WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f66_0_nest_NE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>0 && arg1>0 ], cost: 1
      1: f66_0_nest_NE -> f66_0_nest_NE : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1>0 && -1+arg1<arg1 && -1+arg1==arg1P_2 ], cost: 1
      2: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, [ 1==arg1 && 1==arg1P_3 ], cost: 1
      4: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1>0 && -1+arg1<arg1 && arg1==arg1P_5 ], cost: 1
      3: f115_0_nest_InvokeMethod -> f66_0_nest_NE : arg1'=arg1P_4, arg2'=arg2P_4, [ arg1>0 && 0==arg1P_4 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_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, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f66_0_nest_NE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>0 && arg1>0 ], cost: 1
      1: f66_0_nest_NE -> f66_0_nest_NE : arg1'=-1+arg1, arg2'=arg2P_2, [ arg1>0 ], cost: 1
      2: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=1, arg2'=arg2P_3, [ 1==arg1 ], cost: 1
      4: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg2'=arg2P_5, [ arg1>0 ], cost: 1
      3: f115_0_nest_InvokeMethod -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [ arg1>0 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f66_0_nest_NE -> f66_0_nest_NE : arg1'=-1+arg1, arg2'=arg2P_2, [ arg1>0 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f66_0_nest_NE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>0 && arg1>0 ], cost: 1
      2: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=1, arg2'=arg2P_3, [ 1==arg1 ], cost: 1
      4: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg2'=arg2P_5, [ arg1>0 ], cost: 1
      6: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_2, [ arg1>=1 ], cost: arg1
      3: f115_0_nest_InvokeMethod -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [ arg1>0 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f66_0_nest_NE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>0 && arg1>0 ], cost: 1
      7: f1_0_main_Load -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_2, [ arg2>0 && arg1>0 && arg1P_1>=1 ], cost: 1+arg1P_1
      2: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=1, arg2'=arg2P_3, [ 1==arg1 ], cost: 1
      4: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg2'=arg2P_5, [ arg1>0 ], cost: 1
      3: f115_0_nest_InvokeMethod -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [ arg1>0 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     10: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [ 1==arg1 ], cost: 2
     11: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [ arg1>0 ], cost: 2
      8: __init -> f66_0_nest_NE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_6>0 && arg1P_6>0 ], cost: 2
      9: __init -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_2, [ arg2P_6>0 && arg1P_6>0 && arg1P_1>=1 ], cost: 2+arg1P_1

Accelerating simple loops of location 1.
   Accelerating the following rules:
     10: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [ 1==arg1 ], cost: 2
     11: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [ arg1>0 ], cost: 2

   Failed to prove monotonicity of the guard of rule 10.
   Failed to prove monotonicity of the guard of rule 11.
[accelerate] Nesting with 2 inner and 2 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     10: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [ 1==arg1 ], cost: 2
     11: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [ arg1>0 ], cost: 2
      8: __init -> f66_0_nest_NE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_6>0 && arg1P_6>0 ], cost: 2
      9: __init -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_2, [ arg2P_6>0 && arg1P_6>0 && arg1P_1>=1 ], cost: 2+arg1P_1

Chained accelerated rules (with incoming rules):
   Start location: __init
      8: __init -> f66_0_nest_NE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_6>0 && arg1P_6>0 ], cost: 2
      9: __init -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_2, [ arg2P_6>0 && arg1P_6>0 && arg1P_1>=1 ], cost: 2+arg1P_1
     12: __init -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [], cost: 4
     13: __init -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_4, [], cost: 4

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      9: __init -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_2, [ arg2P_6>0 && arg1P_6>0 && arg1P_1>=1 ], cost: 2+arg1P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
      9: __init -> f66_0_nest_NE : arg1'=0, arg2'=arg2P_2, [ arg2P_6>0 && arg1P_6>0 && arg1P_1>=1 ], cost: 2+arg1P_1

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