WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f74_0_loop_aux_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 && arg2==arg1P_1 && arg2==arg2P_1 && arg2==arg3P_1 ], cost: 1
      1: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>=arg2 && arg1>1 && arg2>4 && arg1==arg3 && -1+arg1==arg1P_2 && -1+arg2==arg2P_2 && -1+arg1==arg3P_2 ], cost: 1
      2: f74_0_loop_aux_LE -> f135_0_loop_aux_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1<arg2 && arg2>1 && 1+arg1>=2*arg2 && arg1>0 && arg1==arg3 && arg1==arg1P_3 && arg2==arg2P_3 && 1+arg1==arg3P_3 && 1+arg2==arg4P_3 ], cost: 1
      3: f74_0_loop_aux_LE -> f135_0_loop_aux_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1<arg2 && arg2>1 && 1+arg1<2*arg2 && arg1>0 && arg1==arg3 && arg1==arg1P_4 && arg2==arg2P_4 && 1+arg1==arg3P_4 && -1+arg2==arg4P_4 ], cost: 1
      5: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1>0 && arg1>=arg2 && arg2<5 && -2-arg2+arg1<=2 && arg2>-1 && arg1==arg3 && -1+arg1==arg1P_6 && 2+arg2==arg2P_6 && -1+arg1==arg3P_6 ], cost: 1
      6: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg1>=arg2 && arg2<5 && -2-arg2+arg1>2 && arg2>-1 && arg1==arg3 && arg1==arg1P_7 && 1+arg2==arg2P_7 && arg1==arg3P_7 ], cost: 1
      4: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>0 && arg2>1 && arg3>1 && arg4>0 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 && arg3==arg1P_5 && arg4==arg2P_5 && arg3==arg3P_5 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

Removed rules with unsatisfiable guard:
   Start location: __init
      0: f1_0_main_Load -> f74_0_loop_aux_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 && arg2==arg1P_1 && arg2==arg2P_1 && arg2==arg3P_1 ], cost: 1
      1: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>=arg2 && arg1>1 && arg2>4 && arg1==arg3 && -1+arg1==arg1P_2 && -1+arg2==arg2P_2 && -1+arg1==arg3P_2 ], cost: 1
      3: f74_0_loop_aux_LE -> f135_0_loop_aux_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1<arg2 && arg2>1 && 1+arg1<2*arg2 && arg1>0 && arg1==arg3 && arg1==arg1P_4 && arg2==arg2P_4 && 1+arg1==arg3P_4 && -1+arg2==arg4P_4 ], cost: 1
      5: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1>0 && arg1>=arg2 && arg2<5 && -2-arg2+arg1<=2 && arg2>-1 && arg1==arg3 && -1+arg1==arg1P_6 && 2+arg2==arg2P_6 && -1+arg1==arg3P_6 ], cost: 1
      6: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg1>=arg2 && arg2<5 && -2-arg2+arg1>2 && arg2>-1 && arg1==arg3 && arg1==arg1P_7 && 1+arg2==arg2P_7 && arg1==arg3P_7 ], cost: 1
      4: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>0 && arg2>1 && arg3>1 && arg4>0 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 && arg3==arg1P_5 && arg4==arg2P_5 && arg3==arg3P_5 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f74_0_loop_aux_LE : arg1'=arg2, arg3'=arg2, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=-1+arg1, arg2'=-1+arg2, arg3'=-1+arg1, arg4'=arg4P_2, [ arg1>=arg2 && arg1>1 && arg2>4 && arg1==arg3 ], cost: 1
      3: f74_0_loop_aux_LE -> f135_0_loop_aux_InvokeMethod : arg3'=1+arg1, arg4'=-1+arg2, [ arg1<arg2 && arg2>1 && arg1>0 && arg1==arg3 ], cost: 1
      5: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=-1+arg1, arg2'=2+arg2, arg3'=-1+arg1, arg4'=arg4P_6, [ arg1>0 && arg1>=arg2 && arg2<5 && -2-arg2+arg1<=2 && arg2>-1 && arg1==arg3 ], cost: 1
      6: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg2'=1+arg2, arg3'=arg1, arg4'=arg4P_7, [ arg2<5 && -2-arg2+arg1>2 && arg2>-1 && arg1==arg3 ], cost: 1
      4: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=arg3, arg2'=arg4, arg4'=arg4P_5, [ arg1>0 && arg3>1 && arg4>0 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=-1+arg1, arg2'=-1+arg2, arg3'=-1+arg1, arg4'=arg4P_2, [ arg1>=arg2 && arg1>1 && arg2>4 && arg1==arg3 ], cost: 1
      5: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=-1+arg1, arg2'=2+arg2, arg3'=-1+arg1, arg4'=arg4P_6, [ arg1>0 && arg1>=arg2 && arg2<5 && -2-arg2+arg1<=2 && arg2>-1 && arg1==arg3 ], cost: 1
      6: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg2'=1+arg2, arg3'=arg1, arg4'=arg4P_7, [ arg2<5 && -2-arg2+arg1>2 && arg2>-1 && arg1==arg3 ], cost: 1

   Accelerated rule 1 with backward acceleration, yielding the new rule 8.
   Accelerated rule 5 with backward acceleration, yielding the new rule 9.
   Accelerated rule 6 with backward acceleration, yielding the new rule 10.
   Accelerated rule 6 with backward acceleration, yielding the new rule 11.
[accelerate] Nesting with 4 inner and 3 outer candidates
   Nested simple loops 1 (outer loop) and 10 (inner loop) with Rule(1 | arg2>-1, arg1==arg3, 5-arg2>=1, -8+arg1>=1, 3>2, | -16+2*arg1 || 1 | 0=8, 1=4, 2=8, 3=arg4P_2, ), resulting in the new rules: 12, 13.
   Removing the simple loops: 1 5 6.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f74_0_loop_aux_LE : arg1'=arg2, arg3'=arg2, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      3: f74_0_loop_aux_LE -> f135_0_loop_aux_InvokeMethod : arg3'=1+arg1, arg4'=-1+arg2, [ arg1<arg2 && arg2>1 && arg1>0 && arg1==arg3 ], cost: 1
      8: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=4-arg2+arg1, arg2'=4, arg3'=4-arg2+arg1, arg4'=arg4P_2, [ arg1>=arg2 && arg1>1 && arg1==arg3 && -4+arg2>=1 ], cost: -4+arg2
      9: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=-k_1+arg1, arg2'=2*k_1+arg2, arg3'=-k_1+arg1, arg4'=arg4P_6, [ -2-arg2+arg1<=2 && arg2>-1 && arg1==arg3 && k_1>=1 && 1-k_1+arg1>0 && 1-k_1+arg1>=-2+2*k_1+arg2 && -2+2*k_1+arg2<5 ], cost: k_1
     10: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg2'=5, arg3'=arg1, arg4'=arg4P_7, [ arg2>-1 && arg1==arg3 && 5-arg2>=1 && -6+arg1>2 ], cost: 5-arg2
     11: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg2'=-4+arg1, arg3'=arg1, arg4'=arg4P_7, [ arg2>-1 && arg1==arg3 && -4-arg2+arg1>=1 && -5+arg1<5 ], cost: -4-arg2+arg1
     12: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=8, arg2'=4, arg3'=8, arg4'=arg4P_2, [ arg2>-1 && arg1==arg3 && 5-arg2>=1 && -8+arg1>=1 ], cost: -16+2*arg1
     13: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=8, arg2'=4, arg3'=8, arg4'=arg4P_2, [ arg1>=arg2 && arg2>4 && arg1==arg3 && 6-arg2>=1 && -9+arg1>=1 ], cost: -17+2*arg1
      4: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=arg3, arg2'=arg4, arg4'=arg4P_5, [ arg1>0 && arg3>1 && arg4>0 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f74_0_loop_aux_LE : arg1'=arg2, arg3'=arg2, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
     14: f1_0_main_Load -> f74_0_loop_aux_LE : arg1'=4, arg2'=4, arg3'=4, arg4'=arg4P_2, [ arg1>0 && -4+arg2>=1 ], cost: -3+arg2
     16: f1_0_main_Load -> f74_0_loop_aux_LE : arg1'=-k_1+arg2, arg2'=2*k_1+arg2, arg3'=-k_1+arg2, arg4'=arg4P_6, [ arg1>0 && arg2>-1 && k_1>=1 && 1-k_1+arg2>0 && 1-k_1+arg2>=-2+2*k_1+arg2 && -2+2*k_1+arg2<5 ], cost: 1+k_1
      3: f74_0_loop_aux_LE -> f135_0_loop_aux_InvokeMethod : arg3'=1+arg1, arg4'=-1+arg2, [ arg1<arg2 && arg2>1 && arg1>0 && arg1==arg3 ], cost: 1
      4: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=arg3, arg2'=arg4, arg4'=arg4P_5, [ arg1>0 && arg3>1 && arg4>0 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 ], cost: 1
     15: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=4+arg3-arg4, arg2'=4, arg3'=4+arg3-arg4, arg4'=arg4P_2, [ arg1>0 && arg3>1 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 && arg3>=arg4 && -4+arg4>=1 ], cost: -3+arg4
     17: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=-k_1+arg3, arg2'=2*k_1+arg4, arg3'=-k_1+arg3, arg4'=arg4P_6, [ arg1>0 && arg3>1 && arg4>0 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 && -2+arg3-arg4<=2 && k_1>=1 && 1-k_1+arg3>0 && 1-k_1+arg3>=-2+2*k_1+arg4 && -2+2*k_1+arg4<5 ], cost: 1+k_1
     18: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=arg3, arg2'=5, arg4'=arg4P_7, [ arg1>0 && arg4>0 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 && 5-arg4>=1 && -6+arg3>2 ], cost: 6-arg4
     19: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=arg3, arg2'=-4+arg3, arg4'=arg4P_7, [ arg1>0 && arg3>1 && arg4>0 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 && -4+arg3-arg4>=1 && -5+arg3<5 ], cost: -3+arg3-arg4
     20: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=8, arg2'=4, arg3'=8, arg4'=arg4P_2, [ arg1>0 && arg4>0 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 && 5-arg4>=1 && -8+arg3>=1 ], cost: -15+2*arg3
     21: f135_0_loop_aux_InvokeMethod -> f74_0_loop_aux_LE : arg1'=8, arg2'=4, arg3'=8, arg4'=arg4P_2, [ arg1>0 && arg2>arg1 && arg2>=arg3 && arg1<=arg4 && arg3>=arg4 && 5-arg4==0 && -9+arg3>=1 ], cost: -16+2*arg3
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     25: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=1+arg1, arg2'=-1+arg2, arg3'=1+arg1, arg4'=arg4P_5, [ arg1<arg2 && arg2>1 && arg1>0 && arg1==arg3 ], cost: 2
     26: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=6-arg2+arg1, arg2'=4, arg3'=6-arg2+arg1, arg4'=arg4P_2, [ arg1<arg2 && arg1>0 && arg1==arg3 && 1+arg1>=-1+arg2 && -5+arg2>=1 ], cost: -3+arg2
     27: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=1-k_1+arg1, arg2'=-1+2*k_1+arg2, arg3'=1-k_1+arg1, arg4'=arg4P_6, [ arg1<arg2 && arg2>1 && arg1>0 && arg1==arg3 && k_1>=1 && 2-k_1+arg1>0 && 2-k_1+arg1>=-3+2*k_1+arg2 && -3+2*k_1+arg2<5 ], cost: 2+k_1
     22: __init -> f74_0_loop_aux_LE : arg1'=arg2P_8, arg2'=arg2P_8, arg3'=arg2P_8, arg4'=arg4P_1, [ arg1P_8>0 && arg2P_8>-1 ], cost: 2
     23: __init -> f74_0_loop_aux_LE : arg1'=4, arg2'=4, arg3'=4, arg4'=arg4P_2, [ arg1P_8>0 && -4+arg2P_8>=1 ], cost: -2+arg2P_8
     24: __init -> f74_0_loop_aux_LE : arg1'=-k_1+arg2P_8, arg2'=2*k_1+arg2P_8, arg3'=-k_1+arg2P_8, arg4'=arg4P_6, [ arg1P_8>0 && arg2P_8>-1 && k_1>=1 && 1-k_1+arg2P_8>0 && 1-k_1+arg2P_8>=-2+2*k_1+arg2P_8 && -2+2*k_1+arg2P_8<5 ], cost: 2+k_1

Accelerating simple loops of location 1.
   Accelerating the following rules:
     25: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=1+arg1, arg2'=-1+arg2, arg3'=1+arg1, arg4'=arg4P_5, [ arg1<arg2 && arg2>1 && arg1>0 && arg1==arg3 ], cost: 2
     26: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=6-arg2+arg1, arg2'=4, arg3'=6-arg2+arg1, arg4'=arg4P_2, [ arg1<arg2 && arg1>0 && arg1==arg3 && 1+arg1>=-1+arg2 && -5+arg2>=1 ], cost: -3+arg2
     27: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=1-k_1+arg1, arg2'=-1+2*k_1+arg2, arg3'=1-k_1+arg1, arg4'=arg4P_6, [ arg1<arg2 && arg2>1 && arg1>0 && arg1==arg3 && k_1>=1 && 2-k_1+arg1>0 && 2-k_1+arg1>=-3+2*k_1+arg2 && -3+2*k_1+arg2<5 ], cost: 2+k_1

   Accelerated rule 25 with backward acceleration, yielding the new rule 28.
   Failed to prove monotonicity of the guard of rule 26.
   Accelerated rule 27 with backward acceleration, yielding the new rule 29.
[accelerate] Nesting with 3 inner and 3 outer candidates
   Removing the simple loops: 25 27.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     26: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=6-arg2+arg1, arg2'=4, arg3'=6-arg2+arg1, arg4'=arg4P_2, [ arg1<arg2 && arg1>0 && arg1==arg3 && 1+arg1>=-1+arg2 && -5+arg2>=1 ], cost: -3+arg2
     28: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=k_7+arg1, arg2'=arg2-k_7, arg3'=k_7+arg1, arg4'=arg4P_5, [ arg1>0 && arg1==arg3 && k_7>=1 && -1+k_7+arg1<1+arg2-k_7 && 1+arg2-k_7>1 ], cost: 2*k_7
     29: f74_0_loop_aux_LE -> f74_0_loop_aux_LE : arg1'=-k_1*k_9+k_9+arg1, arg2'=2*k_1*k_9+arg2-k_9, arg3'=-k_1+k_9-k_1*(-1+k_9)+arg1, arg4'=arg4P_6, [ arg1<arg2 && arg2>1 && arg1>0 && arg1==arg3 && k_1>=1 && 2-k_1+arg1>0 && k_9>=1 && 1-k_1+k_9-k_1*(-1+k_9)+arg1>=-2+2*k_1+arg2-k_9+2*k_1*(-1+k_9) && -2+2*k_1+arg2-k_9+2*k_1*(-1+k_9)<5 ], cost: k_1*k_9+2*k_9
     22: __init -> f74_0_loop_aux_LE : arg1'=arg2P_8, arg2'=arg2P_8, arg3'=arg2P_8, arg4'=arg4P_1, [ arg1P_8>0 && arg2P_8>-1 ], cost: 2
     23: __init -> f74_0_loop_aux_LE : arg1'=4, arg2'=4, arg3'=4, arg4'=arg4P_2, [ arg1P_8>0 && -4+arg2P_8>=1 ], cost: -2+arg2P_8
     24: __init -> f74_0_loop_aux_LE : arg1'=-k_1+arg2P_8, arg2'=2*k_1+arg2P_8, arg3'=-k_1+arg2P_8, arg4'=arg4P_6, [ arg1P_8>0 && arg2P_8>-1 && k_1>=1 && 1-k_1+arg2P_8>0 && 1-k_1+arg2P_8>=-2+2*k_1+arg2P_8 && -2+2*k_1+arg2P_8<5 ], cost: 2+k_1

Chained accelerated rules (with incoming rules):
   Start location: __init
     22: __init -> f74_0_loop_aux_LE : arg1'=arg2P_8, arg2'=arg2P_8, arg3'=arg2P_8, arg4'=arg4P_1, [ arg1P_8>0 && arg2P_8>-1 ], cost: 2
     23: __init -> f74_0_loop_aux_LE : arg1'=4, arg2'=4, arg3'=4, arg4'=arg4P_2, [ arg1P_8>0 && -4+arg2P_8>=1 ], cost: -2+arg2P_8
     24: __init -> f74_0_loop_aux_LE : arg1'=-k_1+arg2P_8, arg2'=2*k_1+arg2P_8, arg3'=-k_1+arg2P_8, arg4'=arg4P_6, [ arg1P_8>0 && arg2P_8>-1 && k_1>=1 && 1-k_1+arg2P_8>0 && 1-k_1+arg2P_8>=-2+2*k_1+arg2P_8 && -2+2*k_1+arg2P_8<5 ], cost: 2+k_1
     30: __init -> f74_0_loop_aux_LE : arg1'=-k_1+k_7+arg2P_8, arg2'=2*k_1-k_7+arg2P_8, arg3'=-k_1+k_7+arg2P_8, arg4'=arg4P_5, [ arg2P_8>-1 && k_1>=1 && 1-k_1+arg2P_8>=-2+2*k_1+arg2P_8 && -2+2*k_1+arg2P_8<5 && -k_1+arg2P_8>0 && k_7>=1 && -1-k_1+k_7+arg2P_8<1+2*k_1-k_7+arg2P_8 && 1+2*k_1-k_7+arg2P_8>1 ], cost: 2+k_1+2*k_7

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     23: __init -> f74_0_loop_aux_LE : arg1'=4, arg2'=4, arg3'=4, arg4'=arg4P_2, [ arg1P_8>0 && -4+arg2P_8>=1 ], cost: -2+arg2P_8
     24: __init -> f74_0_loop_aux_LE : arg1'=-k_1+arg2P_8, arg2'=2*k_1+arg2P_8, arg3'=-k_1+arg2P_8, arg4'=arg4P_6, [ arg1P_8>0 && arg2P_8>-1 && k_1>=1 && 1-k_1+arg2P_8>0 && 1-k_1+arg2P_8>=-2+2*k_1+arg2P_8 && -2+2*k_1+arg2P_8<5 ], cost: 2+k_1
     30: __init -> f74_0_loop_aux_LE : arg1'=-k_1+k_7+arg2P_8, arg2'=2*k_1-k_7+arg2P_8, arg3'=-k_1+k_7+arg2P_8, arg4'=arg4P_5, [ arg2P_8>-1 && k_1>=1 && 1-k_1+arg2P_8>=-2+2*k_1+arg2P_8 && -2+2*k_1+arg2P_8<5 && -k_1+arg2P_8>0 && k_7>=1 && -1-k_1+k_7+arg2P_8<1+2*k_1-k_7+arg2P_8 && 1+2*k_1-k_7+arg2P_8>1 ], cost: 2+k_1+2*k_7

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     23: __init -> f74_0_loop_aux_LE : arg1'=4, arg2'=4, arg3'=4, arg4'=arg4P_2, [ arg1P_8>0 && -4+arg2P_8>=1 ], cost: -2+arg2P_8
     24: __init -> f74_0_loop_aux_LE : arg1'=-k_1+arg2P_8, arg2'=2*k_1+arg2P_8, arg3'=-k_1+arg2P_8, arg4'=arg4P_6, [ arg1P_8>0 && arg2P_8>-1 && k_1>=1 && 1-k_1+arg2P_8>0 && 1-k_1+arg2P_8>=-2+2*k_1+arg2P_8 && -2+2*k_1+arg2P_8<5 ], cost: 2+k_1
     30: __init -> f74_0_loop_aux_LE : arg1'=-k_1+k_7+arg2P_8, arg2'=2*k_1-k_7+arg2P_8, arg3'=-k_1+k_7+arg2P_8, arg4'=arg4P_5, [ arg2P_8>-1 && k_1>=1 && 1-k_1+arg2P_8>=-2+2*k_1+arg2P_8 && -2+2*k_1+arg2P_8<5 && -k_1+arg2P_8>0 && k_7>=1 && -1-k_1+k_7+arg2P_8<1+2*k_1-k_7+arg2P_8 && 1+2*k_1-k_7+arg2P_8>1 ], cost: 2+k_1+2*k_7

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

Computing asymptotic complexity for rule 24
   Simplified the guard:
     24: __init -> f74_0_loop_aux_LE : arg1'=-k_1+arg2P_8, arg2'=2*k_1+arg2P_8, arg3'=-k_1+arg2P_8, arg4'=arg4P_6, [ arg1P_8>0 && k_1>=1 && 1-k_1+arg2P_8>0 && 1-k_1+arg2P_8>=-2+2*k_1+arg2P_8 && -2+2*k_1+arg2P_8<5 ], cost: 2+k_1
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 30
   Simplified the guard:
     30: __init -> f74_0_loop_aux_LE : arg1'=-k_1+k_7+arg2P_8, arg2'=2*k_1-k_7+arg2P_8, arg3'=-k_1+k_7+arg2P_8, arg4'=arg4P_5, [ -2+2*k_1+arg2P_8<5 && -k_1+arg2P_8>0 && k_7>=1 && -1-k_1+k_7+arg2P_8<1+2*k_1-k_7+arg2P_8 ], cost: 2+k_1+2*k_7
   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),?)