WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f139_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, [ 0==arg1P_1 ], cost: 1
      1: f139_0_main_GE -> f169_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1<10 && arg1==arg1P_2 && 3==arg2P_2 ], cost: 1
      2: f169_0_main_GE -> f139_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2>11 && 1+arg1==arg1P_3 ], cost: 1
      3: f169_0_main_GE -> f169_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2<12 && arg1==arg1P_4 && 1+arg2==arg2P_4 ], cost: 1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, arg2'=arg2P_5, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, arg2'=arg2P_5, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f139_0_main_GE : arg1'=0, arg2'=arg2P_1, [], cost: 1
      1: f139_0_main_GE -> f169_0_main_GE : arg2'=3, [ arg1<10 ], cost: 1
      2: f169_0_main_GE -> f139_0_main_GE : arg1'=1+arg1, arg2'=arg2P_3, [ arg2>11 ], cost: 1
      3: f169_0_main_GE -> f169_0_main_GE : arg2'=1+arg2, [ arg2<12 ], cost: 1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, arg2'=arg2P_5, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 2.
   Accelerating the following rules:
      3: f169_0_main_GE -> f169_0_main_GE : arg2'=1+arg2, [ arg2<12 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f139_0_main_GE : arg1'=0, arg2'=arg2P_1, [], cost: 1
      1: f139_0_main_GE -> f169_0_main_GE : arg2'=3, [ arg1<10 ], cost: 1
      2: f169_0_main_GE -> f139_0_main_GE : arg1'=1+arg1, arg2'=arg2P_3, [ arg2>11 ], cost: 1
      5: f169_0_main_GE -> f169_0_main_GE : arg2'=12, [ 12-arg2>=0 ], cost: 12-arg2
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, arg2'=arg2P_5, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f139_0_main_GE : arg1'=0, arg2'=arg2P_1, [], cost: 1
      1: f139_0_main_GE -> f169_0_main_GE : arg2'=3, [ arg1<10 ], cost: 1
      6: f139_0_main_GE -> f169_0_main_GE : arg2'=12, [ arg1<10 ], cost: 10
      2: f169_0_main_GE -> f139_0_main_GE : arg1'=1+arg1, arg2'=arg2P_3, [ arg2>11 ], cost: 1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, arg2'=arg2P_5, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
      1: f139_0_main_GE -> f169_0_main_GE : arg2'=3, [ arg1<10 ], cost: 1
      6: f139_0_main_GE -> f169_0_main_GE : arg2'=12, [ arg1<10 ], cost: 10
      2: f169_0_main_GE -> f139_0_main_GE : arg1'=1+arg1, arg2'=arg2P_3, [ arg2>11 ], cost: 1
      7: __init -> f139_0_main_GE : arg1'=0, arg2'=arg2P_1, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
      8: f139_0_main_GE -> f139_0_main_GE : arg1'=1+arg1, arg2'=arg2P_3, [ arg1<10 ], cost: 11
      7: __init -> f139_0_main_GE : arg1'=0, arg2'=arg2P_1, [], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
      8: f139_0_main_GE -> f139_0_main_GE : arg1'=1+arg1, arg2'=arg2P_3, [ arg1<10 ], cost: 11

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      9: f139_0_main_GE -> f139_0_main_GE : arg1'=10, arg2'=arg2P_3, [ 10-arg1>=1 ], cost: 110-11*arg1
      7: __init -> f139_0_main_GE : arg1'=0, arg2'=arg2P_1, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
      7: __init -> f139_0_main_GE : arg1'=0, arg2'=arg2P_1, [], cost: 2
     10: __init -> f139_0_main_GE : arg1'=10, arg2'=arg2P_3, [], cost: 112

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     <empty>

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     <empty>

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),?)