NO

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


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

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

Applied preprocessing
Original rule:
l2 -> l1 : x_5^0'=x_5^post2, x_5^0-x_5^post2 == 0, cost: 1
New rule:
l2 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l3 : x_5^0'=x_5^post3, (1-x_5^post3 <= 0 /\ 1-x_5^0+x_5^post3 == 0), cost: 1
New rule:
l1 -> l3 : x_5^0'=-1+x_5^0, -2+x_5^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l1 : x_5^0'=x_5^post4, x_5^0-x_5^post4 == 0, cost: 1
New rule:
l3 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l4 -> l0 : x_5^0'=x_5^post5, x_5^0-x_5^post5 == 0, cost: 1
New rule:
l4 -> l0 : TRUE, cost: 1

Simplified rules
Start location: l4
   6: l0 -> l1 : TRUE, cost: 1
   7: l1 -> l2 : x_5^0'=-1+x_5^0, -1+x_5^0 <= 0, cost: 1
   9: l1 -> l3 : x_5^0'=-1+x_5^0, -2+x_5^0 >= 0, cost: 1
   8: l2 -> l1 : TRUE, cost: 1
  10: l3 -> l1 : TRUE, cost: 1
  11: l4 -> l0 : TRUE, cost: 1


Eliminating location l0 by chaining:

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

Applied deletion
Removed the following rules: 6 11

Eliminating location l2 by chaining:

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

Applied deletion
Removed the following rules: 7 8

Eliminating location l3 by chaining:

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

Applied deletion
Removed the following rules: 9 10

Eliminated locations on linear paths
Start location: l4
  13: l1 -> l1 : x_5^0'=-1+x_5^0, -1+x_5^0 <= 0, cost: 2
  14: l1 -> l1 : x_5^0'=-1+x_5^0, -2+x_5^0 >= 0, cost: 2
  12: l4 -> l1 : TRUE, cost: 2


Applied nonterm
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^0, -1+x_5^0 <= 0, cost: 2
New rule:
l1 -> [5] : 1-x_5^0 >= 0, cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=-1+x_5^0, -1+x_5^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=x_5^0-n1, 1-x_5^0 >= 0, cost: 2*n1

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

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

Applied simplification
Original rule:
l1 -> [5] : 1-x_5^0 >= 0, cost: NONTERM
New rule:
l1 -> [5] : -1+x_5^0 <= 0, cost: NONTERM

Applied simplification
Original rule:
l1 -> l1 : x_5^0'=x_5^0-n1, 1-x_5^0 >= 0, cost: 2*n1
New rule:
l1 -> l1 : x_5^0'=x_5^0-n1, -1+x_5^0 <= 0, cost: 2*n1

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

Applied deletion
Removed the following rules: 13 14

Accelerated simple loops
Start location: l4
  18: l1 -> [5] : -1+x_5^0 <= 0, cost: NONTERM
  19: l1 -> l1 : x_5^0'=x_5^0-n1, -1+x_5^0 <= 0, cost: 2*n1
  20: l1 -> l1 : x_5^0'=1, -1+x_5^0 >= 0, cost: -2+2*x_5^0
  12: l4 -> l1 : TRUE, cost: 2


Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [5] : -1+x_5^0 <= 0, cost: NONTERM
New rule:
l4 -> [5] : -1+x_5^0 <= 0, cost: NONTERM

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

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

Applied deletion
Removed the following rules: 18 19 20

Chained accelerated rules with incoming rules
Start location: l4
  12: l4 -> l1 : TRUE, cost: 2
  21: l4 -> [5] : -1+x_5^0 <= 0, cost: NONTERM
  22: l4 -> l1 : x_5^0'=x_5^0-n1, -1+x_5^0 <= 0, cost: 2+2*n1
  23: l4 -> l1 : x_5^0'=1, -1+x_5^0 >= 0, cost: 2*x_5^0


Removed unreachable locations and irrelevant leafs
Start location: l4
  21: l4 -> [5] : -1+x_5^0 <= 0, cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 21 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