WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=arg1P_1, [ 10==arg1P_1 ], cost: 1
      1: f149_0_doSum_LT -> f163_0_factorial_GT : arg1'=arg1P_2, [ arg1>-1 && arg1==arg1P_2 ], cost: 1
      2: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=arg1P_3, [ arg1>-1 && -1+arg1==arg1P_3 ], cost: 1
      3: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=arg1P_4, [ arg1>0 && -1+arg1<arg1 && -1+arg1==arg1P_4 ], cost: 1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_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, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=10, [], cost: 1
      1: f149_0_doSum_LT -> f163_0_factorial_GT : [ arg1>-1 ], cost: 1
      2: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1+arg1, [ arg1>-1 ], cost: 1
      3: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=-1+arg1, [ arg1>0 ], cost: 1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      2: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1+arg1, [ arg1>-1 ], cost: 1

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

Accelerating simple loops of location 2.
   Accelerating the following rules:
      3: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=-1+arg1, [ arg1>0 ], cost: 1

   Accelerated rule 3 with backward acceleration, yielding the new rule 6.
[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 -> f149_0_doSum_LT : arg1'=10, [], cost: 1
      1: f149_0_doSum_LT -> f163_0_factorial_GT : [ arg1>-1 ], cost: 1
      5: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1, [ 1+arg1>=0 ], cost: 1+arg1
      6: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=0, [ arg1>=0 ], cost: arg1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=10, [], cost: 1
      7: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=-1, [], cost: 12
      1: f149_0_doSum_LT -> f163_0_factorial_GT : [ arg1>-1 ], cost: 1
      8: f149_0_doSum_LT -> f163_0_factorial_GT : arg1'=0, [ arg1>-1 ], cost: 1+arg1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=10, [], cost: 1
      7: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=-1, [], cost: 12
      8: f149_0_doSum_LT -> f163_0_factorial_GT : arg1'=0, [ arg1>-1 ], cost: 1+arg1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
      8: f149_0_doSum_LT -> f163_0_factorial_GT : arg1'=0, [ arg1>-1 ], cost: 1+arg1
      9: __init -> f149_0_doSum_LT : arg1'=10, [], cost: 2
     10: __init -> f149_0_doSum_LT : arg1'=-1, [], cost: 13

Eliminated locations (on tree-shaped paths):
   Start location: __init
     11: __init -> f163_0_factorial_GT : arg1'=0, [], cost: 13

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     11: __init -> f163_0_factorial_GT : arg1'=0, [], cost: 13

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