WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg2>-1 && arg1P_1>-1 && arg1>0 && 1==arg2P_1 ], cost: 1
      1: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1<101 && arg2>0 && 11+arg1==arg1P_2 && 1+arg2==arg2P_2 ], cost: 1
      2: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1>100 && arg2>0 && -10+arg1==arg1P_3 && -1+arg2==arg2P_3 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

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

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P_1, arg2'=1, [ arg2>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, [ arg1<101 && arg2>0 ], cost: 1
      2: f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, [ arg1>100 && arg2>0 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f160_0_main_LE -> f160_0_main_LE : arg1'=11+arg1, arg2'=1+arg2, [ arg1<101 && arg2>0 ], cost: 1
      2: f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, [ arg1>100 && arg2>0 ], cost: 1

   Accelerated rule 1 with backward acceleration, yielding the new rule 4.
   Accelerated rule 2 with backward acceleration, yielding the new rule 5.
[accelerate] Nesting with 2 inner and 2 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 -> f160_0_main_LE : arg1'=arg1P_1, arg2'=1, [ arg2>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
      4: f160_0_main_LE -> f160_0_main_LE : arg1'=11*k+arg1, arg2'=arg2+k, [ arg2>0 && k>=0 && -11+11*k+arg1<101 ], cost: k
      5: f160_0_main_LE -> f160_0_main_LE : arg1'=-10*k_1+arg1, arg2'=arg2-k_1, [ k_1>=0 && 10-10*k_1+arg1>100 && 1+arg2-k_1>0 ], cost: k_1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P_1, arg2'=1, [ arg2>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
      6: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P_1+11*k, arg2'=1+k, [ arg2>-1 && arg1P_1>-1 && arg1>0 && k>=0 && -11+arg1P_1+11*k<101 ], cost: 1+k
      7: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P_1-10*k_1, arg2'=1-k_1, [ arg2>-1 && arg1P_1>-1 && arg1>0 && k_1>=0 && 10+arg1P_1-10*k_1>100 && 2-k_1>0 ], cost: 1+k_1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      6: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P_1+11*k, arg2'=1+k, [ arg2>-1 && arg1P_1>-1 && arg1>0 && k>=0 && -11+arg1P_1+11*k<101 ], cost: 1+k
      7: f1_0_main_Load -> f160_0_main_LE : arg1'=arg1P_1-10*k_1, arg2'=1-k_1, [ arg2>-1 && arg1P_1>-1 && arg1>0 && k_1>=0 && 10+arg1P_1-10*k_1>100 && 2-k_1>0 ], cost: 1+k_1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
      8: __init -> f160_0_main_LE : arg1'=arg1P_1+11*k, arg2'=1+k, [ arg2P_4>-1 && arg1P_1>-1 && arg1P_4>0 && k>=0 && -11+arg1P_1+11*k<101 ], cost: 2+k
      9: __init -> f160_0_main_LE : arg1'=arg1P_1-10*k_1, arg2'=1-k_1, [ arg2P_4>-1 && arg1P_1>-1 && arg1P_4>0 && k_1>=0 && 10+arg1P_1-10*k_1>100 && 2-k_1>0 ], cost: 2+k_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
      8: __init -> f160_0_main_LE : arg1'=arg1P_1+11*k, arg2'=1+k, [ arg2P_4>-1 && arg1P_1>-1 && arg1P_4>0 && k>=0 && -11+arg1P_1+11*k<101 ], cost: 2+k
      9: __init -> f160_0_main_LE : arg1'=arg1P_1-10*k_1, arg2'=1-k_1, [ arg2P_4>-1 && arg1P_1>-1 && arg1P_4>0 && k_1>=0 && 10+arg1P_1-10*k_1>100 && 2-k_1>0 ], cost: 2+k_1

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

Computing asymptotic complexity for rule 9
   Simplified the guard:
      9: __init -> f160_0_main_LE : arg1'=arg1P_1-10*k_1, arg2'=1-k_1, [ arg2P_4>-1 && arg1P_4>0 && k_1>=0 && 10+arg1P_1-10*k_1>100 && 2-k_1>0 ], cost: 2+k_1
   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),?)