WORST_CASE(Omega(0),?)

Initial ITS
Start location: l6
   0: l0 -> l1 : x79^0'=x79^post0, i911^0'=i911^post0, x35^0'=x35^post0, i57^0'=i57^post0, tmp^0'=tmp^post0, (-tmp^post0+tmp^0 == 0 /\ x79^0-x79^post0 == 0 /\ i57^0-i57^post0 == 0 /\ -i911^post0+i911^0 == 0 /\ x35^0-x35^post0 == 0), cost: 1
   4: l1 -> l4 : x79^0'=x79^post4, i911^0'=i911^post4, x35^0'=x35^post4, i57^0'=i57^post4, tmp^0'=tmp^post4, (0 == 0 /\ 10-i57^0 <= 0 /\ i57^0-i57^post4 == 0 /\ x35^0-x35^post4 == 0 /\ i911^post4 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1
   5: l1 -> l0 : x79^0'=x79^post5, i911^0'=i911^post5, x35^0'=x35^post5, i57^0'=i57^post5, tmp^0'=tmp^post5, (-9+i57^0 <= 0 /\ tmp^0-tmp^post5 == 0 /\ -1+i57^post5-i57^0 == 0 /\ x79^0-x79^post5 == 0 /\ -x35^post5+x35^0 == 0 /\ i911^0-i911^post5 == 0), cost: 1
   1: l2 -> l3 : x79^0'=x79^post1, i911^0'=i911^post1, x35^0'=x35^post1, i57^0'=i57^post1, tmp^0'=tmp^post1, (-i57^post1+i57^0 == 0 /\ -x35^post1+x35^0 == 0 /\ -tmp^post1+tmp^0 == 0 /\ 10-i911^0 <= 0 /\ i911^0-i911^post1 == 0 /\ x79^0-x79^post1 == 0), cost: 1
   2: l2 -> l4 : x79^0'=x79^post2, i911^0'=i911^post2, x35^0'=x35^post2, i57^0'=i57^post2, tmp^0'=tmp^post2, (x79^0-x79^post2 == 0 /\ -tmp^post2+tmp^0 == 0 /\ i57^0-i57^post2 == 0 /\ -9+i911^0 <= 0 /\ -1+i911^post2-i911^0 == 0 /\ x35^0-x35^post2 == 0), cost: 1
   3: l4 -> l2 : x79^0'=x79^post3, i911^0'=i911^post3, x35^0'=x35^post3, i57^0'=i57^post3, tmp^0'=tmp^post3, (x79^0-x79^post3 == 0 /\ -tmp^post3+tmp^0 == 0 /\ i911^0-i911^post3 == 0 /\ x35^0-x35^post3 == 0 /\ -i57^post3+i57^0 == 0), cost: 1
   6: l5 -> l0 : x79^0'=x79^post6, i911^0'=i911^post6, x35^0'=x35^post6, i57^0'=i57^post6, tmp^0'=tmp^post6, (0 == 0 /\ i57^post6 == 0 /\ x79^0-x79^post6 == 0 /\ i911^0-i911^post6 == 0), cost: 1
   7: l6 -> l5 : x79^0'=x79^post7, i911^0'=i911^post7, x35^0'=x35^post7, i57^0'=i57^post7, tmp^0'=tmp^post7, (-x35^post7+x35^0 == 0 /\ tmp^0-tmp^post7 == 0 /\ i57^0-i57^post7 == 0 /\ i911^0-i911^post7 == 0 /\ x79^0-x79^post7 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l6
   0: l0 -> l1 : x79^0'=x79^post0, i911^0'=i911^post0, x35^0'=x35^post0, i57^0'=i57^post0, tmp^0'=tmp^post0, (-tmp^post0+tmp^0 == 0 /\ x79^0-x79^post0 == 0 /\ i57^0-i57^post0 == 0 /\ -i911^post0+i911^0 == 0 /\ x35^0-x35^post0 == 0), cost: 1
   4: l1 -> l4 : x79^0'=x79^post4, i911^0'=i911^post4, x35^0'=x35^post4, i57^0'=i57^post4, tmp^0'=tmp^post4, (0 == 0 /\ 10-i57^0 <= 0 /\ i57^0-i57^post4 == 0 /\ x35^0-x35^post4 == 0 /\ i911^post4 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1
   5: l1 -> l0 : x79^0'=x79^post5, i911^0'=i911^post5, x35^0'=x35^post5, i57^0'=i57^post5, tmp^0'=tmp^post5, (-9+i57^0 <= 0 /\ tmp^0-tmp^post5 == 0 /\ -1+i57^post5-i57^0 == 0 /\ x79^0-x79^post5 == 0 /\ -x35^post5+x35^0 == 0 /\ i911^0-i911^post5 == 0), cost: 1
   2: l2 -> l4 : x79^0'=x79^post2, i911^0'=i911^post2, x35^0'=x35^post2, i57^0'=i57^post2, tmp^0'=tmp^post2, (x79^0-x79^post2 == 0 /\ -tmp^post2+tmp^0 == 0 /\ i57^0-i57^post2 == 0 /\ -9+i911^0 <= 0 /\ -1+i911^post2-i911^0 == 0 /\ x35^0-x35^post2 == 0), cost: 1
   3: l4 -> l2 : x79^0'=x79^post3, i911^0'=i911^post3, x35^0'=x35^post3, i57^0'=i57^post3, tmp^0'=tmp^post3, (x79^0-x79^post3 == 0 /\ -tmp^post3+tmp^0 == 0 /\ i911^0-i911^post3 == 0 /\ x35^0-x35^post3 == 0 /\ -i57^post3+i57^0 == 0), cost: 1
   6: l5 -> l0 : x79^0'=x79^post6, i911^0'=i911^post6, x35^0'=x35^post6, i57^0'=i57^post6, tmp^0'=tmp^post6, (0 == 0 /\ i57^post6 == 0 /\ x79^0-x79^post6 == 0 /\ i911^0-i911^post6 == 0), cost: 1
   7: l6 -> l5 : x79^0'=x79^post7, i911^0'=i911^post7, x35^0'=x35^post7, i57^0'=i57^post7, tmp^0'=tmp^post7, (-x35^post7+x35^0 == 0 /\ tmp^0-tmp^post7 == 0 /\ i57^0-i57^post7 == 0 /\ i911^0-i911^post7 == 0 /\ x79^0-x79^post7 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : x79^0'=x79^post0, i911^0'=i911^post0, x35^0'=x35^post0, i57^0'=i57^post0, tmp^0'=tmp^post0, (-tmp^post0+tmp^0 == 0 /\ x79^0-x79^post0 == 0 /\ i57^0-i57^post0 == 0 /\ -i911^post0+i911^0 == 0 /\ x35^0-x35^post0 == 0), cost: 1
New rule:
l0 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l4 : x79^0'=x79^post2, i911^0'=i911^post2, x35^0'=x35^post2, i57^0'=i57^post2, tmp^0'=tmp^post2, (x79^0-x79^post2 == 0 /\ -tmp^post2+tmp^0 == 0 /\ i57^0-i57^post2 == 0 /\ -9+i911^0 <= 0 /\ -1+i911^post2-i911^0 == 0 /\ x35^0-x35^post2 == 0), cost: 1
New rule:
l2 -> l4 : i911^0'=1+i911^0, -9+i911^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l2 : x79^0'=x79^post3, i911^0'=i911^post3, x35^0'=x35^post3, i57^0'=i57^post3, tmp^0'=tmp^post3, (x79^0-x79^post3 == 0 /\ -tmp^post3+tmp^0 == 0 /\ i911^0-i911^post3 == 0 /\ x35^0-x35^post3 == 0 /\ -i57^post3+i57^0 == 0), cost: 1
New rule:
l4 -> l2 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l4 : x79^0'=x79^post4, i911^0'=i911^post4, x35^0'=x35^post4, i57^0'=i57^post4, tmp^0'=tmp^post4, (0 == 0 /\ 10-i57^0 <= 0 /\ i57^0-i57^post4 == 0 /\ x35^0-x35^post4 == 0 /\ i911^post4 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1
New rule:
l1 -> l4 : x79^0'=x79^post4, i911^0'=0, -10+i57^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l1 -> l0 : x79^0'=x79^post5, i911^0'=i911^post5, x35^0'=x35^post5, i57^0'=i57^post5, tmp^0'=tmp^post5, (-9+i57^0 <= 0 /\ tmp^0-tmp^post5 == 0 /\ -1+i57^post5-i57^0 == 0 /\ x79^0-x79^post5 == 0 /\ -x35^post5+x35^0 == 0 /\ i911^0-i911^post5 == 0), cost: 1
New rule:
l1 -> l0 : i57^0'=1+i57^0, -9+i57^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l0 : x79^0'=x79^post6, i911^0'=i911^post6, x35^0'=x35^post6, i57^0'=i57^post6, tmp^0'=tmp^post6, (0 == 0 /\ i57^post6 == 0 /\ x79^0-x79^post6 == 0 /\ i911^0-i911^post6 == 0), cost: 1
New rule:
l5 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l6 -> l5 : x79^0'=x79^post7, i911^0'=i911^post7, x35^0'=x35^post7, i57^0'=i57^post7, tmp^0'=tmp^post7, (-x35^post7+x35^0 == 0 /\ tmp^0-tmp^post7 == 0 /\ i57^0-i57^post7 == 0 /\ i911^0-i911^post7 == 0 /\ x79^0-x79^post7 == 0), cost: 1
New rule:
l6 -> l5 : TRUE, cost: 1

Simplified rules
Start location: l6
   8: l0 -> l1 : TRUE, cost: 1
  11: l1 -> l4 : x79^0'=x79^post4, i911^0'=0, -10+i57^0 >= 0, cost: 1
  12: l1 -> l0 : i57^0'=1+i57^0, -9+i57^0 <= 0, cost: 1
   9: l2 -> l4 : i911^0'=1+i911^0, -9+i911^0 <= 0, cost: 1
  10: l4 -> l2 : TRUE, cost: 1
  13: l5 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 1
  14: l6 -> l5 : TRUE, cost: 1


Eliminating location l5 by chaining:

Applied chaining
First rule:
l6 -> l5 : TRUE, cost: 1
Second rule:
l5 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 1
New rule:
l6 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 2

Applied deletion
Removed the following rules: 13 14

Eliminating location l2 by chaining:

Applied chaining
First rule:
l4 -> l2 : TRUE, cost: 1
Second rule:
l2 -> l4 : i911^0'=1+i911^0, -9+i911^0 <= 0, cost: 1
New rule:
l4 -> l4 : i911^0'=1+i911^0, -9+i911^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 9 10

Eliminated locations on linear paths
Start location: l6
   8: l0 -> l1 : TRUE, cost: 1
  11: l1 -> l4 : x79^0'=x79^post4, i911^0'=0, -10+i57^0 >= 0, cost: 1
  12: l1 -> l0 : i57^0'=1+i57^0, -9+i57^0 <= 0, cost: 1
  16: l4 -> l4 : i911^0'=1+i911^0, -9+i911^0 <= 0, cost: 2
  15: l6 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 2


Applied acceleration
Original rule:
l4 -> l4 : i911^0'=1+i911^0, -9+i911^0 <= 0, cost: 2
New rule:
l4 -> l4 : i911^0'=n+i911^0, (n >= 0 /\ 10-n-i911^0 >= 0), cost: 2*n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_HJGkfo.txt

Applied instantiation
Original rule:
l4 -> l4 : i911^0'=n+i911^0, (n >= 0 /\ 10-n-i911^0 >= 0), cost: 2*n
New rule:
l4 -> l4 : i911^0'=10, (0 >= 0 /\ 10-i911^0 >= 0), cost: 20-2*i911^0

Applied simplification
Original rule:
l4 -> l4 : i911^0'=10, (0 >= 0 /\ 10-i911^0 >= 0), cost: 20-2*i911^0
New rule:
l4 -> l4 : i911^0'=10, -10+i911^0 <= 0, cost: 20-2*i911^0

Applied deletion
Removed the following rules: 16

Accelerated simple loops
Start location: l6
   8: l0 -> l1 : TRUE, cost: 1
  11: l1 -> l4 : x79^0'=x79^post4, i911^0'=0, -10+i57^0 >= 0, cost: 1
  12: l1 -> l0 : i57^0'=1+i57^0, -9+i57^0 <= 0, cost: 1
  18: l4 -> l4 : i911^0'=10, -10+i911^0 <= 0, cost: 20-2*i911^0
  15: l6 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 2


Applied chaining
First rule:
l1 -> l4 : x79^0'=x79^post4, i911^0'=0, -10+i57^0 >= 0, cost: 1
Second rule:
l4 -> l4 : i911^0'=10, -10+i911^0 <= 0, cost: 20-2*i911^0
New rule:
l1 -> l4 : x79^0'=x79^post4, i911^0'=10, -10+i57^0 >= 0, cost: 21

Applied deletion
Removed the following rules: 18

Chained accelerated rules with incoming rules
Start location: l6
   8: l0 -> l1 : TRUE, cost: 1
  11: l1 -> l4 : x79^0'=x79^post4, i911^0'=0, -10+i57^0 >= 0, cost: 1
  12: l1 -> l0 : i57^0'=1+i57^0, -9+i57^0 <= 0, cost: 1
  19: l1 -> l4 : x79^0'=x79^post4, i911^0'=10, -10+i57^0 >= 0, cost: 21
  15: l6 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 2


Removed unreachable locations and irrelevant leafs
Start location: l6
   8: l0 -> l1 : TRUE, cost: 1
  12: l1 -> l0 : i57^0'=1+i57^0, -9+i57^0 <= 0, cost: 1
  15: l6 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 2


Eliminating location l1 by chaining:

Applied chaining
First rule:
l0 -> l1 : TRUE, cost: 1
Second rule:
l1 -> l0 : i57^0'=1+i57^0, -9+i57^0 <= 0, cost: 1
New rule:
l0 -> l0 : i57^0'=1+i57^0, -9+i57^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 8 12

Eliminated locations on linear paths
Start location: l6
  20: l0 -> l0 : i57^0'=1+i57^0, -9+i57^0 <= 0, cost: 2
  15: l6 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 2


Applied acceleration
Original rule:
l0 -> l0 : i57^0'=1+i57^0, -9+i57^0 <= 0, cost: 2
New rule:
l0 -> l0 : i57^0'=n0+i57^0, (10-n0-i57^0 >= 0 /\ n0 >= 0), cost: 2*n0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_BdinbE.txt

Applied instantiation
Original rule:
l0 -> l0 : i57^0'=n0+i57^0, (10-n0-i57^0 >= 0 /\ n0 >= 0), cost: 2*n0
New rule:
l0 -> l0 : i57^0'=10, (0 >= 0 /\ 10-i57^0 >= 0), cost: 20-2*i57^0

Applied simplification
Original rule:
l0 -> l0 : i57^0'=10, (0 >= 0 /\ 10-i57^0 >= 0), cost: 20-2*i57^0
New rule:
l0 -> l0 : i57^0'=10, -10+i57^0 <= 0, cost: 20-2*i57^0

Applied deletion
Removed the following rules: 20

Accelerated simple loops
Start location: l6
  22: l0 -> l0 : i57^0'=10, -10+i57^0 <= 0, cost: 20-2*i57^0
  15: l6 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 2


Applied chaining
First rule:
l6 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 2
Second rule:
l0 -> l0 : i57^0'=10, -10+i57^0 <= 0, cost: 20-2*i57^0
New rule:
l6 -> l0 : x35^0'=x35^post6, i57^0'=10, tmp^0'=tmp^post6, (0 == 0 /\ -10 <= 0), cost: 22

Applied deletion
Removed the following rules: 22

Chained accelerated rules with incoming rules
Start location: l6
  15: l6 -> l0 : x35^0'=x35^post6, i57^0'=0, tmp^0'=tmp^post6, 0 == 0, cost: 2
  23: l6 -> l0 : x35^0'=x35^post6, i57^0'=10, tmp^0'=tmp^post6, (0 == 0 /\ -10 <= 0), cost: 22


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0