NO

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


Removed unreachable rules and leafs
Start location: l4
   0: l0 -> l1 : x_1^0'=x_1^post0, y_1^0'=y_1^post0, (-1+x_1^post0 == 0 /\ -1+y_1^post0 == 0), cost: 1
   1: l1 -> l2 : x_1^0'=x_1^post1, y_1^0'=y_1^post1, (-y_1^post1+y_1^0 == 0 /\ -1-x_1^0+x_1^post1 == 0), cost: 1
   2: l2 -> l1 : x_1^0'=x_1^post2, y_1^0'=y_1^post2, (-y_1^post2+y_1^0 == 0 /\ x_1^0-x_1^post2 == 0), cost: 1
   4: l4 -> l0 : x_1^0'=x_1^post4, y_1^0'=y_1^post4, (x_1^0-x_1^post4 == 0 /\ -y_1^post4+y_1^0 == 0), cost: 1


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

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

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

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

Simplified rules
Start location: l4
   5: l0 -> l1 : x_1^0'=1, y_1^0'=1, TRUE, cost: 1
   6: l1 -> l2 : x_1^0'=1+x_1^0, TRUE, cost: 1
   7: l2 -> l1 : TRUE, cost: 1
   8: l4 -> l0 : TRUE, cost: 1


Eliminating location l0 by chaining:

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

Applied deletion
Removed the following rules: 5 8

Eliminating location l2 by chaining:

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

Applied deletion
Removed the following rules: 6 7

Eliminated locations on linear paths
Start location: l4
  10: l1 -> l1 : x_1^0'=1+x_1^0, TRUE, cost: 2
   9: l4 -> l1 : x_1^0'=1, y_1^0'=1, TRUE, cost: 2


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

Applied acceleration
Original rule:
l1 -> l1 : x_1^0'=1+x_1^0, TRUE, cost: 2
New rule:
l1 -> l1 : x_1^0'=x_1^0+n0, TRUE, cost: 2*n0

Applied deletion
Removed the following rules: 10

Accelerated simple loops
Start location: l4
  11: l1 -> [5] : TRUE, cost: NONTERM
  12: l1 -> l1 : x_1^0'=x_1^0+n0, TRUE, cost: 2*n0
   9: l4 -> l1 : x_1^0'=1, y_1^0'=1, TRUE, cost: 2


Applied chaining
First rule:
l4 -> l1 : x_1^0'=1, y_1^0'=1, TRUE, cost: 2
Second rule:
l1 -> [5] : TRUE, cost: NONTERM
New rule:
l4 -> [5] : TRUE, cost: NONTERM

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

Applied deletion
Removed the following rules: 11 12

Chained accelerated rules with incoming rules
Start location: l4
   9: l4 -> l1 : x_1^0'=1, y_1^0'=1, TRUE, cost: 2
  13: l4 -> [5] : TRUE, cost: NONTERM
  14: l4 -> l1 : x_1^0'=1+n0, y_1^0'=1, TRUE, cost: 2+2*n0


Removed unreachable locations and irrelevant leafs
Start location: l4
  13: l4 -> [5] : TRUE, cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 13 via SMT.

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

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  TRUE