WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f162_0_power_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && 0==arg2 && 0==arg1P_1 && 0==arg2P_1 ], cost: 1
      1: f1_0_main_Load -> f97_0_random_GT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg2>0 && arg1>0 && arg1P_2>0 && 0==arg2P_2 ], cost: 1
      2: f1_0_main_Load -> f97_0_random_GT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg2P_3>-1 && arg2>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 ], cost: 1
      7: f162_0_power_GT -> f162_0_power_GT\' : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1<2 && arg2>1 && arg1==arg1P_8 && arg2==arg2P_8 ], cost: 1
      9: f162_0_power_GT -> f162_0_power_GT\' : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>2 && arg2>1 && arg1==arg1P_10 && arg2==arg2P_10 ], cost: 1
      3: f97_0_random_GT -> f162_0_power_GT : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 && arg2==arg1P_4 && 0==arg2P_4 ], cost: 1
      4: f97_0_random_GT -> f155_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && x10_1>1 && arg1>0 && arg1P_5>0 && arg2==arg2P_5 && 0==arg3P_5 ], cost: 1
      5: f97_0_random_GT -> f155_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ x14_1>1 && arg3P_6>-1 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 && arg2==arg2P_6 ], cost: 1
      6: f155_0_main_InvokeMethod -> f162_0_power_GT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && x19_1>1 && arg2==arg1P_7 && arg3==arg2P_7 ], cost: 1
      8: f162_0_power_GT\' -> f213_0_power_NE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2>1 && arg1<2 && arg2-2*x37_1<2 && arg2-2*x37_1>=0 && arg1==arg1P_9 && arg2==arg2P_9 && arg2-2*x37_1==arg3P_9 ], cost: 1
     10: f162_0_power_GT\' -> f213_0_power_NE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg2>1 && arg1>2 && arg2-2*x41_1<2 && arg2-2*x41_1>=0 && arg1==arg1P_11 && arg2==arg2P_11 && arg2-2*x41_1==arg3P_11 ], cost: 1
     11: f213_0_power_NE -> f213_0_power_NE\' : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg2>1 && x47_1>0 && arg2>x47_1 && 0==arg3 && arg1==arg1P_12 && arg2==arg2P_12 && 0==arg3P_12 && arg4==arg4P_12 ], cost: 1
     13: f213_0_power_NE -> f162_0_power_GT : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg2>1 && -1+arg2<arg2 && 1==arg3 && arg1==arg1P_14 && -1+arg2==arg2P_14 ], cost: 1
     12: f213_0_power_NE\' -> f162_0_power_GT : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2>1 && arg2>arg2P_13 && arg2P_13>0 && arg2-2*arg2P_13<2 && arg2-2*arg2P_13>=0 && 0==arg3 && arg1==arg1P_13 ], cost: 1
     14: __init -> f1_0_main_Load : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     14: __init -> f1_0_main_Load : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f97_0_random_GT : arg1'=arg1P_2, arg2'=0, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg2>0 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f1_0_main_Load -> f97_0_random_GT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg2P_3>-1 && arg2>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 ], cost: 1
      7: f162_0_power_GT -> f162_0_power_GT\' : arg3'=arg3P_8, arg4'=arg4P_8, [ arg1<2 && arg2>1 ], cost: 1
      9: f162_0_power_GT -> f162_0_power_GT\' : arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>2 && arg2>1 ], cost: 1
      3: f97_0_random_GT -> f162_0_power_GT : arg1'=arg2, arg2'=0, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 ], cost: 1
      4: f97_0_random_GT -> f155_0_main_InvokeMethod : arg1'=arg1P_5, arg3'=0, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      5: f97_0_random_GT -> f155_0_main_InvokeMethod : arg1'=arg1P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3P_6>-1 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 ], cost: 1
      6: f155_0_main_InvokeMethod -> f162_0_power_GT : arg1'=arg2, arg2'=arg3, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 ], cost: 1
      8: f162_0_power_GT\' -> f213_0_power_NE : arg3'=arg2-2*x37_1, arg4'=arg4P_9, [ arg2>1 && arg1<2 && arg2-2*x37_1<2 && arg2-2*x37_1>=0 ], cost: 1
     10: f162_0_power_GT\' -> f213_0_power_NE : arg3'=arg2-2*x41_1, arg4'=arg4P_11, [ arg2>1 && arg1>2 && arg2-2*x41_1<2 && arg2-2*x41_1>=0 ], cost: 1
     11: f213_0_power_NE -> f213_0_power_NE\' : arg3'=0, [ 0==arg3 && 1<=-1+arg2 ], cost: 1
     13: f213_0_power_NE -> f162_0_power_GT : arg2'=-1+arg2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg2>1 && 1==arg3 ], cost: 1
     12: f213_0_power_NE\' -> f162_0_power_GT : arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_13>0 && arg2-2*arg2P_13<2 && arg2-2*arg2P_13>=0 && 0==arg3 ], cost: 1
     14: __init -> f1_0_main_Load : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
      0: f1_0_main_Load -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f97_0_random_GT : arg1'=arg1P_2, arg2'=0, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg2>0 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f1_0_main_Load -> f97_0_random_GT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg2P_3>-1 && arg2>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 ], cost: 1
      7: f162_0_power_GT -> f162_0_power_GT\' : arg3'=arg3P_8, arg4'=arg4P_8, [ arg1<2 && arg2>1 ], cost: 1
      9: f162_0_power_GT -> f162_0_power_GT\' : arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>2 && arg2>1 ], cost: 1
      3: f97_0_random_GT -> f162_0_power_GT : arg1'=arg2, arg2'=0, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 ], cost: 1
      4: f97_0_random_GT -> f155_0_main_InvokeMethod : arg1'=arg1P_5, arg3'=0, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      5: f97_0_random_GT -> f155_0_main_InvokeMethod : arg1'=arg1P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3P_6>-1 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 ], cost: 1
      6: f155_0_main_InvokeMethod -> f162_0_power_GT : arg1'=arg2, arg2'=arg3, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 ], cost: 1
      8: f162_0_power_GT\' -> f213_0_power_NE : arg3'=arg2-2*x37_1, arg4'=arg4P_9, [ arg2>1 && arg1<2 && arg2-2*x37_1<2 && arg2-2*x37_1>=0 ], cost: 1
     10: f162_0_power_GT\' -> f213_0_power_NE : arg3'=arg2-2*x41_1, arg4'=arg4P_11, [ arg2>1 && arg1>2 && arg2-2*x41_1<2 && arg2-2*x41_1>=0 ], cost: 1
     13: f213_0_power_NE -> f162_0_power_GT : arg2'=-1+arg2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg2>1 && 1==arg3 ], cost: 1
     15: f213_0_power_NE -> f162_0_power_GT : arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ 0==arg3 && 1<=-1+arg2 && arg2P_13>0 && arg2-2*arg2P_13<2 && arg2-2*arg2P_13>=0 ], cost: 2
     14: __init -> f1_0_main_Load : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     19: f162_0_power_GT -> f213_0_power_NE : arg3'=arg2-2*x37_1, arg4'=arg4P_9, [ arg1<2 && arg2>1 && arg2-2*x37_1<2 && arg2-2*x37_1>=0 ], cost: 2
     20: f162_0_power_GT -> f213_0_power_NE : arg3'=arg2-2*x41_1, arg4'=arg4P_11, [ arg1>2 && arg2>1 && arg2-2*x41_1<2 && arg2-2*x41_1>=0 ], cost: 2
      3: f97_0_random_GT -> f162_0_power_GT : arg1'=arg2, arg2'=0, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 ], cost: 1
     21: f97_0_random_GT -> f162_0_power_GT : arg1'=arg2, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 2
     22: f97_0_random_GT -> f162_0_power_GT : arg1'=arg2, arg2'=arg3P_6, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3P_6>-1 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 ], cost: 2
     13: f213_0_power_NE -> f162_0_power_GT : arg2'=-1+arg2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg2>1 && 1==arg3 ], cost: 1
     15: f213_0_power_NE -> f162_0_power_GT : arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ 0==arg3 && 1<=-1+arg2 && arg2P_13>0 && arg2-2*arg2P_13<2 && arg2-2*arg2P_13>=0 ], cost: 2
     16: __init -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_15>0 && 0==arg2P_15 ], cost: 2
     17: __init -> f97_0_random_GT : arg1'=arg1P_2, arg2'=0, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>0 ], cost: 2
     18: __init -> f97_0_random_GT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg2P_3>-1 && arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     29: f162_0_power_GT -> f162_0_power_GT : arg2'=-1+arg2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1<2 && arg2>1 && 1==arg2-2*x37_1 ], cost: 3
     30: f162_0_power_GT -> f162_0_power_GT : arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1<2 && arg2>1 && 0==arg2-2*x37_1 && arg2P_13>0 && arg2-2*arg2P_13<2 && arg2-2*arg2P_13>=0 ], cost: 4
     31: f162_0_power_GT -> f162_0_power_GT : arg2'=-1+arg2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1>2 && arg2>1 && 1==arg2-2*x41_1 ], cost: 3
     32: f162_0_power_GT -> f162_0_power_GT : arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>2 && arg2>1 && 0==arg2-2*x41_1 && arg2P_13>0 && arg2-2*arg2P_13<2 && arg2-2*arg2P_13>=0 ], cost: 4
     16: __init -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_15>0 && 0==arg2P_15 ], cost: 2
     23: __init -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>0 ], cost: 3
     24: __init -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>0 && arg1P_5<=arg1P_2 && arg1P_5>0 ], cost: 4
     25: __init -> f162_0_power_GT : arg1'=0, arg2'=arg3P_6, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>0 && arg3P_6>-1 && arg1P_6<=arg1P_2 && arg1P_6>0 ], cost: 4
     26: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=0, arg3'=arg3P_4, arg4'=arg4P_4, [ arg2P_3>-1 && arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 ], cost: 3
     27: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_3>-1 && arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg1P_5<=arg1P_3 && arg1P_5>0 ], cost: 4
     28: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=arg3P_6, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_3>-1 && arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg3P_6>-1 && arg1P_6<=arg1P_3 && arg1P_6>0 ], cost: 4

Accelerating simple loops of location 1.
   Accelerating the following rules:
     29: f162_0_power_GT -> f162_0_power_GT : arg2'=-1+arg2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1<2 && arg2>1 && 1==arg2-2*x37_1 ], cost: 3
     30: f162_0_power_GT -> f162_0_power_GT : arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1<2 && arg2>1 && 0==arg2-2*x37_1 && arg2P_13>0 && arg2-2*arg2P_13<2 && arg2-2*arg2P_13>=0 ], cost: 4
     31: f162_0_power_GT -> f162_0_power_GT : arg2'=-1+arg2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1>2 && arg2>1 && 1==arg2-2*x41_1 ], cost: 3
     32: f162_0_power_GT -> f162_0_power_GT : arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>2 && arg2>1 && 0==arg2-2*x41_1 && arg2P_13>0 && arg2-2*arg2P_13<2 && arg2-2*arg2P_13>=0 ], cost: 4

   Failed to prove monotonicity of the guard of rule 29.
   Failed to prove monotonicity of the guard of rule 30.
   Failed to prove monotonicity of the guard of rule 31.
   Failed to prove monotonicity of the guard of rule 32.
[accelerate] Nesting with 4 inner and 4 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     29: f162_0_power_GT -> f162_0_power_GT : arg2'=-1+arg2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1<2 && arg2>1 && 1==arg2-2*x37_1 ], cost: 3
     30: f162_0_power_GT -> f162_0_power_GT : arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1<2 && arg2>1 && 0==arg2-2*x37_1 && arg2P_13>0 && arg2-2*arg2P_13<2 && arg2-2*arg2P_13>=0 ], cost: 4
     31: f162_0_power_GT -> f162_0_power_GT : arg2'=-1+arg2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1>2 && arg2>1 && 1==arg2-2*x41_1 ], cost: 3
     32: f162_0_power_GT -> f162_0_power_GT : arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>2 && arg2>1 && 0==arg2-2*x41_1 && arg2P_13>0 && arg2-2*arg2P_13<2 && arg2-2*arg2P_13>=0 ], cost: 4
     16: __init -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_15>0 && 0==arg2P_15 ], cost: 2
     23: __init -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>0 ], cost: 3
     24: __init -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>0 && arg1P_5<=arg1P_2 && arg1P_5>0 ], cost: 4
     25: __init -> f162_0_power_GT : arg1'=0, arg2'=arg3P_6, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>0 && arg3P_6>-1 && arg1P_6<=arg1P_2 && arg1P_6>0 ], cost: 4
     26: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=0, arg3'=arg3P_4, arg4'=arg4P_4, [ arg2P_3>-1 && arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 ], cost: 3
     27: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_3>-1 && arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg1P_5<=arg1P_3 && arg1P_5>0 ], cost: 4
     28: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=arg3P_6, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_3>-1 && arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg3P_6>-1 && arg1P_6<=arg1P_3 && arg1P_6>0 ], cost: 4

Chained accelerated rules (with incoming rules):
   Start location: __init
     16: __init -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_15>0 && 0==arg2P_15 ], cost: 2
     23: __init -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>0 ], cost: 3
     24: __init -> f162_0_power_GT : arg1'=0, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>0 && arg1P_5<=arg1P_2 && arg1P_5>0 ], cost: 4
     25: __init -> f162_0_power_GT : arg1'=0, arg2'=arg3P_6, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>0 && arg3P_6>-1 && arg1P_6<=arg1P_2 && arg1P_6>0 ], cost: 4
     26: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=0, arg3'=arg3P_4, arg4'=arg4P_4, [ arg2P_3>-1 && arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 ], cost: 3
     27: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_3>-1 && arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg1P_5<=arg1P_3 && arg1P_5>0 ], cost: 4
     28: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=arg3P_6, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_3>-1 && arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg3P_6>-1 && arg1P_6<=arg1P_3 && arg1P_6>0 ], cost: 4
     33: __init -> f162_0_power_GT : arg1'=0, arg2'=2*x37_1, arg3'=arg3P_14, arg4'=arg4P_14, [ 1+2*x37_1>1 ], cost: 7
     34: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=2*x37_1, arg3'=arg3P_14, arg4'=arg4P_14, [ arg2P_3>-1 && arg2P_3<2 && 1+2*x37_1>1 ], cost: 7
     35: __init -> f162_0_power_GT : arg1'=0, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ 2*x37_1>1 && arg2P_13>0 && 2*x37_1-2*arg2P_13<2 && 2*x37_1-2*arg2P_13>=0 ], cost: 8
     36: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_3>-1 && arg2P_3<2 && 2*x37_1>1 && arg2P_13>0 && 2*x37_1-2*arg2P_13<2 && 2*x37_1-2*arg2P_13>=0 ], cost: 8
     37: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=2*x41_1, arg3'=arg3P_14, arg4'=arg4P_14, [ arg2P_3>2 && 1+2*x41_1>1 ], cost: 7
     38: __init -> f162_0_power_GT : arg1'=arg2P_3, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_3>2 && 2*x41_1>1 && arg2P_13>0 && 2*x41_1-2*arg2P_13<2 && 2*x41_1-2*arg2P_13>=0 ], cost: 8

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