WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1>0 && arg1P_1>2 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ -1+arg1P_2<=arg1 && arg1>0 && arg1P_2>1 && 0==arg2 ], cost: 1
      2: f1_0_main_Load -> f481_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && x6_1>-1 && arg1P_3>2 && 1==arg2 ], cost: 1
      3: f1_0_main_Load -> f481_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ -1+arg1P_4<=arg1 && x64_1>-1 && arg1>0 && arg1P_4>1 && 1==arg2 ], cost: 1
      4: f1_0_main_Load -> f482_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ x15_1*x14_1>=0 && arg2>1 && x15_1>-1 && x14_1>-1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 && arg2P_5>2 ], cost: 1
      5: f1_0_main_Load -> f482_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ x20_1*x21_1>=0 && arg2>1 && x21_1>-1 && x20_1>-1 && arg1P_6<=arg1 && -1+arg2P_6<=arg1 && arg1>0 && arg1P_6>0 && arg2P_6>1 ], cost: 1
      6: f1_0_main_Load -> f193_0__init__LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1>0 && 0==arg2 && 10==arg1P_7 ], cost: 1
      7: f1_0_main_Load -> f193_0__init__LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1>0 && x69_1>-1 && 1==arg2 && 10==arg1P_8 ], cost: 1
      8: f1_0_main_Load -> f193_0__init__LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, [ x28_1*x27_1>=0 && arg2>1 && x28_1>-1 && x27_1>-1 && arg1>0 && 10+x28_1*x27_1==arg1P_9 ], cost: 1
     13: f480_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, [ arg1P_14<=arg1 && 1+arg2P_14<=arg1 && arg1>0 && arg1P_14>0 && arg2P_14>-1 ], cost: 1
     14: f481_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, [ arg1P_15<=arg1 && 1+arg2P_15<=arg1 && arg1>0 && arg1P_15>0 && arg2P_15>-1 ], cost: 1
     15: f482_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, [ arg1P_16<=arg2 && x46_1>1 && 1+arg2P_16<=arg2 && arg1>0 && arg2>0 && arg1P_16>0 && arg2P_16>-1 ], cost: 1
      9: f193_0__init__LE -> f193_0__init__LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1>1 && -1+arg1<arg1 && -1+arg1==arg1P_10 ], cost: 1
     10: f193_0__init__LE -> f518_0__init__InvokeMethod : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, [ -1+arg1<arg1 && arg1P_11>4 && arg1>1 && -1+arg1==arg2P_11 ], cost: 1
     11: f193_0__init__LE -> f518_0__init__InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, [ -1+arg1<arg1 && arg1P_12>3 && arg1>1 && -1+arg1==arg2P_12 ], cost: 1
     12: f518_0__init__InvokeMethod -> f193_0__init__LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1>2 && arg2>0 && arg2==arg1P_13 ], cost: 1
     16: f388_0_height_NONNULL -> f388_0_height_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ 2+arg1P_17<=arg1 && arg1P_17<=arg2 && 3+arg2P_17<=arg1 && 1+arg2P_17<=arg2 && arg1>2 && arg2>0 && arg1P_17>0 && arg2P_17>-1 ], cost: 1
     17: f388_0_height_NONNULL -> f388_0_height_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ 2+arg1P_18<=arg1 && 3+arg2P_18<=arg1 && arg1>2 && arg2>-1 && arg1P_18>0 && arg2P_18>-1 ], cost: 1
     18: __init -> f1_0_main_Load : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     18: __init -> f1_0_main_Load : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1>0 && arg1P_1>2 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ -1+arg1P_2<=arg1 && arg1>0 && arg1P_2>1 && 0==arg2 ], cost: 1
      2: f1_0_main_Load -> f481_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && arg1P_3>2 && 1==arg2 ], cost: 1
      3: f1_0_main_Load -> f481_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ -1+arg1P_4<=arg1 && arg1>0 && arg1P_4>1 && 1==arg2 ], cost: 1
      4: f1_0_main_Load -> f482_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ arg2>1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 && arg2P_5>2 ], cost: 1
      5: f1_0_main_Load -> f482_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ arg2>1 && arg1P_6<=arg1 && -1+arg2P_6<=arg1 && arg1>0 && arg1P_6>0 && arg2P_6>1 ], cost: 1
      6: f1_0_main_Load -> f193_0__init__LE : arg1'=10, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1>0 && 0==arg2 ], cost: 1
      7: f1_0_main_Load -> f193_0__init__LE : arg1'=10, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1>0 && 1==arg2 ], cost: 1
      8: f1_0_main_Load -> f193_0__init__LE : arg1'=10+x28_1*x27_1, arg2'=arg2P_9, arg3'=arg3P_9, [ arg2>1 && x28_1>-1 && x27_1>-1 && arg1>0 ], cost: 1
     13: f480_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, [ arg1P_14<=arg1 && 1+arg2P_14<=arg1 && arg1>0 && arg1P_14>0 && arg2P_14>-1 ], cost: 1
     14: f481_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, [ arg1P_15<=arg1 && 1+arg2P_15<=arg1 && arg1>0 && arg1P_15>0 && arg2P_15>-1 ], cost: 1
     15: f482_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, [ arg1P_16<=arg2 && 1+arg2P_16<=arg2 && arg1>0 && arg2>0 && arg1P_16>0 && arg2P_16>-1 ], cost: 1
      9: f193_0__init__LE -> f193_0__init__LE : arg1'=-1+arg1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1>1 ], cost: 1
     10: f193_0__init__LE -> f518_0__init__InvokeMethod : arg1'=arg1P_11, arg2'=-1+arg1, arg3'=arg3P_11, [ arg1P_11>4 && arg1>1 ], cost: 1
     11: f193_0__init__LE -> f518_0__init__InvokeMethod : arg1'=arg1P_12, arg2'=-1+arg1, arg3'=arg3P_12, [ arg1P_12>3 && arg1>1 ], cost: 1
     12: f518_0__init__InvokeMethod -> f193_0__init__LE : arg1'=arg2, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1>2 && arg2>0 ], cost: 1
     16: f388_0_height_NONNULL -> f388_0_height_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ 2+arg1P_17<=arg1 && arg1P_17<=arg2 && 3+arg2P_17<=arg1 && 1+arg2P_17<=arg2 && arg1>2 && arg2>0 && arg1P_17>0 && arg2P_17>-1 ], cost: 1
     17: f388_0_height_NONNULL -> f388_0_height_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ 2+arg1P_18<=arg1 && 3+arg2P_18<=arg1 && arg1>2 && arg2>-1 && arg1P_18>0 && arg2P_18>-1 ], cost: 1
     18: __init -> f1_0_main_Load : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 4.
   Accelerating the following rules:
      9: f193_0__init__LE -> f193_0__init__LE : arg1'=-1+arg1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1>1 ], cost: 1

   Accelerated rule 9 with backward acceleration, yielding the new rule 19.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 9.

Accelerating simple loops of location 6.
   Accelerating the following rules:
     16: f388_0_height_NONNULL -> f388_0_height_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ 2+arg1P_17<=arg1 && arg1P_17<=arg2 && 3+arg2P_17<=arg1 && 1+arg2P_17<=arg2 && arg1>2 && arg2>0 && arg1P_17>0 && arg2P_17>-1 ], cost: 1
     17: f388_0_height_NONNULL -> f388_0_height_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ 2+arg1P_18<=arg1 && 3+arg2P_18<=arg1 && arg1>2 && arg2>-1 && arg1P_18>0 && arg2P_18>-1 ], cost: 1

   Failed to prove monotonicity of the guard of rule 16.
   Failed to prove monotonicity of the guard of rule 17.
[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 -> f480_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1>0 && arg1P_1>2 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ -1+arg1P_2<=arg1 && arg1>0 && arg1P_2>1 && 0==arg2 ], cost: 1
      2: f1_0_main_Load -> f481_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && arg1P_3>2 && 1==arg2 ], cost: 1
      3: f1_0_main_Load -> f481_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ -1+arg1P_4<=arg1 && arg1>0 && arg1P_4>1 && 1==arg2 ], cost: 1
      4: f1_0_main_Load -> f482_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ arg2>1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 && arg2P_5>2 ], cost: 1
      5: f1_0_main_Load -> f482_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ arg2>1 && arg1P_6<=arg1 && -1+arg2P_6<=arg1 && arg1>0 && arg1P_6>0 && arg2P_6>1 ], cost: 1
      6: f1_0_main_Load -> f193_0__init__LE : arg1'=10, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1>0 && 0==arg2 ], cost: 1
      7: f1_0_main_Load -> f193_0__init__LE : arg1'=10, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1>0 && 1==arg2 ], cost: 1
      8: f1_0_main_Load -> f193_0__init__LE : arg1'=10+x28_1*x27_1, arg2'=arg2P_9, arg3'=arg3P_9, [ arg2>1 && x28_1>-1 && x27_1>-1 && arg1>0 ], cost: 1
     13: f480_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, [ arg1P_14<=arg1 && 1+arg2P_14<=arg1 && arg1>0 && arg1P_14>0 && arg2P_14>-1 ], cost: 1
     14: f481_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, [ arg1P_15<=arg1 && 1+arg2P_15<=arg1 && arg1>0 && arg1P_15>0 && arg2P_15>-1 ], cost: 1
     15: f482_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, [ arg1P_16<=arg2 && 1+arg2P_16<=arg2 && arg1>0 && arg2>0 && arg1P_16>0 && arg2P_16>-1 ], cost: 1
     10: f193_0__init__LE -> f518_0__init__InvokeMethod : arg1'=arg1P_11, arg2'=-1+arg1, arg3'=arg3P_11, [ arg1P_11>4 && arg1>1 ], cost: 1
     11: f193_0__init__LE -> f518_0__init__InvokeMethod : arg1'=arg1P_12, arg2'=-1+arg1, arg3'=arg3P_12, [ arg1P_12>3 && arg1>1 ], cost: 1
     19: f193_0__init__LE -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ -1+arg1>=1 ], cost: -1+arg1
     12: f518_0__init__InvokeMethod -> f193_0__init__LE : arg1'=arg2, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1>2 && arg2>0 ], cost: 1
     16: f388_0_height_NONNULL -> f388_0_height_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ 2+arg1P_17<=arg1 && arg1P_17<=arg2 && 3+arg2P_17<=arg1 && 1+arg2P_17<=arg2 && arg1>2 && arg2>0 && arg1P_17>0 && arg2P_17>-1 ], cost: 1
     17: f388_0_height_NONNULL -> f388_0_height_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ 2+arg1P_18<=arg1 && 3+arg2P_18<=arg1 && arg1>2 && arg2>-1 && arg1P_18>0 && arg2P_18>-1 ], cost: 1
     18: __init -> f1_0_main_Load : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1>0 && arg1P_1>2 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ -1+arg1P_2<=arg1 && arg1>0 && arg1P_2>1 && 0==arg2 ], cost: 1
      2: f1_0_main_Load -> f481_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && arg1P_3>2 && 1==arg2 ], cost: 1
      3: f1_0_main_Load -> f481_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ -1+arg1P_4<=arg1 && arg1>0 && arg1P_4>1 && 1==arg2 ], cost: 1
      4: f1_0_main_Load -> f482_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ arg2>1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 && arg2P_5>2 ], cost: 1
      5: f1_0_main_Load -> f482_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ arg2>1 && arg1P_6<=arg1 && -1+arg2P_6<=arg1 && arg1>0 && arg1P_6>0 && arg2P_6>1 ], cost: 1
      6: f1_0_main_Load -> f193_0__init__LE : arg1'=10, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1>0 && 0==arg2 ], cost: 1
      7: f1_0_main_Load -> f193_0__init__LE : arg1'=10, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1>0 && 1==arg2 ], cost: 1
      8: f1_0_main_Load -> f193_0__init__LE : arg1'=10+x28_1*x27_1, arg2'=arg2P_9, arg3'=arg3P_9, [ arg2>1 && x28_1>-1 && x27_1>-1 && arg1>0 ], cost: 1
     20: f1_0_main_Load -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1>0 && 0==arg2 ], cost: 10
     21: f1_0_main_Load -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1>0 && 1==arg2 ], cost: 10
     22: f1_0_main_Load -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg2>1 && x28_1>-1 && x27_1>-1 && arg1>0 && 9+x28_1*x27_1>=1 ], cost: 10+x28_1*x27_1
     13: f480_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, [ arg1P_14<=arg1 && 1+arg2P_14<=arg1 && arg1>0 && arg1P_14>0 && arg2P_14>-1 ], cost: 1
     24: f480_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ arg1P_17>0 && arg2P_17>-1 && 2+arg1P_17<=arg1 && 3+arg2P_17<=arg1 && 3<=arg1 ], cost: 2
     27: f480_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ arg1P_18>0 && arg2P_18>-1 && 2+arg1P_18<=arg1 && 3+arg2P_18<=arg1 && 3<=arg1 ], cost: 2
     14: f481_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, [ arg1P_15<=arg1 && 1+arg2P_15<=arg1 && arg1>0 && arg1P_15>0 && arg2P_15>-1 ], cost: 1
     25: f481_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ arg1P_17>0 && arg2P_17>-1 && 2+arg1P_17<=arg1 && 3+arg2P_17<=arg1 && 3<=arg1 ], cost: 2
     28: f481_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ arg1P_18>0 && arg2P_18>-1 && 2+arg1P_18<=arg1 && 3+arg2P_18<=arg1 && 3<=arg1 ], cost: 2
     15: f482_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, [ arg1P_16<=arg2 && 1+arg2P_16<=arg2 && arg1>0 && arg2>0 && arg1P_16>0 && arg2P_16>-1 ], cost: 1
     26: f482_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ arg1>0 && arg1P_17>0 && arg2P_17>-1 && 2+arg1P_17<=arg2 && 3+arg2P_17<=arg2 && 3<=arg2 ], cost: 2
     29: f482_0_main_InvokeMethod -> f388_0_height_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ arg1>0 && arg1P_18>0 && arg2P_18>-1 && 2+arg1P_18<=arg2 && 3+arg2P_18<=arg2 && 3<=arg2 ], cost: 2
     10: f193_0__init__LE -> f518_0__init__InvokeMethod : arg1'=arg1P_11, arg2'=-1+arg1, arg3'=arg3P_11, [ arg1P_11>4 && arg1>1 ], cost: 1
     11: f193_0__init__LE -> f518_0__init__InvokeMethod : arg1'=arg1P_12, arg2'=-1+arg1, arg3'=arg3P_12, [ arg1P_12>3 && arg1>1 ], cost: 1
     12: f518_0__init__InvokeMethod -> f193_0__init__LE : arg1'=arg2, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1>2 && arg2>0 ], cost: 1
     23: f518_0__init__InvokeMethod -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1>2 && -1+arg2>=1 ], cost: arg2
     18: __init -> f1_0_main_Load : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      6: f1_0_main_Load -> f193_0__init__LE : arg1'=10, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1>0 && 0==arg2 ], cost: 1
      7: f1_0_main_Load -> f193_0__init__LE : arg1'=10, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1>0 && 1==arg2 ], cost: 1
      8: f1_0_main_Load -> f193_0__init__LE : arg1'=10+x28_1*x27_1, arg2'=arg2P_9, arg3'=arg3P_9, [ arg2>1 && x28_1>-1 && x27_1>-1 && arg1>0 ], cost: 1
     20: f1_0_main_Load -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1>0 && 0==arg2 ], cost: 10
     21: f1_0_main_Load -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1>0 && 1==arg2 ], cost: 10
     22: f1_0_main_Load -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg2>1 && x28_1>-1 && x27_1>-1 && arg1>0 && 9+x28_1*x27_1>=1 ], cost: 10+x28_1*x27_1
     10: f193_0__init__LE -> f518_0__init__InvokeMethod : arg1'=arg1P_11, arg2'=-1+arg1, arg3'=arg3P_11, [ arg1P_11>4 && arg1>1 ], cost: 1
     11: f193_0__init__LE -> f518_0__init__InvokeMethod : arg1'=arg1P_12, arg2'=-1+arg1, arg3'=arg3P_12, [ arg1P_12>3 && arg1>1 ], cost: 1
     12: f518_0__init__InvokeMethod -> f193_0__init__LE : arg1'=arg2, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1>2 && arg2>0 ], cost: 1
     23: f518_0__init__InvokeMethod -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1>2 && -1+arg2>=1 ], cost: arg2
     18: __init -> f1_0_main_Load : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     36: f193_0__init__LE -> f193_0__init__LE : arg1'=-1+arg1, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1P_11>4 && arg1>1 ], cost: 2
     37: f193_0__init__LE -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_11>4 && -2+arg1>=1 ], cost: arg1
     38: f193_0__init__LE -> f193_0__init__LE : arg1'=-1+arg1, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1P_12>3 && arg1>1 ], cost: 2
     39: f193_0__init__LE -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_12>3 && -2+arg1>=1 ], cost: arg1
     30: __init -> f193_0__init__LE : arg1'=10, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1P_19>0 && 0==arg2P_19 ], cost: 2
     31: __init -> f193_0__init__LE : arg1'=10, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1P_19>0 && 1==arg2P_19 ], cost: 2
     32: __init -> f193_0__init__LE : arg1'=10+x28_1*x27_1, arg2'=arg2P_9, arg3'=arg3P_9, [ arg2P_19>1 && x28_1>-1 && x27_1>-1 && arg1P_19>0 ], cost: 2
     33: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_19>0 && 0==arg2P_19 ], cost: 11
     34: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_19>0 && 1==arg2P_19 ], cost: 11
     35: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg2P_19>1 && x28_1>-1 && x27_1>-1 && arg1P_19>0 && 9+x28_1*x27_1>=1 ], cost: 11+x28_1*x27_1

Applied pruning (of leafs and parallel rules):
   Start location: __init
     36: f193_0__init__LE -> f193_0__init__LE : arg1'=-1+arg1, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1P_11>4 && arg1>1 ], cost: 2
     37: f193_0__init__LE -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_11>4 && -2+arg1>=1 ], cost: arg1
     38: f193_0__init__LE -> f193_0__init__LE : arg1'=-1+arg1, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1P_12>3 && arg1>1 ], cost: 2
     39: f193_0__init__LE -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_12>3 && -2+arg1>=1 ], cost: arg1
     30: __init -> f193_0__init__LE : arg1'=10, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1P_19>0 && 0==arg2P_19 ], cost: 2
     31: __init -> f193_0__init__LE : arg1'=10, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1P_19>0 && 1==arg2P_19 ], cost: 2
     32: __init -> f193_0__init__LE : arg1'=10+x28_1*x27_1, arg2'=arg2P_9, arg3'=arg3P_9, [ arg2P_19>1 && x28_1>-1 && x27_1>-1 && arg1P_19>0 ], cost: 2
     33: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_19>0 && 0==arg2P_19 ], cost: 11
     35: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg2P_19>1 && x28_1>-1 && x27_1>-1 && arg1P_19>0 && 9+x28_1*x27_1>=1 ], cost: 11+x28_1*x27_1

Accelerating simple loops of location 4.
[accelerate] Removed some duplicate simple loops
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     38: f193_0__init__LE -> f193_0__init__LE : arg1'=-1+arg1, arg2'=arg2P_13, arg3'=arg3P_13, [ arg1>1 ], cost: 2
     39: f193_0__init__LE -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ -2+arg1>=1 ], cost: arg1

   Accelerated rule 38 with backward acceleration, yielding the new rule 40.
   Failed to prove monotonicity of the guard of rule 39.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Removing the simple loops: 38.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     39: f193_0__init__LE -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ -2+arg1>=1 ], cost: arg1
     40: f193_0__init__LE -> f193_0__init__LE : arg1'=1, arg2'=arg2P_13, arg3'=arg3P_13, [ -1+arg1>=1 ], cost: -2+2*arg1
     30: __init -> f193_0__init__LE : arg1'=10, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1P_19>0 && 0==arg2P_19 ], cost: 2
     31: __init -> f193_0__init__LE : arg1'=10, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1P_19>0 && 1==arg2P_19 ], cost: 2
     32: __init -> f193_0__init__LE : arg1'=10+x28_1*x27_1, arg2'=arg2P_9, arg3'=arg3P_9, [ arg2P_19>1 && x28_1>-1 && x27_1>-1 && arg1P_19>0 ], cost: 2
     33: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_19>0 && 0==arg2P_19 ], cost: 11
     35: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg2P_19>1 && x28_1>-1 && x27_1>-1 && arg1P_19>0 && 9+x28_1*x27_1>=1 ], cost: 11+x28_1*x27_1

Chained accelerated rules (with incoming rules):
   Start location: __init
     30: __init -> f193_0__init__LE : arg1'=10, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1P_19>0 && 0==arg2P_19 ], cost: 2
     31: __init -> f193_0__init__LE : arg1'=10, arg2'=arg2P_8, arg3'=arg3P_8, [ arg1P_19>0 && 1==arg2P_19 ], cost: 2
     32: __init -> f193_0__init__LE : arg1'=10+x28_1*x27_1, arg2'=arg2P_9, arg3'=arg3P_9, [ arg2P_19>1 && x28_1>-1 && x27_1>-1 && arg1P_19>0 ], cost: 2
     33: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg1P_19>0 && 0==arg2P_19 ], cost: 11
     35: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg2P_19>1 && x28_1>-1 && x27_1>-1 && arg1P_19>0 && 9+x28_1*x27_1>=1 ], cost: 11+x28_1*x27_1
     41: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 12
     42: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 12
     43: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ x28_1>-1 && x27_1>-1 && 8+x28_1*x27_1>=1 ], cost: 12+x28_1*x27_1
     44: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_13, arg3'=arg3P_13, [], cost: 20
     45: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_13, arg3'=arg3P_13, [], cost: 20
     46: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_13, arg3'=arg3P_13, [ x28_1>-1 && x27_1>-1 && 9+x28_1*x27_1>=1 ], cost: 20+2*x28_1*x27_1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     35: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg2P_19>1 && x28_1>-1 && x27_1>-1 && arg1P_19>0 && 9+x28_1*x27_1>=1 ], cost: 11+x28_1*x27_1
     43: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ x28_1>-1 && x27_1>-1 && 8+x28_1*x27_1>=1 ], cost: 12+x28_1*x27_1
     46: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_13, arg3'=arg3P_13, [ x28_1>-1 && x27_1>-1 && 9+x28_1*x27_1>=1 ], cost: 20+2*x28_1*x27_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     35: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ arg2P_19>1 && x28_1>-1 && x27_1>-1 && arg1P_19>0 && 9+x28_1*x27_1>=1 ], cost: 11+x28_1*x27_1
     43: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_10, arg3'=arg3P_10, [ x28_1>-1 && x27_1>-1 && 8+x28_1*x27_1>=1 ], cost: 12+x28_1*x27_1
     46: __init -> f193_0__init__LE : arg1'=1, arg2'=arg2P_13, arg3'=arg3P_13, [ x28_1>-1 && x27_1>-1 && 9+x28_1*x27_1>=1 ], cost: 20+2*x28_1*x27_1

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

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

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