WORST_CASE(Omega(0),?)

Initial ITS
Start location: l4
   0: l0 -> l1 : i!22^0'=i!22^post0, temp0!15^0'=temp0!15^post0, i!14^0'=i!14^post0, result!12^0'=result!12^post0, (i!14^10 <= 0 /\ i!14^10 == 0 /\ -1-i!14^10+i!14^20 == 0 /\ 2-i!14^post0 <= 0 /\ -9+i!14^10 <= 0 /\ 1-i!14^20 <= 0 /\ -1+i!14^20 <= 0 /\ -temp0!15^post0+temp0!15^0 == 0 /\ -i!14^10 <= 0 /\ -9+i!14^20 <= 0 /\ -result!12^post0+result!12^0 == 0 /\ -1-i!14^20+i!14^post0 == 0 /\ -2+i!14^post0 <= 0 /\ -i!22^post0+i!22^0 == 0), cost: 1
   1: l1 -> l2 : i!22^0'=i!22^post1, temp0!15^0'=temp0!15^post1, i!14^0'=i!14^post1, result!12^0'=result!12^post1, (10-i!14^0 <= 0 /\ temp0!15^0-temp0!15^post1 == 0 /\ result!12^post1-temp0!15^0 == 0 /\ i!22^0-i!22^post1 == 0 /\ i!14^0-i!14^post1 == 0), cost: 1
   2: l1 -> l3 : i!22^0'=i!22^post2, temp0!15^0'=temp0!15^post2, i!14^0'=i!14^post2, result!12^0'=result!12^post2, (-9+i!14^0 <= 0 /\ -1-i!22^0+i!14^post2 <= 0 /\ -9+i!22^0 <= 0 /\ -1-i!14^0+i!14^post2 == 0 /\ 1+i!22^0-i!14^post2 <= 0 /\ temp0!15^0-temp0!15^post2 == 0 /\ i!22^0-i!22^post2 == 0 /\ -result!12^post2+result!12^0 == 0), cost: 1
   3: l3 -> l1 : i!22^0'=i!22^post3, temp0!15^0'=temp0!15^post3, i!14^0'=i!14^post3, result!12^0'=result!12^post3, (-result!12^post3+result!12^0 == 0 /\ i!22^0-i!22^post3 == 0 /\ -i!14^post3+i!14^0 == 0 /\ temp0!15^0-temp0!15^post3 == 0), cost: 1
   4: l4 -> l0 : i!22^0'=i!22^post4, temp0!15^0'=temp0!15^post4, i!14^0'=i!14^post4, result!12^0'=result!12^post4, (-result!12^post4+result!12^0 == 0 /\ i!22^0-i!22^post4 == 0 /\ -i!14^post4+i!14^0 == 0 /\ -temp0!15^post4+temp0!15^0 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l4
   0: l0 -> l1 : i!22^0'=i!22^post0, temp0!15^0'=temp0!15^post0, i!14^0'=i!14^post0, result!12^0'=result!12^post0, (i!14^10 <= 0 /\ i!14^10 == 0 /\ -1-i!14^10+i!14^20 == 0 /\ 2-i!14^post0 <= 0 /\ -9+i!14^10 <= 0 /\ 1-i!14^20 <= 0 /\ -1+i!14^20 <= 0 /\ -temp0!15^post0+temp0!15^0 == 0 /\ -i!14^10 <= 0 /\ -9+i!14^20 <= 0 /\ -result!12^post0+result!12^0 == 0 /\ -1-i!14^20+i!14^post0 == 0 /\ -2+i!14^post0 <= 0 /\ -i!22^post0+i!22^0 == 0), cost: 1
   2: l1 -> l3 : i!22^0'=i!22^post2, temp0!15^0'=temp0!15^post2, i!14^0'=i!14^post2, result!12^0'=result!12^post2, (-9+i!14^0 <= 0 /\ -1-i!22^0+i!14^post2 <= 0 /\ -9+i!22^0 <= 0 /\ -1-i!14^0+i!14^post2 == 0 /\ 1+i!22^0-i!14^post2 <= 0 /\ temp0!15^0-temp0!15^post2 == 0 /\ i!22^0-i!22^post2 == 0 /\ -result!12^post2+result!12^0 == 0), cost: 1
   3: l3 -> l1 : i!22^0'=i!22^post3, temp0!15^0'=temp0!15^post3, i!14^0'=i!14^post3, result!12^0'=result!12^post3, (-result!12^post3+result!12^0 == 0 /\ i!22^0-i!22^post3 == 0 /\ -i!14^post3+i!14^0 == 0 /\ temp0!15^0-temp0!15^post3 == 0), cost: 1
   4: l4 -> l0 : i!22^0'=i!22^post4, temp0!15^0'=temp0!15^post4, i!14^0'=i!14^post4, result!12^0'=result!12^post4, (-result!12^post4+result!12^0 == 0 /\ i!22^0-i!22^post4 == 0 /\ -i!14^post4+i!14^0 == 0 /\ -temp0!15^post4+temp0!15^0 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : i!22^0'=i!22^post0, temp0!15^0'=temp0!15^post0, i!14^0'=i!14^post0, result!12^0'=result!12^post0, (i!14^10 <= 0 /\ i!14^10 == 0 /\ -1-i!14^10+i!14^20 == 0 /\ 2-i!14^post0 <= 0 /\ -9+i!14^10 <= 0 /\ 1-i!14^20 <= 0 /\ -1+i!14^20 <= 0 /\ -temp0!15^post0+temp0!15^0 == 0 /\ -i!14^10 <= 0 /\ -9+i!14^20 <= 0 /\ -result!12^post0+result!12^0 == 0 /\ -1-i!14^20+i!14^post0 == 0 /\ -2+i!14^post0 <= 0 /\ -i!22^post0+i!22^0 == 0), cost: 1
New rule:
l0 -> l1 : i!14^0'=2, (0 == 0 /\ -9 <= 0 /\ -8 <= 0), cost: 1

Applied preprocessing
Original rule:
l1 -> l3 : i!22^0'=i!22^post2, temp0!15^0'=temp0!15^post2, i!14^0'=i!14^post2, result!12^0'=result!12^post2, (-9+i!14^0 <= 0 /\ -1-i!22^0+i!14^post2 <= 0 /\ -9+i!22^0 <= 0 /\ -1-i!14^0+i!14^post2 == 0 /\ 1+i!22^0-i!14^post2 <= 0 /\ temp0!15^0-temp0!15^post2 == 0 /\ i!22^0-i!22^post2 == 0 /\ -result!12^post2+result!12^0 == 0), cost: 1
New rule:
l1 -> l3 : i!14^0'=1+i!22^0, (i!22^0-i!14^0 == 0 /\ -9+i!22^0 <= 0), cost: 1

Applied preprocessing
Original rule:
l3 -> l1 : i!22^0'=i!22^post3, temp0!15^0'=temp0!15^post3, i!14^0'=i!14^post3, result!12^0'=result!12^post3, (-result!12^post3+result!12^0 == 0 /\ i!22^0-i!22^post3 == 0 /\ -i!14^post3+i!14^0 == 0 /\ temp0!15^0-temp0!15^post3 == 0), cost: 1
New rule:
l3 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l4 -> l0 : i!22^0'=i!22^post4, temp0!15^0'=temp0!15^post4, i!14^0'=i!14^post4, result!12^0'=result!12^post4, (-result!12^post4+result!12^0 == 0 /\ i!22^0-i!22^post4 == 0 /\ -i!14^post4+i!14^0 == 0 /\ -temp0!15^post4+temp0!15^0 == 0), cost: 1
New rule:
l4 -> l0 : TRUE, cost: 1

Simplified rules
Start location: l4
   5: l0 -> l1 : i!14^0'=2, (0 == 0 /\ -9 <= 0 /\ -8 <= 0), cost: 1
   6: l1 -> l3 : i!14^0'=1+i!22^0, (i!22^0-i!14^0 == 0 /\ -9+i!22^0 <= 0), cost: 1
   7: l3 -> l1 : TRUE, cost: 1
   8: l4 -> l0 : TRUE, cost: 1


Eliminating location l0 by chaining:

Applied chaining
First rule:
l4 -> l0 : TRUE, cost: 1
Second rule:
l0 -> l1 : i!14^0'=2, (0 == 0 /\ -9 <= 0 /\ -8 <= 0), cost: 1
New rule:
l4 -> l1 : i!14^0'=2, (0 == 0 /\ -9 <= 0 /\ -8 <= 0), cost: 2

Applied deletion
Removed the following rules: 5 8

Eliminating location l3 by chaining:

Applied chaining
First rule:
l1 -> l3 : i!14^0'=1+i!22^0, (i!22^0-i!14^0 == 0 /\ -9+i!22^0 <= 0), cost: 1
Second rule:
l3 -> l1 : TRUE, cost: 1
New rule:
l1 -> l1 : i!14^0'=1+i!22^0, (i!22^0-i!14^0 == 0 /\ -9+i!22^0 <= 0), cost: 2

Applied deletion
Removed the following rules: 6 7

Eliminated locations on linear paths
Start location: l4
  10: l1 -> l1 : i!14^0'=1+i!22^0, (i!22^0-i!14^0 == 0 /\ -9+i!22^0 <= 0), cost: 2
   9: l4 -> l1 : i!14^0'=2, (0 == 0 /\ -9 <= 0 /\ -8 <= 0), cost: 2


Accelerated simple loops
Start location: l4
  10: l1 -> l1 : i!14^0'=1+i!22^0, (i!22^0-i!14^0 == 0 /\ -9+i!22^0 <= 0), cost: 2
   9: l4 -> l1 : i!14^0'=2, (0 == 0 /\ -9 <= 0 /\ -8 <= 0), cost: 2


Applied chaining
First rule:
l4 -> l1 : i!14^0'=2, (0 == 0 /\ -9 <= 0 /\ -8 <= 0), cost: 2
Second rule:
l1 -> l1 : i!14^0'=1+i!22^0, (i!22^0-i!14^0 == 0 /\ -9+i!22^0 <= 0), cost: 2
New rule:
l4 -> l1 : i!14^0'=1+i!22^0, -2+i!22^0 == 0, cost: 4

Applied deletion
Removed the following rules: 10

Chained accelerated rules with incoming rules
Start location: l4
   9: l4 -> l1 : i!14^0'=2, (0 == 0 /\ -9 <= 0 /\ -8 <= 0), cost: 2
  11: l4 -> l1 : i!14^0'=1+i!22^0, -2+i!22^0 == 0, cost: 4


Removed unreachable locations and irrelevant leafs
Start location: l4
  <empty>


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0