NO

Initial ITS
Start location: l9
   0: l0 -> l1 : i^0'=i^post0, k^0'=k^post0, (k^0-k^post0 == 0 /\ -1-i^0+i^post0 == 0), cost: 1
   4: l1 -> l2 : i^0'=i^post4, k^0'=k^post4, (i^0-i^post4 == 0 /\ -k^post4+k^0 == 0), cost: 1
   1: l2 -> l0 : i^0'=i^post1, k^0'=k^post1, (-k^post1+k^0 == 0 /\ i^0-i^post1 == 0), cost: 1
   2: l2 -> l0 : i^0'=i^post2, k^0'=k^post2, (-k^post2+k^0 == 0 /\ i^0-i^post2 == 0), cost: 1
   3: l2 -> l3 : i^0'=i^post3, k^0'=k^post3, (i^0-i^post3 == 0 /\ k^0-k^post3 == 0), cost: 1
  11: l3 -> l4 : i^0'=i^post11, k^0'=k^post11, (k^0-k^post11 == 0 /\ i^0-i^post11 == 0 /\ 1+k^0 <= 0), cost: 1
  12: l3 -> l7 : i^0'=i^post12, k^0'=k^post12, (-k^post12+k^0 == 0 /\ -k^0 <= 0 /\ i^0-i^post12 == 0), cost: 1
   5: l4 -> l5 : i^0'=i^post5, k^0'=k^post5, (k^0-k^post5 == 0 /\ i^0-i^post5 == 0), cost: 1
   6: l6 -> l4 : i^0'=i^post6, k^0'=k^post6, (-k^post6+k^0 == 0 /\ i^0-i^post6 == 0), cost: 1
   7: l6 -> l4 : i^0'=i^post7, k^0'=k^post7, (i^0-i^post7 == 0 /\ -k^post7+k^0 == 0), cost: 1
   8: l6 -> l5 : i^0'=i^post8, k^0'=k^post8, (i^0-i^post8 == 0 /\ k^0-k^post8 == 0), cost: 1
   9: l7 -> l4 : i^0'=i^post9, k^0'=k^post9, (i^0-k^0 <= 0 /\ -k^post9+k^0 == 0 /\ i^0-i^post9 == 0), cost: 1
  10: l7 -> l6 : i^0'=i^post10, k^0'=k^post10, (-k^post10+k^0 == 0 /\ 1-i^0+k^0 <= 0 /\ i^0-i^post10 == 0), cost: 1
  13: l8 -> l1 : i^0'=i^post13, k^0'=k^post13, (0 == 0 /\ i^post13 == 0), cost: 1
  14: l9 -> l8 : i^0'=i^post14, k^0'=k^post14, (i^0-i^post14 == 0 /\ k^0-k^post14 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l9
   0: l0 -> l1 : i^0'=i^post0, k^0'=k^post0, (k^0-k^post0 == 0 /\ -1-i^0+i^post0 == 0), cost: 1
   4: l1 -> l2 : i^0'=i^post4, k^0'=k^post4, (i^0-i^post4 == 0 /\ -k^post4+k^0 == 0), cost: 1
   1: l2 -> l0 : i^0'=i^post1, k^0'=k^post1, (-k^post1+k^0 == 0 /\ i^0-i^post1 == 0), cost: 1
   2: l2 -> l0 : i^0'=i^post2, k^0'=k^post2, (-k^post2+k^0 == 0 /\ i^0-i^post2 == 0), cost: 1
  13: l8 -> l1 : i^0'=i^post13, k^0'=k^post13, (0 == 0 /\ i^post13 == 0), cost: 1
  14: l9 -> l8 : i^0'=i^post14, k^0'=k^post14, (i^0-i^post14 == 0 /\ k^0-k^post14 == 0), cost: 1


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

Applied preprocessing
Original rule:
l2 -> l0 : i^0'=i^post1, k^0'=k^post1, (-k^post1+k^0 == 0 /\ i^0-i^post1 == 0), cost: 1
New rule:
l2 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l0 : i^0'=i^post2, k^0'=k^post2, (-k^post2+k^0 == 0 /\ i^0-i^post2 == 0), cost: 1
New rule:
l2 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l2 : i^0'=i^post4, k^0'=k^post4, (i^0-i^post4 == 0 /\ -k^post4+k^0 == 0), cost: 1
New rule:
l1 -> l2 : TRUE, cost: 1

Applied preprocessing
Original rule:
l8 -> l1 : i^0'=i^post13, k^0'=k^post13, (0 == 0 /\ i^post13 == 0), cost: 1
New rule:
l8 -> l1 : i^0'=0, k^0'=k^post13, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l9 -> l8 : i^0'=i^post14, k^0'=k^post14, (i^0-i^post14 == 0 /\ k^0-k^post14 == 0), cost: 1
New rule:
l9 -> l8 : TRUE, cost: 1

Applied deletion
Removed the following rules: 16

Simplified rules
Start location: l9
  15: l0 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  18: l1 -> l2 : TRUE, cost: 1
  17: l2 -> l0 : TRUE, cost: 1
  19: l8 -> l1 : i^0'=0, k^0'=k^post13, 0 == 0, cost: 1
  20: l9 -> l8 : TRUE, cost: 1


Eliminating location l8 by chaining:

Applied chaining
First rule:
l9 -> l8 : TRUE, cost: 1
Second rule:
l8 -> l1 : i^0'=0, k^0'=k^post13, 0 == 0, cost: 1
New rule:
l9 -> l1 : i^0'=0, k^0'=k^post13, 0 == 0, cost: 2

Applied deletion
Removed the following rules: 19 20

Eliminating location l2 by chaining:

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

Applied deletion
Removed the following rules: 17 18

Eliminating location l0 by chaining:

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

Applied deletion
Removed the following rules: 15 22

Eliminated locations on linear paths
Start location: l9
  23: l1 -> l1 : i^0'=1+i^0, TRUE, cost: 3
  21: l9 -> l1 : i^0'=0, k^0'=k^post13, 0 == 0, cost: 2


Applied nonterm
Original rule:
l1 -> l1 : i^0'=1+i^0, TRUE, cost: 3
New rule:
l1 -> [10] : TRUE, cost: NONTERM

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

Applied deletion
Removed the following rules: 23

Accelerated simple loops
Start location: l9
  24: l1 -> [10] : TRUE, cost: NONTERM
  25: l1 -> l1 : i^0'=i^0+n0, TRUE, cost: 3*n0
  21: l9 -> l1 : i^0'=0, k^0'=k^post13, 0 == 0, cost: 2


Applied chaining
First rule:
l9 -> l1 : i^0'=0, k^0'=k^post13, 0 == 0, cost: 2
Second rule:
l1 -> [10] : TRUE, cost: NONTERM
New rule:
l9 -> [10] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l9 -> l1 : i^0'=0, k^0'=k^post13, 0 == 0, cost: 2
Second rule:
l1 -> l1 : i^0'=i^0+n0, TRUE, cost: 3*n0
New rule:
l9 -> l1 : i^0'=n0, k^0'=k^post13, 0 == 0, cost: 2+3*n0

Applied deletion
Removed the following rules: 24 25

Chained accelerated rules with incoming rules
Start location: l9
  21: l9 -> l1 : i^0'=0, k^0'=k^post13, 0 == 0, cost: 2
  26: l9 -> [10] : 0 == 0, cost: NONTERM
  27: l9 -> l1 : i^0'=n0, k^0'=k^post13, 0 == 0, cost: 2+3*n0


Removed unreachable locations and irrelevant leafs
Start location: l9
  26: l9 -> [10] : 0 == 0, cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 26 via SMT.

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

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  0 == 0