WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: l4
      0: l0 -> l1 : i!14^0'=i!14^post_1, i!22^0'=i!22^post_1, result!12^0'=result!12^post_1, temp0!15^0'=temp0!15^post_1, [ i!14^1_1==0 && 0<=i!14^1_1 && i!14^1_1<=0 && 0<=i!14^1_1 && i!14^1_1<=0 && 1+i!14^1_1<=10 && i!14^2_1==1+i!14^1_1 && 1<=i!14^2_1 && i!14^2_1<=1 && 1<=i!14^2_1 && i!14^2_1<=1 && 1+i!14^2_1<=10 && i!14^post_1==1+i!14^2_1 && 2<=i!14^post_1 && i!14^post_1<=2 && i!22^0==i!22^post_1 && result!12^0==result!12^post_1 && temp0!15^0==temp0!15^post_1 ], cost: 1
      1: l1 -> l2 : i!14^0'=i!14^post_2, i!22^0'=i!22^post_2, result!12^0'=result!12^post_2, temp0!15^0'=temp0!15^post_2, [ 10<=i!14^0 && result!12^post_2==temp0!15^0 && i!14^0==i!14^post_2 && i!22^0==i!22^post_2 && temp0!15^0==temp0!15^post_2 ], cost: 1
      2: l1 -> l3 : i!14^0'=i!14^post_3, i!22^0'=i!22^post_3, result!12^0'=result!12^post_3, temp0!15^0'=temp0!15^post_3, [ 1+i!14^0<=10 && i!14^post_3==1+i!14^0 && i!14^post_3<=1+i!22^0 && 1+i!22^0<=i!14^post_3 && 1+i!22^0<=10 && i!22^0==i!22^post_3 && result!12^0==result!12^post_3 && temp0!15^0==temp0!15^post_3 ], cost: 1
      3: l3 -> l1 : i!14^0'=i!14^post_4, i!22^0'=i!22^post_4, result!12^0'=result!12^post_4, temp0!15^0'=temp0!15^post_4, [ i!14^0==i!14^post_4 && i!22^0==i!22^post_4 && result!12^0==result!12^post_4 && temp0!15^0==temp0!15^post_4 ], cost: 1
      4: l4 -> l0 : i!14^0'=i!14^post_5, i!22^0'=i!22^post_5, result!12^0'=result!12^post_5, temp0!15^0'=temp0!15^post_5, [ i!14^0==i!14^post_5 && i!22^0==i!22^post_5 && result!12^0==result!12^post_5 && temp0!15^0==temp0!15^post_5 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      4: l4 -> l0 : i!14^0'=i!14^post_5, i!22^0'=i!22^post_5, result!12^0'=result!12^post_5, temp0!15^0'=temp0!15^post_5, [ i!14^0==i!14^post_5 && i!22^0==i!22^post_5 && result!12^0==result!12^post_5 && temp0!15^0==temp0!15^post_5 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l4
      0: l0 -> l1 : i!14^0'=i!14^post_1, i!22^0'=i!22^post_1, result!12^0'=result!12^post_1, temp0!15^0'=temp0!15^post_1, [ i!14^1_1==0 && 0<=i!14^1_1 && i!14^1_1<=0 && 0<=i!14^1_1 && i!14^1_1<=0 && 1+i!14^1_1<=10 && i!14^2_1==1+i!14^1_1 && 1<=i!14^2_1 && i!14^2_1<=1 && 1<=i!14^2_1 && i!14^2_1<=1 && 1+i!14^2_1<=10 && i!14^post_1==1+i!14^2_1 && 2<=i!14^post_1 && i!14^post_1<=2 && i!22^0==i!22^post_1 && result!12^0==result!12^post_1 && temp0!15^0==temp0!15^post_1 ], cost: 1
      2: l1 -> l3 : i!14^0'=i!14^post_3, i!22^0'=i!22^post_3, result!12^0'=result!12^post_3, temp0!15^0'=temp0!15^post_3, [ 1+i!14^0<=10 && i!14^post_3==1+i!14^0 && i!14^post_3<=1+i!22^0 && 1+i!22^0<=i!14^post_3 && 1+i!22^0<=10 && i!22^0==i!22^post_3 && result!12^0==result!12^post_3 && temp0!15^0==temp0!15^post_3 ], cost: 1
      3: l3 -> l1 : i!14^0'=i!14^post_4, i!22^0'=i!22^post_4, result!12^0'=result!12^post_4, temp0!15^0'=temp0!15^post_4, [ i!14^0==i!14^post_4 && i!22^0==i!22^post_4 && result!12^0==result!12^post_4 && temp0!15^0==temp0!15^post_4 ], cost: 1
      4: l4 -> l0 : i!14^0'=i!14^post_5, i!22^0'=i!22^post_5, result!12^0'=result!12^post_5, temp0!15^0'=temp0!15^post_5, [ i!14^0==i!14^post_5 && i!22^0==i!22^post_5 && result!12^0==result!12^post_5 && temp0!15^0==temp0!15^post_5 ], cost: 1

Simplified all rules, resulting in:
   Start location: l4
      0: l0 -> l1 : i!14^0'=2, [], cost: 1
      2: l1 -> l3 : i!14^0'=1+i!14^0, [ 1+i!14^0<=10 && -i!22^0+i!14^0==0 ], cost: 1
      3: l3 -> l1 : [], cost: 1
      4: l4 -> l0 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l4
      6: l1 -> l1 : i!14^0'=1+i!14^0, [ 1+i!14^0<=10 && -i!22^0+i!14^0==0 ], cost: 2
      5: l4 -> l1 : i!14^0'=2, [], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
      6: l1 -> l1 : i!14^0'=1+i!14^0, [ 1+i!14^0<=10 && -i!22^0+i!14^0==0 ], cost: 2

   Failed to prove monotonicity of the guard of rule 6.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: l4
      6: l1 -> l1 : i!14^0'=1+i!14^0, [ 1+i!14^0<=10 && -i!22^0+i!14^0==0 ], cost: 2
      5: l4 -> l1 : i!14^0'=2, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l4
      5: l4 -> l1 : i!14^0'=2, [], cost: 2
      7: l4 -> l1 : i!14^0'=3, [ 2-i!22^0==0 ], cost: 4

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

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l4
     <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:  [ i!14^0==i!14^post_5 && i!22^0==i!22^post_5 && result!12^0==result!12^post_5 && temp0!15^0==temp0!15^post_5 ]

WORST_CASE(Omega(1),?)