WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, arg7'=arg7P_1, arg8'=arg8P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && 0==arg2 && 0==arg2P_1 && 0==arg3P_1 && 0==arg4P_1 && 0==arg5P_1 && 0==arg6P_1 && 0==arg7P_1 && 0==arg8P_1 ], cost: 1
      1: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, arg7'=arg7P_2, arg8'=arg8P_2, [ arg1P_2<=arg1 && arg2P_2>-1 && arg1>0 && arg1P_2>0 && 1==arg2 && 0==arg3P_2 && 0==arg4P_2 && 0==arg5P_2 && 1==arg6P_2 && 1==arg7P_2 && 1==arg8P_2 ], cost: 1
      2: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, arg7'=arg7P_3, arg8'=arg8P_3, [ arg2P_3>-1 && arg3P_3>-1 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && 2==arg2 && 0==arg4P_3 && 0==arg5P_3 && 2==arg6P_3 && 2==arg7P_3 && 2==arg8P_3 ], cost: 1
      3: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, arg7'=arg7P_4, arg8'=arg8P_4, [ arg2P_4>-1 && arg2>2 && arg4P_4>-1 && arg3P_4>-1 && arg1>=arg1P_4 && arg1>0 && arg1P_4>0 && arg4P_4==arg5P_4 && arg2==arg6P_4 && 3==arg7P_4 && arg2==arg8P_4 ], cost: 1
      4: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, arg7'=arg7P_5, arg8'=arg8P_5, [ arg4>-1 && arg6>-1 && arg7>=arg6 && arg3>-1 && 2*arg2>=0 && 2*arg2-arg3>0 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 && arg4==arg5 && arg6==arg8 && 0==arg2P_5 && 0==arg3P_5 && arg4==arg4P_5 && arg4==arg5P_5 && arg6==arg6P_5 && arg7==arg7P_5 && arg6==arg8P_5 ], cost: 1
      5: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, arg7'=arg7P_6, arg8'=arg8P_6, [ arg4>-1 && arg6>-1 && arg7>-1 && arg7<arg6 && arg2P_6>-1 && 1+arg7>=arg6 && arg3>-1 && 2*arg2>=0 && 2*arg2P_6>=0 && 2*arg2P_6<2*arg2-arg3 && 2*arg2P_6+arg4>=0 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 && arg4==arg5 && arg6==arg8 && 0==arg3P_6 && 2*arg2P_6+arg4==arg4P_6 && 2*arg2P_6+arg4==arg5P_6 && arg6==arg6P_6 && 1+arg7==arg7P_6 && arg6==arg8P_6 ], cost: 1
      6: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, arg7'=arg7P_7, arg8'=arg8P_7, [ arg6>-1 && 1+arg7<arg6 && arg4>-1 && arg7>-1 && arg2P_7>-1 && arg3P_7>-1 && arg3>-1 && 2*arg2>=0 && 2*arg2P_7>=0 && -arg3P_7+2*arg2P_7<2*arg2-arg3 && 2*arg2P_7+arg4>=0 && arg1P_7<=arg1 && arg1>0 && arg1P_7>0 && arg4==arg5 && arg6==arg8 && -arg3P_7+2*arg2P_7+arg4==arg4P_7 && -arg3P_7+2*arg2P_7+arg4==arg5P_7 && arg6==arg6P_7 && 2+arg7==arg7P_7 && arg6==arg8P_7 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, arg7'=arg7P_8, arg8'=arg8P_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, arg5'=arg5P_8, arg6'=arg6P_8, arg7'=arg7P_8, arg8'=arg8P_8, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_1, arg2'=0, arg3'=0, arg4'=0, arg5'=0, arg6'=0, arg7'=0, arg8'=0, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=0, arg5'=0, arg6'=1, arg7'=1, arg8'=1, [ arg1P_2<=arg1 && arg2P_2>-1 && arg1>0 && arg1P_2>0 && 1==arg2 ], cost: 1
      2: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=0, arg5'=0, arg6'=2, arg7'=2, arg8'=2, [ arg2P_3>-1 && arg3P_3>-1 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && 2==arg2 ], cost: 1
      3: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg4P_4, arg6'=arg2, arg7'=3, arg8'=arg2, [ arg2P_4>-1 && arg2>2 && arg4P_4>-1 && arg3P_4>-1 && arg1>=arg1P_4 && arg1>0 && arg1P_4>0 ], cost: 1
      4: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_5, arg2'=0, arg3'=0, arg5'=arg4, arg8'=arg6, [ arg4>-1 && arg6>-1 && arg7>=arg6 && arg3>-1 && 2*arg2>=0 && 2*arg2-arg3>0 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 && arg4==arg5 && arg6==arg8 ], cost: 1
      5: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=2*arg2P_6+arg4, arg5'=2*arg2P_6+arg4, arg7'=1+arg7, arg8'=arg6, [ arg4>-1 && arg7>-1 && 1-arg6+arg7==0 && arg2P_6>-1 && arg3>-1 && 2*arg2>=0 && 2*arg2P_6<2*arg2-arg3 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 && arg4==arg5 && arg6==arg8 ], cost: 1
      6: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-arg4P_7+2*arg2P_7+arg4, arg4'=arg4P_7, arg5'=arg4P_7, arg7'=2+arg7, arg8'=arg6, [ 1+arg7<arg6 && arg4>-1 && arg7>-1 && arg2P_7>-1 && -arg4P_7+2*arg2P_7+arg4>-1 && arg3>-1 && 2*arg2>=0 && arg4P_7-arg4<2*arg2-arg3 && arg1P_7<=arg1 && arg1>0 && arg1P_7>0 && arg4==arg5 && arg6==arg8 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, arg7'=arg7P_8, arg8'=arg8P_8, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      4: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_5, arg2'=0, arg3'=0, arg5'=arg4, arg8'=arg6, [ arg4>-1 && arg6>-1 && arg7>=arg6 && arg3>-1 && 2*arg2>=0 && 2*arg2-arg3>0 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 && arg4==arg5 && arg6==arg8 ], cost: 1
      5: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=2*arg2P_6+arg4, arg5'=2*arg2P_6+arg4, arg7'=1+arg7, arg8'=arg6, [ arg4>-1 && arg7>-1 && 1-arg6+arg7==0 && arg2P_6>-1 && arg3>-1 && 2*arg2>=0 && 2*arg2P_6<2*arg2-arg3 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 && arg4==arg5 && arg6==arg8 ], cost: 1
      6: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-arg4P_7+2*arg2P_7+arg4, arg4'=arg4P_7, arg5'=arg4P_7, arg7'=2+arg7, arg8'=arg6, [ 1+arg7<arg6 && arg4>-1 && arg7>-1 && arg2P_7>-1 && -arg4P_7+2*arg2P_7+arg4>-1 && arg3>-1 && 2*arg2>=0 && arg4P_7-arg4<2*arg2-arg3 && arg1P_7<=arg1 && arg1>0 && arg1P_7>0 && arg4==arg5 && arg6==arg8 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_1, arg2'=0, arg3'=0, arg4'=0, arg5'=0, arg6'=0, arg7'=0, arg8'=0, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=0, arg5'=0, arg6'=1, arg7'=1, arg8'=1, [ arg1P_2<=arg1 && arg2P_2>-1 && arg1>0 && arg1P_2>0 && 1==arg2 ], cost: 1
      2: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=0, arg5'=0, arg6'=2, arg7'=2, arg8'=2, [ arg2P_3>-1 && arg3P_3>-1 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && 2==arg2 ], cost: 1
      3: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg4P_4, arg6'=arg2, arg7'=3, arg8'=arg2, [ arg2P_4>-1 && arg2>2 && arg4P_4>-1 && arg3P_4>-1 && arg1>=arg1P_4 && arg1>0 && arg1P_4>0 ], cost: 1
      4: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_5, arg2'=0, arg3'=0, arg5'=arg4, arg8'=arg6, [ arg4>-1 && arg6>-1 && arg7>=arg6 && arg3>-1 && 2*arg2>=0 && 2*arg2-arg3>0 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 && arg4==arg5 && arg6==arg8 ], cost: 1
      5: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=2*arg2P_6+arg4, arg5'=2*arg2P_6+arg4, arg7'=1+arg7, arg8'=arg6, [ arg4>-1 && arg7>-1 && 1-arg6+arg7==0 && arg2P_6>-1 && arg3>-1 && 2*arg2>=0 && 2*arg2P_6<2*arg2-arg3 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 && arg4==arg5 && arg6==arg8 ], cost: 1
      6: f1184_0_main_LT -> f1184_0_main_LT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-arg4P_7+2*arg2P_7+arg4, arg4'=arg4P_7, arg5'=arg4P_7, arg7'=2+arg7, arg8'=arg6, [ 1+arg7<arg6 && arg4>-1 && arg7>-1 && arg2P_7>-1 && -arg4P_7+2*arg2P_7+arg4>-1 && arg3>-1 && 2*arg2>=0 && arg4P_7-arg4<2*arg2-arg3 && arg1P_7<=arg1 && arg1>0 && arg1P_7>0 && arg4==arg5 && arg6==arg8 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, arg7'=arg7P_8, arg8'=arg8P_8, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_1, arg2'=0, arg3'=0, arg4'=0, arg5'=0, arg6'=0, arg7'=0, arg8'=0, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=0, arg5'=0, arg6'=1, arg7'=1, arg8'=1, [ arg1P_2<=arg1 && arg2P_2>-1 && arg1>0 && arg1P_2>0 && 1==arg2 ], cost: 1
      2: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=0, arg5'=0, arg6'=2, arg7'=2, arg8'=2, [ arg2P_3>-1 && arg3P_3>-1 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && 2==arg2 ], cost: 1
      3: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg4P_4, arg6'=arg2, arg7'=3, arg8'=arg2, [ arg2P_4>-1 && arg2>2 && arg4P_4>-1 && arg3P_4>-1 && arg1>=arg1P_4 && arg1>0 && arg1P_4>0 ], cost: 1
      8: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_5, arg2'=0, arg3'=0, arg4'=0, arg5'=0, arg6'=1, arg7'=1, arg8'=1, [ arg2P_2>-1 && arg1>0 && 1==arg2 && 2*arg2P_2>0 && arg1P_5>0 && arg1P_5<=arg1 ], cost: 2
      9: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_5, arg2'=0, arg3'=0, arg4'=0, arg5'=0, arg6'=2, arg7'=2, arg8'=2, [ arg2P_3>-1 && arg1>0 && 2==arg2 && arg1P_5>0 && 0<=-1+2*arg2P_3 && arg1P_5<=arg1 ], cost: 2
     10: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_5, arg2'=0, arg3'=0, arg4'=arg4P_4, arg5'=arg4P_4, arg6'=arg2, arg7'=3, arg8'=arg2, [ arg2P_4>-1 && 3-arg2==0 && arg4P_4>-1 && arg1>0 && arg1P_5>0 && arg1P_5<=arg1 && 0<=-1+2*arg2P_4 ], cost: 2
     11: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=2*arg2P_6+arg4P_4, arg5'=2*arg2P_6+arg4P_4, arg6'=arg2, arg7'=4, arg8'=arg2, [ arg2P_4>-1 && arg4P_4>-1 && arg1>0 && 4-arg2==0 && arg2P_6>-1 && 2*arg2P_4>=0 && arg1P_6>0 && arg1P_6<=arg1 && 0<=-1+2*arg2P_4-2*arg2P_6 ], cost: 2
     12: f1_0_main_Load -> f1184_0_main_LT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-arg4P_7+2*arg2P_7+arg4P_4, arg4'=arg4P_7, arg5'=arg4P_7, arg6'=arg2, arg7'=5, arg8'=arg2, [ arg2P_4>-1 && arg4P_4>-1 && arg1>0 && 4<arg2 && arg2P_7>-1 && -arg4P_7+2*arg2P_7+arg4P_4>-1 && 2*arg2P_4>=0 && arg1P_7>0 && arg1P_7<=arg1 && 0<=-1+2*arg2P_4-arg4P_7+arg4P_4 ], cost: 2
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, arg7'=arg7P_8, arg8'=arg8P_8, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     <empty>

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     <empty>

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),?)