WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 && arg1==arg1P_1 && arg2==arg2P_1 ], cost: 1
      1: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && arg2==arg1P_2 && -5*x16_1+arg2==arg2P_2 && arg2-4*x17_1==arg3P_2 && -5*x18_1+5*arg2-12*x19_1==arg4P_2 ], cost: 1
      2: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg4>-1 && arg2<arg1 && -1+arg1==arg1P_3 && arg2==arg2P_3 && arg3==arg3P_3 && -1+arg2+3*arg3+arg1==arg4P_3 ], cost: 1
      3: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg3<arg2 && arg4>-1 && arg2>=arg1 && 1+arg1==arg1P_4 && -2+arg2==arg2P_4 && arg3==arg3P_4 && -1+arg2+3*arg3+arg1==arg4P_4 ], cost: 1
      4: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg4>-1 && arg3>=arg2 && arg2>=arg1 && 1+arg1==arg1P_5 && 1+arg2==arg2P_5 && -1+arg3==arg3P_5 && -1+arg2+3*arg3+arg1==arg4P_5 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg2'=-5*x16_1+arg2, arg3'=arg2-4*x17_1, arg4'=-5*x18_1+5*arg2-12*x19_1, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 ], cost: 1
      2: f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1+arg1, arg4'=-1+arg2+3*arg3+arg1, [ arg4>-1 && arg2<arg1 ], cost: 1
      3: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=-2+arg2, arg4'=-1+arg2+3*arg3+arg1, [ arg3<arg2 && arg4>-1 && arg2>=arg1 ], cost: 1
      4: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=1+arg2, arg3'=-1+arg3, arg4'=-1+arg2+3*arg3+arg1, [ arg4>-1 && arg3>=arg2 && arg2>=arg1 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 2.
   Accelerating the following rules:
      2: f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1+arg1, arg4'=-1+arg2+3*arg3+arg1, [ arg4>-1 && arg2<arg1 ], cost: 1
      3: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=-2+arg2, arg4'=-1+arg2+3*arg3+arg1, [ arg3<arg2 && arg4>-1 && arg2>=arg1 ], cost: 1
      4: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=1+arg2, arg3'=-1+arg3, arg4'=-1+arg2+3*arg3+arg1, [ arg4>-1 && arg3>=arg2 && arg2>=arg1 ], cost: 1

[test] deduced pseudo-invariant -1+arg2+3*arg3-arg4+arg1<=0, also trying 1-arg2-3*arg3+arg4-arg1<=-1
   Accelerated rule 2 with backward acceleration, yielding the new rule 6.
   Accelerated rule 2 with backward acceleration, yielding the new rule 7.
[test] deduced pseudo-invariant -1+arg2+3*arg3-arg4+arg1<=0, also trying 1-arg2-3*arg3+arg4-arg1<=-1
   Accelerated rule 3 with backward acceleration, yielding the new rule 8.
[test] deduced pseudo-invariant arg2+3*arg3-arg4+arg1<=0, also trying -arg2-3*arg3+arg4-arg1<=-1
   Accelerated rule 4 with backward acceleration, yielding the new rule 9.
[accelerate] Nesting with 4 inner and 3 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg2'=-5*x16_1+arg2, arg3'=arg2-4*x17_1, arg4'=-5*x18_1+5*arg2-12*x19_1, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 ], cost: 1
      2: f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1+arg1, arg4'=-1+arg2+3*arg3+arg1, [ arg4>-1 && arg2<arg1 ], cost: 1
      3: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=-2+arg2, arg4'=-1+arg2+3*arg3+arg1, [ arg3<arg2 && arg4>-1 && arg2>=arg1 ], cost: 1
      4: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=1+arg2, arg3'=-1+arg3, arg4'=-1+arg2+3*arg3+arg1, [ arg4>-1 && arg3>=arg2 && arg2>=arg1 ], cost: 1
      6: f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1-arg2-3*arg3, arg4'=-1, [ -1+arg2+3*arg3-arg4+arg1<=0 && 1+arg2+3*arg3+arg1>=1 && arg2<-arg2-3*arg3 ], cost: 1+arg2+3*arg3+arg1
      7: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg2, arg4'=2*arg2+3*arg3, [ -1+arg2+3*arg3-arg4+arg1<=0 && -arg2+arg1>=1 && 1+2*arg2+3*arg3>-1 ], cost: -arg2+arg1
      8: f384_0_iter_LT -> f384_0_iter_LT : arg1'=k_3+arg1, arg2'=arg2-2*k_3, arg4'=arg2-k_3+3*arg3+arg1, [ -1+arg2+3*arg3-arg4+arg1<=0 && k_3>=1 && arg3<2+arg2-2*k_3 && 1+arg2-k_3+3*arg3+arg1>-1 && 2+arg2-2*k_3>=-1+k_3+arg1 ], cost: k_3
      9: f384_0_iter_LT -> f384_0_iter_LT : arg1'=k_6+arg1, arg2'=arg2+k_6, arg3'=arg3-k_6, arg4'=arg2+3*arg3-k_6+arg1, [ arg2>=arg1 && arg2+3*arg3-arg4+arg1<=0 && k_6>=1 && 1+arg2+3*arg3-k_6+arg1>-1 && 1+arg3-k_6>=-1+arg2+k_6 ], cost: k_6
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg2'=-5*x16_1+arg2, arg3'=arg2-4*x17_1, arg4'=-5*x18_1+5*arg2-12*x19_1, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 ], cost: 1
     10: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=-1+arg2, arg2'=-5*x16_1+arg2, arg3'=arg2-4*x17_1, arg4'=-1-5*x16_1+5*arg2-12*x17_1, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -5*x18_1+5*arg2-12*x19_1>-1 && -5*x16_1+arg2<arg2 ], cost: 2
     11: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=1+arg2, arg2'=-2-5*x16_1+arg2, arg3'=arg2-4*x17_1, arg4'=-1-5*x16_1+5*arg2-12*x17_1, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && arg2-4*x17_1<-5*x16_1+arg2 && -5*x18_1+5*arg2-12*x19_1>-1 && -5*x16_1+arg2>=arg2 ], cost: 2
     12: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=1+arg2, arg2'=1-5*x16_1+arg2, arg3'=-1+arg2-4*x17_1, arg4'=-1-5*x16_1+5*arg2-12*x17_1, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -5*x18_1+5*arg2-12*x19_1>-1 && arg2-4*x17_1>=-5*x16_1+arg2 && -5*x16_1+arg2>=arg2 ], cost: 2
     13: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=-5*x16_1+arg2, arg2'=-5*x16_1+arg2, arg3'=arg2-4*x17_1, arg4'=-10*x16_1+5*arg2-12*x17_1, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -1+5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && 5*x16_1>=1 && 1-10*x16_1+5*arg2-12*x17_1>-1 ], cost: 1+5*x16_1
     14: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2+k_3, arg2'=-5*x16_1+arg2-2*k_3, arg3'=arg2-4*x17_1, arg4'=-5*x16_1+5*arg2-12*x17_1-k_3, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -1+5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && k_3>=1 && arg2-4*x17_1<2-5*x16_1+arg2-2*k_3 && 1-5*x16_1+5*arg2-12*x17_1-k_3>-1 && 2-5*x16_1+arg2-2*k_3>=-1+arg2+k_3 ], cost: 1+k_3
     15: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2+k_6, arg2'=-5*x16_1+arg2+k_6, arg3'=arg2-4*x17_1-k_6, arg4'=-5*x16_1+5*arg2-12*x17_1-k_6, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -5*x16_1+arg2>=arg2 && 5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && k_6>=1 && 1-5*x16_1+5*arg2-12*x17_1-k_6>-1 && 1+arg2-4*x17_1-k_6>=-1-5*x16_1+arg2+k_6 ], cost: 1+k_6
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
     13: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=-5*x16_1+arg2, arg2'=-5*x16_1+arg2, arg3'=arg2-4*x17_1, arg4'=-10*x16_1+5*arg2-12*x17_1, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -1+5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && 5*x16_1>=1 && 1-10*x16_1+5*arg2-12*x17_1>-1 ], cost: 1+5*x16_1
     14: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2+k_3, arg2'=-5*x16_1+arg2-2*k_3, arg3'=arg2-4*x17_1, arg4'=-5*x16_1+5*arg2-12*x17_1-k_3, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -1+5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && k_3>=1 && arg2-4*x17_1<2-5*x16_1+arg2-2*k_3 && 1-5*x16_1+5*arg2-12*x17_1-k_3>-1 && 2-5*x16_1+arg2-2*k_3>=-1+arg2+k_3 ], cost: 1+k_3
     15: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2+k_6, arg2'=-5*x16_1+arg2+k_6, arg3'=arg2-4*x17_1-k_6, arg4'=-5*x16_1+5*arg2-12*x17_1-k_6, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -5*x16_1+arg2>=arg2 && 5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && k_6>=1 && 1-5*x16_1+5*arg2-12*x17_1-k_6>-1 && 1+arg2-4*x17_1-k_6>=-1-5*x16_1+arg2+k_6 ], cost: 1+k_6
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
     13: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=-5*x16_1+arg2, arg2'=-5*x16_1+arg2, arg3'=arg2-4*x17_1, arg4'=-10*x16_1+5*arg2-12*x17_1, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -1+5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && 5*x16_1>=1 && 1-10*x16_1+5*arg2-12*x17_1>-1 ], cost: 1+5*x16_1
     14: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2+k_3, arg2'=-5*x16_1+arg2-2*k_3, arg3'=arg2-4*x17_1, arg4'=-5*x16_1+5*arg2-12*x17_1-k_3, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -1+5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && k_3>=1 && arg2-4*x17_1<2-5*x16_1+arg2-2*k_3 && 1-5*x16_1+5*arg2-12*x17_1-k_3>-1 && 2-5*x16_1+arg2-2*k_3>=-1+arg2+k_3 ], cost: 1+k_3
     15: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2+k_6, arg2'=-5*x16_1+arg2+k_6, arg3'=arg2-4*x17_1-k_6, arg4'=-5*x16_1+5*arg2-12*x17_1-k_6, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && arg2-4*x17_1>=0 && arg2-4*x17_1<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && arg2-4*x19_1<4 && arg2-4*x19_1>=0 && -5*x16_1+arg2>=arg2 && 5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && k_6>=1 && 1-5*x16_1+5*arg2-12*x17_1-k_6>-1 && 1+arg2-4*x17_1-k_6>=-1-5*x16_1+arg2+k_6 ], cost: 1+k_6
     16: __init -> f1_0_main_Load\' : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_6>0 && arg2P_6>-1 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     17: __init -> f384_0_iter_LT : arg1'=-5*x16_1+arg2P_6, arg2'=-5*x16_1+arg2P_6, arg3'=-4*x17_1+arg2P_6, arg4'=-10*x16_1-12*x17_1+5*arg2P_6, [ arg1P_6>0 && arg2P_6>-1 && -5*x16_1+arg2P_6>=0 && -5*x16_1+arg2P_6<5 && -4*x17_1+arg2P_6>=0 && -4*x17_1+arg2P_6<4 && -5*x18_1+arg2P_6>=0 && -5*x18_1+arg2P_6<5 && -4*x19_1+arg2P_6<4 && -4*x19_1+arg2P_6>=0 && -1+5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && 5*x16_1>=1 && 1-10*x16_1-12*x17_1+5*arg2P_6>-1 ], cost: 3+5*x16_1
     18: __init -> f384_0_iter_LT : arg1'=k_3+arg2P_6, arg2'=-5*x16_1-2*k_3+arg2P_6, arg3'=-4*x17_1+arg2P_6, arg4'=-5*x16_1-12*x17_1-k_3+5*arg2P_6, [ arg1P_6>0 && arg2P_6>-1 && -5*x16_1+arg2P_6>=0 && -5*x16_1+arg2P_6<5 && -4*x17_1+arg2P_6>=0 && -4*x17_1+arg2P_6<4 && -5*x18_1+arg2P_6>=0 && -5*x18_1+arg2P_6<5 && -4*x19_1+arg2P_6<4 && -4*x19_1+arg2P_6>=0 && -1+5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && k_3>=1 && -4*x17_1+arg2P_6<2-5*x16_1-2*k_3+arg2P_6 && 1-5*x16_1-12*x17_1-k_3+5*arg2P_6>-1 && 2-5*x16_1-2*k_3+arg2P_6>=-1+k_3+arg2P_6 ], cost: 3+k_3
     19: __init -> f384_0_iter_LT : arg1'=k_6+arg2P_6, arg2'=-5*x16_1+k_6+arg2P_6, arg3'=-4*x17_1-k_6+arg2P_6, arg4'=-5*x16_1-12*x17_1-k_6+5*arg2P_6, [ arg1P_6>0 && arg2P_6>-1 && -5*x16_1+arg2P_6>=0 && -5*x16_1+arg2P_6<5 && -4*x17_1+arg2P_6>=0 && -4*x17_1+arg2P_6<4 && -5*x18_1+arg2P_6>=0 && -5*x18_1+arg2P_6<5 && -4*x19_1+arg2P_6<4 && -4*x19_1+arg2P_6>=0 && -5*x16_1+arg2P_6>=arg2P_6 && 5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && k_6>=1 && 1-5*x16_1-12*x17_1-k_6+5*arg2P_6>-1 && 1-4*x17_1-k_6+arg2P_6>=-1-5*x16_1+k_6+arg2P_6 ], cost: 3+k_6

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     17: __init -> f384_0_iter_LT : arg1'=-5*x16_1+arg2P_6, arg2'=-5*x16_1+arg2P_6, arg3'=-4*x17_1+arg2P_6, arg4'=-10*x16_1-12*x17_1+5*arg2P_6, [ arg1P_6>0 && arg2P_6>-1 && -5*x16_1+arg2P_6>=0 && -5*x16_1+arg2P_6<5 && -4*x17_1+arg2P_6>=0 && -4*x17_1+arg2P_6<4 && -5*x18_1+arg2P_6>=0 && -5*x18_1+arg2P_6<5 && -4*x19_1+arg2P_6<4 && -4*x19_1+arg2P_6>=0 && -1+5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && 5*x16_1>=1 && 1-10*x16_1-12*x17_1+5*arg2P_6>-1 ], cost: 3+5*x16_1
     18: __init -> f384_0_iter_LT : arg1'=k_3+arg2P_6, arg2'=-5*x16_1-2*k_3+arg2P_6, arg3'=-4*x17_1+arg2P_6, arg4'=-5*x16_1-12*x17_1-k_3+5*arg2P_6, [ arg1P_6>0 && arg2P_6>-1 && -5*x16_1+arg2P_6>=0 && -5*x16_1+arg2P_6<5 && -4*x17_1+arg2P_6>=0 && -4*x17_1+arg2P_6<4 && -5*x18_1+arg2P_6>=0 && -5*x18_1+arg2P_6<5 && -4*x19_1+arg2P_6<4 && -4*x19_1+arg2P_6>=0 && -1+5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && k_3>=1 && -4*x17_1+arg2P_6<2-5*x16_1-2*k_3+arg2P_6 && 1-5*x16_1-12*x17_1-k_3+5*arg2P_6>-1 && 2-5*x16_1-2*k_3+arg2P_6>=-1+k_3+arg2P_6 ], cost: 3+k_3
     19: __init -> f384_0_iter_LT : arg1'=k_6+arg2P_6, arg2'=-5*x16_1+k_6+arg2P_6, arg3'=-4*x17_1-k_6+arg2P_6, arg4'=-5*x16_1-12*x17_1-k_6+5*arg2P_6, [ arg1P_6>0 && arg2P_6>-1 && -5*x16_1+arg2P_6>=0 && -5*x16_1+arg2P_6<5 && -4*x17_1+arg2P_6>=0 && -4*x17_1+arg2P_6<4 && -5*x18_1+arg2P_6>=0 && -5*x18_1+arg2P_6<5 && -4*x19_1+arg2P_6<4 && -4*x19_1+arg2P_6>=0 && -5*x16_1+arg2P_6>=arg2P_6 && 5*x18_1-5*x16_1-12*x17_1+12*x19_1<=0 && k_6>=1 && 1-5*x16_1-12*x17_1-k_6+5*arg2P_6>-1 && 1-4*x17_1-k_6+arg2P_6>=-1-5*x16_1+k_6+arg2P_6 ], cost: 3+k_6

Computing asymptotic complexity for rule 17
   Simplified the guard:
     17: __init -> f384_0_iter_LT : arg1'=-5*x16_1+arg2P_6, arg2'=-5*x16_1+arg2P_6, arg3'=-4*x17_1+arg2P_6, arg4'=-10*x16_1-12*x17_1+5*arg2P_6, [ arg1P_6>0 && -5*x16_1+arg2P_6>=0 && -5*x16_1+arg2P_6<5 && -4*x17_1+arg2P_6>=0 && -4*x17_1+arg2P_6<4 && -5*x18_1+arg2P_6>=0 && -5*x18_1+arg2P_6<5 && -4*x19_1+arg2P_6<4 && -4*x19_1+arg2P_6>=0 && 5*x16_1>=1 ], cost: 3+5*x16_1
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 18
   Simplified the guard:
     18: __init -> f384_0_iter_LT : arg1'=k_3+arg2P_6, arg2'=-5*x16_1-2*k_3+arg2P_6, arg3'=-4*x17_1+arg2P_6, arg4'=-5*x16_1-12*x17_1-k_3+5*arg2P_6, [ arg1P_6>0 && arg2P_6>-1 && -5*x16_1+arg2P_6<5 && -4*x17_1+arg2P_6>=0 && -4*x17_1+arg2P_6<4 && -5*x18_1+arg2P_6>=0 && -5*x18_1+arg2P_6<5 && -4*x19_1+arg2P_6<4 && -4*x19_1+arg2P_6>=0 && k_3>=1 && -4*x17_1+arg2P_6<2-5*x16_1-2*k_3+arg2P_6 && 2-5*x16_1-2*k_3+arg2P_6>=-1+k_3+arg2P_6 ], cost: 3+k_3
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 19
   Simplified the guard:
     19: __init -> f384_0_iter_LT : arg1'=k_6+arg2P_6, arg2'=-5*x16_1+k_6+arg2P_6, arg3'=-4*x17_1-k_6+arg2P_6, arg4'=-5*x16_1-12*x17_1-k_6+5*arg2P_6, [ arg1P_6>0 && arg2P_6>-1 && -5*x16_1+arg2P_6>=0 && -4*x17_1+arg2P_6<4 && -5*x18_1+arg2P_6>=0 && -5*x18_1+arg2P_6<5 && -4*x19_1+arg2P_6<4 && -4*x19_1+arg2P_6>=0 && -5*x16_1+arg2P_6>=arg2P_6 && k_6>=1 && 1-5*x16_1-12*x17_1-k_6+5*arg2P_6>-1 && 1-4*x17_1-k_6+arg2P_6>=-1-5*x16_1+k_6+arg2P_6 ], cost: 3+k_6
   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),?)