WORST_CASE(Omega(1),?)

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

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

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f168_0_main_LE : arg1'=-1+arg2, arg3'=0, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f168_0_main_LE -> f168_0_main_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2>0 && arg3P_2>arg3 && arg3>0 ], cost: 1
      2: f168_0_main_LE -> f168_0_main_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=1, arg4'=arg4P_3, [ arg2>0 ], cost: 1
      3: f168_0_main_LE -> f223_0_iterate_EQ : arg1'=0, arg2'=arg3, arg4'=0, [ arg2<1 && arg3>0 ], cost: 1
      4: f223_0_iterate_EQ -> f223_0_iterate_EQ : arg1'=arg1P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>0 && arg4>0 && arg3>0 && arg1P_5>arg1 && arg2>arg1 && arg3P_5<arg3 && arg4P_5<arg4 ], cost: 1
      5: f223_0_iterate_EQ -> f223_0_iterate_EQ : arg1'=1, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3P_6<arg2 && arg2>0 && arg2==arg3 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f168_0_main_LE -> f168_0_main_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2>0 && arg3P_2>arg3 && arg3>0 ], cost: 1
      2: f168_0_main_LE -> f168_0_main_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=1, arg4'=arg4P_3, [ arg2>0 ], cost: 1

   Failed to prove monotonicity of the guard of rule 1.
[test] deduced invariant 1-arg2+arg1<=0
   Accelerated rule 2 with backward acceleration, yielding the new rule 7.
[accelerate] Nesting with 2 inner and 2 outer candidates

Accelerating simple loops of location 2.
   Accelerating the following rules:
      4: f223_0_iterate_EQ -> f223_0_iterate_EQ : arg1'=arg1P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>0 && arg4>0 && arg3>0 && arg1P_5>arg1 && arg2>arg1 && arg3P_5<arg3 && arg4P_5<arg4 ], cost: 1
      5: f223_0_iterate_EQ -> f223_0_iterate_EQ : arg1'=1, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3P_6<arg2 && arg2>0 && arg2==arg3 ], cost: 1

   Failed to prove monotonicity of the guard of rule 4.
   Failed to prove monotonicity of the guard of rule 5.
[accelerate] Nesting with 2 inner and 2 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f168_0_main_LE : arg1'=-1+arg2, arg3'=0, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f168_0_main_LE -> f168_0_main_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2>0 && arg3P_2>arg3 && arg3>0 ], cost: 1
      2: f168_0_main_LE -> f168_0_main_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=1, arg4'=arg4P_3, [ arg2>0 ], cost: 1
      3: f168_0_main_LE -> f223_0_iterate_EQ : arg1'=0, arg2'=arg3, arg4'=0, [ arg2<1 && arg3>0 ], cost: 1
      7: f168_0_main_LE -> f168_0_main_LE : arg1'=-1, arg2'=0, arg3'=1, arg4'=arg4P_3, [ 1-arg2+arg1<=0 && 1+arg1>=1 ], cost: 1+arg1
      4: f223_0_iterate_EQ -> f223_0_iterate_EQ : arg1'=arg1P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>0 && arg4>0 && arg3>0 && arg1P_5>arg1 && arg2>arg1 && arg3P_5<arg3 && arg4P_5<arg4 ], cost: 1
      5: f223_0_iterate_EQ -> f223_0_iterate_EQ : arg1'=1, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3P_6<arg2 && arg2>0 && arg2==arg3 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f168_0_main_LE : arg1'=-1+arg2, arg3'=0, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      8: f1_0_main_Load -> f168_0_main_LE : arg1'=-2+arg2, arg2'=-1+arg2, arg3'=1, arg4'=arg4P_3, [ arg1>0 && arg2>0 ], cost: 2
      9: f1_0_main_Load -> f168_0_main_LE : arg1'=-1, arg2'=0, arg3'=1, arg4'=arg4P_3, [ arg1>0 && arg2>=1 ], cost: 1+arg2
      3: f168_0_main_LE -> f223_0_iterate_EQ : arg1'=0, arg2'=arg3, arg4'=0, [ arg2<1 && arg3>0 ], cost: 1
     10: f168_0_main_LE -> f223_0_iterate_EQ : arg1'=1, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 && arg3>0 && arg3P_6<arg3 ], cost: 2
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      9: f1_0_main_Load -> f168_0_main_LE : arg1'=-1, arg2'=0, arg3'=1, arg4'=arg4P_3, [ arg1>0 && arg2>=1 ], cost: 1+arg2
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
     11: __init -> f168_0_main_LE : arg1'=-1, arg2'=0, arg3'=1, arg4'=arg4P_3, [ arg1P_7>0 && arg2P_7>=1 ], cost: 2+arg2P_7

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     11: __init -> f168_0_main_LE : arg1'=-1, arg2'=0, arg3'=1, arg4'=arg4P_3, [ arg1P_7>0 && arg2P_7>=1 ], cost: 2+arg2P_7

Computing asymptotic complexity for rule 11
   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),?)