NO

Initial ITS
Start location: l8
   0: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1
   1: l1 -> l2 : Result_4^0'=Result_4^post1, x_5^0'=x_5^post1, (-x_5^post1+x_5^0 == 0 /\ -x_5^0 <= 0 /\ x_5^0 <= 0 /\ Result_4^0-Result_4^post1 == 0), cost: 1
   2: l1 -> l2 : Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (0 == 0 /\ -1-x_5^10+x_5^post2 == 0 /\ Result_4^0-Result_4^post2 == 0 /\ -x_5^0 <= 0 /\ 1-x_5^0 <= 0 /\ -x_5^post2 <= 0 /\ x_5^post2 <= 0), cost: 1
   3: l1 -> l2 : Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (0 == 0 /\ 1-x_5^11+x_5^post3 == 0 /\ Result_4^0-Result_4^post3 == 0 /\ -x_5^post3 <= 0 /\ 1+x_5^0 <= 0 /\ x_5^post3 <= 0), cost: 1
   4: l1 -> l3 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (0 == 0 /\ -1-x_5^30+x_5^post4 == 0 /\ -x_5^0 <= 0 /\ 1-x_5^0 <= 0 /\ -1-x_5^12+x_5^20 == 0 /\ -x_5^20 <= 0 /\ 1-x_5^20 <= 0 /\ Result_4^0-Result_4^post4 == 0), cost: 1
   6: l1 -> l4 : Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (0 == 0 /\ 1+x_5^210 <= 0 /\ 1-x_5^310+x_5^post6 == 0 /\ -x_5^0 <= 0 /\ 1-x_5^0 <= 0 /\ Result_4^0-Result_4^post6 == 0 /\ -1-x_5^13+x_5^210 == 0), cost: 1
   8: l1 -> l5 : Result_4^0'=Result_4^post8, x_5^0'=x_5^post8, (0 == 0 /\ 1-x_5^220 <= 0 /\ 1+x_5^220-x_5^14 == 0 /\ -x_5^220 <= 0 /\ -1+x_5^post8-x_5^320 == 0 /\ Result_4^0-Result_4^post8 == 0 /\ 1+x_5^0 <= 0), cost: 1
  10: l1 -> l6 : Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (0 == 0 /\ 1+x_5^230-x_5^15 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ 1+x_5^230 <= 0 /\ 1+x_5^post10-x_5^330 == 0 /\ 1+x_5^0 <= 0), cost: 1
  12: l2 -> l7 : Result_4^0'=Result_4^post12, x_5^0'=x_5^post12, (0 == 0 /\ -x_5^post12+x_5^0 == 0), cost: 1
   5: l3 -> l1 : Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (-x_5^post5+x_5^0 == 0 /\ Result_4^0-Result_4^post5 == 0), cost: 1
   7: l4 -> l1 : Result_4^0'=Result_4^post7, x_5^0'=x_5^post7, (Result_4^0-Result_4^post7 == 0 /\ -x_5^post7+x_5^0 == 0), cost: 1
   9: l5 -> l1 : Result_4^0'=Result_4^post9, x_5^0'=x_5^post9, (Result_4^0-Result_4^post9 == 0 /\ -x_5^post9+x_5^0 == 0), cost: 1
  11: l6 -> l1 : Result_4^0'=Result_4^post11, x_5^0'=x_5^post11, (x_5^0-x_5^post11 == 0 /\ Result_4^0-Result_4^post11 == 0), cost: 1
  13: l8 -> l0 : Result_4^0'=Result_4^post13, x_5^0'=x_5^post13, (x_5^0-x_5^post13 == 0 /\ Result_4^0-Result_4^post13 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l8
   0: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1
   4: l1 -> l3 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (0 == 0 /\ -1-x_5^30+x_5^post4 == 0 /\ -x_5^0 <= 0 /\ 1-x_5^0 <= 0 /\ -1-x_5^12+x_5^20 == 0 /\ -x_5^20 <= 0 /\ 1-x_5^20 <= 0 /\ Result_4^0-Result_4^post4 == 0), cost: 1
   6: l1 -> l4 : Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (0 == 0 /\ 1+x_5^210 <= 0 /\ 1-x_5^310+x_5^post6 == 0 /\ -x_5^0 <= 0 /\ 1-x_5^0 <= 0 /\ Result_4^0-Result_4^post6 == 0 /\ -1-x_5^13+x_5^210 == 0), cost: 1
   8: l1 -> l5 : Result_4^0'=Result_4^post8, x_5^0'=x_5^post8, (0 == 0 /\ 1-x_5^220 <= 0 /\ 1+x_5^220-x_5^14 == 0 /\ -x_5^220 <= 0 /\ -1+x_5^post8-x_5^320 == 0 /\ Result_4^0-Result_4^post8 == 0 /\ 1+x_5^0 <= 0), cost: 1
  10: l1 -> l6 : Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (0 == 0 /\ 1+x_5^230-x_5^15 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ 1+x_5^230 <= 0 /\ 1+x_5^post10-x_5^330 == 0 /\ 1+x_5^0 <= 0), cost: 1
   5: l3 -> l1 : Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (-x_5^post5+x_5^0 == 0 /\ Result_4^0-Result_4^post5 == 0), cost: 1
   7: l4 -> l1 : Result_4^0'=Result_4^post7, x_5^0'=x_5^post7, (Result_4^0-Result_4^post7 == 0 /\ -x_5^post7+x_5^0 == 0), cost: 1
   9: l5 -> l1 : Result_4^0'=Result_4^post9, x_5^0'=x_5^post9, (Result_4^0-Result_4^post9 == 0 /\ -x_5^post9+x_5^0 == 0), cost: 1
  11: l6 -> l1 : Result_4^0'=Result_4^post11, x_5^0'=x_5^post11, (x_5^0-x_5^post11 == 0 /\ Result_4^0-Result_4^post11 == 0), cost: 1
  13: l8 -> l0 : Result_4^0'=Result_4^post13, x_5^0'=x_5^post13, (x_5^0-x_5^post13 == 0 /\ Result_4^0-Result_4^post13 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1
New rule:
l0 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l3 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (0 == 0 /\ -1-x_5^30+x_5^post4 == 0 /\ -x_5^0 <= 0 /\ 1-x_5^0 <= 0 /\ -1-x_5^12+x_5^20 == 0 /\ -x_5^20 <= 0 /\ 1-x_5^20 <= 0 /\ Result_4^0-Result_4^post4 == 0), cost: 1
New rule:
l1 -> l3 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l1 : Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (-x_5^post5+x_5^0 == 0 /\ Result_4^0-Result_4^post5 == 0), cost: 1
New rule:
l3 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l4 : Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (0 == 0 /\ 1+x_5^210 <= 0 /\ 1-x_5^310+x_5^post6 == 0 /\ -x_5^0 <= 0 /\ 1-x_5^0 <= 0 /\ Result_4^0-Result_4^post6 == 0 /\ -1-x_5^13+x_5^210 == 0), cost: 1
New rule:
l1 -> l4 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l1 : Result_4^0'=Result_4^post7, x_5^0'=x_5^post7, (Result_4^0-Result_4^post7 == 0 /\ -x_5^post7+x_5^0 == 0), cost: 1
New rule:
l4 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l5 : Result_4^0'=Result_4^post8, x_5^0'=x_5^post8, (0 == 0 /\ 1-x_5^220 <= 0 /\ 1+x_5^220-x_5^14 == 0 /\ -x_5^220 <= 0 /\ -1+x_5^post8-x_5^320 == 0 /\ Result_4^0-Result_4^post8 == 0 /\ 1+x_5^0 <= 0), cost: 1
New rule:
l1 -> l5 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l1 : Result_4^0'=Result_4^post9, x_5^0'=x_5^post9, (Result_4^0-Result_4^post9 == 0 /\ -x_5^post9+x_5^0 == 0), cost: 1
New rule:
l5 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l6 : Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (0 == 0 /\ 1+x_5^230-x_5^15 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ 1+x_5^230 <= 0 /\ 1+x_5^post10-x_5^330 == 0 /\ 1+x_5^0 <= 0), cost: 1
New rule:
l1 -> l6 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l6 -> l1 : Result_4^0'=Result_4^post11, x_5^0'=x_5^post11, (x_5^0-x_5^post11 == 0 /\ Result_4^0-Result_4^post11 == 0), cost: 1
New rule:
l6 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l8 -> l0 : Result_4^0'=Result_4^post13, x_5^0'=x_5^post13, (x_5^0-x_5^post13 == 0 /\ Result_4^0-Result_4^post13 == 0), cost: 1
New rule:
l8 -> l0 : TRUE, cost: 1

Simplified rules
Start location: l8
  14: l0 -> l1 : TRUE, cost: 1
  15: l1 -> l3 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 1
  17: l1 -> l4 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 1
  19: l1 -> l5 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 1
  21: l1 -> l6 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 1
  16: l3 -> l1 : TRUE, cost: 1
  18: l4 -> l1 : TRUE, cost: 1
  20: l5 -> l1 : TRUE, cost: 1
  22: l6 -> l1 : TRUE, cost: 1
  23: l8 -> l0 : TRUE, cost: 1


Eliminating location l0 by chaining:

Applied chaining
First rule:
l8 -> l0 : TRUE, cost: 1
Second rule:
l0 -> l1 : TRUE, cost: 1
New rule:
l8 -> l1 : TRUE, cost: 2

Applied deletion
Removed the following rules: 14 23

Eliminating location l3 by chaining:

Applied chaining
First rule:
l1 -> l3 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 1
Second rule:
l3 -> l1 : TRUE, cost: 1
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2

Applied deletion
Removed the following rules: 15 16

Eliminating location l4 by chaining:

Applied chaining
First rule:
l1 -> l4 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 1
Second rule:
l4 -> l1 : TRUE, cost: 1
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2

Applied deletion
Removed the following rules: 17 18

Eliminating location l5 by chaining:

Applied chaining
First rule:
l1 -> l5 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 1
Second rule:
l5 -> l1 : TRUE, cost: 1
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 19 20

Eliminating location l6 by chaining:

Applied chaining
First rule:
l1 -> l6 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 1
Second rule:
l6 -> l1 : TRUE, cost: 1
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 21 22

Eliminated locations on linear paths
Start location: l8
  25: l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
  26: l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
  27: l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
  28: l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
  24: l8 -> l1 : TRUE, cost: 2


Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: 2*n3

Applied unrolling
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: 4

Applied non-termination processor
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: 4
New rule:
l1 -> [9] : (x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: 2*n5

Applied unrolling
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0), cost: 4

Applied non-termination processor
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0), cost: 4
New rule:
l1 -> [9] : (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: 2*n7

Applied unrolling
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 4

Applied non-termination processor
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, (2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 4
New rule:
l1 -> [9] : (2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1-x_5^0 >= 0), cost: 2*n9

Applied unrolling
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: 4

Applied non-termination processor
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: 4
New rule:
l1 -> [9] : (x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n11 >= 0), cost: 4*n11

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n11 >= 0), cost: 4*n11
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n11 >= 0), cost: 2+4*n11

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, -1+x_5^0 >= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, -1+x_5^0 >= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n13 >= 0), cost: 4*n13

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n13 >= 0), cost: 4*n13
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+n13 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n13

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, -1+x_5^0 >= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, -1+x_5^0 >= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+x_5^0 >= 0 /\ -2+x_5^330 >= 0 /\ -1+n15 >= 0), cost: 4*n15

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+x_5^0 >= 0 /\ -2+x_5^330 >= 0 /\ -1+n15 >= 0), cost: 4*n15
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-2+x_5^330 >= 0 /\ 1+x_5^0 <= 0 /\ -1+n15 >= 0), cost: 2+4*n15

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+n17 >= 0 /\ x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: 4*n17

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+n17 >= 0 /\ x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: 4*n17
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+n17 >= 0 /\ x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n17

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, -1+x_5^0 >= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, -1+x_5^0 >= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ -1+x_5^0 >= 0), cost: 4*n19

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ -1+x_5^0 >= 0), cost: 4*n19
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n19

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, -1+x_5^0 >= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, -1+x_5^0 >= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -1+x_5^0 >= 0 /\ -2+x_5^330 >= 0), cost: 4*n21

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -1+x_5^0 >= 0 /\ -2+x_5^330 >= 0), cost: 4*n21
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -2+x_5^330 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n21

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, 1+x_5^0 <= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, 1+x_5^0 <= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+n23 >= 0 /\ -1-x_5^0 >= 0 /\ -2-x_5^30 >= 0), cost: 4*n23

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+n23 >= 0 /\ -1-x_5^0 >= 0 /\ -2-x_5^30 >= 0), cost: 4*n23
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+n23 >= 0 /\ -1+x_5^0 >= 0 /\ -2-x_5^30 >= 0), cost: 2+4*n23

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, 1+x_5^0 <= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, 1+x_5^0 <= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ -x_5^310 >= 0 /\ -1-x_5^0 >= 0), cost: 4*n25

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ -x_5^310 >= 0 /\ -1-x_5^0 >= 0), cost: 4*n25
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ -1+x_5^0 >= 0 /\ -x_5^310 >= 0), cost: 2+4*n25

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-x_5^330 >= 0 /\ -1-x_5^0 >= 0 /\ -1+n27 >= 0), cost: 4*n27

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-x_5^330 >= 0 /\ -1-x_5^0 >= 0 /\ -1+n27 >= 0), cost: 4*n27
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-x_5^330 >= 0 /\ 1+x_5^0 <= 0 /\ -1+n27 >= 0), cost: 2+4*n27

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, 1+x_5^0 <= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, 1+x_5^0 <= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1-x_5^0 >= 0 /\ -2-x_5^30 >= 0 /\ -1+n29 >= 0), cost: 4*n29

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1-x_5^0 >= 0 /\ -2-x_5^30 >= 0 /\ -1+n29 >= 0), cost: 4*n29
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+x_5^0 >= 0 /\ -2-x_5^30 >= 0 /\ -1+n29 >= 0), cost: 2+4*n29

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, 1+x_5^0 <= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, 1+x_5^0 <= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n31 >= 0 /\ -x_5^310 >= 0 /\ -1-x_5^0 >= 0), cost: 4*n31

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n31 >= 0 /\ -x_5^310 >= 0 /\ -1-x_5^0 >= 0), cost: 4*n31
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n31 >= 0 /\ -1+x_5^0 >= 0 /\ -x_5^310 >= 0), cost: 2+4*n31

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 4

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 4
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: 4*n33

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: 4*n33
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ -2-x_5^320 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n33

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^30, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: 2*n5
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: 2+2*n5

Applied nonterm
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: 2+2*n5
New rule:
l1 -> [9] : (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: 2+2*n5
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n35 >= 0 /\ -2+x_5^310 >= 0 /\ -1+n5 >= 0 /\ ((-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0) \/ (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0))), cost: 2*n35+2*n35*n5

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: 2*n5
Second rule:
l1 -> [9] : (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: NONTERM
New rule:
l1 -> [9] : (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: NONTERM

Heuristically decided not to add the following rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n35 >= 0 /\ -2+x_5^310 >= 0 /\ -1+n5 >= 0 /\ ((-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0) \/ (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0))), cost: 2*n35+2*n35*n5

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^310, -1+x_5^0 >= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: 2*n3
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: 2+2*n3

Applied nonterm
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: 2+2*n3
New rule:
l1 -> [9] : (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: 2+2*n3
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+n41 >= 0 /\ -1+n3 >= 0 /\ ((x_5^30 >= 0 /\ -1+x_5^0 >= 0) \/ (x_5^30 >= 0 /\ -1+x_5^0 >= 0))), cost: 2*n41+2*n41*n3

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: 2*n3
Second rule:
l1 -> [9] : (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: NONTERM
New rule:
l1 -> [9] : (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: NONTERM

Heuristically decided not to add the following rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+n41 >= 0 /\ -1+n3 >= 0 /\ ((x_5^30 >= 0 /\ -1+x_5^0 >= 0) \/ (x_5^30 >= 0 /\ -1+x_5^0 >= 0))), cost: 2*n41+2*n41*n3

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^320, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1-x_5^0 >= 0), cost: 2*n9
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: 2+2*n9

Applied nonterm
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: 2+2*n9
New rule:
l1 -> [9] : (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1-x_5^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: 2+2*n9
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1+n49 >= 0 /\ ((-x_5^330 >= 0 /\ -1-x_5^0 >= 0) \/ (-x_5^330 >= 0 /\ -1-x_5^0 >= 0))), cost: 2*n9*n49+2*n49

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1-x_5^0 >= 0), cost: 2*n9
Second rule:
l1 -> [9] : (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1-x_5^0 >= 0), cost: NONTERM
New rule:
l1 -> [9] : (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1-x_5^0 >= 0), cost: NONTERM

Heuristically decided not to add the following rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1+n49 >= 0 /\ ((-x_5^330 >= 0 /\ -1-x_5^0 >= 0) \/ (-x_5^330 >= 0 /\ -1-x_5^0 >= 0))), cost: 2*n9*n49+2*n49

Applied chaining
First rule:
l1 -> l1 : x_5^0'=-1+x_5^330, 1+x_5^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: 2*n7
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2+2*n7

Applied nonterm
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2+2*n7
New rule:
l1 -> [9] : (-1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2+2*n7
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n55 >= 0 /\ -1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ ((-2-x_5^320 >= 0 /\ -1-x_5^0 >= 0) \/ (-2-x_5^320 >= 0 /\ -1-x_5^0 >= 0))), cost: 2*n55+2*n7*n55

Applied chaining
First rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: 2*n7
Second rule:
l1 -> [9] : (-1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: NONTERM
New rule:
l1 -> [9] : (-1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: NONTERM

Heuristically decided not to add the following rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n55 >= 0 /\ -1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ ((-2-x_5^320 >= 0 /\ -1-x_5^0 >= 0) \/ (-2-x_5^320 >= 0 /\ -1-x_5^0 >= 0))), cost: 2*n55+2*n7*n55

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: 2*n7
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2*n7

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1-x_5^0 >= 0), cost: 2*n9
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: 2*n9

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+n23 >= 0 /\ -1-x_5^0 >= 0 /\ -2-x_5^30 >= 0), cost: 4*n23
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+n23 >= 0 /\ 1+x_5^0 <= 0), cost: 4*n23

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+n23 >= 0 /\ -1+x_5^0 >= 0 /\ -2-x_5^30 >= 0), cost: 2+4*n23
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+n23 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n23

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ -x_5^310 >= 0 /\ -1-x_5^0 >= 0), cost: 4*n25
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ x_5^310 <= 0 /\ 1+x_5^0 <= 0), cost: 4*n25

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ -1+x_5^0 >= 0 /\ -x_5^310 >= 0), cost: 2+4*n25
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ x_5^310 <= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n25

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-x_5^330 >= 0 /\ -1-x_5^0 >= 0 /\ -1+n27 >= 0), cost: 4*n27
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (x_5^330 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n27 >= 0), cost: 4*n27

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-x_5^330 >= 0 /\ 1+x_5^0 <= 0 /\ -1+n27 >= 0), cost: 2+4*n27
New rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (x_5^330 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n27 >= 0), cost: 2+4*n27

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1-x_5^0 >= 0 /\ -2-x_5^30 >= 0 /\ -1+n29 >= 0), cost: 4*n29
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n29 >= 0), cost: 4*n29

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+x_5^0 >= 0 /\ -2-x_5^30 >= 0 /\ -1+n29 >= 0), cost: 2+4*n29
New rule:
l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+x_5^0 >= 0 /\ -1+n29 >= 0), cost: 2+4*n29

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n31 >= 0 /\ -x_5^310 >= 0 /\ -1-x_5^0 >= 0), cost: 4*n31
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (x_5^310 <= 0 /\ -1+n31 >= 0 /\ 1+x_5^0 <= 0), cost: 4*n31

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n31 >= 0 /\ -1+x_5^0 >= 0 /\ -x_5^310 >= 0), cost: 2+4*n31
New rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (x_5^310 <= 0 /\ -1+n31 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n31

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: 4*n33
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 4*n33

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ -2-x_5^320 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n33
New rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n33

Applied simplification
Original rule:
l1 -> [9] : (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1-x_5^0 >= 0), cost: NONTERM
New rule:
l1 -> [9] : (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [9] : (-1+n9 >= 0 /\ -x_5^330 >= 0 /\ -1-x_5^0 >= 0), cost: NONTERM
New rule:
l1 -> [9] : (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [9] : (-1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: NONTERM
New rule:
l1 -> [9] : (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [9] : (-1+n7 >= 0 /\ -2-x_5^320 >= 0 /\ -1-x_5^0 >= 0), cost: NONTERM
New rule:
l1 -> [9] : (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM

Applied deletion
Removed the following rules: 25 26 27 28

Applied deletion
Removed the following rules: 37 43 61 63 75 81 83 85

Accelerated simple loops
Start location: l8
  29: l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: 2*n3
  30: l1 -> [9] : (x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: NONTERM
  31: l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: 2*n5
  32: l1 -> [9] : (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0), cost: NONTERM
  34: l1 -> [9] : (2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM
  36: l1 -> [9] : (x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM
  38: l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n11 >= 0), cost: 2+4*n11
  39: l1 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n13 >= 0), cost: 4*n13
  40: l1 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+n13 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n13
  41: l1 -> l1 : x_5^0'=-1+x_5^330, (-1+x_5^0 >= 0 /\ -2+x_5^330 >= 0 /\ -1+n15 >= 0), cost: 4*n15
  42: l1 -> l1 : x_5^0'=-1+x_5^330, (-2+x_5^330 >= 0 /\ 1+x_5^0 <= 0 /\ -1+n15 >= 0), cost: 2+4*n15
  44: l1 -> l1 : x_5^0'=1+x_5^30, (-1+n17 >= 0 /\ x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n17
  45: l1 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ -1+x_5^0 >= 0), cost: 4*n19
  46: l1 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n19
  47: l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -1+x_5^0 >= 0 /\ -2+x_5^330 >= 0), cost: 4*n21
  48: l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -2+x_5^330 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n21
  62: l1 -> [9] : (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: NONTERM
  64: l1 -> [9] : (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: NONTERM
  69: l1 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2*n7
  70: l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: 2*n9
  71: l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+n23 >= 0 /\ 1+x_5^0 <= 0), cost: 4*n23
  72: l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+n23 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n23
  73: l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ x_5^310 <= 0 /\ 1+x_5^0 <= 0), cost: 4*n25
  74: l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ x_5^310 <= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n25
  76: l1 -> l1 : x_5^0'=-1+x_5^330, (x_5^330 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n27 >= 0), cost: 2+4*n27
  77: l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n29 >= 0), cost: 4*n29
  78: l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+x_5^0 >= 0 /\ -1+n29 >= 0), cost: 2+4*n29
  79: l1 -> l1 : x_5^0'=-1+x_5^310, (x_5^310 <= 0 /\ -1+n31 >= 0 /\ 1+x_5^0 <= 0), cost: 4*n31
  80: l1 -> l1 : x_5^0'=-1+x_5^310, (x_5^310 <= 0 /\ -1+n31 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n31
  82: l1 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n33
  84: l1 -> [9] : (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM
  86: l1 -> [9] : (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM
  24: l8 -> l1 : TRUE, cost: 2


Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: 2*n3
New rule:
l8 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: 2+2*n3

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [9] : (x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: NONTERM
New rule:
l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: 2*n5
New rule:
l8 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: 2+2*n5

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [9] : (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0), cost: NONTERM
New rule:
l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [9] : (2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM
New rule:
l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [9] : (x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM
New rule:
l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n11 >= 0), cost: 2+4*n11
New rule:
l8 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n11 >= 0), cost: 4+4*n11

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n13 >= 0), cost: 4*n13
New rule:
l8 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n13 >= 0), cost: 2+4*n13

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+n13 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n13
New rule:
l8 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+n13 >= 0 /\ 1+x_5^0 <= 0), cost: 4+4*n13

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+x_5^0 >= 0 /\ -2+x_5^330 >= 0 /\ -1+n15 >= 0), cost: 4*n15
New rule:
l8 -> l1 : x_5^0'=-1+x_5^330, (-1+x_5^0 >= 0 /\ -2+x_5^330 >= 0 /\ -1+n15 >= 0), cost: 2+4*n15

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-2+x_5^330 >= 0 /\ 1+x_5^0 <= 0 /\ -1+n15 >= 0), cost: 2+4*n15
New rule:
l8 -> l1 : x_5^0'=-1+x_5^330, (-2+x_5^330 >= 0 /\ 1+x_5^0 <= 0 /\ -1+n15 >= 0), cost: 4+4*n15

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, (-1+n17 >= 0 /\ x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n17
New rule:
l8 -> l1 : x_5^0'=1+x_5^30, (-1+n17 >= 0 /\ x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: 4+4*n17

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ -1+x_5^0 >= 0), cost: 4*n19
New rule:
l8 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n19

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n19
New rule:
l8 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ 1+x_5^0 <= 0), cost: 4+4*n19

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -1+x_5^0 >= 0 /\ -2+x_5^330 >= 0), cost: 4*n21
New rule:
l8 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -1+x_5^0 >= 0 /\ -2+x_5^330 >= 0), cost: 2+4*n21

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -2+x_5^330 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n21
New rule:
l8 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -2+x_5^330 >= 0 /\ 1+x_5^0 <= 0), cost: 4+4*n21

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [9] : (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: NONTERM
New rule:
l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [9] : (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: NONTERM
New rule:
l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2*n7
New rule:
l8 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2+2*n7

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: 2*n9
New rule:
l8 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: 2+2*n9

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+n23 >= 0 /\ 1+x_5^0 <= 0), cost: 4*n23
New rule:
l8 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+n23 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n23

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+n23 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n23
New rule:
l8 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+n23 >= 0 /\ -1+x_5^0 >= 0), cost: 4+4*n23

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ x_5^310 <= 0 /\ 1+x_5^0 <= 0), cost: 4*n25
New rule:
l8 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ x_5^310 <= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n25

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ x_5^310 <= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n25
New rule:
l8 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ x_5^310 <= 0 /\ -1+x_5^0 >= 0), cost: 4+4*n25

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^330, (x_5^330 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n27 >= 0), cost: 2+4*n27
New rule:
l8 -> l1 : x_5^0'=-1+x_5^330, (x_5^330 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n27 >= 0), cost: 4+4*n27

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n29 >= 0), cost: 4*n29
New rule:
l8 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n29 >= 0), cost: 2+4*n29

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+x_5^0 >= 0 /\ -1+n29 >= 0), cost: 2+4*n29
New rule:
l8 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+x_5^0 >= 0 /\ -1+n29 >= 0), cost: 4+4*n29

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (x_5^310 <= 0 /\ -1+n31 >= 0 /\ 1+x_5^0 <= 0), cost: 4*n31
New rule:
l8 -> l1 : x_5^0'=-1+x_5^310, (x_5^310 <= 0 /\ -1+n31 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n31

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=-1+x_5^310, (x_5^310 <= 0 /\ -1+n31 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n31
New rule:
l8 -> l1 : x_5^0'=-1+x_5^310, (x_5^310 <= 0 /\ -1+n31 >= 0 /\ -1+x_5^0 >= 0), cost: 4+4*n31

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n33
New rule:
l8 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 4+4*n33

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [9] : (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM
New rule:
l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM

Applied chaining
First rule:
l8 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [9] : (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: NONTERM
New rule:
l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM

Applied deletion
Removed the following rules: 29 30 31 32 34 36 38 39 40 41 42 44 45 46 47 48 62 64 69 70 71 72 73 74 76 77 78 79 80 82 84 86

Chained accelerated rules with incoming rules
Start location: l8
  24: l8 -> l1 : TRUE, cost: 2
  87: l8 -> l1 : x_5^0'=1+x_5^30, (x_5^30 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n3 >= 0), cost: 2+2*n3
  88: l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM
  89: l8 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n5 >= 0), cost: 2+2*n5
  90: l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM
  91: l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM
  92: l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM
  93: l8 -> l1 : x_5^0'=-1+x_5^310, (-2+x_5^310 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n11 >= 0), cost: 4+4*n11
  94: l8 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+x_5^0 >= 0 /\ -1+n13 >= 0), cost: 2+4*n13
  95: l8 -> l1 : x_5^0'=1+x_5^320, (x_5^320 >= 0 /\ -1+n13 >= 0 /\ 1+x_5^0 <= 0), cost: 4+4*n13
  96: l8 -> l1 : x_5^0'=-1+x_5^330, (-1+x_5^0 >= 0 /\ -2+x_5^330 >= 0 /\ -1+n15 >= 0), cost: 2+4*n15
  97: l8 -> l1 : x_5^0'=-1+x_5^330, (-2+x_5^330 >= 0 /\ 1+x_5^0 <= 0 /\ -1+n15 >= 0), cost: 4+4*n15
  98: l8 -> l1 : x_5^0'=1+x_5^30, (-1+n17 >= 0 /\ x_5^30 >= 0 /\ -1+x_5^0 >= 0), cost: 4+4*n17
  99: l8 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*n19
 100: l8 -> l1 : x_5^0'=1+x_5^320, (-1+n19 >= 0 /\ x_5^320 >= 0 /\ 1+x_5^0 <= 0), cost: 4+4*n19
 101: l8 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -1+x_5^0 >= 0 /\ -2+x_5^330 >= 0), cost: 2+4*n21
 102: l8 -> l1 : x_5^0'=-1+x_5^330, (-1+n21 >= 0 /\ -2+x_5^330 >= 0 /\ 1+x_5^0 <= 0), cost: 4+4*n21
 103: l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM
 104: l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM
 105: l8 -> l1 : x_5^0'=1+x_5^320, (-1+n7 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 2+2*n7
 106: l8 -> l1 : x_5^0'=-1+x_5^330, (-1+n9 >= 0 /\ x_5^330 <= 0 /\ 1+x_5^0 <= 0), cost: 2+2*n9
 107: l8 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+n23 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n23
 108: l8 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+n23 >= 0 /\ -1+x_5^0 >= 0), cost: 4+4*n23
 109: l8 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ x_5^310 <= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n25
 110: l8 -> l1 : x_5^0'=-1+x_5^310, (-1+n25 >= 0 /\ x_5^310 <= 0 /\ -1+x_5^0 >= 0), cost: 4+4*n25
 111: l8 -> l1 : x_5^0'=-1+x_5^330, (x_5^330 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n27 >= 0), cost: 4+4*n27
 112: l8 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ 1+x_5^0 <= 0 /\ -1+n29 >= 0), cost: 2+4*n29
 113: l8 -> l1 : x_5^0'=1+x_5^30, (2+x_5^30 <= 0 /\ -1+x_5^0 >= 0 /\ -1+n29 >= 0), cost: 4+4*n29
 114: l8 -> l1 : x_5^0'=-1+x_5^310, (x_5^310 <= 0 /\ -1+n31 >= 0 /\ 1+x_5^0 <= 0), cost: 2+4*n31
 115: l8 -> l1 : x_5^0'=-1+x_5^310, (x_5^310 <= 0 /\ -1+n31 >= 0 /\ -1+x_5^0 >= 0), cost: 4+4*n31
 116: l8 -> l1 : x_5^0'=1+x_5^320, (-1+n33 >= 0 /\ 2+x_5^320 <= 0 /\ 1+x_5^0 <= 0), cost: 4+4*n33
 117: l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM
 118: l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM


Removed unreachable locations and irrelevant leafs
Start location: l8
  88: l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM
  90: l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM
  91: l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM
  92: l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM
 103: l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM
 104: l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM
 117: l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM
 118: l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM


Removed duplicate rules (ignoring updates)
Start location: l8
 104: l8 -> [9] : -1+x_5^0 >= 0, cost: NONTERM
 118: l8 -> [9] : 1+x_5^0 <= 0, cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 104 via SMT.

Proved the following lower bound
Complexity:  Nonterm
Cpx degree: Nonterm

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  -1+x_5^0 >= 0