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, [ arg1==arg1P_1 && arg3==arg3P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2==arg2P_2 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
     14: f3 -> f4 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg2>=0 && arg1>0 && arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
     15: f3 -> f5 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2<0 && arg1==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 && arg4==arg4P_16 ], cost: 1
     16: f3 -> f5 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg1<=0 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 && arg4==arg4P_17 ], cost: 1
      2: f4 -> f7 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && arg2==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f7 -> f8 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && 0==arg4P_4 ], cost: 1
     11: f8 -> f9 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg3>0 && arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
     13: f8 -> f16 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg3<=0 && arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && arg4==arg4P_14 ], cost: 1
      4: f10 -> f13 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg4P_5==1+arg4 && arg1==arg1P_5 && arg2==arg2P_5 && arg3==arg3P_5 ], cost: 1
      5: f13 -> f14 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3P_6==-1+arg3 && arg1==arg1P_6 && arg2==arg2P_6 && arg4==arg4P_6 ], cost: 1
      9: f14 -> f12 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
      6: f11 -> f15 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 && 0==arg4P_7 ], cost: 1
     10: f15 -> f12 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
      7: f9 -> f10 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg4<arg1 && arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      8: f9 -> f11 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg4>=arg1 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
     12: f12 -> f8 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
     17: f16 -> f6 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 && arg4==arg4P_18 ], cost: 1
     18: f5 -> f6 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 && arg4==arg4P_19 ], cost: 1
     19: __init -> f1 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_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, [], 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, [ arg1==arg1P_1 && arg3==arg3P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2==arg2P_2 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
     14: f3 -> f4 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg2>=0 && arg1>0 && arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
      2: f4 -> f7 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && arg2==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f7 -> f8 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && 0==arg4P_4 ], cost: 1
     11: f8 -> f9 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg3>0 && arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
      4: f10 -> f13 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg4P_5==1+arg4 && arg1==arg1P_5 && arg2==arg2P_5 && arg3==arg3P_5 ], cost: 1
      5: f13 -> f14 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3P_6==-1+arg3 && arg1==arg1P_6 && arg2==arg2P_6 && arg4==arg4P_6 ], cost: 1
      9: f14 -> f12 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
      6: f11 -> f15 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 && 0==arg4P_7 ], cost: 1
     10: f15 -> f12 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
      7: f9 -> f10 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg4<arg1 && arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      8: f9 -> f11 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg4>=arg1 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
     12: f12 -> f8 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
     19: __init -> f1 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg2'=arg2P_1, [], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, [], cost: 1
     14: f3 -> f4 : [ arg2>=0 && arg1>0 ], cost: 1
      2: f4 -> f7 : arg3'=arg2, [], cost: 1
      3: f7 -> f8 : arg4'=0, [], cost: 1
     11: f8 -> f9 : [ arg3>0 ], cost: 1
      4: f10 -> f13 : arg4'=1+arg4, [], cost: 1
      5: f13 -> f14 : arg3'=-1+arg3, [], cost: 1
      9: f14 -> f12 : [], cost: 1
      6: f11 -> f15 : arg4'=0, [], cost: 1
     10: f15 -> f12 : [], cost: 1
      7: f9 -> f10 : [ arg4<arg1 ], cost: 1
      8: f9 -> f11 : [ arg4>=arg1 ], cost: 1
     12: f12 -> f8 : [], cost: 1
     19: __init -> f1 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     11: f8 -> f9 : [ arg3>0 ], cost: 1
     28: f9 -> f12 : arg4'=0, [ arg4>=arg1 ], cost: 3
     29: f9 -> f12 : arg3'=-1+arg3, arg4'=1+arg4, [ arg4<arg1 ], cost: 4
     12: f12 -> f8 : [], cost: 1
     24: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=arg2P_1, arg4'=0, [ arg2P_1>=0 && arg1P_2>0 ], cost: 6

Eliminated locations (on tree-shaped paths):
   Start location: __init
     30: f8 -> f12 : arg4'=0, [ arg3>0 && arg4>=arg1 ], cost: 4
     31: f8 -> f12 : arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4<arg1 ], cost: 5
     12: f12 -> f8 : [], cost: 1
     24: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=arg2P_1, arg4'=0, [ arg2P_1>=0 && arg1P_2>0 ], cost: 6

Eliminated locations (on tree-shaped paths):
   Start location: __init
     32: f8 -> f8 : arg4'=0, [ arg3>0 && arg4>=arg1 ], cost: 5
     33: f8 -> f8 : arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4<arg1 ], cost: 6
     24: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=arg2P_1, arg4'=0, [ arg2P_1>=0 && arg1P_2>0 ], cost: 6

Accelerating simple loops of location 5.
   Accelerating the following rules:
     32: f8 -> f8 : arg4'=0, [ arg3>0 && arg4>=arg1 ], cost: 5
     33: f8 -> f8 : arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4<arg1 ], cost: 6

   Accelerated rule 32 with non-termination, yielding the new rule 34.
   Accelerated rule 33 with backward acceleration, yielding the new rule 35.
   Accelerated rule 33 with backward acceleration, yielding the new rule 36.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Nested simple loops 32 (outer loop) and 36 (inner loop) with Rule(5 | arg4>=arg1, arg1>=0, k_1>=1, arg3-(-1+k_1)*arg1>0, 1+arg3-(-1+k_1)*arg1-arg1>0, | 6*k_1*arg1+5*k_1 || 5 | 2=arg3-k_1*arg1, 3=arg1, ), resulting in the new rules: 37, 38.
   Removing the simple loops: 32 33.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     34: f8 -> [17] : [ arg3>0 && arg4>=arg1 && 0>=arg1 ], cost: NONTERM
     35: f8 -> f8 : arg3'=0, arg4'=arg3+arg4, [ arg3>=0 && -1+arg3+arg4<arg1 ], cost: 6*arg3
     36: f8 -> f8 : arg3'=arg3+arg4-arg1, arg4'=arg1, [ -arg4+arg1>=0 && 1+arg3+arg4-arg1>0 ], cost: -6*arg4+6*arg1
     37: f8 -> f8 : arg3'=arg3-k_1*arg1, arg4'=arg1, [ arg4>=arg1 && arg1>=0 && k_1>=1 && arg3-(-1+k_1)*arg1>0 && 1+arg3-(-1+k_1)*arg1-arg1>0 ], cost: 6*k_1*arg1+5*k_1
     38: f8 -> f8 : arg3'=arg3-k_1*arg1+arg4-arg1, arg4'=arg1, [ -arg4+arg1>=0 && 1+arg3+arg4-arg1>0 && arg1>=0 && k_1>=1 && arg3-(-1+k_1)*arg1+arg4-arg1>0 && 1+arg3-(-1+k_1)*arg1+arg4-2*arg1>0 ], cost: 6*k_1*arg1+5*k_1-6*arg4+6*arg1
     24: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=arg2P_1, arg4'=0, [ arg2P_1>=0 && arg1P_2>0 ], cost: 6

Chained accelerated rules (with incoming rules):
   Start location: __init
     24: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=arg2P_1, arg4'=0, [ arg2P_1>=0 && arg1P_2>0 ], cost: 6
     39: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=0, arg4'=arg2P_1, [ arg2P_1>=0 && arg1P_2>0 && -1+arg2P_1<arg1P_2 ], cost: 6+6*arg2P_1
     40: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=-arg1P_2+arg2P_1, arg4'=arg1P_2, [ arg2P_1>=0 && arg1P_2>0 && 1-arg1P_2+arg2P_1>0 ], cost: 6+6*arg1P_2
     41: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=-k_1*arg1P_2-arg1P_2+arg2P_1, arg4'=arg1P_2, [ arg2P_1>=0 && arg1P_2>0 && 1-arg1P_2+arg2P_1>0 && k_1>=1 && -(-1+k_1)*arg1P_2-arg1P_2+arg2P_1>0 && 1-(-1+k_1)*arg1P_2-2*arg1P_2+arg2P_1>0 ], cost: 6+6*k_1*arg1P_2+5*k_1+6*arg1P_2

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     39: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=0, arg4'=arg2P_1, [ arg2P_1>=0 && arg1P_2>0 && -1+arg2P_1<arg1P_2 ], cost: 6+6*arg2P_1
     40: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=-arg1P_2+arg2P_1, arg4'=arg1P_2, [ arg2P_1>=0 && arg1P_2>0 && 1-arg1P_2+arg2P_1>0 ], cost: 6+6*arg1P_2
     41: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=-k_1*arg1P_2-arg1P_2+arg2P_1, arg4'=arg1P_2, [ arg2P_1>=0 && arg1P_2>0 && 1-arg1P_2+arg2P_1>0 && k_1>=1 && -(-1+k_1)*arg1P_2-arg1P_2+arg2P_1>0 && 1-(-1+k_1)*arg1P_2-2*arg1P_2+arg2P_1>0 ], cost: 6+6*k_1*arg1P_2+5*k_1+6*arg1P_2

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     39: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=0, arg4'=arg2P_1, [ arg2P_1>=0 && arg1P_2>0 && -1+arg2P_1<arg1P_2 ], cost: 6+6*arg2P_1
     40: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=-arg1P_2+arg2P_1, arg4'=arg1P_2, [ arg2P_1>=0 && arg1P_2>0 && 1-arg1P_2+arg2P_1>0 ], cost: 6+6*arg1P_2
     41: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=-k_1*arg1P_2-arg1P_2+arg2P_1, arg4'=arg1P_2, [ arg2P_1>=0 && arg1P_2>0 && 1-arg1P_2+arg2P_1>0 && k_1>=1 && -(-1+k_1)*arg1P_2-arg1P_2+arg2P_1>0 && 1-(-1+k_1)*arg1P_2-2*arg1P_2+arg2P_1>0 ], cost: 6+6*k_1*arg1P_2+5*k_1+6*arg1P_2

Computing asymptotic complexity for rule 41
   Simplified the guard:
     41: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=-k_1*arg1P_2-arg1P_2+arg2P_1, arg4'=arg1P_2, [ arg1P_2>0 && 1-arg1P_2+arg2P_1>0 && k_1>=1 && -(-1+k_1)*arg1P_2-arg1P_2+arg2P_1>0 && 1-(-1+k_1)*arg1P_2-2*arg1P_2+arg2P_1>0 ], cost: 6+6*k_1*arg1P_2+5*k_1+6*arg1P_2
   Resulting cost 0 has complexity: Unknown

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

Computing asymptotic complexity for rule 40
   Simplified the guard:
     40: __init -> f8 : arg1'=arg1P_2, arg2'=arg2P_1, arg3'=-arg1P_2+arg2P_1, arg4'=arg1P_2, [ arg1P_2>0 && 1-arg1P_2+arg2P_1>0 ], cost: 6+6*arg1P_2
   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),?)