WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>-1 && arg2P_1>-1 && arg1>0 ], cost: 1
      1: f142_0_main_LE -> f194_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, [ arg2<=arg1 && arg2>0 && arg1>0 && arg2==arg1P_2 && arg1==arg2P_2 ], cost: 1
      2: f142_0_main_LE -> f209_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2>arg1 && arg2>0 && arg1>0 && arg1==arg1P_3 && arg2==arg2P_3 ], cost: 1
      3: f194_0_main_LE -> f142_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, [ 0==arg2 && 0==arg1P_4 && arg1==arg2P_4 ], cost: 1
      4: f194_0_main_LE -> f194_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, [ arg2>0 && arg1==arg1P_5 && -1+arg2==arg2P_5 ], cost: 1
      5: f209_0_main_LE -> f142_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, [ 0==arg2 && arg1==arg1P_6 && 0==arg2P_6 ], cost: 1
      6: f209_0_main_LE -> f209_0_main_LE : arg1'=arg1P_7, arg2'=arg2P_7, [ arg2>0 && arg1==arg1P_7 && -1+arg2==arg2P_7 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>-1 && arg2P_1>-1 && arg1>0 ], cost: 1
      1: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=arg1, [ arg2<=arg1 && arg2>0 ], cost: 1
      2: f142_0_main_LE -> f209_0_main_LE : [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1
      3: f194_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=arg1, [ 0==arg2 ], cost: 1
      4: f194_0_main_LE -> f194_0_main_LE : arg2'=-1+arg2, [ arg2>0 ], cost: 1
      5: f209_0_main_LE -> f142_0_main_LE : arg2'=0, [ 0==arg2 ], cost: 1
      6: f209_0_main_LE -> f209_0_main_LE : arg2'=-1+arg2, [ arg2>0 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 2.
   Accelerating the following rules:
      4: f194_0_main_LE -> f194_0_main_LE : arg2'=-1+arg2, [ arg2>0 ], cost: 1

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

Accelerating simple loops of location 3.
   Accelerating the following rules:
      6: f209_0_main_LE -> f209_0_main_LE : arg2'=-1+arg2, [ arg2>0 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>-1 && arg2P_1>-1 && arg1>0 ], cost: 1
      1: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=arg1, [ arg2<=arg1 && arg2>0 ], cost: 1
      2: f142_0_main_LE -> f209_0_main_LE : [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1
      3: f194_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=arg1, [ 0==arg2 ], cost: 1
      8: f194_0_main_LE -> f194_0_main_LE : arg2'=0, [ arg2>=0 ], cost: arg2
      5: f209_0_main_LE -> f142_0_main_LE : arg2'=0, [ 0==arg2 ], cost: 1
      9: f209_0_main_LE -> f209_0_main_LE : arg2'=0, [ arg2>=0 ], cost: arg2
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>-1 && arg2P_1>-1 && arg1>0 ], cost: 1
      1: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=arg1, [ arg2<=arg1 && arg2>0 ], cost: 1
      2: f142_0_main_LE -> f209_0_main_LE : [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1
     10: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=0, [ arg2<=arg1 && arg2>0 && arg1>=0 ], cost: 1+arg1
     11: f142_0_main_LE -> f209_0_main_LE : arg2'=0, [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1+arg2
      3: f194_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=arg1, [ 0==arg2 ], cost: 1
      5: f209_0_main_LE -> f142_0_main_LE : arg2'=0, [ 0==arg2 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
      1: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=arg1, [ arg2<=arg1 && arg2>0 ], cost: 1
      2: f142_0_main_LE -> f209_0_main_LE : [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1
     10: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=0, [ arg2<=arg1 && arg2>0 && arg1>=0 ], cost: 1+arg1
     11: f142_0_main_LE -> f209_0_main_LE : arg2'=0, [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1+arg2
      3: f194_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=arg1, [ 0==arg2 ], cost: 1
      5: f209_0_main_LE -> f142_0_main_LE : arg2'=0, [ 0==arg2 ], cost: 1
     12: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_8>-1 && arg2P_1>-1 && arg1P_8>0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     13: f142_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=arg2, [ arg2<=arg1 && arg2>0 && arg1>=0 ], cost: 2+arg1
     14: f142_0_main_LE -> f142_0_main_LE : arg2'=0, [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 2+arg2
     12: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_8>-1 && arg2P_1>-1 && arg1P_8>0 ], cost: 2

Accelerating simple loops of location 1.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     13: f142_0_main_LE -> f142_0_main_LE : arg1'=0, [ arg2<=arg1 && arg2>0 && arg1>=0 ], cost: 2+arg1
     14: f142_0_main_LE -> f142_0_main_LE : arg2'=0, [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 2+arg2

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     13: f142_0_main_LE -> f142_0_main_LE : arg1'=0, [ arg2<=arg1 && arg2>0 && arg1>=0 ], cost: 2+arg1
     14: f142_0_main_LE -> f142_0_main_LE : arg2'=0, [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 2+arg2
     12: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_8>-1 && arg2P_1>-1 && arg1P_8>0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     12: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_8>-1 && arg2P_1>-1 && arg1P_8>0 ], cost: 2
     15: __init -> f142_0_main_LE : arg1'=0, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_1<=arg1P_1 && arg2P_1>0 ], cost: 4+arg1P_1
     16: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=0, [ arg2P_1>arg1P_1 && arg2P_1>0 && arg1P_1>0 ], cost: 4+arg2P_1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     15: __init -> f142_0_main_LE : arg1'=0, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_1<=arg1P_1 && arg2P_1>0 ], cost: 4+arg1P_1
     16: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=0, [ arg2P_1>arg1P_1 && arg2P_1>0 && arg1P_1>0 ], cost: 4+arg2P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     15: __init -> f142_0_main_LE : arg1'=0, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_1<=arg1P_1 && arg2P_1>0 ], cost: 4+arg1P_1
     16: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=0, [ arg2P_1>arg1P_1 && arg2P_1>0 && arg1P_1>0 ], cost: 4+arg2P_1

Computing asymptotic complexity for rule 15
   Simplified the guard:
     15: __init -> f142_0_main_LE : arg1'=0, arg2'=arg2P_1, [ arg2P_1<=arg1P_1 && arg2P_1>0 ], cost: 4+arg1P_1
   Resulting cost 0 has complexity: Unknown

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