WORST_CASE(Omega(1),?)

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

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

   Accelerated rule 1 with non-termination, yielding the new rule 6.
   Accelerated rule 2 with backward acceleration, yielding the new rule 7.
   Failed to prove monotonicity of the guard of rule 3.
   Failed to prove monotonicity of the guard of rule 4.
[accelerate] Nesting with 3 inner and 3 outer candidates
   Removing the simple loops: 1 2.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f251_0_loop_GT : arg1'=arg2, arg2'=20, [ arg1>0 && arg2>-1 ], cost: 1
      3: f251_0_loop_GT -> f251_0_loop_GT : arg1'=0, arg2'=-1+arg1, [ arg1>0 && arg1==arg2 ], cost: 1
      4: f251_0_loop_GT -> f251_0_loop_GT : arg1'=1, [ arg2>0 && 0==arg1 ], cost: 1
      6: f251_0_loop_GT -> [3] : [ 0==arg1 && 0==arg2 ], cost: NONTERM
      7: f251_0_loop_GT -> f251_0_loop_GT : arg1'=arg2, [ arg2>0 && arg1>0 && arg2-arg1>=0 ], cost: arg2-arg1
      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 -> f251_0_loop_GT : arg1'=arg2, arg2'=20, [ arg1>0 && arg2>-1 ], cost: 1
      8: f1_0_main_Load -> f251_0_loop_GT : arg1'=0, arg2'=-1+arg2, [ arg1>0 && arg2==20 ], cost: 2
      9: f1_0_main_Load -> f251_0_loop_GT : arg1'=1, arg2'=20, [ arg1>0 && 0==arg2 ], cost: 2
     10: f1_0_main_Load -> f251_0_loop_GT : arg1'=20, arg2'=20, [ arg1>0 && arg2>0 && 20-arg2>=0 ], cost: 21-arg2
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     10: f1_0_main_Load -> f251_0_loop_GT : arg1'=20, arg2'=20, [ arg1>0 && arg2>0 && 20-arg2>=0 ], cost: 21-arg2
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
     11: __init -> f251_0_loop_GT : arg1'=20, arg2'=20, [ arg1P_6>0 && arg2P_6>0 && 20-arg2P_6>=0 ], cost: 22-arg2P_6

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     11: __init -> f251_0_loop_GT : arg1'=20, arg2'=20, [ arg1P_6>0 && arg2P_6>0 && 20-arg2P_6>=0 ], cost: 22-arg2P_6

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