NO

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


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

Applied preprocessing
Original rule:
l1 -> l0 : p^0'=p^post1, y_1^0'=y_1^post1, (-y_1^post1+y_1^0 == 0 /\ p^0-p^post1 == 0), cost: 1
New rule:
l1 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l3 : p^0'=p^post2, y_1^0'=y_1^post2, (-y_1^post2+y_1^0 == 0 /\ p^post2 == 0), cost: 1
New rule:
l2 -> l3 : p^0'=0, TRUE, cost: 1

Applied preprocessing
Original rule:
l3 -> l4 : p^0'=p^post3, y_1^0'=y_1^post3, (p^0-p^post3 == 0 /\ 1-y_1^0 <= 0 /\ 1-y_1^0+y_1^post3 == 0), cost: 1
New rule:
l3 -> l4 : y_1^0'=-1+y_1^0, -1+y_1^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l3 : p^0'=p^post4, y_1^0'=y_1^post4, (p^0-p^post4 == 0 /\ -y_1^post4+y_1^0 == 0), cost: 1
New rule:
l4 -> l3 : TRUE, cost: 1

Applied preprocessing
Original rule:
l3 -> l0 : p^0'=p^post5, y_1^0'=y_1^post5, (y_1^0-y_1^post5 == 0 /\ y_1^0 <= 0 /\ 1+p^post5 == 0), cost: 1
New rule:
l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l2 : p^0'=p^post6, y_1^0'=y_1^post6, (-y_1^post6+y_1^0 == 0 /\ p^0-p^post6 == 0), cost: 1
New rule:
l5 -> l2 : TRUE, cost: 1

Simplified rules
Start location: l5
   7: l0 -> l1 : TRUE, cost: 1
   8: l1 -> l0 : TRUE, cost: 1
   9: l2 -> l3 : p^0'=0, TRUE, cost: 1
  10: l3 -> l4 : y_1^0'=-1+y_1^0, -1+y_1^0 >= 0, cost: 1
  12: l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1
  11: l4 -> l3 : TRUE, cost: 1
  13: l5 -> l2 : TRUE, cost: 1


Eliminating location l2 by chaining:

Applied chaining
First rule:
l5 -> l2 : TRUE, cost: 1
Second rule:
l2 -> l3 : p^0'=0, TRUE, cost: 1
New rule:
l5 -> l3 : p^0'=0, TRUE, cost: 2

Applied deletion
Removed the following rules: 9 13

Eliminating location l4 by chaining:

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

Applied deletion
Removed the following rules: 10 11

Eliminating location l1 by chaining:

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

Applied deletion
Removed the following rules: 7 8

Eliminated locations on linear paths
Start location: l5
  16: l0 -> l0 : TRUE, cost: 2
  12: l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1
  15: l3 -> l3 : y_1^0'=-1+y_1^0, -1+y_1^0 >= 0, cost: 2
  14: l5 -> l3 : p^0'=0, TRUE, cost: 2


Applied nonterm
Original rule:
l0 -> l0 : TRUE, cost: 2
New rule:
l0 -> [6] : TRUE, cost: NONTERM

Applied acceleration
Original rule:
l0 -> l0 : TRUE, cost: 2
New rule:
l0 -> l0 : TRUE, cost: 2*n0

Applied deletion
Removed the following rules: 16

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

Applied instantiation
Original rule:
l3 -> l3 : y_1^0'=-n3+y_1^0, (n3 >= 0 /\ -n3+y_1^0 >= 0), cost: 2*n3
New rule:
l3 -> l3 : y_1^0'=0, (0 >= 0 /\ y_1^0 >= 0), cost: 2*y_1^0

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

Applied deletion
Removed the following rules: 15

Accelerated simple loops
Start location: l5
  17: l0 -> [6] : TRUE, cost: NONTERM
  18: l0 -> l0 : TRUE, cost: 2*n0
  12: l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1
  20: l3 -> l3 : y_1^0'=0, y_1^0 >= 0, cost: 2*y_1^0
  14: l5 -> l3 : p^0'=0, TRUE, cost: 2


Applied chaining
First rule:
l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1
Second rule:
l0 -> [6] : TRUE, cost: NONTERM
New rule:
l3 -> [6] : y_1^0 <= 0, cost: NONTERM

Applied chaining
First rule:
l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1
Second rule:
l0 -> l0 : TRUE, cost: 2*n0
New rule:
l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1+2*n0

Applied deletion
Removed the following rules: 17 18

Applied chaining
First rule:
l5 -> l3 : p^0'=0, TRUE, cost: 2
Second rule:
l3 -> l3 : y_1^0'=0, y_1^0 >= 0, cost: 2*y_1^0
New rule:
l5 -> l3 : p^0'=0, y_1^0'=0, y_1^0 >= 0, cost: 2+2*y_1^0

Applied deletion
Removed the following rules: 20

Chained accelerated rules with incoming rules
Start location: l5
  12: l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1
  21: l3 -> [6] : y_1^0 <= 0, cost: NONTERM
  22: l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1+2*n0
  14: l5 -> l3 : p^0'=0, TRUE, cost: 2
  23: l5 -> l3 : p^0'=0, y_1^0'=0, y_1^0 >= 0, cost: 2+2*y_1^0


Removed unreachable locations and irrelevant leafs
Start location: l5
  21: l3 -> [6] : y_1^0 <= 0, cost: NONTERM
  14: l5 -> l3 : p^0'=0, TRUE, cost: 2
  23: l5 -> l3 : p^0'=0, y_1^0'=0, y_1^0 >= 0, cost: 2+2*y_1^0


Eliminating location l3 by chaining:

Applied chaining
First rule:
l5 -> l3 : p^0'=0, TRUE, cost: 2
Second rule:
l3 -> [6] : y_1^0 <= 0, cost: NONTERM
New rule:
l5 -> [6] : y_1^0 <= 0, cost: NONTERM

Applied chaining
First rule:
l5 -> l3 : p^0'=0, y_1^0'=0, y_1^0 >= 0, cost: 2+2*y_1^0
Second rule:
l3 -> [6] : y_1^0 <= 0, cost: NONTERM
New rule:
l5 -> [6] : (0 <= 0 /\ y_1^0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l5 -> [6] : (0 <= 0 /\ y_1^0 >= 0), cost: NONTERM
New rule:
l5 -> [6] : y_1^0 >= 0, cost: NONTERM

Applied deletion
Removed the following rules: 14 21 23

Eliminated locations on tree-shaped paths
Start location: l5
  24: l5 -> [6] : y_1^0 <= 0, cost: NONTERM
  25: l5 -> [6] : y_1^0 >= 0, cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 24 via SMT.

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

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  y_1^0 <= 0