NO

Initial ITS
Start location: l9
   0: l0 -> l1 : n^0'=n^post0, R^0'=R^post0, dobreak^0'=dobreak^post0, A^0'=A^post0, ___rho_1_^0'=___rho_1_^post0, (0 == 0 /\ -___rho_1_^post0+n^post0 == 0 /\ -dobreak^post0+dobreak^0 == 0 /\ A^post0 == 0 /\ dobreak^0 <= 0 /\ -1+A^10 == 0 /\ R^0-R^post0 == 0), cost: 1
   1: l0 -> l2 : n^0'=n^post1, R^0'=R^post1, dobreak^0'=dobreak^post1, A^0'=A^post1, ___rho_1_^0'=___rho_1_^post1, (1-dobreak^0 <= 0 /\ R^0-R^post1 == 0 /\ -A^post1+A^0 == 0 /\ dobreak^0-dobreak^post1 == 0 /\ -___rho_1_^post1+___rho_1_^0 == 0 /\ n^0-n^post1 == 0), cost: 1
   3: l1 -> l4 : n^0'=n^post3, R^0'=R^post3, dobreak^0'=dobreak^post3, A^0'=A^post3, ___rho_1_^0'=___rho_1_^post3, (R^0-R^post3 == 0 /\ -A^post3+A^0 == 0 /\ n^0-n^post3 == 0 /\ -___rho_1_^post3+___rho_1_^0 == 0 /\ dobreak^0-dobreak^post3 == 0), cost: 1
   5: l2 -> l7 : n^0'=n^post5, R^0'=R^post5, dobreak^0'=dobreak^post5, A^0'=A^post5, ___rho_1_^0'=___rho_1_^post5, (-A^post5+A^0 == 0 /\ -dobreak^post5+dobreak^0 == 0 /\ n^0-n^post5 == 0 /\ -___rho_1_^post5+___rho_1_^0 == 0 /\ R^0-R^post5 == 0), cost: 1
   2: l3 -> l0 : n^0'=n^post2, R^0'=R^post2, dobreak^0'=dobreak^post2, A^0'=A^post2, ___rho_1_^0'=___rho_1_^post2, (n^0-n^post2 == 0 /\ ___rho_1_^0-___rho_1_^post2 == 0 /\ -dobreak^post2+dobreak^0 == 0 /\ -R^post2+R^0 == 0 /\ A^0-A^post2 == 0), cost: 1
   7: l4 -> l1 : n^0'=n^post7, R^0'=R^post7, dobreak^0'=dobreak^post7, A^0'=A^post7, ___rho_1_^0'=___rho_1_^post7, (-dobreak^post7+dobreak^0 == 0 /\ -A^post7+A^0 == 0 /\ -___rho_1_^post7+___rho_1_^0 == 0 /\ 1-n^0+n^post7 == 0 /\ 1-n^0 <= 0 /\ R^0-R^post7 == 0), cost: 1
   8: l4 -> l3 : n^0'=n^post8, R^0'=R^post8, dobreak^0'=dobreak^post8, A^0'=A^post8, ___rho_1_^0'=___rho_1_^post8, (0 == 0 /\ n^0 <= 0 /\ R^post8 == 0 /\ n^0-n^post8 == 0 /\ A^0-A^post8 == 0 /\ -___rho_1_^post8+___rho_1_^0 == 0 /\ -1+R^10 == 0), cost: 1
   4: l5 -> l6 : n^0'=n^post4, R^0'=R^post4, dobreak^0'=dobreak^post4, A^0'=A^post4, ___rho_1_^0'=___rho_1_^post4, (dobreak^0-dobreak^post4 == 0 /\ n^0-n^post4 == 0 /\ A^0-A^post4 == 0 /\ -___rho_1_^post4+___rho_1_^0 == 0 /\ R^0-R^post4 == 0), cost: 1
   6: l7 -> l2 : n^0'=n^post6, R^0'=R^post6, dobreak^0'=dobreak^post6, A^0'=A^post6, ___rho_1_^0'=___rho_1_^post6, (A^0-A^post6 == 0 /\ -___rho_1_^post6+___rho_1_^0 == 0 /\ dobreak^0-dobreak^post6 == 0 /\ R^0-R^post6 == 0 /\ n^0-n^post6 == 0), cost: 1
   9: l8 -> l3 : n^0'=n^post9, R^0'=R^post9, dobreak^0'=dobreak^post9, A^0'=A^post9, ___rho_1_^0'=___rho_1_^post9, (0 == 0 /\ n^0-n^post9 == 0 /\ A^post9 == 0 /\ -___rho_1_^post9+___rho_1_^0 == 0 /\ R^post9 == 0), cost: 1
  10: l9 -> l8 : n^0'=n^post10, R^0'=R^post10, dobreak^0'=dobreak^post10, A^0'=A^post10, ___rho_1_^0'=___rho_1_^post10, (-A^post10+A^0 == 0 /\ dobreak^0-dobreak^post10 == 0 /\ -___rho_1_^post10+___rho_1_^0 == 0 /\ R^0-R^post10 == 0 /\ n^0-n^post10 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l9
   0: l0 -> l1 : n^0'=n^post0, R^0'=R^post0, dobreak^0'=dobreak^post0, A^0'=A^post0, ___rho_1_^0'=___rho_1_^post0, (0 == 0 /\ -___rho_1_^post0+n^post0 == 0 /\ -dobreak^post0+dobreak^0 == 0 /\ A^post0 == 0 /\ dobreak^0 <= 0 /\ -1+A^10 == 0 /\ R^0-R^post0 == 0), cost: 1
   1: l0 -> l2 : n^0'=n^post1, R^0'=R^post1, dobreak^0'=dobreak^post1, A^0'=A^post1, ___rho_1_^0'=___rho_1_^post1, (1-dobreak^0 <= 0 /\ R^0-R^post1 == 0 /\ -A^post1+A^0 == 0 /\ dobreak^0-dobreak^post1 == 0 /\ -___rho_1_^post1+___rho_1_^0 == 0 /\ n^0-n^post1 == 0), cost: 1
   3: l1 -> l4 : n^0'=n^post3, R^0'=R^post3, dobreak^0'=dobreak^post3, A^0'=A^post3, ___rho_1_^0'=___rho_1_^post3, (R^0-R^post3 == 0 /\ -A^post3+A^0 == 0 /\ n^0-n^post3 == 0 /\ -___rho_1_^post3+___rho_1_^0 == 0 /\ dobreak^0-dobreak^post3 == 0), cost: 1
   5: l2 -> l7 : n^0'=n^post5, R^0'=R^post5, dobreak^0'=dobreak^post5, A^0'=A^post5, ___rho_1_^0'=___rho_1_^post5, (-A^post5+A^0 == 0 /\ -dobreak^post5+dobreak^0 == 0 /\ n^0-n^post5 == 0 /\ -___rho_1_^post5+___rho_1_^0 == 0 /\ R^0-R^post5 == 0), cost: 1
   2: l3 -> l0 : n^0'=n^post2, R^0'=R^post2, dobreak^0'=dobreak^post2, A^0'=A^post2, ___rho_1_^0'=___rho_1_^post2, (n^0-n^post2 == 0 /\ ___rho_1_^0-___rho_1_^post2 == 0 /\ -dobreak^post2+dobreak^0 == 0 /\ -R^post2+R^0 == 0 /\ A^0-A^post2 == 0), cost: 1
   7: l4 -> l1 : n^0'=n^post7, R^0'=R^post7, dobreak^0'=dobreak^post7, A^0'=A^post7, ___rho_1_^0'=___rho_1_^post7, (-dobreak^post7+dobreak^0 == 0 /\ -A^post7+A^0 == 0 /\ -___rho_1_^post7+___rho_1_^0 == 0 /\ 1-n^0+n^post7 == 0 /\ 1-n^0 <= 0 /\ R^0-R^post7 == 0), cost: 1
   8: l4 -> l3 : n^0'=n^post8, R^0'=R^post8, dobreak^0'=dobreak^post8, A^0'=A^post8, ___rho_1_^0'=___rho_1_^post8, (0 == 0 /\ n^0 <= 0 /\ R^post8 == 0 /\ n^0-n^post8 == 0 /\ A^0-A^post8 == 0 /\ -___rho_1_^post8+___rho_1_^0 == 0 /\ -1+R^10 == 0), cost: 1
   6: l7 -> l2 : n^0'=n^post6, R^0'=R^post6, dobreak^0'=dobreak^post6, A^0'=A^post6, ___rho_1_^0'=___rho_1_^post6, (A^0-A^post6 == 0 /\ -___rho_1_^post6+___rho_1_^0 == 0 /\ dobreak^0-dobreak^post6 == 0 /\ R^0-R^post6 == 0 /\ n^0-n^post6 == 0), cost: 1
   9: l8 -> l3 : n^0'=n^post9, R^0'=R^post9, dobreak^0'=dobreak^post9, A^0'=A^post9, ___rho_1_^0'=___rho_1_^post9, (0 == 0 /\ n^0-n^post9 == 0 /\ A^post9 == 0 /\ -___rho_1_^post9+___rho_1_^0 == 0 /\ R^post9 == 0), cost: 1
  10: l9 -> l8 : n^0'=n^post10, R^0'=R^post10, dobreak^0'=dobreak^post10, A^0'=A^post10, ___rho_1_^0'=___rho_1_^post10, (-A^post10+A^0 == 0 /\ dobreak^0-dobreak^post10 == 0 /\ -___rho_1_^post10+___rho_1_^0 == 0 /\ R^0-R^post10 == 0 /\ n^0-n^post10 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : n^0'=n^post0, R^0'=R^post0, dobreak^0'=dobreak^post0, A^0'=A^post0, ___rho_1_^0'=___rho_1_^post0, (0 == 0 /\ -___rho_1_^post0+n^post0 == 0 /\ -dobreak^post0+dobreak^0 == 0 /\ A^post0 == 0 /\ dobreak^0 <= 0 /\ -1+A^10 == 0 /\ R^0-R^post0 == 0), cost: 1
New rule:
l0 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l0 -> l2 : n^0'=n^post1, R^0'=R^post1, dobreak^0'=dobreak^post1, A^0'=A^post1, ___rho_1_^0'=___rho_1_^post1, (1-dobreak^0 <= 0 /\ R^0-R^post1 == 0 /\ -A^post1+A^0 == 0 /\ dobreak^0-dobreak^post1 == 0 /\ -___rho_1_^post1+___rho_1_^0 == 0 /\ n^0-n^post1 == 0), cost: 1
New rule:
l0 -> l2 : -1+dobreak^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l0 : n^0'=n^post2, R^0'=R^post2, dobreak^0'=dobreak^post2, A^0'=A^post2, ___rho_1_^0'=___rho_1_^post2, (n^0-n^post2 == 0 /\ ___rho_1_^0-___rho_1_^post2 == 0 /\ -dobreak^post2+dobreak^0 == 0 /\ -R^post2+R^0 == 0 /\ A^0-A^post2 == 0), cost: 1
New rule:
l3 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l4 : n^0'=n^post3, R^0'=R^post3, dobreak^0'=dobreak^post3, A^0'=A^post3, ___rho_1_^0'=___rho_1_^post3, (R^0-R^post3 == 0 /\ -A^post3+A^0 == 0 /\ n^0-n^post3 == 0 /\ -___rho_1_^post3+___rho_1_^0 == 0 /\ dobreak^0-dobreak^post3 == 0), cost: 1
New rule:
l1 -> l4 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l7 : n^0'=n^post5, R^0'=R^post5, dobreak^0'=dobreak^post5, A^0'=A^post5, ___rho_1_^0'=___rho_1_^post5, (-A^post5+A^0 == 0 /\ -dobreak^post5+dobreak^0 == 0 /\ n^0-n^post5 == 0 /\ -___rho_1_^post5+___rho_1_^0 == 0 /\ R^0-R^post5 == 0), cost: 1
New rule:
l2 -> l7 : TRUE, cost: 1

Applied preprocessing
Original rule:
l7 -> l2 : n^0'=n^post6, R^0'=R^post6, dobreak^0'=dobreak^post6, A^0'=A^post6, ___rho_1_^0'=___rho_1_^post6, (A^0-A^post6 == 0 /\ -___rho_1_^post6+___rho_1_^0 == 0 /\ dobreak^0-dobreak^post6 == 0 /\ R^0-R^post6 == 0 /\ n^0-n^post6 == 0), cost: 1
New rule:
l7 -> l2 : TRUE, cost: 1

Applied preprocessing
Original rule:
l4 -> l1 : n^0'=n^post7, R^0'=R^post7, dobreak^0'=dobreak^post7, A^0'=A^post7, ___rho_1_^0'=___rho_1_^post7, (-dobreak^post7+dobreak^0 == 0 /\ -A^post7+A^0 == 0 /\ -___rho_1_^post7+___rho_1_^0 == 0 /\ 1-n^0+n^post7 == 0 /\ 1-n^0 <= 0 /\ R^0-R^post7 == 0), cost: 1
New rule:
l4 -> l1 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l3 : n^0'=n^post8, R^0'=R^post8, dobreak^0'=dobreak^post8, A^0'=A^post8, ___rho_1_^0'=___rho_1_^post8, (0 == 0 /\ n^0 <= 0 /\ R^post8 == 0 /\ n^0-n^post8 == 0 /\ A^0-A^post8 == 0 /\ -___rho_1_^post8+___rho_1_^0 == 0 /\ -1+R^10 == 0), cost: 1
New rule:
l4 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l8 -> l3 : n^0'=n^post9, R^0'=R^post9, dobreak^0'=dobreak^post9, A^0'=A^post9, ___rho_1_^0'=___rho_1_^post9, (0 == 0 /\ n^0-n^post9 == 0 /\ A^post9 == 0 /\ -___rho_1_^post9+___rho_1_^0 == 0 /\ R^post9 == 0), cost: 1
New rule:
l8 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l9 -> l8 : n^0'=n^post10, R^0'=R^post10, dobreak^0'=dobreak^post10, A^0'=A^post10, ___rho_1_^0'=___rho_1_^post10, (-A^post10+A^0 == 0 /\ dobreak^0-dobreak^post10 == 0 /\ -___rho_1_^post10+___rho_1_^0 == 0 /\ R^0-R^post10 == 0 /\ n^0-n^post10 == 0), cost: 1
New rule:
l9 -> l8 : TRUE, cost: 1

Simplified rules
Start location: l9
  11: l0 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 1
  12: l0 -> l2 : -1+dobreak^0 >= 0, cost: 1
  14: l1 -> l4 : TRUE, cost: 1
  15: l2 -> l7 : TRUE, cost: 1
  13: l3 -> l0 : TRUE, cost: 1
  17: l4 -> l1 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1
  18: l4 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 1
  16: l7 -> l2 : TRUE, cost: 1
  19: l8 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 1
  20: l9 -> l8 : TRUE, cost: 1


Eliminating location l8 by chaining:

Applied chaining
First rule:
l9 -> l8 : TRUE, cost: 1
Second rule:
l8 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 1
New rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2

Applied deletion
Removed the following rules: 19 20

Eliminating location l7 by chaining:

Applied chaining
First rule:
l2 -> l7 : TRUE, cost: 1
Second rule:
l7 -> l2 : TRUE, cost: 1
New rule:
l2 -> l2 : TRUE, cost: 2

Applied deletion
Removed the following rules: 15 16

Eliminated locations on linear paths
Start location: l9
  11: l0 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 1
  12: l0 -> l2 : -1+dobreak^0 >= 0, cost: 1
  14: l1 -> l4 : TRUE, cost: 1
  22: l2 -> l2 : TRUE, cost: 2
  13: l3 -> l0 : TRUE, cost: 1
  17: l4 -> l1 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1
  18: l4 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 1
  21: l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2


Applied nonterm
Original rule:
l2 -> l2 : TRUE, cost: 2
New rule:
l2 -> [10] : n >= 0, cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_AndAgc.txt

Applied deletion
Removed the following rules: 22

Accelerated simple loops
Start location: l9
  11: l0 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 1
  12: l0 -> l2 : -1+dobreak^0 >= 0, cost: 1
  14: l1 -> l4 : TRUE, cost: 1
  23: l2 -> [10] : n >= 0, cost: NONTERM
  13: l3 -> l0 : TRUE, cost: 1
  17: l4 -> l1 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1
  18: l4 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 1
  21: l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2


Applied chaining
First rule:
l0 -> l2 : -1+dobreak^0 >= 0, cost: 1
Second rule:
l2 -> [10] : n >= 0, cost: NONTERM
New rule:
l0 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM

Applied deletion
Removed the following rules: 23

Chained accelerated rules with incoming rules
Start location: l9
  11: l0 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 1
  12: l0 -> l2 : -1+dobreak^0 >= 0, cost: 1
  24: l0 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM
  14: l1 -> l4 : TRUE, cost: 1
  13: l3 -> l0 : TRUE, cost: 1
  17: l4 -> l1 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1
  18: l4 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 1
  21: l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2


Removed unreachable locations and irrelevant leafs
Start location: l9
  11: l0 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 1
  24: l0 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM
  14: l1 -> l4 : TRUE, cost: 1
  13: l3 -> l0 : TRUE, cost: 1
  17: l4 -> l1 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1
  18: l4 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 1
  21: l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2


Eliminating location l0 by chaining:

Applied chaining
First rule:
l3 -> l0 : TRUE, cost: 1
Second rule:
l0 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 1
New rule:
l3 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 2

Applied chaining
First rule:
l3 -> l0 : TRUE, cost: 1
Second rule:
l0 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM
New rule:
l3 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM

Applied deletion
Removed the following rules: 11 13 24

Eliminating location l4 by chaining:

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

Applied chaining
First rule:
l1 -> l4 : TRUE, cost: 1
Second rule:
l4 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 1
New rule:
l1 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 14 17 18

Eliminated locations on tree-shaped paths
Start location: l9
  27: l1 -> l1 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 2
  28: l1 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 2
  25: l3 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 2
  26: l3 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM
  21: l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2


Applied acceleration
Original rule:
l1 -> l1 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 2
New rule:
l1 -> l1 : n^0'=n^0-n0, (n0 >= 0 /\ n^0-n0 >= 0), cost: 2*n0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_feDIic.txt

Applied instantiation
Original rule:
l1 -> l1 : n^0'=n^0-n0, (n0 >= 0 /\ n^0-n0 >= 0), cost: 2*n0
New rule:
l1 -> l1 : n^0'=0, (0 >= 0 /\ n^0 >= 0), cost: 2*n^0

Applied simplification
Original rule:
l1 -> l1 : n^0'=0, (0 >= 0 /\ n^0 >= 0), cost: 2*n^0
New rule:
l1 -> l1 : n^0'=0, n^0 >= 0, cost: 2*n^0

Applied deletion
Removed the following rules: 27

Accelerated simple loops
Start location: l9
  28: l1 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 2
  30: l1 -> l1 : n^0'=0, n^0 >= 0, cost: 2*n^0
  25: l3 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 2
  26: l3 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM
  21: l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2


Applied chaining
First rule:
l3 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 2
Second rule:
l1 -> l1 : n^0'=0, n^0 >= 0, cost: 2*n^0
New rule:
l3 -> l1 : n^0'=0, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 2+2*n^post0

Applied deletion
Removed the following rules: 30

Chained accelerated rules with incoming rules
Start location: l9
  28: l1 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 2
  25: l3 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 2
  26: l3 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM
  31: l3 -> l1 : n^0'=0, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 2+2*n^post0
  21: l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2


Eliminating location l1 by chaining:

Applied chaining
First rule:
l3 -> l1 : n^0'=n^post0, A^0'=0, ___rho_1_^0'=n^post0, dobreak^0 <= 0, cost: 2
Second rule:
l1 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 2
New rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 <= 0), cost: 4

Applied chaining
First rule:
l3 -> l1 : n^0'=0, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 2+2*n^post0
Second rule:
l1 -> l3 : R^0'=0, dobreak^0'=dobreak^post8, n^0 <= 0, cost: 2
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (0 <= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0

Applied simplification
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (0 <= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0

Applied deletion
Removed the following rules: 25 28 31

Eliminated locations on tree-shaped paths
Start location: l9
  26: l3 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM
  32: l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 <= 0), cost: 4
  33: l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0
  21: l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2


Applied acceleration
Original rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 <= 0), cost: 4
New rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n1
Sub-proof via acceration calculus written to file:///tmp/tmpnam_DbGOJI.txt

Applied nonterm
Original rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 <= 0), cost: 4
New rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -n^post0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_cfabbe.txt

Applied acceleration
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-dobreak^0 >= 0 /\ -1+n2 >= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n2+2*n2*n^post0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_kleehP.txt

Applied nonterm
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0
New rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ n^post0 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_cEMGMn.txt

Applied chaining
First rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0
Second rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 <= 0), cost: 4
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 8

Applied acceleration
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 8
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-dobreak^0 >= 0 /\ -1+n3 >= 0 /\ -dobreak^post8 >= 0), cost: 8*n3
Sub-proof via acceration calculus written to file:///tmp/tmpnam_OmaNEf.txt

Applied nonterm
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 8
New rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_jAMbMp.txt

Applied chaining
First rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 <= 0), cost: 4
Second rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (0 <= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM

Applied chaining
First rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 <= 0), cost: 4
Second rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 8

Applied acceleration
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 8
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-dobreak^0 >= 0 /\ -1+n4 >= 0 /\ -dobreak^post8 >= 0), cost: 8*n4
Sub-proof via acceration calculus written to file:///tmp/tmpnam_aedDgc.txt

Applied nonterm
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 8
New rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_EeNnho.txt

Applied chaining
First rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0
Second rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (0 <= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM

Applied chaining
First rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0
Second rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n1
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n1

Applied acceleration
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n1
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -1+n5 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n5+4*n5*n1
Sub-proof via acceration calculus written to file:///tmp/tmpnam_jclGOC.txt

Applied nonterm
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n1
New rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_JJkLjD.txt

Applied chaining
First rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n1
Second rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (0 <= 0 /\ -dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM

Applied chaining
First rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n1
Second rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n1

Applied acceleration
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n1
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -1+n6 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n1*n6+4*n6
Sub-proof via acceration calculus written to file:///tmp/tmpnam_DGPldn.txt

Applied nonterm
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n1
New rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_fkOaki.txt

Applied chaining
First rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 >= 0), cost: 4+2*n^post0
Second rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (0 <= 0 /\ -1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM

Applied chaining
First rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 <= 0), cost: 4
Second rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-dobreak^0 >= 0 /\ -1+n2 >= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n2+2*n2*n^post0
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n2

Applied acceleration
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n2
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-dobreak^0 >= 0 /\ -1+n2 >= 0 /\ -1+n7 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n7+4*n7*n2
Sub-proof via acceration calculus written to file:///tmp/tmpnam_EKAIgh.txt

Applied nonterm
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n2
New rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -1+n2 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_GlGbfI.txt

Applied chaining
First rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-dobreak^0 >= 0 /\ -1+n2 >= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n2+2*n2*n^post0
Second rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -1+n2 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (0 <= 0 /\ -dobreak^0 >= 0 /\ -1+n2 >= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM

Applied chaining
First rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-dobreak^0 >= 0 /\ -1+n2 >= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n2+2*n2*n^post0
Second rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 <= 0), cost: 4
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n2

Applied acceleration
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n2
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-dobreak^0 >= 0 /\ -1+n2 >= 0 /\ -1+n8 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n2*n8+4*n8
Sub-proof via acceration calculus written to file:///tmp/tmpnam_lhaAIe.txt

Applied nonterm
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=0, (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post8 <= 0), cost: 4+4*n2
New rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -1+n2 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_aFfdEb.txt

Applied chaining
First rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (dobreak^0 <= 0 /\ n^post0 <= 0), cost: 4
Second rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -1+n2 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (0 <= 0 /\ -1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n1
New rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: 4*n1

Applied simplification
Original rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -n^post0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0), cost: NONTERM
New rule:
l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-dobreak^0 >= 0 /\ -1+n2 >= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: 4*n2+2*n2*n^post0
New rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: 4*n2+2*n2*n^post0

Applied simplification
Original rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ n^post0 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> [12] : (0 <= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> [12] : (0 <= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (-1+n1 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> [12] : (0 <= 0 /\ -dobreak^0 >= 0 /\ -1+n1 >= 0 /\ -n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> [12] : (0 <= 0 /\ -1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> [12] : (-dobreak^0 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ -1+n2 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ -1+n2 >= 0 /\ dobreak^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> [12] : (0 <= 0 /\ -dobreak^0 >= 0 /\ -1+n2 >= 0 /\ n^post0 >= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: NONTERM

Applied simplification
Original rule:
l3 -> [12] : (0 <= 0 /\ -1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ -dobreak^post8 >= 0), cost: NONTERM
New rule:
l3 -> [12] : (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: NONTERM

Applied deletion
Removed the following rules: 32 33

Accelerated simple loops
Start location: l9
  26: l3 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM
  47: l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: 4*n1
  48: l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0), cost: NONTERM
  49: l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: 4*n2+2*n2*n^post0
  50: l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0), cost: NONTERM
  51: l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0), cost: NONTERM
  52: l3 -> [12] : (dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: NONTERM
  53: l3 -> [12] : (dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: NONTERM
  54: l3 -> [12] : (-1+n1 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0), cost: NONTERM
  55: l3 -> [12] : (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: NONTERM
  56: l3 -> [12] : (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: NONTERM
  57: l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ -1+n2 >= 0 /\ dobreak^0 <= 0), cost: NONTERM
  58: l3 -> [12] : (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: NONTERM
  59: l3 -> [12] : (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: NONTERM
  21: l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2


Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: 4*n1
New rule:
l9 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n1 >= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: 2+4*n1

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: 4*n2+2*n2*n^post0
New rule:
l9 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n2 >= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: 2+4*n2+2*n2*n^post0

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (-1+n1 >= 0 /\ -dobreak^0+dobreak^post8 <= 0 /\ dobreak^0 <= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (-1+n1 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (-dobreak^0+dobreak^post8 <= 0 /\ -1+n2 >= 0 /\ dobreak^0 <= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [12] : (-1+n2 >= 0 /\ dobreak^0 <= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: NONTERM
New rule:
l9 -> [12] : 0 == 0, cost: NONTERM

Applied deletion
Removed the following rules: 47 48 49 50 51 52 53 54 55 56 57 58 59

Chained accelerated rules with incoming rules
Start location: l9
  26: l3 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM
  21: l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
  60: l9 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n1 >= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: 2+4*n1
  61: l9 -> [12] : 0 == 0, cost: NONTERM
  62: l9 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n2 >= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: 2+4*n2+2*n2*n^post0


Eliminating location l3 by chaining:

Applied chaining
First rule:
l9 -> l3 : R^0'=0, dobreak^0'=dobreak^post9, A^0'=0, 0 == 0, cost: 2
Second rule:
l3 -> [10] : -1+dobreak^0 >= 0, cost: NONTERM
New rule:
l9 -> [10] : (0 == 0 /\ -1+dobreak^post9 >= 0), cost: NONTERM

Applied simplification
Original rule:
l9 -> [10] : (0 == 0 /\ -1+dobreak^post9 >= 0), cost: NONTERM
New rule:
l9 -> [10] : -1+dobreak^post9 >= 0, cost: NONTERM

Applied partial deletion
Original rule:
l9 -> l3 : n^0'=n^post0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n1 >= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: 2+4*n1
New rule:
l9 -> [13] : (-1+n1 >= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: 2+4*n1

Applied partial deletion
Original rule:
l9 -> l3 : n^0'=0, R^0'=0, dobreak^0'=dobreak^post8, A^0'=0, ___rho_1_^0'=n^post0, (-1+n2 >= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: 2+4*n2+2*n2*n^post0
New rule:
l9 -> [13] : (-1+n2 >= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: 2+4*n2+2*n2*n^post0

Applied deletion
Removed the following rules: 21 26 60 62

Eliminated locations on tree-shaped paths
Start location: l9
  61: l9 -> [12] : 0 == 0, cost: NONTERM
  63: l9 -> [10] : -1+dobreak^post9 >= 0, cost: NONTERM
  64: l9 -> [13] : (-1+n1 >= 0 /\ n^post0 <= 0 /\ dobreak^post8 <= 0), cost: 2+4*n1
  65: l9 -> [13] : (-1+n2 >= 0 /\ n^post0 >= 0 /\ dobreak^post8 <= 0), cost: 2+4*n2+2*n2*n^post0


Computing asymptotic complexity
Proved nontermination of rule 61 via SMT.

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

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  0 == 0