WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
      2: f2 -> f3 : arg1'=arg1P_3, [ arg1<=2147483647 && arg1==arg1P_3 ], cost: 1
      4: f2 -> f5 : arg1'=arg1P_5, [ arg1>2147483647 && arg1==arg1P_5 ], cost: 1
      1: f3 -> f4 : arg1'=arg1P_2, [ arg1P_2==1+arg1 ], cost: 1
      3: f4 -> f2 : arg1'=arg1P_4, [ arg1==arg1P_4 ], cost: 1
      5: __init -> f1 : arg1'=arg1P_6, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      5: __init -> f1 : arg1'=arg1P_6, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
      2: f2 -> f3 : arg1'=arg1P_3, [ arg1<=2147483647 && arg1==arg1P_3 ], cost: 1
      1: f3 -> f4 : arg1'=arg1P_2, [ arg1P_2==1+arg1 ], cost: 1
      3: f4 -> f2 : arg1'=arg1P_4, [ arg1==arg1P_4 ], cost: 1
      5: __init -> f1 : arg1'=arg1P_6, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
      2: f2 -> f3 : [ arg1<=2147483647 ], cost: 1
      1: f3 -> f4 : arg1'=1+arg1, [], cost: 1
      3: f4 -> f2 : [], cost: 1
      5: __init -> f1 : arg1'=arg1P_6, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
      8: f2 -> f2 : arg1'=1+arg1, [ arg1<=2147483647 ], cost: 3
      6: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
      8: f2 -> f2 : arg1'=1+arg1, [ arg1<=2147483647 ], cost: 3

   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: f2 -> f2 : arg1'=2147483648, [ 2147483648-arg1>=0 ], cost: 6442450944-3*arg1
      6: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
      6: __init -> f2 : arg1'=arg1P_1, [], cost: 2
     10: __init -> f2 : arg1'=2147483648, [ 2147483648-arg1P_1>=0 ], cost: 6442450946-3*arg1P_1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     10: __init -> f2 : arg1'=2147483648, [ 2147483648-arg1P_1>=0 ], cost: 6442450946-3*arg1P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     10: __init -> f2 : arg1'=2147483648, [ 2147483648-arg1P_1>=0 ], cost: 6442450946-3*arg1P_1

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