NO

Initial ITS
Start location: l5
   0: l0 -> l1 : Result_4^0'=Result_4^post0, y_6^0'=y_6^post0, x_5^0'=x_5^post0, (0 == 0 /\ 20-x_5^0 <= 0 /\ y_6^0-y_6^post0 == 0 /\ -x_5^post0+x_5^0 == 0), cost: 1
   1: l0 -> l2 : Result_4^0'=Result_4^post1, y_6^0'=y_6^post1, x_5^0'=x_5^post1, (y_6^0-y_6^post1 == 0 /\ -19+x_5^0 <= 0 /\ Result_4^0-Result_4^post1 == 0 /\ x_5^0-x_5^post1 == 0), cost: 1
   3: l2 -> l0 : Result_4^0'=Result_4^post3, y_6^0'=y_6^post3, x_5^0'=x_5^post3, (1-x_5^0+x_5^post3 == 0 /\ 30-y_6^0 <= 0 /\ Result_4^0-Result_4^post3 == 0 /\ y_6^0-y_6^post3 == 0), cost: 1
   4: l2 -> l4 : Result_4^0'=Result_4^post4, y_6^0'=y_6^post4, x_5^0'=x_5^post4, (1-x_5^0+x_5^post4 == 0 /\ -29+y_6^0 <= 0 /\ y_6^0-y_6^post4 == 0 /\ Result_4^0-Result_4^post4 == 0), cost: 1
   2: l3 -> l0 : Result_4^0'=Result_4^post2, y_6^0'=y_6^post2, x_5^0'=x_5^post2, (y_6^0-y_6^post2 == 0 /\ x_5^0-x_5^post2 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1
   5: l4 -> l2 : Result_4^0'=Result_4^post5, y_6^0'=y_6^post5, x_5^0'=x_5^post5, (Result_4^0-Result_4^post5 == 0 /\ y_6^0-y_6^post5 == 0 /\ x_5^0-x_5^post5 == 0), cost: 1
   6: l5 -> l3 : Result_4^0'=Result_4^post6, y_6^0'=y_6^post6, x_5^0'=x_5^post6, (x_5^0-x_5^post6 == 0 /\ Result_4^0-Result_4^post6 == 0 /\ y_6^0-y_6^post6 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l5
   1: l0 -> l2 : Result_4^0'=Result_4^post1, y_6^0'=y_6^post1, x_5^0'=x_5^post1, (y_6^0-y_6^post1 == 0 /\ -19+x_5^0 <= 0 /\ Result_4^0-Result_4^post1 == 0 /\ x_5^0-x_5^post1 == 0), cost: 1
   3: l2 -> l0 : Result_4^0'=Result_4^post3, y_6^0'=y_6^post3, x_5^0'=x_5^post3, (1-x_5^0+x_5^post3 == 0 /\ 30-y_6^0 <= 0 /\ Result_4^0-Result_4^post3 == 0 /\ y_6^0-y_6^post3 == 0), cost: 1
   4: l2 -> l4 : Result_4^0'=Result_4^post4, y_6^0'=y_6^post4, x_5^0'=x_5^post4, (1-x_5^0+x_5^post4 == 0 /\ -29+y_6^0 <= 0 /\ y_6^0-y_6^post4 == 0 /\ Result_4^0-Result_4^post4 == 0), cost: 1
   2: l3 -> l0 : Result_4^0'=Result_4^post2, y_6^0'=y_6^post2, x_5^0'=x_5^post2, (y_6^0-y_6^post2 == 0 /\ x_5^0-x_5^post2 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1
   5: l4 -> l2 : Result_4^0'=Result_4^post5, y_6^0'=y_6^post5, x_5^0'=x_5^post5, (Result_4^0-Result_4^post5 == 0 /\ y_6^0-y_6^post5 == 0 /\ x_5^0-x_5^post5 == 0), cost: 1
   6: l5 -> l3 : Result_4^0'=Result_4^post6, y_6^0'=y_6^post6, x_5^0'=x_5^post6, (x_5^0-x_5^post6 == 0 /\ Result_4^0-Result_4^post6 == 0 /\ y_6^0-y_6^post6 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l2 : Result_4^0'=Result_4^post1, y_6^0'=y_6^post1, x_5^0'=x_5^post1, (y_6^0-y_6^post1 == 0 /\ -19+x_5^0 <= 0 /\ Result_4^0-Result_4^post1 == 0 /\ x_5^0-x_5^post1 == 0), cost: 1
New rule:
l0 -> l2 : -19+x_5^0 <= 0, cost: 1

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

Applied preprocessing
Original rule:
l2 -> l0 : Result_4^0'=Result_4^post3, y_6^0'=y_6^post3, x_5^0'=x_5^post3, (1-x_5^0+x_5^post3 == 0 /\ 30-y_6^0 <= 0 /\ Result_4^0-Result_4^post3 == 0 /\ y_6^0-y_6^post3 == 0), cost: 1
New rule:
l2 -> l0 : x_5^0'=-1+x_5^0, -30+y_6^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l2 -> l4 : Result_4^0'=Result_4^post4, y_6^0'=y_6^post4, x_5^0'=x_5^post4, (1-x_5^0+x_5^post4 == 0 /\ -29+y_6^0 <= 0 /\ y_6^0-y_6^post4 == 0 /\ Result_4^0-Result_4^post4 == 0), cost: 1
New rule:
l2 -> l4 : x_5^0'=-1+x_5^0, -29+y_6^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l2 : Result_4^0'=Result_4^post5, y_6^0'=y_6^post5, x_5^0'=x_5^post5, (Result_4^0-Result_4^post5 == 0 /\ y_6^0-y_6^post5 == 0 /\ x_5^0-x_5^post5 == 0), cost: 1
New rule:
l4 -> l2 : TRUE, cost: 1

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

Simplified rules
Start location: l5
   7: l0 -> l2 : -19+x_5^0 <= 0, cost: 1
   9: l2 -> l0 : x_5^0'=-1+x_5^0, -30+y_6^0 >= 0, cost: 1
  10: l2 -> l4 : x_5^0'=-1+x_5^0, -29+y_6^0 <= 0, cost: 1
   8: l3 -> l0 : TRUE, cost: 1
  11: l4 -> l2 : TRUE, cost: 1
  12: l5 -> l3 : TRUE, cost: 1


Eliminating location l3 by chaining:

Applied chaining
First rule:
l5 -> l3 : TRUE, cost: 1
Second rule:
l3 -> l0 : TRUE, cost: 1
New rule:
l5 -> l0 : TRUE, cost: 2

Applied deletion
Removed the following rules: 8 12

Eliminating location l4 by chaining:

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

Applied deletion
Removed the following rules: 10 11

Eliminated locations on linear paths
Start location: l5
   7: l0 -> l2 : -19+x_5^0 <= 0, cost: 1
   9: l2 -> l0 : x_5^0'=-1+x_5^0, -30+y_6^0 >= 0, cost: 1
  14: l2 -> l2 : x_5^0'=-1+x_5^0, -29+y_6^0 <= 0, cost: 2
  13: l5 -> l0 : TRUE, cost: 2


Applied nonterm
Original rule:
l2 -> l2 : x_5^0'=-1+x_5^0, -29+y_6^0 <= 0, cost: 2
New rule:
l2 -> [6] : 29-y_6^0 >= 0, cost: NONTERM

Applied acceleration
Original rule:
l2 -> l2 : x_5^0'=-1+x_5^0, -29+y_6^0 <= 0, cost: 2
New rule:
l2 -> l2 : x_5^0'=-n0+x_5^0, 29-y_6^0 >= 0, cost: 2*n0

Applied simplification
Original rule:
l2 -> [6] : 29-y_6^0 >= 0, cost: NONTERM
New rule:
l2 -> [6] : -29+y_6^0 <= 0, cost: NONTERM

Applied simplification
Original rule:
l2 -> l2 : x_5^0'=-n0+x_5^0, 29-y_6^0 >= 0, cost: 2*n0
New rule:
l2 -> l2 : x_5^0'=-n0+x_5^0, -29+y_6^0 <= 0, cost: 2*n0

Applied deletion
Removed the following rules: 14

Accelerated simple loops
Start location: l5
   7: l0 -> l2 : -19+x_5^0 <= 0, cost: 1
   9: l2 -> l0 : x_5^0'=-1+x_5^0, -30+y_6^0 >= 0, cost: 1
  17: l2 -> [6] : -29+y_6^0 <= 0, cost: NONTERM
  18: l2 -> l2 : x_5^0'=-n0+x_5^0, -29+y_6^0 <= 0, cost: 2*n0
  13: l5 -> l0 : TRUE, cost: 2


Applied chaining
First rule:
l0 -> l2 : -19+x_5^0 <= 0, cost: 1
Second rule:
l2 -> [6] : -29+y_6^0 <= 0, cost: NONTERM
New rule:
l0 -> [6] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: NONTERM

Applied chaining
First rule:
l0 -> l2 : -19+x_5^0 <= 0, cost: 1
Second rule:
l2 -> l2 : x_5^0'=-n0+x_5^0, -29+y_6^0 <= 0, cost: 2*n0
New rule:
l0 -> l2 : x_5^0'=-n0+x_5^0, (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: 1+2*n0

Applied deletion
Removed the following rules: 17 18

Chained accelerated rules with incoming rules
Start location: l5
   7: l0 -> l2 : -19+x_5^0 <= 0, cost: 1
  19: l0 -> [6] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: NONTERM
  20: l0 -> l2 : x_5^0'=-n0+x_5^0, (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: 1+2*n0
   9: l2 -> l0 : x_5^0'=-1+x_5^0, -30+y_6^0 >= 0, cost: 1
  13: l5 -> l0 : TRUE, cost: 2


Eliminating location l2 by chaining:

Applied chaining
First rule:
l0 -> l2 : -19+x_5^0 <= 0, cost: 1
Second rule:
l2 -> l0 : x_5^0'=-1+x_5^0, -30+y_6^0 >= 0, cost: 1
New rule:
l0 -> l0 : x_5^0'=-1+x_5^0, (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2

Applied partial deletion
Original rule:
l0 -> l2 : x_5^0'=-n0+x_5^0, (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: 1+2*n0
New rule:
l0 -> [7] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: 1+2*n0

Applied deletion
Removed the following rules: 7 9 20

Eliminated locations on tree-shaped paths
Start location: l5
  19: l0 -> [6] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: NONTERM
  21: l0 -> l0 : x_5^0'=-1+x_5^0, (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2
  22: l0 -> [7] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: 1+2*n0
  13: l5 -> l0 : TRUE, cost: 2


Applied pruning (of leafs and parallel rules):
Start location: l5
  19: l0 -> [6] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: NONTERM
  21: l0 -> l0 : x_5^0'=-1+x_5^0, (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2
  13: l5 -> l0 : TRUE, cost: 2


Applied nonterm
Original rule:
l0 -> l0 : x_5^0'=-1+x_5^0, (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2
New rule:
l0 -> [8] : (19-x_5^0 >= 0 /\ -30+y_6^0 >= 0), cost: NONTERM

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

Applied simplification
Original rule:
l0 -> [8] : (19-x_5^0 >= 0 /\ -30+y_6^0 >= 0), cost: NONTERM
New rule:
l0 -> [8] : (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l0 -> l0 : x_5^0'=-n3+x_5^0, (19-x_5^0 >= 0 /\ -30+y_6^0 >= 0), cost: 2*n3
New rule:
l0 -> l0 : x_5^0'=-n3+x_5^0, (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2*n3

Applied deletion
Removed the following rules: 21

Accelerated simple loops
Start location: l5
  19: l0 -> [6] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: NONTERM
  25: l0 -> [8] : (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: NONTERM
  26: l0 -> l0 : x_5^0'=-n3+x_5^0, (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2*n3
  13: l5 -> l0 : TRUE, cost: 2


Applied chaining
First rule:
l5 -> l0 : TRUE, cost: 2
Second rule:
l0 -> [8] : (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: NONTERM
New rule:
l5 -> [8] : (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: NONTERM

Applied chaining
First rule:
l5 -> l0 : TRUE, cost: 2
Second rule:
l0 -> l0 : x_5^0'=-n3+x_5^0, (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2*n3
New rule:
l5 -> l0 : x_5^0'=-n3+x_5^0, (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2+2*n3

Applied deletion
Removed the following rules: 25 26

Chained accelerated rules with incoming rules
Start location: l5
  19: l0 -> [6] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: NONTERM
  13: l5 -> l0 : TRUE, cost: 2
  27: l5 -> [8] : (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: NONTERM
  28: l5 -> l0 : x_5^0'=-n3+x_5^0, (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2+2*n3


Eliminating location l0 by chaining:

Applied chaining
First rule:
l5 -> l0 : TRUE, cost: 2
Second rule:
l0 -> [6] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: NONTERM
New rule:
l5 -> [6] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: NONTERM

Applied partial deletion
Original rule:
l5 -> l0 : x_5^0'=-n3+x_5^0, (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2+2*n3
New rule:
l5 -> [9] : (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2+2*n3

Applied deletion
Removed the following rules: 13 19 28

Eliminated locations on tree-shaped paths
Start location: l5
  27: l5 -> [8] : (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: NONTERM
  29: l5 -> [6] : (-19+x_5^0 <= 0 /\ -29+y_6^0 <= 0), cost: NONTERM
  30: l5 -> [9] : (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0), cost: 2+2*n3


Computing asymptotic complexity
Proved nontermination of rule 27 via SMT.

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

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (-19+x_5^0 <= 0 /\ -30+y_6^0 >= 0)