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 metering function meter (where 11*meter==100-arg1), yielding the new rule 4.
   Accelerated rule 2 with metering function meter_1 (where 10*meter_1==-100+arg1) (after adding arg1<=arg2), yielding the new rule 5.
      During metering: Instantiating temporary variables by {meter_1==1}
   Nested simple loops 1 (outer loop) and 5 (inner loop) with metering function 89-arg1+10*meter_1, resulting in the new rules: 6.
   Removing the simple loops: 1.

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
      2: f160_0_main_LE -> f160_0_main_LE : arg1'=-10+arg1, arg2'=-1+arg2, [ arg1>100 && arg2>0 ], cost: 1
      4: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1+11*meter, arg2'=meter+arg2, [ arg1<101 && arg2>0 && 11*meter==100-arg1 && meter>=1 ], cost: meter
      5: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1-10*meter_1, arg2'=-meter_1+arg2, [ arg1>100 && arg2>0 && arg1<=arg2 && 10*meter_1==-100+arg1 && meter_1>=1 ], cost: meter_1
      6: f160_0_main_LE -> f160_0_main_LE : arg1'=979+10*(-89+arg1-10*meter_1)*meter_1-10*arg1+110*meter_1, arg2'=89+(-89+arg1-10*meter_1)*meter_1-arg1+10*meter_1+arg2, [ arg1<101 && arg2>0 && 11+arg1>100 && 11+arg1<=1+arg2 && 10*meter_1==-89+arg1 && meter_1>=1 && 89-arg1+10*meter_1>=1 ], cost: 89-(-89+arg1-10*meter_1)*meter_1-arg1+10*meter_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
      7: f1_0_main_Load -> f160_0_main_LE : arg1'=-10+arg1P_1, arg2'=0, [ arg2>-1 && arg1>0 && arg1P_1>100 ], cost: 2
      8: f1_0_main_Load -> f160_0_main_LE : arg1'=100, arg2'=1+meter, [ arg2>-1 && 100-11*meter>-1 && arg1>0 && 100-11*meter<101 && meter>=1 ], cost: 1+meter
      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
      8: f1_0_main_Load -> f160_0_main_LE : arg1'=100, arg2'=1+meter, [ arg2>-1 && 100-11*meter>-1 && arg1>0 && 100-11*meter<101 && meter>=1 ], cost: 1+meter
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
      9: __init -> f160_0_main_LE : arg1'=100, arg2'=1+meter, [ arg2P_4>-1 && 100-11*meter>-1 && arg1P_4>0 && 100-11*meter<101 && meter>=1 ], cost: 2+meter

### Computing asymptotic complexity ###

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

Computing asymptotic complexity for rule 9
   Simplified the guard:
      9: __init -> f160_0_main_LE : arg1'=100, arg2'=1+meter, [ arg2P_4>-1 && 100-11*meter>-1 && arg1P_4>0 && meter>=1 ], cost: 2+meter
   Could not solve the limit problem.
   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),?)