WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 && -1+arg2==arg2P_1 && arg2==arg3P_1 && arg2==arg4P_1 ], cost: 1
      1: f162_0_mk_LE -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>0 && -1+arg2==arg2P_2 && arg2==arg3P_2 && arg4==arg4P_2 ], cost: 1
      2: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && -1+arg4==arg2P_3 && arg4==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f276_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4<=arg1 && arg3>0 && arg1>0 && arg1P_4>0 && -1+arg2==arg2P_4 && arg2==arg3P_4 && arg4==arg4P_4 ], cost: 1
      4: f276_0_mk_LE -> f401_0_mk_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg4>-1 && arg1>0 && -1+arg4==arg1P_5 && arg4==arg2P_5 ], cost: 1
      5: f401_0_mk_LE -> f576_0_test_LT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 && 2==arg1P_6 ], cost: 1
      6: f401_0_mk_LE -> f401_0_mk_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2>0 && -1+arg1==arg1P_7 && arg1==arg2P_7 ], cost: 1
      7: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1>-1 && arg1P_8>-1 && arg1<3 ], cost: 1
      8: f576_0_test_LT -> f576_0_test_LT : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>-1 && arg1<3 && -1+arg1==arg1P_9 ], cost: 1
      9: f470_0_length_NONNULL -> f470_0_length_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=arg2, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f162_0_mk_LE -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-1+arg2, arg3'=arg2, [ arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_3, arg2'=-1+arg4, arg3'=arg4, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
      3: f276_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=-1+arg2, arg3'=arg2, [ arg1P_4<=arg1 && arg3>0 && arg1>0 && arg1P_4>0 ], cost: 1
      4: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg4, arg2'=arg4, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg4>-1 && arg1>0 ], cost: 1
      5: f401_0_mk_LE -> f576_0_test_LT : arg1'=2, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 ], cost: 1
      6: f401_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2>0 ], cost: 1
      7: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1>-1 && arg1P_8>-1 && arg1<3 ], cost: 1
      8: f576_0_test_LT -> f576_0_test_LT : arg1'=-1+arg1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>-1 && arg1<3 ], cost: 1
      9: f470_0_length_NONNULL -> f470_0_length_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f162_0_mk_LE -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-1+arg2, arg3'=arg2, [ arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>0 ], cost: 1

[test] deduced pseudo-invariant arg2-arg3<=0, also trying -arg2+arg3<=-1
   Accelerated rule 1 with backward acceleration, yielding the new rule 11.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerating simple loops of location 2.
   Accelerating the following rules:
      3: f276_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=-1+arg2, arg3'=arg2, [ arg1P_4<=arg1 && arg3>0 && arg1>0 && arg1P_4>0 ], cost: 1

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

Accelerating simple loops of location 3.
   Accelerating the following rules:
      6: f401_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2>0 ], cost: 1

[test] deduced pseudo-invariant 1-arg2+arg1<=0, also trying -1+arg2-arg1<=-1
   Accelerated rule 6 with backward acceleration, yielding the new rule 12.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerating simple loops of location 4.
   Accelerating the following rules:
      8: f576_0_test_LT -> f576_0_test_LT : arg1'=-1+arg1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>-1 && arg1<3 ], cost: 1

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

Accelerating simple loops of location 5.
   Accelerating the following rules:
      9: f470_0_length_NONNULL -> f470_0_length_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1

   Failed to prove monotonicity of the guard of rule 9.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=arg2, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f162_0_mk_LE -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-1+arg2, arg3'=arg2, [ arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_3, arg2'=-1+arg4, arg3'=arg4, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
     11: f162_0_mk_LE -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-1, arg3'=0, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2-arg3<=0 && 1+arg2>=1 ], cost: 1+arg2
      3: f276_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=-1+arg2, arg3'=arg2, [ arg1P_4<=arg1 && arg3>0 && arg1>0 && arg1P_4>0 ], cost: 1
      4: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg4, arg2'=arg4, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg4>-1 && arg1>0 ], cost: 1
      5: f401_0_mk_LE -> f576_0_test_LT : arg1'=2, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 ], cost: 1
      6: f401_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2>0 ], cost: 1
     12: f401_0_mk_LE -> f401_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ 1-arg2+arg1<=0 && 1+arg1>=1 ], cost: 1+arg1
      7: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1>-1 && arg1P_8>-1 && arg1<3 ], cost: 1
     13: f576_0_test_LT -> f576_0_test_LT : arg1'=-1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1<3 && 1+arg1>=1 ], cost: 1+arg1
      9: f470_0_length_NONNULL -> f470_0_length_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=arg2, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
     14: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-2+arg2, arg3'=-1+arg2, arg4'=arg2, [ arg1>0 && arg2>0 && arg1P_2>0 && arg1P_2<=arg1 ], cost: 2
     15: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-1, arg3'=0, arg4'=arg2, [ arg1>0 && arg1P_2>0 && arg2>=1 && arg1P_2<=arg1 ], cost: 1+arg2
      2: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_3, arg2'=-1+arg4, arg3'=arg4, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
     16: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=-2+arg4, arg3'=-1+arg4, [ arg3<1 && arg1>0 && arg4>0 && arg1P_4>0 && arg1P_4<=arg1 ], cost: 2
      4: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-1+arg4, arg2'=arg4, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3<1 && arg4>-1 && arg1>0 ], cost: 1
     17: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-2+arg4, arg2'=-1+arg4, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3<1 && arg1>0 && arg4>0 ], cost: 2
     18: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3<1 && arg1>0 && arg4>=1 ], cost: 1+arg4
      5: f401_0_mk_LE -> f576_0_test_LT : arg1'=2, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 ], cost: 1
     19: f401_0_mk_LE -> f576_0_test_LT : arg1'=-1, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2<1 ], cost: 4
      7: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1>-1 && arg1P_8>-1 && arg1<3 ], cost: 1
     20: f576_0_test_LT -> f470_0_length_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>-1 && arg1<3 && arg1P_10>-1 ], cost: 2
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=arg2, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
     14: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-2+arg2, arg3'=-1+arg2, arg4'=arg2, [ arg1>0 && arg2>0 && arg1P_2>0 && arg1P_2<=arg1 ], cost: 2
     15: f1_0_main_ConstantStackPush -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-1, arg3'=0, arg4'=arg2, [ arg1>0 && arg1P_2>0 && arg2>=1 && arg1P_2<=arg1 ], cost: 1+arg2
      2: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_3, arg2'=-1+arg4, arg3'=arg4, [ arg3<1 && arg4>-1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
     16: f162_0_mk_LE -> f276_0_mk_LE : arg1'=arg1P_4, arg2'=-2+arg4, arg3'=-1+arg4, [ arg3<1 && arg1>0 && arg4>0 && arg1P_4>0 && arg1P_4<=arg1 ], cost: 2
     18: f276_0_mk_LE -> f401_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3<1 && arg1>0 && arg4>=1 ], cost: 1+arg4
     10: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     24: f162_0_mk_LE -> f401_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3<1 && arg1>0 && arg4>0 && arg1P_4>0 && arg1P_4<=arg1 && -1+arg4<1 ], cost: 3+arg4
     21: __init -> f162_0_mk_LE : arg1'=arg1P_1, arg2'=-1+arg2P_11, arg3'=arg2P_11, arg4'=arg2P_11, [ arg1P_1<=arg1P_11 && arg2P_11>-1 && arg1P_11>0 && arg1P_1>0 ], cost: 2
     22: __init -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-2+arg2P_11, arg3'=-1+arg2P_11, arg4'=arg2P_11, [ arg1P_11>0 && arg2P_11>0 && arg1P_2>0 && arg1P_2<=arg1P_11 ], cost: 3
     23: __init -> f162_0_mk_LE : arg1'=arg1P_2, arg2'=-1, arg3'=0, arg4'=arg2P_11, [ arg1P_11>0 && arg1P_2>0 && arg2P_11>=1 && arg1P_2<=arg1P_11 ], cost: 2+arg2P_11

Eliminated locations (on tree-shaped paths):
   Start location: __init
     25: __init -> f401_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_11>0 && arg2P_11>0 && arg1P_2>0 && arg1P_2<=arg1P_11 && -1+arg2P_11<1 && arg1P_4>0 && arg1P_4<=arg1P_2 ], cost: 6+arg2P_11
     26: __init -> f401_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_11>0 && arg1P_2>0 && arg2P_11>=1 && arg1P_2<=arg1P_11 && arg1P_4>0 && arg1P_4<=arg1P_2 && -1+arg2P_11<1 ], cost: 5+2*arg2P_11

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     25: __init -> f401_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_11>0 && arg2P_11>0 && arg1P_2>0 && arg1P_2<=arg1P_11 && -1+arg2P_11<1 && arg1P_4>0 && arg1P_4<=arg1P_2 ], cost: 6+arg2P_11
     26: __init -> f401_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_11>0 && arg1P_2>0 && arg2P_11>=1 && arg1P_2<=arg1P_11 && arg1P_4>0 && arg1P_4<=arg1P_2 && -1+arg2P_11<1 ], cost: 5+2*arg2P_11

Computing asymptotic complexity for rule 25
   Simplified the guard:
     25: __init -> f401_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_11>0 && arg1P_2<=arg1P_11 && -1+arg2P_11<1 && arg1P_4>0 && arg1P_4<=arg1P_2 ], cost: 6+arg2P_11
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 26
   Simplified the guard:
     26: __init -> f401_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_11>=1 && arg1P_2<=arg1P_11 && arg1P_4>0 && arg1P_4<=arg1P_2 && -1+arg2P_11<1 ], cost: 5+2*arg2P_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),?)