NO

Initial ITS
Start location: l13
   0: l0 -> l1 : tmp_7^0'=tmp_7^post0, y_6^0'=y_6^post0, Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (y_6^0-y_6^post0 == 0 /\ tmp_7^0-tmp_7^post0 == 0 /\ x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1
   1: l1 -> l3 : tmp_7^0'=tmp_7^post1, y_6^0'=y_6^post1, Result_4^0'=Result_4^post1, x_5^0'=x_5^post1, (Result_4^0-Result_4^post1 == 0 /\ y_6^0-y_6^post1 == 0 /\ y_6^0-x_5^0 <= 0 /\ tmp_7^0-tmp_7^post1 == 0 /\ -x_5^post1+x_5^0 == 0), cost: 1
   5: l1 -> l5 : tmp_7^0'=tmp_7^post5, y_6^0'=y_6^post5, Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (0 == 0 /\ y_6^0-y_6^post5 == 0 /\ -tmp_7^post5 <= 0 /\ tmp_7^post5 <= 0 /\ x_5^0-x_5^post5 == 0 /\ y_6^0-x_5^0 <= 0 /\ Result_4^0-Result_4^post5 == 0 /\ -y_6^0+x_5^0 <= 0), cost: 1
   7: l1 -> l7 : tmp_7^0'=tmp_7^post7, y_6^0'=y_6^post7, Result_4^0'=Result_4^post7, x_5^0'=x_5^post7, (0 == 0 /\ -x_5^post7+x_5^0 == 0 /\ y_6^0-x_5^0 <= 0 /\ -Result_4^post7+Result_4^0 == 0 /\ -y_6^post7+y_6^0 == 0 /\ -y_6^0+x_5^0 <= 0), cost: 1
  12: l1 -> l9 : tmp_7^0'=tmp_7^post12, y_6^0'=y_6^post12, Result_4^0'=Result_4^post12, x_5^0'=x_5^post12, (0 == 0 /\ -y_6^post12+y_6^0 == 0 /\ -tmp_7^post12 <= 0 /\ -Result_4^post12+Result_4^0 == 0 /\ -x_5^post12+x_5^0 == 0 /\ 1-y_6^0+x_5^0 <= 0 /\ tmp_7^post12 <= 0), cost: 1
  14: l1 -> l11 : tmp_7^0'=tmp_7^post14, y_6^0'=y_6^post14, Result_4^0'=Result_4^post14, x_5^0'=x_5^post14, (0 == 0 /\ Result_4^0-Result_4^post14 == 0 /\ -x_5^post14+x_5^0 == 0 /\ y_6^0-y_6^post14 == 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 1
   2: l3 -> l4 : tmp_7^0'=tmp_7^post2, y_6^0'=y_6^post2, Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (-y_6^post2+y_6^0 == 0 /\ tmp_7^0-tmp_7^post2 == 0 /\ -Result_4^post2+Result_4^0 == 0 /\ -x_5^post2+x_5^0 == 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 1
   3: l3 -> l4 : tmp_7^0'=tmp_7^post3, y_6^0'=y_6^post3, Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (-Result_4^post3+Result_4^0 == 0 /\ -x_5^post3+x_5^0 == 0 /\ -y_6^post3+y_6^0 == 0 /\ tmp_7^0-tmp_7^post3 == 0 /\ 1+y_6^0-x_5^0 <= 0), cost: 1
   4: l4 -> l2 : tmp_7^0'=tmp_7^post4, y_6^0'=y_6^post4, Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (0 == 0 /\ -x_5^post4+x_5^0 == 0 /\ -y_6^post4+y_6^0 == 0 /\ -tmp_7^post4+tmp_7^0 == 0), cost: 1
   6: l5 -> l1 : tmp_7^0'=tmp_7^post6, y_6^0'=y_6^post6, Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (tmp_7^0-tmp_7^post6 == 0 /\ Result_4^0-Result_4^post6 == 0 /\ y_6^0-y_6^post6 == 0 /\ -x_5^post6+x_5^0 == 0), cost: 1
   8: l7 -> l8 : tmp_7^0'=tmp_7^post8, y_6^0'=y_6^post8, Result_4^0'=Result_4^post8, x_5^0'=x_5^post8, (x_5^0-x_5^post8 == 0 /\ 1+tmp_7^0 <= 0 /\ -Result_4^post8+Result_4^0 == 0 /\ -tmp_7^post8+tmp_7^0 == 0 /\ y_6^0-y_6^post8 == 0), cost: 1
   9: l7 -> l8 : tmp_7^0'=tmp_7^post9, y_6^0'=y_6^post9, Result_4^0'=Result_4^post9, x_5^0'=x_5^post9, (-x_5^post9+x_5^0 == 0 /\ y_6^0-y_6^post9 == 0 /\ tmp_7^0-tmp_7^post9 == 0 /\ 1-tmp_7^0 <= 0 /\ Result_4^0-Result_4^post9 == 0), cost: 1
  10: l8 -> l6 : tmp_7^0'=tmp_7^post10, y_6^0'=y_6^post10, Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (tmp_7^0-tmp_7^post10 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ -1+x_5^post10-x_5^0 == 0 /\ y_6^0-y_6^post10 == 0), cost: 1
  11: l6 -> l1 : tmp_7^0'=tmp_7^post11, y_6^0'=y_6^post11, Result_4^0'=Result_4^post11, x_5^0'=x_5^post11, (-y_6^post11+y_6^0 == 0 /\ tmp_7^0-tmp_7^post11 == 0 /\ -Result_4^post11+Result_4^0 == 0 /\ -x_5^post11+x_5^0 == 0), cost: 1
  13: l9 -> l1 : tmp_7^0'=tmp_7^post13, y_6^0'=y_6^post13, Result_4^0'=Result_4^post13, x_5^0'=x_5^post13, (tmp_7^0-tmp_7^post13 == 0 /\ x_5^0-x_5^post13 == 0 /\ Result_4^0-Result_4^post13 == 0 /\ y_6^0-y_6^post13 == 0), cost: 1
  15: l11 -> l12 : tmp_7^0'=tmp_7^post15, y_6^0'=y_6^post15, Result_4^0'=Result_4^post15, x_5^0'=x_5^post15, (-y_6^post15+y_6^0 == 0 /\ -Result_4^post15+Result_4^0 == 0 /\ 1+tmp_7^0 <= 0 /\ -x_5^post15+x_5^0 == 0 /\ tmp_7^0-tmp_7^post15 == 0), cost: 1
  16: l11 -> l12 : tmp_7^0'=tmp_7^post16, y_6^0'=y_6^post16, Result_4^0'=Result_4^post16, x_5^0'=x_5^post16, (-Result_4^post16+Result_4^0 == 0 /\ -y_6^post16+y_6^0 == 0 /\ -tmp_7^post16+tmp_7^0 == 0 /\ -x_5^post16+x_5^0 == 0 /\ 1-tmp_7^0 <= 0), cost: 1
  17: l12 -> l10 : tmp_7^0'=tmp_7^post17, y_6^0'=y_6^post17, Result_4^0'=Result_4^post17, x_5^0'=x_5^post17, (y_6^0-y_6^post17 == 0 /\ tmp_7^0-tmp_7^post17 == 0 /\ -1-x_5^0+x_5^post17 == 0 /\ Result_4^0-Result_4^post17 == 0), cost: 1
  18: l10 -> l1 : tmp_7^0'=tmp_7^post18, y_6^0'=y_6^post18, Result_4^0'=Result_4^post18, x_5^0'=x_5^post18, (Result_4^0-Result_4^post18 == 0 /\ y_6^0-y_6^post18 == 0 /\ tmp_7^0-tmp_7^post18 == 0 /\ -x_5^post18+x_5^0 == 0), cost: 1
  19: l13 -> l0 : tmp_7^0'=tmp_7^post19, y_6^0'=y_6^post19, Result_4^0'=Result_4^post19, x_5^0'=x_5^post19, (tmp_7^0-tmp_7^post19 == 0 /\ Result_4^0-Result_4^post19 == 0 /\ -x_5^post19+x_5^0 == 0 /\ y_6^0-y_6^post19 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l13
   0: l0 -> l1 : tmp_7^0'=tmp_7^post0, y_6^0'=y_6^post0, Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (y_6^0-y_6^post0 == 0 /\ tmp_7^0-tmp_7^post0 == 0 /\ x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1
   5: l1 -> l5 : tmp_7^0'=tmp_7^post5, y_6^0'=y_6^post5, Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (0 == 0 /\ y_6^0-y_6^post5 == 0 /\ -tmp_7^post5 <= 0 /\ tmp_7^post5 <= 0 /\ x_5^0-x_5^post5 == 0 /\ y_6^0-x_5^0 <= 0 /\ Result_4^0-Result_4^post5 == 0 /\ -y_6^0+x_5^0 <= 0), cost: 1
   7: l1 -> l7 : tmp_7^0'=tmp_7^post7, y_6^0'=y_6^post7, Result_4^0'=Result_4^post7, x_5^0'=x_5^post7, (0 == 0 /\ -x_5^post7+x_5^0 == 0 /\ y_6^0-x_5^0 <= 0 /\ -Result_4^post7+Result_4^0 == 0 /\ -y_6^post7+y_6^0 == 0 /\ -y_6^0+x_5^0 <= 0), cost: 1
  12: l1 -> l9 : tmp_7^0'=tmp_7^post12, y_6^0'=y_6^post12, Result_4^0'=Result_4^post12, x_5^0'=x_5^post12, (0 == 0 /\ -y_6^post12+y_6^0 == 0 /\ -tmp_7^post12 <= 0 /\ -Result_4^post12+Result_4^0 == 0 /\ -x_5^post12+x_5^0 == 0 /\ 1-y_6^0+x_5^0 <= 0 /\ tmp_7^post12 <= 0), cost: 1
  14: l1 -> l11 : tmp_7^0'=tmp_7^post14, y_6^0'=y_6^post14, Result_4^0'=Result_4^post14, x_5^0'=x_5^post14, (0 == 0 /\ Result_4^0-Result_4^post14 == 0 /\ -x_5^post14+x_5^0 == 0 /\ y_6^0-y_6^post14 == 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 1
   6: l5 -> l1 : tmp_7^0'=tmp_7^post6, y_6^0'=y_6^post6, Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (tmp_7^0-tmp_7^post6 == 0 /\ Result_4^0-Result_4^post6 == 0 /\ y_6^0-y_6^post6 == 0 /\ -x_5^post6+x_5^0 == 0), cost: 1
   8: l7 -> l8 : tmp_7^0'=tmp_7^post8, y_6^0'=y_6^post8, Result_4^0'=Result_4^post8, x_5^0'=x_5^post8, (x_5^0-x_5^post8 == 0 /\ 1+tmp_7^0 <= 0 /\ -Result_4^post8+Result_4^0 == 0 /\ -tmp_7^post8+tmp_7^0 == 0 /\ y_6^0-y_6^post8 == 0), cost: 1
   9: l7 -> l8 : tmp_7^0'=tmp_7^post9, y_6^0'=y_6^post9, Result_4^0'=Result_4^post9, x_5^0'=x_5^post9, (-x_5^post9+x_5^0 == 0 /\ y_6^0-y_6^post9 == 0 /\ tmp_7^0-tmp_7^post9 == 0 /\ 1-tmp_7^0 <= 0 /\ Result_4^0-Result_4^post9 == 0), cost: 1
  10: l8 -> l6 : tmp_7^0'=tmp_7^post10, y_6^0'=y_6^post10, Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (tmp_7^0-tmp_7^post10 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ -1+x_5^post10-x_5^0 == 0 /\ y_6^0-y_6^post10 == 0), cost: 1
  11: l6 -> l1 : tmp_7^0'=tmp_7^post11, y_6^0'=y_6^post11, Result_4^0'=Result_4^post11, x_5^0'=x_5^post11, (-y_6^post11+y_6^0 == 0 /\ tmp_7^0-tmp_7^post11 == 0 /\ -Result_4^post11+Result_4^0 == 0 /\ -x_5^post11+x_5^0 == 0), cost: 1
  13: l9 -> l1 : tmp_7^0'=tmp_7^post13, y_6^0'=y_6^post13, Result_4^0'=Result_4^post13, x_5^0'=x_5^post13, (tmp_7^0-tmp_7^post13 == 0 /\ x_5^0-x_5^post13 == 0 /\ Result_4^0-Result_4^post13 == 0 /\ y_6^0-y_6^post13 == 0), cost: 1
  15: l11 -> l12 : tmp_7^0'=tmp_7^post15, y_6^0'=y_6^post15, Result_4^0'=Result_4^post15, x_5^0'=x_5^post15, (-y_6^post15+y_6^0 == 0 /\ -Result_4^post15+Result_4^0 == 0 /\ 1+tmp_7^0 <= 0 /\ -x_5^post15+x_5^0 == 0 /\ tmp_7^0-tmp_7^post15 == 0), cost: 1
  16: l11 -> l12 : tmp_7^0'=tmp_7^post16, y_6^0'=y_6^post16, Result_4^0'=Result_4^post16, x_5^0'=x_5^post16, (-Result_4^post16+Result_4^0 == 0 /\ -y_6^post16+y_6^0 == 0 /\ -tmp_7^post16+tmp_7^0 == 0 /\ -x_5^post16+x_5^0 == 0 /\ 1-tmp_7^0 <= 0), cost: 1
  17: l12 -> l10 : tmp_7^0'=tmp_7^post17, y_6^0'=y_6^post17, Result_4^0'=Result_4^post17, x_5^0'=x_5^post17, (y_6^0-y_6^post17 == 0 /\ tmp_7^0-tmp_7^post17 == 0 /\ -1-x_5^0+x_5^post17 == 0 /\ Result_4^0-Result_4^post17 == 0), cost: 1
  18: l10 -> l1 : tmp_7^0'=tmp_7^post18, y_6^0'=y_6^post18, Result_4^0'=Result_4^post18, x_5^0'=x_5^post18, (Result_4^0-Result_4^post18 == 0 /\ y_6^0-y_6^post18 == 0 /\ tmp_7^0-tmp_7^post18 == 0 /\ -x_5^post18+x_5^0 == 0), cost: 1
  19: l13 -> l0 : tmp_7^0'=tmp_7^post19, y_6^0'=y_6^post19, Result_4^0'=Result_4^post19, x_5^0'=x_5^post19, (tmp_7^0-tmp_7^post19 == 0 /\ Result_4^0-Result_4^post19 == 0 /\ -x_5^post19+x_5^0 == 0 /\ y_6^0-y_6^post19 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : tmp_7^0'=tmp_7^post0, y_6^0'=y_6^post0, Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (y_6^0-y_6^post0 == 0 /\ tmp_7^0-tmp_7^post0 == 0 /\ 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 -> l5 : tmp_7^0'=tmp_7^post5, y_6^0'=y_6^post5, Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (0 == 0 /\ y_6^0-y_6^post5 == 0 /\ -tmp_7^post5 <= 0 /\ tmp_7^post5 <= 0 /\ x_5^0-x_5^post5 == 0 /\ y_6^0-x_5^0 <= 0 /\ Result_4^0-Result_4^post5 == 0 /\ -y_6^0+x_5^0 <= 0), cost: 1
New rule:
l1 -> l5 : tmp_7^0'=0, y_6^0-x_5^0 == 0, cost: 1

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

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

Applied preprocessing
Original rule:
l7 -> l8 : tmp_7^0'=tmp_7^post8, y_6^0'=y_6^post8, Result_4^0'=Result_4^post8, x_5^0'=x_5^post8, (x_5^0-x_5^post8 == 0 /\ 1+tmp_7^0 <= 0 /\ -Result_4^post8+Result_4^0 == 0 /\ -tmp_7^post8+tmp_7^0 == 0 /\ y_6^0-y_6^post8 == 0), cost: 1
New rule:
l7 -> l8 : 1+tmp_7^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l7 -> l8 : tmp_7^0'=tmp_7^post9, y_6^0'=y_6^post9, Result_4^0'=Result_4^post9, x_5^0'=x_5^post9, (-x_5^post9+x_5^0 == 0 /\ y_6^0-y_6^post9 == 0 /\ tmp_7^0-tmp_7^post9 == 0 /\ 1-tmp_7^0 <= 0 /\ Result_4^0-Result_4^post9 == 0), cost: 1
New rule:
l7 -> l8 : -1+tmp_7^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l8 -> l6 : tmp_7^0'=tmp_7^post10, y_6^0'=y_6^post10, Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (tmp_7^0-tmp_7^post10 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ -1+x_5^post10-x_5^0 == 0 /\ y_6^0-y_6^post10 == 0), cost: 1
New rule:
l8 -> l6 : x_5^0'=1+x_5^0, TRUE, cost: 1

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

Applied preprocessing
Original rule:
l1 -> l9 : tmp_7^0'=tmp_7^post12, y_6^0'=y_6^post12, Result_4^0'=Result_4^post12, x_5^0'=x_5^post12, (0 == 0 /\ -y_6^post12+y_6^0 == 0 /\ -tmp_7^post12 <= 0 /\ -Result_4^post12+Result_4^0 == 0 /\ -x_5^post12+x_5^0 == 0 /\ 1-y_6^0+x_5^0 <= 0 /\ tmp_7^post12 <= 0), cost: 1
New rule:
l1 -> l9 : tmp_7^0'=0, 1-y_6^0+x_5^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l9 -> l1 : tmp_7^0'=tmp_7^post13, y_6^0'=y_6^post13, Result_4^0'=Result_4^post13, x_5^0'=x_5^post13, (tmp_7^0-tmp_7^post13 == 0 /\ x_5^0-x_5^post13 == 0 /\ Result_4^0-Result_4^post13 == 0 /\ y_6^0-y_6^post13 == 0), cost: 1
New rule:
l9 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l11 : tmp_7^0'=tmp_7^post14, y_6^0'=y_6^post14, Result_4^0'=Result_4^post14, x_5^0'=x_5^post14, (0 == 0 /\ Result_4^0-Result_4^post14 == 0 /\ -x_5^post14+x_5^0 == 0 /\ y_6^0-y_6^post14 == 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 1
New rule:
l1 -> l11 : tmp_7^0'=tmp_7^post14, 1-y_6^0+x_5^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l11 -> l12 : tmp_7^0'=tmp_7^post15, y_6^0'=y_6^post15, Result_4^0'=Result_4^post15, x_5^0'=x_5^post15, (-y_6^post15+y_6^0 == 0 /\ -Result_4^post15+Result_4^0 == 0 /\ 1+tmp_7^0 <= 0 /\ -x_5^post15+x_5^0 == 0 /\ tmp_7^0-tmp_7^post15 == 0), cost: 1
New rule:
l11 -> l12 : 1+tmp_7^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l11 -> l12 : tmp_7^0'=tmp_7^post16, y_6^0'=y_6^post16, Result_4^0'=Result_4^post16, x_5^0'=x_5^post16, (-Result_4^post16+Result_4^0 == 0 /\ -y_6^post16+y_6^0 == 0 /\ -tmp_7^post16+tmp_7^0 == 0 /\ -x_5^post16+x_5^0 == 0 /\ 1-tmp_7^0 <= 0), cost: 1
New rule:
l11 -> l12 : -1+tmp_7^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l12 -> l10 : tmp_7^0'=tmp_7^post17, y_6^0'=y_6^post17, Result_4^0'=Result_4^post17, x_5^0'=x_5^post17, (y_6^0-y_6^post17 == 0 /\ tmp_7^0-tmp_7^post17 == 0 /\ -1-x_5^0+x_5^post17 == 0 /\ Result_4^0-Result_4^post17 == 0), cost: 1
New rule:
l12 -> l10 : x_5^0'=1+x_5^0, TRUE, cost: 1

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

Applied preprocessing
Original rule:
l13 -> l0 : tmp_7^0'=tmp_7^post19, y_6^0'=y_6^post19, Result_4^0'=Result_4^post19, x_5^0'=x_5^post19, (tmp_7^0-tmp_7^post19 == 0 /\ Result_4^0-Result_4^post19 == 0 /\ -x_5^post19+x_5^0 == 0 /\ y_6^0-y_6^post19 == 0), cost: 1
New rule:
l13 -> l0 : TRUE, cost: 1

Simplified rules
Start location: l13
  20: l0 -> l1 : TRUE, cost: 1
  21: l1 -> l5 : tmp_7^0'=0, y_6^0-x_5^0 == 0, cost: 1
  23: l1 -> l7 : tmp_7^0'=tmp_7^post7, y_6^0-x_5^0 == 0, cost: 1
  28: l1 -> l9 : tmp_7^0'=0, 1-y_6^0+x_5^0 <= 0, cost: 1
  30: l1 -> l11 : tmp_7^0'=tmp_7^post14, 1-y_6^0+x_5^0 <= 0, cost: 1
  22: l5 -> l1 : TRUE, cost: 1
  24: l7 -> l8 : 1+tmp_7^0 <= 0, cost: 1
  25: l7 -> l8 : -1+tmp_7^0 >= 0, cost: 1
  26: l8 -> l6 : x_5^0'=1+x_5^0, TRUE, cost: 1
  27: l6 -> l1 : TRUE, cost: 1
  29: l9 -> l1 : TRUE, cost: 1
  31: l11 -> l12 : 1+tmp_7^0 <= 0, cost: 1
  32: l11 -> l12 : -1+tmp_7^0 >= 0, cost: 1
  33: l12 -> l10 : x_5^0'=1+x_5^0, TRUE, cost: 1
  34: l10 -> l1 : TRUE, cost: 1
  35: l13 -> l0 : TRUE, cost: 1


Eliminating location l0 by chaining:

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

Applied deletion
Removed the following rules: 20 35

Eliminating location l5 by chaining:

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

Applied deletion
Removed the following rules: 21 22

Eliminating location l9 by chaining:

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

Applied deletion
Removed the following rules: 28 29

Eliminating location l6 by chaining:

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

Applied deletion
Removed the following rules: 26 27

Eliminating location l10 by chaining:

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

Applied deletion
Removed the following rules: 33 34

Eliminated locations on linear paths
Start location: l13
  23: l1 -> l7 : tmp_7^0'=tmp_7^post7, y_6^0-x_5^0 == 0, cost: 1
  30: l1 -> l11 : tmp_7^0'=tmp_7^post14, 1-y_6^0+x_5^0 <= 0, cost: 1
  37: l1 -> l1 : tmp_7^0'=0, y_6^0-x_5^0 == 0, cost: 2
  38: l1 -> l1 : tmp_7^0'=0, 1-y_6^0+x_5^0 <= 0, cost: 2
  24: l7 -> l8 : 1+tmp_7^0 <= 0, cost: 1
  25: l7 -> l8 : -1+tmp_7^0 >= 0, cost: 1
  39: l8 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
  31: l11 -> l12 : 1+tmp_7^0 <= 0, cost: 1
  32: l11 -> l12 : -1+tmp_7^0 >= 0, cost: 1
  40: l12 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
  36: l13 -> l1 : TRUE, cost: 2


Applied nonterm
Original rule:
l1 -> l1 : tmp_7^0'=0, y_6^0-x_5^0 == 0, cost: 2
New rule:
l1 -> [14] : (-1+n >= 0 /\ y_6^0-x_5^0 >= 0 /\ -y_6^0+x_5^0 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_kncLoF.txt

Applied nonterm
Original rule:
l1 -> l1 : tmp_7^0'=0, 1-y_6^0+x_5^0 <= 0, cost: 2
New rule:
l1 -> [14] : (-1+y_6^0-x_5^0 >= 0 /\ -1+n0 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_PKhHBN.txt

Applied deletion
Removed the following rules: 37 38

Accelerated simple loops
Start location: l13
  23: l1 -> l7 : tmp_7^0'=tmp_7^post7, y_6^0-x_5^0 == 0, cost: 1
  30: l1 -> l11 : tmp_7^0'=tmp_7^post14, 1-y_6^0+x_5^0 <= 0, cost: 1
  41: l1 -> [14] : (-1+n >= 0 /\ y_6^0-x_5^0 >= 0 /\ -y_6^0+x_5^0 >= 0), cost: NONTERM
  42: l1 -> [14] : (-1+y_6^0-x_5^0 >= 0 /\ -1+n0 >= 0), cost: NONTERM
  24: l7 -> l8 : 1+tmp_7^0 <= 0, cost: 1
  25: l7 -> l8 : -1+tmp_7^0 >= 0, cost: 1
  39: l8 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
  31: l11 -> l12 : 1+tmp_7^0 <= 0, cost: 1
  32: l11 -> l12 : -1+tmp_7^0 >= 0, cost: 1
  40: l12 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
  36: l13 -> l1 : TRUE, cost: 2


Applied chaining
First rule:
l13 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [14] : (-1+n >= 0 /\ y_6^0-x_5^0 >= 0 /\ -y_6^0+x_5^0 >= 0), cost: NONTERM
New rule:
l13 -> [14] : -y_6^0+x_5^0 == 0, cost: NONTERM

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

Applied chaining
First rule:
l12 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
Second rule:
l1 -> [14] : (-1+n >= 0 /\ y_6^0-x_5^0 >= 0 /\ -y_6^0+x_5^0 >= 0), cost: NONTERM
New rule:
l12 -> [14] : 1-y_6^0+x_5^0 == 0, cost: NONTERM

Applied chaining
First rule:
l13 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [14] : (-1+y_6^0-x_5^0 >= 0 /\ -1+n0 >= 0), cost: NONTERM
New rule:
l13 -> [14] : -1+y_6^0-x_5^0 >= 0, cost: NONTERM

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

Applied chaining
First rule:
l12 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
Second rule:
l1 -> [14] : (-1+y_6^0-x_5^0 >= 0 /\ -1+n0 >= 0), cost: NONTERM
New rule:
l12 -> [14] : -2+y_6^0-x_5^0 >= 0, cost: NONTERM

Applied deletion
Removed the following rules: 41 42

Chained accelerated rules with incoming rules
Start location: l13
  23: l1 -> l7 : tmp_7^0'=tmp_7^post7, y_6^0-x_5^0 == 0, cost: 1
  30: l1 -> l11 : tmp_7^0'=tmp_7^post14, 1-y_6^0+x_5^0 <= 0, cost: 1
  24: l7 -> l8 : 1+tmp_7^0 <= 0, cost: 1
  25: l7 -> l8 : -1+tmp_7^0 >= 0, cost: 1
  39: l8 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
  44: l8 -> [14] : 1-y_6^0+x_5^0 == 0, cost: NONTERM
  47: l8 -> [14] : -2+y_6^0-x_5^0 >= 0, cost: NONTERM
  31: l11 -> l12 : 1+tmp_7^0 <= 0, cost: 1
  32: l11 -> l12 : -1+tmp_7^0 >= 0, cost: 1
  40: l12 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
  45: l12 -> [14] : 1-y_6^0+x_5^0 == 0, cost: NONTERM
  48: l12 -> [14] : -2+y_6^0-x_5^0 >= 0, cost: NONTERM
  36: l13 -> l1 : TRUE, cost: 2
  43: l13 -> [14] : -y_6^0+x_5^0 == 0, cost: NONTERM
  46: l13 -> [14] : -1+y_6^0-x_5^0 >= 0, cost: NONTERM


Eliminating location l7 by chaining:

Applied chaining
First rule:
l1 -> l7 : tmp_7^0'=tmp_7^post7, y_6^0-x_5^0 == 0, cost: 1
Second rule:
l7 -> l8 : 1+tmp_7^0 <= 0, cost: 1
New rule:
l1 -> l8 : tmp_7^0'=tmp_7^post7, (y_6^0-x_5^0 == 0 /\ 1+tmp_7^post7 <= 0), cost: 2

Applied chaining
First rule:
l1 -> l7 : tmp_7^0'=tmp_7^post7, y_6^0-x_5^0 == 0, cost: 1
Second rule:
l7 -> l8 : -1+tmp_7^0 >= 0, cost: 1
New rule:
l1 -> l8 : tmp_7^0'=tmp_7^post7, (-1+tmp_7^post7 >= 0 /\ y_6^0-x_5^0 == 0), cost: 2

Applied deletion
Removed the following rules: 23 24 25

Eliminating location l11 by chaining:

Applied chaining
First rule:
l1 -> l11 : tmp_7^0'=tmp_7^post14, 1-y_6^0+x_5^0 <= 0, cost: 1
Second rule:
l11 -> l12 : 1+tmp_7^0 <= 0, cost: 1
New rule:
l1 -> l12 : tmp_7^0'=tmp_7^post14, (1-y_6^0+x_5^0 <= 0 /\ 1+tmp_7^post14 <= 0), cost: 2

Applied chaining
First rule:
l1 -> l11 : tmp_7^0'=tmp_7^post14, 1-y_6^0+x_5^0 <= 0, cost: 1
Second rule:
l11 -> l12 : -1+tmp_7^0 >= 0, cost: 1
New rule:
l1 -> l12 : tmp_7^0'=tmp_7^post14, (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 2

Applied deletion
Removed the following rules: 30 31 32

Eliminated locations on tree-shaped paths
Start location: l13
  49: l1 -> l8 : tmp_7^0'=tmp_7^post7, (y_6^0-x_5^0 == 0 /\ 1+tmp_7^post7 <= 0), cost: 2
  50: l1 -> l8 : tmp_7^0'=tmp_7^post7, (-1+tmp_7^post7 >= 0 /\ y_6^0-x_5^0 == 0), cost: 2
  51: l1 -> l12 : tmp_7^0'=tmp_7^post14, (1-y_6^0+x_5^0 <= 0 /\ 1+tmp_7^post14 <= 0), cost: 2
  52: l1 -> l12 : tmp_7^0'=tmp_7^post14, (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 2
  39: l8 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
  44: l8 -> [14] : 1-y_6^0+x_5^0 == 0, cost: NONTERM
  47: l8 -> [14] : -2+y_6^0-x_5^0 >= 0, cost: NONTERM
  40: l12 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
  45: l12 -> [14] : 1-y_6^0+x_5^0 == 0, cost: NONTERM
  48: l12 -> [14] : -2+y_6^0-x_5^0 >= 0, cost: NONTERM
  36: l13 -> l1 : TRUE, cost: 2
  43: l13 -> [14] : -y_6^0+x_5^0 == 0, cost: NONTERM
  46: l13 -> [14] : -1+y_6^0-x_5^0 >= 0, cost: NONTERM


Eliminating location l8 by chaining:

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

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

Applied deletion
Removed the following rules: 39 44 47 49 50

Eliminating location l12 by chaining:

Applied chaining
First rule:
l1 -> l12 : tmp_7^0'=tmp_7^post14, (1-y_6^0+x_5^0 <= 0 /\ 1+tmp_7^post14 <= 0), cost: 2
Second rule:
l12 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
New rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=1+x_5^0, (1-y_6^0+x_5^0 <= 0 /\ 1+tmp_7^post14 <= 0), cost: 4

Applied chaining
First rule:
l1 -> l12 : tmp_7^0'=tmp_7^post14, (1-y_6^0+x_5^0 <= 0 /\ 1+tmp_7^post14 <= 0), cost: 2
Second rule:
l12 -> [14] : 1-y_6^0+x_5^0 == 0, cost: NONTERM
New rule:
l1 -> [14] : (1-y_6^0+x_5^0 <= 0 /\ 1-y_6^0+x_5^0 == 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [14] : (1-y_6^0+x_5^0 <= 0 /\ 1-y_6^0+x_5^0 == 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
New rule:
l1 -> [14] : (1-y_6^0+x_5^0 == 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM

Applied chaining
First rule:
l1 -> l12 : tmp_7^0'=tmp_7^post14, (1-y_6^0+x_5^0 <= 0 /\ 1+tmp_7^post14 <= 0), cost: 2
Second rule:
l12 -> [14] : -2+y_6^0-x_5^0 >= 0, cost: NONTERM
New rule:
l1 -> [14] : (-2+y_6^0-x_5^0 >= 0 /\ 1-y_6^0+x_5^0 <= 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [14] : (-2+y_6^0-x_5^0 >= 0 /\ 1-y_6^0+x_5^0 <= 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
New rule:
l1 -> [14] : (-2+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM

Applied chaining
First rule:
l1 -> l12 : tmp_7^0'=tmp_7^post14, (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 2
Second rule:
l12 -> l1 : x_5^0'=1+x_5^0, TRUE, cost: 2
New rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=1+x_5^0, (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 4

Applied chaining
First rule:
l1 -> l12 : tmp_7^0'=tmp_7^post14, (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 2
Second rule:
l12 -> [14] : 1-y_6^0+x_5^0 == 0, cost: NONTERM
New rule:
l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 <= 0 /\ 1-y_6^0+x_5^0 == 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 <= 0 /\ 1-y_6^0+x_5^0 == 0), cost: NONTERM
New rule:
l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 == 0), cost: NONTERM

Applied chaining
First rule:
l1 -> l12 : tmp_7^0'=tmp_7^post14, (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 2
Second rule:
l12 -> [14] : -2+y_6^0-x_5^0 >= 0, cost: NONTERM
New rule:
l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ -2+y_6^0-x_5^0 >= 0 /\ 1-y_6^0+x_5^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ -2+y_6^0-x_5^0 >= 0 /\ 1-y_6^0+x_5^0 <= 0), cost: NONTERM
New rule:
l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ -2+y_6^0-x_5^0 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 40 45 48 51 52

Eliminated locations on tree-shaped paths
Start location: l13
  53: l1 -> l1 : tmp_7^0'=tmp_7^post7, x_5^0'=1+x_5^0, (y_6^0-x_5^0 == 0 /\ 1+tmp_7^post7 <= 0), cost: 4
  54: l1 -> l1 : tmp_7^0'=tmp_7^post7, x_5^0'=1+x_5^0, (-1+tmp_7^post7 >= 0 /\ y_6^0-x_5^0 == 0), cost: 4
  55: l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=1+x_5^0, (1-y_6^0+x_5^0 <= 0 /\ 1+tmp_7^post14 <= 0), cost: 4
  56: l1 -> [14] : (1-y_6^0+x_5^0 == 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
  57: l1 -> [14] : (-2+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
  58: l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=1+x_5^0, (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 4
  59: l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 == 0), cost: NONTERM
  60: l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ -2+y_6^0-x_5^0 >= 0), cost: NONTERM
  36: l13 -> l1 : TRUE, cost: 2
  43: l13 -> [14] : -y_6^0+x_5^0 == 0, cost: NONTERM
  46: l13 -> [14] : -1+y_6^0-x_5^0 >= 0, cost: NONTERM


Applied acceleration
Original rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=1+x_5^0, (1-y_6^0+x_5^0 <= 0 /\ 1+tmp_7^post14 <= 0), cost: 4
New rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=n3+x_5^0, (y_6^0-n3-x_5^0 >= 0 /\ -1+n3 >= 0 /\ -1-tmp_7^post14 >= 0), cost: 4*n3
Sub-proof via acceration calculus written to file:///tmp/tmpnam_BpHjAN.txt

Applied instantiation
Original rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=n3+x_5^0, (y_6^0-n3-x_5^0 >= 0 /\ -1+n3 >= 0 /\ -1-tmp_7^post14 >= 0), cost: 4*n3
New rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=y_6^0, (0 >= 0 /\ -1+y_6^0-x_5^0 >= 0 /\ -1-tmp_7^post14 >= 0), cost: 4*y_6^0-4*x_5^0

Applied acceleration
Original rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=1+x_5^0, (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 <= 0), cost: 4
New rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=n4+x_5^0, (-1+tmp_7^post14 >= 0 /\ -n4+y_6^0-x_5^0 >= 0 /\ -1+n4 >= 0), cost: 4*n4
Sub-proof via acceration calculus written to file:///tmp/tmpnam_DpNIBj.txt

Applied instantiation
Original rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=n4+x_5^0, (-1+tmp_7^post14 >= 0 /\ -n4+y_6^0-x_5^0 >= 0 /\ -1+n4 >= 0), cost: 4*n4
New rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=y_6^0, (0 >= 0 /\ -1+tmp_7^post14 >= 0 /\ -1+y_6^0-x_5^0 >= 0), cost: 4*y_6^0-4*x_5^0

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

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

Applied deletion
Removed the following rules: 55 58

Accelerated simple loops
Start location: l13
  53: l1 -> l1 : tmp_7^0'=tmp_7^post7, x_5^0'=1+x_5^0, (y_6^0-x_5^0 == 0 /\ 1+tmp_7^post7 <= 0), cost: 4
  54: l1 -> l1 : tmp_7^0'=tmp_7^post7, x_5^0'=1+x_5^0, (-1+tmp_7^post7 >= 0 /\ y_6^0-x_5^0 == 0), cost: 4
  56: l1 -> [14] : (1-y_6^0+x_5^0 == 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
  57: l1 -> [14] : (-2+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
  59: l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 == 0), cost: NONTERM
  60: l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ -2+y_6^0-x_5^0 >= 0), cost: NONTERM
  63: l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=y_6^0, (-1+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: 4*y_6^0-4*x_5^0
  64: l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=y_6^0, (-1+tmp_7^post14 >= 0 /\ -1+y_6^0-x_5^0 >= 0), cost: 4*y_6^0-4*x_5^0
  36: l13 -> l1 : TRUE, cost: 2
  43: l13 -> [14] : -y_6^0+x_5^0 == 0, cost: NONTERM
  46: l13 -> [14] : -1+y_6^0-x_5^0 >= 0, cost: NONTERM


Applied chaining
First rule:
l13 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : tmp_7^0'=tmp_7^post7, x_5^0'=1+x_5^0, (y_6^0-x_5^0 == 0 /\ 1+tmp_7^post7 <= 0), cost: 4
New rule:
l13 -> l1 : tmp_7^0'=tmp_7^post7, x_5^0'=1+x_5^0, (y_6^0-x_5^0 == 0 /\ 1+tmp_7^post7 <= 0), cost: 6

Applied chaining
First rule:
l13 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : tmp_7^0'=tmp_7^post7, x_5^0'=1+x_5^0, (-1+tmp_7^post7 >= 0 /\ y_6^0-x_5^0 == 0), cost: 4
New rule:
l13 -> l1 : tmp_7^0'=tmp_7^post7, x_5^0'=1+x_5^0, (-1+tmp_7^post7 >= 0 /\ y_6^0-x_5^0 == 0), cost: 6

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

Applied chaining
First rule:
l13 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=y_6^0, (-1+tmp_7^post14 >= 0 /\ -1+y_6^0-x_5^0 >= 0), cost: 4*y_6^0-4*x_5^0
New rule:
l13 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=y_6^0, (-1+tmp_7^post14 >= 0 /\ -1+y_6^0-x_5^0 >= 0), cost: 2+4*y_6^0-4*x_5^0

Applied deletion
Removed the following rules: 53 54 63 64

Chained accelerated rules with incoming rules
Start location: l13
  56: l1 -> [14] : (1-y_6^0+x_5^0 == 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
  57: l1 -> [14] : (-2+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
  59: l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 == 0), cost: NONTERM
  60: l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ -2+y_6^0-x_5^0 >= 0), cost: NONTERM
  36: l13 -> l1 : TRUE, cost: 2
  43: l13 -> [14] : -y_6^0+x_5^0 == 0, cost: NONTERM
  46: l13 -> [14] : -1+y_6^0-x_5^0 >= 0, cost: NONTERM
  65: l13 -> l1 : tmp_7^0'=tmp_7^post7, x_5^0'=1+x_5^0, (y_6^0-x_5^0 == 0 /\ 1+tmp_7^post7 <= 0), cost: 6
  66: l13 -> l1 : tmp_7^0'=tmp_7^post7, x_5^0'=1+x_5^0, (-1+tmp_7^post7 >= 0 /\ y_6^0-x_5^0 == 0), cost: 6
  67: l13 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=y_6^0, (-1+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: 2+4*y_6^0-4*x_5^0
  68: l13 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=y_6^0, (-1+tmp_7^post14 >= 0 /\ -1+y_6^0-x_5^0 >= 0), cost: 2+4*y_6^0-4*x_5^0


Eliminating location l1 by chaining:

Applied chaining
First rule:
l13 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [14] : (1-y_6^0+x_5^0 == 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
New rule:
l13 -> [14] : (1-y_6^0+x_5^0 == 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM

Applied chaining
First rule:
l13 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [14] : (-2+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
New rule:
l13 -> [14] : (-2+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM

Applied chaining
First rule:
l13 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 == 0), cost: NONTERM
New rule:
l13 -> [14] : (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 == 0), cost: NONTERM

Applied chaining
First rule:
l13 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [14] : (-1+tmp_7^post14 >= 0 /\ -2+y_6^0-x_5^0 >= 0), cost: NONTERM
New rule:
l13 -> [14] : (-1+tmp_7^post14 >= 0 /\ -2+y_6^0-x_5^0 >= 0), cost: NONTERM

Applied partial deletion
Original rule:
l13 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=y_6^0, (-1+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: 2+4*y_6^0-4*x_5^0
New rule:
l13 -> [16] : (-1+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: 2+4*y_6^0-4*x_5^0

Applied partial deletion
Original rule:
l13 -> l1 : tmp_7^0'=tmp_7^post14, x_5^0'=y_6^0, (-1+tmp_7^post14 >= 0 /\ -1+y_6^0-x_5^0 >= 0), cost: 2+4*y_6^0-4*x_5^0
New rule:
l13 -> [16] : (-1+tmp_7^post14 >= 0 /\ -1+y_6^0-x_5^0 >= 0), cost: 2+4*y_6^0-4*x_5^0

Applied deletion
Removed the following rules: 36 56 57 59 60 65 66 67 68

Eliminated locations on tree-shaped paths
Start location: l13
  43: l13 -> [14] : -y_6^0+x_5^0 == 0, cost: NONTERM
  46: l13 -> [14] : -1+y_6^0-x_5^0 >= 0, cost: NONTERM
  69: l13 -> [14] : (1-y_6^0+x_5^0 == 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
  70: l13 -> [14] : (-2+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: NONTERM
  71: l13 -> [14] : (-1+tmp_7^post14 >= 0 /\ 1-y_6^0+x_5^0 == 0), cost: NONTERM
  72: l13 -> [14] : (-1+tmp_7^post14 >= 0 /\ -2+y_6^0-x_5^0 >= 0), cost: NONTERM
  73: l13 -> [16] : (-1+y_6^0-x_5^0 >= 0 /\ 1+tmp_7^post14 <= 0), cost: 2+4*y_6^0-4*x_5^0
  74: l13 -> [16] : (-1+tmp_7^post14 >= 0 /\ -1+y_6^0-x_5^0 >= 0), cost: 2+4*y_6^0-4*x_5^0


Computing asymptotic complexity
Proved nontermination of rule 43 via SMT.

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

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