WORST_CASE(Omega(1),?)

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2==arg2P_1 && arg3==arg3P_1 && arg4==arg4P_1 && arg5==arg5P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, [ arg1==arg1P_2 && arg3==arg3P_2 && arg4==arg4P_2 && arg5==arg5P_2 ], cost: 1
      2: f3 -> f4 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && arg4==arg4P_3 && arg5==arg5P_3 ], cost: 1
      3: f4 -> f5 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && arg5==arg5P_4 ], cost: 1
      6: f5 -> f6 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg4>=1 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 && arg4==arg4P_7 && arg5==arg5P_7 ], cost: 1
      7: f5 -> f7 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg4<1 && arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 && arg5==arg5P_8 ], cost: 1
      4: f6 -> f9 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1==arg1P_5 && arg2==arg2P_5 && arg3==arg3P_5 && arg4==arg4P_5 && 1==arg5P_5 ], cost: 1
      8: f9 -> f8 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 && arg5==arg5P_9 ], cost: 1
      5: f7 -> f10 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg5P_6==-1 && arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
      9: f10 -> f8 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 && arg5==arg5P_10 ], cost: 1
     16: f8 -> f11 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, [ arg2<=arg3 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 && arg4==arg4P_17 && arg5==arg5P_17 ], cost: 1
     18: f8 -> f17 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, arg5'=arg5P_19, [ arg2>arg3 && arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 && arg4==arg4P_19 && arg5==arg5P_19 ], cost: 1
     10: f12 -> f15 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [ arg2P_11==arg5+arg2 && arg1==arg1P_11 && arg3==arg3P_11 && arg4==arg4P_11 && arg5==arg5P_11 ], cost: 1
     14: f15 -> f14 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, [ arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 && arg5==arg5P_15 ], cost: 1
     11: f13 -> f16 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, [ arg2P_12==-arg5+arg2 && arg1==arg1P_12 && arg3==arg3P_12 && arg4==arg4P_12 && arg5==arg5P_12 ], cost: 1
     15: f16 -> f14 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, [ arg1==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 && arg4==arg4P_16 && arg5==arg5P_16 ], cost: 1
     12: f11 -> f12 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, [ arg4>=1 && arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 && arg5==arg5P_13 ], cost: 1
     13: f11 -> f13 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, [ arg4<1 && arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && arg4==arg4P_14 && arg5==arg5P_14 ], cost: 1
     17: f14 -> f8 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, [ arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 && arg4==arg4P_18 && arg5==arg5P_18 ], cost: 1
     19: __init -> f1 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, arg5'=arg5P_20, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     19: __init -> f1 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, arg5'=arg5P_20, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2==arg2P_1 && arg3==arg3P_1 && arg4==arg4P_1 && arg5==arg5P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, [ arg1==arg1P_2 && arg3==arg3P_2 && arg4==arg4P_2 && arg5==arg5P_2 ], cost: 1
      2: f3 -> f4 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && arg4==arg4P_3 && arg5==arg5P_3 ], cost: 1
      3: f4 -> f5 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && arg5==arg5P_4 ], cost: 1
      6: f5 -> f6 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg4>=1 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 && arg4==arg4P_7 && arg5==arg5P_7 ], cost: 1
      7: f5 -> f7 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg4<1 && arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 && arg5==arg5P_8 ], cost: 1
      4: f6 -> f9 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1==arg1P_5 && arg2==arg2P_5 && arg3==arg3P_5 && arg4==arg4P_5 && 1==arg5P_5 ], cost: 1
      8: f9 -> f8 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 && arg5==arg5P_9 ], cost: 1
      5: f7 -> f10 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg5P_6==-1 && arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
      9: f10 -> f8 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 && arg5==arg5P_10 ], cost: 1
     16: f8 -> f11 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, [ arg2<=arg3 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 && arg4==arg4P_17 && arg5==arg5P_17 ], cost: 1
     10: f12 -> f15 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [ arg2P_11==arg5+arg2 && arg1==arg1P_11 && arg3==arg3P_11 && arg4==arg4P_11 && arg5==arg5P_11 ], cost: 1
     14: f15 -> f14 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, [ arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 && arg5==arg5P_15 ], cost: 1
     11: f13 -> f16 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, [ arg2P_12==-arg5+arg2 && arg1==arg1P_12 && arg3==arg3P_12 && arg4==arg4P_12 && arg5==arg5P_12 ], cost: 1
     15: f16 -> f14 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, [ arg1==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 && arg4==arg4P_16 && arg5==arg5P_16 ], cost: 1
     12: f11 -> f12 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, [ arg4>=1 && arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 && arg5==arg5P_13 ], cost: 1
     13: f11 -> f13 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, [ arg4<1 && arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && arg4==arg4P_14 && arg5==arg5P_14 ], cost: 1
     17: f14 -> f8 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, [ arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 && arg4==arg4P_18 && arg5==arg5P_18 ], cost: 1
     19: __init -> f1 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, arg5'=arg5P_20, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
      1: f2 -> f3 : arg2'=arg2P_2, [], cost: 1
      2: f3 -> f4 : arg3'=arg3P_3, [], cost: 1
      3: f4 -> f5 : arg4'=arg4P_4, [], cost: 1
      6: f5 -> f6 : [ arg4>=1 ], cost: 1
      7: f5 -> f7 : [ arg4<1 ], cost: 1
      4: f6 -> f9 : arg5'=1, [], cost: 1
      8: f9 -> f8 : [], cost: 1
      5: f7 -> f10 : arg5'=-1, [], cost: 1
      9: f10 -> f8 : [], cost: 1
     16: f8 -> f11 : [ arg2<=arg3 ], cost: 1
     10: f12 -> f15 : arg2'=arg5+arg2, [], cost: 1
     14: f15 -> f14 : [], cost: 1
     11: f13 -> f16 : arg2'=-arg5+arg2, [], cost: 1
     15: f16 -> f14 : [], cost: 1
     12: f11 -> f12 : [ arg4>=1 ], cost: 1
     13: f11 -> f13 : [ arg4<1 ], cost: 1
     17: f14 -> f8 : [], cost: 1
     19: __init -> f1 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, arg5'=arg5P_20, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     26: f5 -> f8 : arg5'=1, [ arg4>=1 ], cost: 3
     27: f5 -> f8 : arg5'=-1, [ arg4<1 ], cost: 3
     16: f8 -> f11 : [ arg2<=arg3 ], cost: 1
     30: f11 -> f14 : arg2'=arg5+arg2, [ arg4>=1 ], cost: 3
     31: f11 -> f14 : arg2'=-arg5+arg2, [ arg4<1 ], cost: 3
     17: f14 -> f8 : [], cost: 1
     23: __init -> f5 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=arg5P_20, [], cost: 5

Eliminated locations (on tree-shaped paths):
   Start location: __init
     34: f8 -> f14 : arg2'=arg5+arg2, [ arg2<=arg3 && arg4>=1 ], cost: 4
     35: f8 -> f14 : arg2'=-arg5+arg2, [ arg2<=arg3 && arg4<1 ], cost: 4
     17: f14 -> f8 : [], cost: 1
     32: __init -> f8 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=1, [ arg4P_4>=1 ], cost: 8
     33: __init -> f8 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=-1, [ arg4P_4<1 ], cost: 8

Eliminated locations (on tree-shaped paths):
   Start location: __init
     36: f8 -> f8 : arg2'=arg5+arg2, [ arg2<=arg3 && arg4>=1 ], cost: 5
     37: f8 -> f8 : arg2'=-arg5+arg2, [ arg2<=arg3 && arg4<1 ], cost: 5
     32: __init -> f8 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=1, [ arg4P_4>=1 ], cost: 8
     33: __init -> f8 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=-1, [ arg4P_4<1 ], cost: 8

Accelerating simple loops of location 9.
   Accelerating the following rules:
     36: f8 -> f8 : arg2'=arg5+arg2, [ arg2<=arg3 && arg4>=1 ], cost: 5
     37: f8 -> f8 : arg2'=-arg5+arg2, [ arg2<=arg3 && arg4<1 ], cost: 5

[test] deduced pseudo-invariant 1-arg5<=0, also trying -1+arg5<=-1
   Accelerated rule 36 with non-termination, yielding the new rule 38.
   Accelerated rule 36 with backward acceleration, yielding the new rule 39.
   Accelerated rule 36 with non-termination, yielding the new rule 40.
   Accelerated rule 36 with backward acceleration, yielding the new rule 41.
[test] deduced pseudo-invariant 1-arg5<=0, also trying -1+arg5<=-1
   Accelerated rule 37 with non-termination, yielding the new rule 42.
   Accelerated rule 37 with non-termination, yielding the new rule 43.
   Accelerated rule 37 with backward acceleration, yielding the new rule 44.
   Accelerated rule 37 with non-termination, yielding the new rule 45.
   Accelerated rule 37 with backward acceleration, yielding the new rule 46.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Also removing duplicate rules: 40 42 43.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     36: f8 -> f8 : arg2'=arg5+arg2, [ arg2<=arg3 && arg4>=1 ], cost: 5
     37: f8 -> f8 : arg2'=-arg5+arg2, [ arg2<=arg3 && arg4<1 ], cost: 5
     38: f8 -> [18] : [ arg2<=arg3 && arg5==0 && arg2==0 && arg3==0 && arg4==1 ], cost: NONTERM
     39: f8 -> f8 : arg2'=arg2+arg5*k, [ arg4>=1 && 1-arg5<=0 && k>=0 && arg2+arg5*(-1+k)<=arg3 ], cost: 5*k
     41: f8 -> [18] : [ arg2<=arg3 && arg4>=1 && -1+arg5<=-1 ], cost: NONTERM
     44: f8 -> [18] : [ arg2<=arg3 && arg4<1 && 1-arg5<=0 ], cost: NONTERM
     45: f8 -> [18] : [ arg2<=arg3 && arg5==0 && arg2==0 && arg3==0 && arg4==0 ], cost: NONTERM
     46: f8 -> f8 : arg2'=arg2-arg5*k_2, [ arg4<1 && -1+arg5<=-1 && k_2>=0 && arg2-arg5*(-1+k_2)<=arg3 ], cost: 5*k_2
     32: __init -> f8 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=1, [ arg4P_4>=1 ], cost: 8
     33: __init -> f8 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=-1, [ arg4P_4<1 ], cost: 8

Chained accelerated rules (with incoming rules):
   Start location: __init
     32: __init -> f8 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=1, [ arg4P_4>=1 ], cost: 8
     33: __init -> f8 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=-1, [ arg4P_4<1 ], cost: 8
     47: __init -> f8 : arg1'=arg1P_1, arg2'=1+arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=1, [ arg4P_4>=1 && arg2P_2<=arg3P_3 ], cost: 13
     48: __init -> f8 : arg1'=arg1P_1, arg2'=1+arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=-1, [ arg4P_4<1 && arg2P_2<=arg3P_3 ], cost: 13
     49: __init -> f8 : arg1'=arg1P_1, arg2'=k+arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=1, [ arg4P_4>=1 && k>=0 && -1+k+arg2P_2<=arg3P_3 ], cost: 8+5*k
     50: __init -> f8 : arg1'=arg1P_1, arg2'=k_2+arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=-1, [ arg4P_4<1 && k_2>=0 && -1+k_2+arg2P_2<=arg3P_3 ], cost: 8+5*k_2

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     49: __init -> f8 : arg1'=arg1P_1, arg2'=k+arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=1, [ arg4P_4>=1 && k>=0 && -1+k+arg2P_2<=arg3P_3 ], cost: 8+5*k
     50: __init -> f8 : arg1'=arg1P_1, arg2'=k_2+arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=-1, [ arg4P_4<1 && k_2>=0 && -1+k_2+arg2P_2<=arg3P_3 ], cost: 8+5*k_2

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     49: __init -> f8 : arg1'=arg1P_1, arg2'=k+arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=1, [ arg4P_4>=1 && k>=0 && -1+k+arg2P_2<=arg3P_3 ], cost: 8+5*k
     50: __init -> f8 : arg1'=arg1P_1, arg2'=k_2+arg2P_2, arg3'=arg3P_3, arg4'=arg4P_4, arg5'=-1, [ arg4P_4<1 && k_2>=0 && -1+k_2+arg2P_2<=arg3P_3 ], cost: 8+5*k_2

Computing asymptotic complexity for rule 49
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 50
   Resulting cost 0 has complexity: Unknown

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  []

WORST_CASE(Omega(1),?)