WORST_CASE(Omega(0),?)

Initial ITS
Start location: l18
   0: l0 -> l1 : i2^0'=i2^post0, r^0'=r^post0, i^0'=i^post0, (i^post0 == 0 /\ i2^0-i2^post0 == 0 /\ r^0-r^post0 == 0 /\ 1000-i^0 <= 0), cost: 1
   1: l0 -> l2 : i2^0'=i2^post1, r^0'=r^post1, i^0'=i^post1, (r^0-r^post1 == 0 /\ i^0-i^post1 == 0 /\ -999+i^0 <= 0 /\ i2^post1-i^0 == 0), cost: 1
  16: l1 -> l10 : i2^0'=i2^post16, r^0'=r^post16, i^0'=i^post16, (i^0-i^post16 == 0 /\ r^0-r^post16 == 0 /\ i2^0-i2^post16 == 0), cost: 1
  23: l2 -> l16 : i2^0'=i2^post23, r^0'=r^post23, i^0'=i^post23, (i2^0-i2^post23 == 0 /\ -i^post23+i^0 == 0 /\ -r^post23+r^0 == 0), cost: 1
  24: l2 -> l12 : i2^0'=i2^post24, r^0'=r^post24, i^0'=i^post24, (-i^post24+i^0 == 0 /\ i2^0-i2^post24 == 0 /\ r^0-r^post24 == 0), cost: 1
  25: l2 -> l16 : i2^0'=i2^post25, r^0'=r^post25, i^0'=i^post25, (-i^post25+i^0 == 0 /\ r^0-r^post25 == 0 /\ i2^0-i2^post25 == 0), cost: 1
   2: l3 -> l1 : i2^0'=i2^post2, r^0'=r^post2, i^0'=i^post2, (r^0-r^post2 == 0 /\ i2^0-i2^post2 == 0 /\ -1-i^0+i^post2 == 0), cost: 1
   3: l4 -> l5 : i2^0'=i2^post3, r^0'=r^post3, i^0'=i^post3, (i^0-i^post3 == 0 /\ i2^0-i2^post3 == 0 /\ r^0-r^post3 == 0), cost: 1
   4: l5 -> l3 : i2^0'=i2^post4, r^0'=r^post4, i^0'=i^post4, (r^0-r^post4 == 0 /\ i^0-i^post4 == 0 /\ i2^0-i2^post4 == 0), cost: 1
   5: l6 -> l0 : i2^0'=i2^post5, r^0'=r^post5, i^0'=i^post5, (i2^0-i2^post5 == 0 /\ r^0-r^post5 == 0 /\ i^0-i^post5 == 0), cost: 1
   6: l7 -> l4 : i2^0'=i2^post6, r^0'=r^post6, i^0'=i^post6, (i^0-i^post6 == 0 /\ i2^0-i2^post6 == 0 /\ r^0-r^post6 == 0), cost: 1
   7: l7 -> l4 : i2^0'=i2^post7, r^0'=r^post7, i^0'=i^post7, (r^0-r^post7 == 0 /\ i^0-i^post7 == 0 /\ i2^0-i2^post7 == 0), cost: 1
   8: l7 -> l5 : i2^0'=i2^post8, r^0'=r^post8, i^0'=i^post8, (i2^0-i2^post8 == 0 /\ r^0-r^post8 == 0 /\ i^0-i^post8 == 0), cost: 1
   9: l8 -> l7 : i2^0'=i2^post9, r^0'=r^post9, i^0'=i^post9, (0 == 0 /\ i2^0-i2^post9 == 0 /\ -i^post9+i^0 == 0), cost: 1
  10: l9 -> l8 : i2^0'=i2^post10, r^0'=r^post10, i^0'=i^post10, (-r^post10+r^0 == 0 /\ i2^0-i2^post10 == 0 /\ -i^post10+i^0 == 0), cost: 1
  11: l9 -> l3 : i2^0'=i2^post11, r^0'=r^post11, i^0'=i^post11, (-r^post11+r^0 == 0 /\ -i^post11+i^0 == 0 /\ i2^0-i2^post11 == 0), cost: 1
  12: l9 -> l8 : i2^0'=i2^post12, r^0'=r^post12, i^0'=i^post12, (i2^0-i2^post12 == 0 /\ -r^post12+r^0 == 0 /\ -i^post12+i^0 == 0), cost: 1
  13: l10 -> l11 : i2^0'=i2^post13, r^0'=r^post13, i^0'=i^post13, (-i^post13+i^0 == 0 /\ 1000-i^0 <= 0 /\ i2^0-i2^post13 == 0 /\ r^0-r^post13 == 0), cost: 1
  14: l10 -> l9 : i2^0'=i2^post14, r^0'=r^post14, i^0'=i^post14, (-i^post14+i^0 == 0 /\ -999+i^0 <= 0 /\ r^0-r^post14 == 0 /\ i2^0-i2^post14 == 0), cost: 1
  15: l12 -> l6 : i2^0'=i2^post15, r^0'=r^post15, i^0'=i^post15, (i2^0-i2^post15 == 0 /\ -1+i^post15-i^0 == 0 /\ r^0-r^post15 == 0), cost: 1
  17: l13 -> l14 : i2^0'=i2^post17, r^0'=r^post17, i^0'=i^post17, (i^0-i^post17 == 0 /\ i2^0-i2^post17 == 0 /\ r^0-r^post17 == 0), cost: 1
  18: l14 -> l12 : i2^0'=i2^post18, r^0'=r^post18, i^0'=i^post18, (r^0-r^post18 == 0 /\ i2^0-i2^post18 == 0 /\ i^0-i^post18 == 0), cost: 1
  19: l15 -> l13 : i2^0'=i2^post19, r^0'=r^post19, i^0'=i^post19, (i2^0-i2^post19 == 0 /\ r^0-r^post19 == 0 /\ i^0-i^post19 == 0), cost: 1
  20: l15 -> l13 : i2^0'=i2^post20, r^0'=r^post20, i^0'=i^post20, (i2^0-i2^post20 == 0 /\ r^0-r^post20 == 0 /\ -i^post20+i^0 == 0), cost: 1
  21: l15 -> l14 : i2^0'=i2^post21, r^0'=r^post21, i^0'=i^post21, (-i^post21+i^0 == 0 /\ -r^post21+r^0 == 0 /\ i2^0-i2^post21 == 0), cost: 1
  22: l16 -> l15 : i2^0'=i2^post22, r^0'=r^post22, i^0'=i^post22, (-i^post22+i^0 == 0 /\ i2^0-i2^post22 == 0 /\ -r^post22+r^0 == 0), cost: 1
  26: l17 -> l6 : i2^0'=i2^post26, r^0'=r^post26, i^0'=i^post26, (i^10 == 0 /\ i2^0-i2^post26 == 0 /\ r^0-r^post26 == 0 /\ i^post26 == 0), cost: 1
  27: l18 -> l17 : i2^0'=i2^post27, r^0'=r^post27, i^0'=i^post27, (-i^post27+i^0 == 0 /\ r^0-r^post27 == 0 /\ i2^0-i2^post27 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l18
   0: l0 -> l1 : i2^0'=i2^post0, r^0'=r^post0, i^0'=i^post0, (i^post0 == 0 /\ i2^0-i2^post0 == 0 /\ r^0-r^post0 == 0 /\ 1000-i^0 <= 0), cost: 1
   1: l0 -> l2 : i2^0'=i2^post1, r^0'=r^post1, i^0'=i^post1, (r^0-r^post1 == 0 /\ i^0-i^post1 == 0 /\ -999+i^0 <= 0 /\ i2^post1-i^0 == 0), cost: 1
  16: l1 -> l10 : i2^0'=i2^post16, r^0'=r^post16, i^0'=i^post16, (i^0-i^post16 == 0 /\ r^0-r^post16 == 0 /\ i2^0-i2^post16 == 0), cost: 1
  23: l2 -> l16 : i2^0'=i2^post23, r^0'=r^post23, i^0'=i^post23, (i2^0-i2^post23 == 0 /\ -i^post23+i^0 == 0 /\ -r^post23+r^0 == 0), cost: 1
  24: l2 -> l12 : i2^0'=i2^post24, r^0'=r^post24, i^0'=i^post24, (-i^post24+i^0 == 0 /\ i2^0-i2^post24 == 0 /\ r^0-r^post24 == 0), cost: 1
  25: l2 -> l16 : i2^0'=i2^post25, r^0'=r^post25, i^0'=i^post25, (-i^post25+i^0 == 0 /\ r^0-r^post25 == 0 /\ i2^0-i2^post25 == 0), cost: 1
   2: l3 -> l1 : i2^0'=i2^post2, r^0'=r^post2, i^0'=i^post2, (r^0-r^post2 == 0 /\ i2^0-i2^post2 == 0 /\ -1-i^0+i^post2 == 0), cost: 1
   3: l4 -> l5 : i2^0'=i2^post3, r^0'=r^post3, i^0'=i^post3, (i^0-i^post3 == 0 /\ i2^0-i2^post3 == 0 /\ r^0-r^post3 == 0), cost: 1
   4: l5 -> l3 : i2^0'=i2^post4, r^0'=r^post4, i^0'=i^post4, (r^0-r^post4 == 0 /\ i^0-i^post4 == 0 /\ i2^0-i2^post4 == 0), cost: 1
   5: l6 -> l0 : i2^0'=i2^post5, r^0'=r^post5, i^0'=i^post5, (i2^0-i2^post5 == 0 /\ r^0-r^post5 == 0 /\ i^0-i^post5 == 0), cost: 1
   6: l7 -> l4 : i2^0'=i2^post6, r^0'=r^post6, i^0'=i^post6, (i^0-i^post6 == 0 /\ i2^0-i2^post6 == 0 /\ r^0-r^post6 == 0), cost: 1
   7: l7 -> l4 : i2^0'=i2^post7, r^0'=r^post7, i^0'=i^post7, (r^0-r^post7 == 0 /\ i^0-i^post7 == 0 /\ i2^0-i2^post7 == 0), cost: 1
   8: l7 -> l5 : i2^0'=i2^post8, r^0'=r^post8, i^0'=i^post8, (i2^0-i2^post8 == 0 /\ r^0-r^post8 == 0 /\ i^0-i^post8 == 0), cost: 1
   9: l8 -> l7 : i2^0'=i2^post9, r^0'=r^post9, i^0'=i^post9, (0 == 0 /\ i2^0-i2^post9 == 0 /\ -i^post9+i^0 == 0), cost: 1
  10: l9 -> l8 : i2^0'=i2^post10, r^0'=r^post10, i^0'=i^post10, (-r^post10+r^0 == 0 /\ i2^0-i2^post10 == 0 /\ -i^post10+i^0 == 0), cost: 1
  11: l9 -> l3 : i2^0'=i2^post11, r^0'=r^post11, i^0'=i^post11, (-r^post11+r^0 == 0 /\ -i^post11+i^0 == 0 /\ i2^0-i2^post11 == 0), cost: 1
  12: l9 -> l8 : i2^0'=i2^post12, r^0'=r^post12, i^0'=i^post12, (i2^0-i2^post12 == 0 /\ -r^post12+r^0 == 0 /\ -i^post12+i^0 == 0), cost: 1
  14: l10 -> l9 : i2^0'=i2^post14, r^0'=r^post14, i^0'=i^post14, (-i^post14+i^0 == 0 /\ -999+i^0 <= 0 /\ r^0-r^post14 == 0 /\ i2^0-i2^post14 == 0), cost: 1
  15: l12 -> l6 : i2^0'=i2^post15, r^0'=r^post15, i^0'=i^post15, (i2^0-i2^post15 == 0 /\ -1+i^post15-i^0 == 0 /\ r^0-r^post15 == 0), cost: 1
  17: l13 -> l14 : i2^0'=i2^post17, r^0'=r^post17, i^0'=i^post17, (i^0-i^post17 == 0 /\ i2^0-i2^post17 == 0 /\ r^0-r^post17 == 0), cost: 1
  18: l14 -> l12 : i2^0'=i2^post18, r^0'=r^post18, i^0'=i^post18, (r^0-r^post18 == 0 /\ i2^0-i2^post18 == 0 /\ i^0-i^post18 == 0), cost: 1
  19: l15 -> l13 : i2^0'=i2^post19, r^0'=r^post19, i^0'=i^post19, (i2^0-i2^post19 == 0 /\ r^0-r^post19 == 0 /\ i^0-i^post19 == 0), cost: 1
  20: l15 -> l13 : i2^0'=i2^post20, r^0'=r^post20, i^0'=i^post20, (i2^0-i2^post20 == 0 /\ r^0-r^post20 == 0 /\ -i^post20+i^0 == 0), cost: 1
  21: l15 -> l14 : i2^0'=i2^post21, r^0'=r^post21, i^0'=i^post21, (-i^post21+i^0 == 0 /\ -r^post21+r^0 == 0 /\ i2^0-i2^post21 == 0), cost: 1
  22: l16 -> l15 : i2^0'=i2^post22, r^0'=r^post22, i^0'=i^post22, (-i^post22+i^0 == 0 /\ i2^0-i2^post22 == 0 /\ -r^post22+r^0 == 0), cost: 1
  26: l17 -> l6 : i2^0'=i2^post26, r^0'=r^post26, i^0'=i^post26, (i^10 == 0 /\ i2^0-i2^post26 == 0 /\ r^0-r^post26 == 0 /\ i^post26 == 0), cost: 1
  27: l18 -> l17 : i2^0'=i2^post27, r^0'=r^post27, i^0'=i^post27, (-i^post27+i^0 == 0 /\ r^0-r^post27 == 0 /\ i2^0-i2^post27 == 0), cost: 1


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

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

Applied preprocessing
Original rule:
l3 -> l1 : i2^0'=i2^post2, r^0'=r^post2, i^0'=i^post2, (r^0-r^post2 == 0 /\ i2^0-i2^post2 == 0 /\ -1-i^0+i^post2 == 0), cost: 1
New rule:
l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l4 -> l5 : i2^0'=i2^post3, r^0'=r^post3, i^0'=i^post3, (i^0-i^post3 == 0 /\ i2^0-i2^post3 == 0 /\ r^0-r^post3 == 0), cost: 1
New rule:
l4 -> l5 : TRUE, cost: 1

Applied preprocessing
Original rule:
l5 -> l3 : i2^0'=i2^post4, r^0'=r^post4, i^0'=i^post4, (r^0-r^post4 == 0 /\ i^0-i^post4 == 0 /\ i2^0-i2^post4 == 0), cost: 1
New rule:
l5 -> l3 : TRUE, cost: 1

Applied preprocessing
Original rule:
l6 -> l0 : i2^0'=i2^post5, r^0'=r^post5, i^0'=i^post5, (i2^0-i2^post5 == 0 /\ r^0-r^post5 == 0 /\ i^0-i^post5 == 0), cost: 1
New rule:
l6 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l7 -> l4 : i2^0'=i2^post6, r^0'=r^post6, i^0'=i^post6, (i^0-i^post6 == 0 /\ i2^0-i2^post6 == 0 /\ r^0-r^post6 == 0), cost: 1
New rule:
l7 -> l4 : TRUE, cost: 1

Applied preprocessing
Original rule:
l7 -> l4 : i2^0'=i2^post7, r^0'=r^post7, i^0'=i^post7, (r^0-r^post7 == 0 /\ i^0-i^post7 == 0 /\ i2^0-i2^post7 == 0), cost: 1
New rule:
l7 -> l4 : TRUE, cost: 1

Applied preprocessing
Original rule:
l7 -> l5 : i2^0'=i2^post8, r^0'=r^post8, i^0'=i^post8, (i2^0-i2^post8 == 0 /\ r^0-r^post8 == 0 /\ i^0-i^post8 == 0), cost: 1
New rule:
l7 -> l5 : TRUE, cost: 1

Applied preprocessing
Original rule:
l8 -> l7 : i2^0'=i2^post9, r^0'=r^post9, i^0'=i^post9, (0 == 0 /\ i2^0-i2^post9 == 0 /\ -i^post9+i^0 == 0), cost: 1
New rule:
l8 -> l7 : r^0'=r^post9, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l9 -> l8 : i2^0'=i2^post10, r^0'=r^post10, i^0'=i^post10, (-r^post10+r^0 == 0 /\ i2^0-i2^post10 == 0 /\ -i^post10+i^0 == 0), cost: 1
New rule:
l9 -> l8 : TRUE, cost: 1

Applied preprocessing
Original rule:
l9 -> l3 : i2^0'=i2^post11, r^0'=r^post11, i^0'=i^post11, (-r^post11+r^0 == 0 /\ -i^post11+i^0 == 0 /\ i2^0-i2^post11 == 0), cost: 1
New rule:
l9 -> l3 : TRUE, cost: 1

Applied preprocessing
Original rule:
l9 -> l8 : i2^0'=i2^post12, r^0'=r^post12, i^0'=i^post12, (i2^0-i2^post12 == 0 /\ -r^post12+r^0 == 0 /\ -i^post12+i^0 == 0), cost: 1
New rule:
l9 -> l8 : TRUE, cost: 1

Applied preprocessing
Original rule:
l10 -> l9 : i2^0'=i2^post14, r^0'=r^post14, i^0'=i^post14, (-i^post14+i^0 == 0 /\ -999+i^0 <= 0 /\ r^0-r^post14 == 0 /\ i2^0-i2^post14 == 0), cost: 1
New rule:
l10 -> l9 : -999+i^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l12 -> l6 : i2^0'=i2^post15, r^0'=r^post15, i^0'=i^post15, (i2^0-i2^post15 == 0 /\ -1+i^post15-i^0 == 0 /\ r^0-r^post15 == 0), cost: 1
New rule:
l12 -> l6 : i^0'=1+i^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l10 : i2^0'=i2^post16, r^0'=r^post16, i^0'=i^post16, (i^0-i^post16 == 0 /\ r^0-r^post16 == 0 /\ i2^0-i2^post16 == 0), cost: 1
New rule:
l1 -> l10 : TRUE, cost: 1

Applied preprocessing
Original rule:
l13 -> l14 : i2^0'=i2^post17, r^0'=r^post17, i^0'=i^post17, (i^0-i^post17 == 0 /\ i2^0-i2^post17 == 0 /\ r^0-r^post17 == 0), cost: 1
New rule:
l13 -> l14 : TRUE, cost: 1

Applied preprocessing
Original rule:
l14 -> l12 : i2^0'=i2^post18, r^0'=r^post18, i^0'=i^post18, (r^0-r^post18 == 0 /\ i2^0-i2^post18 == 0 /\ i^0-i^post18 == 0), cost: 1
New rule:
l14 -> l12 : TRUE, cost: 1

Applied preprocessing
Original rule:
l15 -> l13 : i2^0'=i2^post19, r^0'=r^post19, i^0'=i^post19, (i2^0-i2^post19 == 0 /\ r^0-r^post19 == 0 /\ i^0-i^post19 == 0), cost: 1
New rule:
l15 -> l13 : TRUE, cost: 1

Applied preprocessing
Original rule:
l15 -> l13 : i2^0'=i2^post20, r^0'=r^post20, i^0'=i^post20, (i2^0-i2^post20 == 0 /\ r^0-r^post20 == 0 /\ -i^post20+i^0 == 0), cost: 1
New rule:
l15 -> l13 : TRUE, cost: 1

Applied preprocessing
Original rule:
l15 -> l14 : i2^0'=i2^post21, r^0'=r^post21, i^0'=i^post21, (-i^post21+i^0 == 0 /\ -r^post21+r^0 == 0 /\ i2^0-i2^post21 == 0), cost: 1
New rule:
l15 -> l14 : TRUE, cost: 1

Applied preprocessing
Original rule:
l16 -> l15 : i2^0'=i2^post22, r^0'=r^post22, i^0'=i^post22, (-i^post22+i^0 == 0 /\ i2^0-i2^post22 == 0 /\ -r^post22+r^0 == 0), cost: 1
New rule:
l16 -> l15 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l16 : i2^0'=i2^post23, r^0'=r^post23, i^0'=i^post23, (i2^0-i2^post23 == 0 /\ -i^post23+i^0 == 0 /\ -r^post23+r^0 == 0), cost: 1
New rule:
l2 -> l16 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l12 : i2^0'=i2^post24, r^0'=r^post24, i^0'=i^post24, (-i^post24+i^0 == 0 /\ i2^0-i2^post24 == 0 /\ r^0-r^post24 == 0), cost: 1
New rule:
l2 -> l12 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l16 : i2^0'=i2^post25, r^0'=r^post25, i^0'=i^post25, (-i^post25+i^0 == 0 /\ r^0-r^post25 == 0 /\ i2^0-i2^post25 == 0), cost: 1
New rule:
l2 -> l16 : TRUE, cost: 1

Applied preprocessing
Original rule:
l17 -> l6 : i2^0'=i2^post26, r^0'=r^post26, i^0'=i^post26, (i^10 == 0 /\ i2^0-i2^post26 == 0 /\ r^0-r^post26 == 0 /\ i^post26 == 0), cost: 1
New rule:
l17 -> l6 : i^0'=0, TRUE, cost: 1

Applied preprocessing
Original rule:
l18 -> l17 : i2^0'=i2^post27, r^0'=r^post27, i^0'=i^post27, (-i^post27+i^0 == 0 /\ r^0-r^post27 == 0 /\ i2^0-i2^post27 == 0), cost: 1
New rule:
l18 -> l17 : TRUE, cost: 1

Applied deletion
Removed the following rules: 34 38 46 50

Simplified rules
Start location: l18
  28: l0 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 1
  29: l0 -> l2 : i2^0'=i^0, -999+i^0 <= 0, cost: 1
  43: l1 -> l10 : TRUE, cost: 1
  51: l2 -> l12 : TRUE, cost: 1
  52: l2 -> l16 : TRUE, cost: 1
  30: l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  31: l4 -> l5 : TRUE, cost: 1
  32: l5 -> l3 : TRUE, cost: 1
  33: l6 -> l0 : TRUE, cost: 1
  35: l7 -> l4 : TRUE, cost: 1
  36: l7 -> l5 : TRUE, cost: 1
  37: l8 -> l7 : r^0'=r^post9, 0 == 0, cost: 1
  39: l9 -> l3 : TRUE, cost: 1
  40: l9 -> l8 : TRUE, cost: 1
  41: l10 -> l9 : -999+i^0 <= 0, cost: 1
  42: l12 -> l6 : i^0'=1+i^0, TRUE, cost: 1
  44: l13 -> l14 : TRUE, cost: 1
  45: l14 -> l12 : TRUE, cost: 1
  47: l15 -> l13 : TRUE, cost: 1
  48: l15 -> l14 : TRUE, cost: 1
  49: l16 -> l15 : TRUE, cost: 1
  53: l17 -> l6 : i^0'=0, TRUE, cost: 1
  54: l18 -> l17 : TRUE, cost: 1


Eliminating location l17 by chaining:

Applied chaining
First rule:
l18 -> l17 : TRUE, cost: 1
Second rule:
l17 -> l6 : i^0'=0, TRUE, cost: 1
New rule:
l18 -> l6 : i^0'=0, TRUE, cost: 2

Applied deletion
Removed the following rules: 53 54

Eliminating location l10 by chaining:

Applied chaining
First rule:
l1 -> l10 : TRUE, cost: 1
Second rule:
l10 -> l9 : -999+i^0 <= 0, cost: 1
New rule:
l1 -> l9 : -999+i^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 41 43

Eliminating location l8 by chaining:

Applied chaining
First rule:
l9 -> l8 : TRUE, cost: 1
Second rule:
l8 -> l7 : r^0'=r^post9, 0 == 0, cost: 1
New rule:
l9 -> l7 : r^0'=r^post9, 0 == 0, cost: 2

Applied deletion
Removed the following rules: 37 40

Eliminating location l4 by chaining:

Applied chaining
First rule:
l7 -> l4 : TRUE, cost: 1
Second rule:
l4 -> l5 : TRUE, cost: 1
New rule:
l7 -> l5 : TRUE, cost: 2

Applied deletion
Removed the following rules: 31 35

Eliminating location l16 by chaining:

Applied chaining
First rule:
l2 -> l16 : TRUE, cost: 1
Second rule:
l16 -> l15 : TRUE, cost: 1
New rule:
l2 -> l15 : TRUE, cost: 2

Applied deletion
Removed the following rules: 49 52

Eliminating location l13 by chaining:

Applied chaining
First rule:
l15 -> l13 : TRUE, cost: 1
Second rule:
l13 -> l14 : TRUE, cost: 1
New rule:
l15 -> l14 : TRUE, cost: 2

Applied deletion
Removed the following rules: 44 47

Eliminated locations on linear paths
Start location: l18
  28: l0 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 1
  29: l0 -> l2 : i2^0'=i^0, -999+i^0 <= 0, cost: 1
  56: l1 -> l9 : -999+i^0 <= 0, cost: 2
  51: l2 -> l12 : TRUE, cost: 1
  59: l2 -> l15 : TRUE, cost: 2
  30: l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  32: l5 -> l3 : TRUE, cost: 1
  33: l6 -> l0 : TRUE, cost: 1
  36: l7 -> l5 : TRUE, cost: 1
  58: l7 -> l5 : TRUE, cost: 2
  39: l9 -> l3 : TRUE, cost: 1
  57: l9 -> l7 : r^0'=r^post9, 0 == 0, cost: 2
  42: l12 -> l6 : i^0'=1+i^0, TRUE, cost: 1
  45: l14 -> l12 : TRUE, cost: 1
  48: l15 -> l14 : TRUE, cost: 1
  60: l15 -> l14 : TRUE, cost: 2
  55: l18 -> l6 : i^0'=0, TRUE, cost: 2


Eliminating location l0 by chaining:

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

Applied chaining
First rule:
l6 -> l0 : TRUE, cost: 1
Second rule:
l0 -> l2 : i2^0'=i^0, -999+i^0 <= 0, cost: 1
New rule:
l6 -> l2 : i2^0'=i^0, -999+i^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 28 29 33

Eliminating location l9 by chaining:

Applied chaining
First rule:
l1 -> l9 : -999+i^0 <= 0, cost: 2
Second rule:
l9 -> l3 : TRUE, cost: 1
New rule:
l1 -> l3 : -999+i^0 <= 0, cost: 3

Applied chaining
First rule:
l1 -> l9 : -999+i^0 <= 0, cost: 2
Second rule:
l9 -> l7 : r^0'=r^post9, 0 == 0, cost: 2
New rule:
l1 -> l7 : r^0'=r^post9, (0 == 0 /\ -999+i^0 <= 0), cost: 4

Applied simplification
Original rule:
l1 -> l7 : r^0'=r^post9, (0 == 0 /\ -999+i^0 <= 0), cost: 4
New rule:
l1 -> l7 : r^0'=r^post9, -999+i^0 <= 0, cost: 4

Applied deletion
Removed the following rules: 39 56 57

Eliminating location l5 by chaining:

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

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

Applied deletion
Removed the following rules: 32 36 58

Eliminating location l15 by chaining:

Applied chaining
First rule:
l2 -> l15 : TRUE, cost: 2
Second rule:
l15 -> l14 : TRUE, cost: 1
New rule:
l2 -> l14 : TRUE, cost: 3

Applied chaining
First rule:
l2 -> l15 : TRUE, cost: 2
Second rule:
l15 -> l14 : TRUE, cost: 2
New rule:
l2 -> l14 : TRUE, cost: 4

Applied deletion
Removed the following rules: 48 59 60

Eliminated locations on tree-shaped paths
Start location: l18
  63: l1 -> l3 : -999+i^0 <= 0, cost: 3
  64: l1 -> l7 : r^0'=r^post9, -999+i^0 <= 0, cost: 4
  51: l2 -> l12 : TRUE, cost: 1
  67: l2 -> l14 : TRUE, cost: 3
  68: l2 -> l14 : TRUE, cost: 4
  30: l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  61: l6 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 2
  62: l6 -> l2 : i2^0'=i^0, -999+i^0 <= 0, cost: 2
  65: l7 -> l3 : TRUE, cost: 2
  66: l7 -> l3 : TRUE, cost: 3
  42: l12 -> l6 : i^0'=1+i^0, TRUE, cost: 1
  45: l14 -> l12 : TRUE, cost: 1
  55: l18 -> l6 : i^0'=0, TRUE, cost: 2


Applied merging
first rule:
l2 -> l14 : TRUE, cost: 3
second rule:
l2 -> l14 : TRUE, cost: 4
new rule:
l2 -> l14 : TRUE, cost: 3

Merged rules
Start location: l18
  63: l1 -> l3 : -999+i^0 <= 0, cost: 3
  64: l1 -> l7 : r^0'=r^post9, -999+i^0 <= 0, cost: 4
  51: l2 -> l12 : TRUE, cost: 1
  69: l2 -> l14 : TRUE, cost: 3
  30: l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  61: l6 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 2
  62: l6 -> l2 : i2^0'=i^0, -999+i^0 <= 0, cost: 2
  65: l7 -> l3 : TRUE, cost: 2
  66: l7 -> l3 : TRUE, cost: 3
  42: l12 -> l6 : i^0'=1+i^0, TRUE, cost: 1
  45: l14 -> l12 : TRUE, cost: 1
  55: l18 -> l6 : i^0'=0, TRUE, cost: 2


Eliminating location l14 by chaining:

Applied chaining
First rule:
l2 -> l14 : TRUE, cost: 3
Second rule:
l14 -> l12 : TRUE, cost: 1
New rule:
l2 -> l12 : TRUE, cost: 4

Applied deletion
Removed the following rules: 45 69

Eliminated locations on linear paths
Start location: l18
  63: l1 -> l3 : -999+i^0 <= 0, cost: 3
  64: l1 -> l7 : r^0'=r^post9, -999+i^0 <= 0, cost: 4
  51: l2 -> l12 : TRUE, cost: 1
  70: l2 -> l12 : TRUE, cost: 4
  30: l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  61: l6 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 2
  62: l6 -> l2 : i2^0'=i^0, -999+i^0 <= 0, cost: 2
  65: l7 -> l3 : TRUE, cost: 2
  66: l7 -> l3 : TRUE, cost: 3
  42: l12 -> l6 : i^0'=1+i^0, TRUE, cost: 1
  55: l18 -> l6 : i^0'=0, TRUE, cost: 2


Eliminating location l2 by chaining:

Applied chaining
First rule:
l6 -> l2 : i2^0'=i^0, -999+i^0 <= 0, cost: 2
Second rule:
l2 -> l12 : TRUE, cost: 1
New rule:
l6 -> l12 : i2^0'=i^0, -999+i^0 <= 0, cost: 3

Applied chaining
First rule:
l6 -> l2 : i2^0'=i^0, -999+i^0 <= 0, cost: 2
Second rule:
l2 -> l12 : TRUE, cost: 4
New rule:
l6 -> l12 : i2^0'=i^0, -999+i^0 <= 0, cost: 6

Applied deletion
Removed the following rules: 51 62 70

Eliminating location l7 by chaining:

Applied chaining
First rule:
l1 -> l7 : r^0'=r^post9, -999+i^0 <= 0, cost: 4
Second rule:
l7 -> l3 : TRUE, cost: 2
New rule:
l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 6

Applied chaining
First rule:
l1 -> l7 : r^0'=r^post9, -999+i^0 <= 0, cost: 4
Second rule:
l7 -> l3 : TRUE, cost: 3
New rule:
l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 7

Applied deletion
Removed the following rules: 64 65 66

Eliminated locations on tree-shaped paths
Start location: l18
  63: l1 -> l3 : -999+i^0 <= 0, cost: 3
  73: l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 6
  74: l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 7
  30: l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  61: l6 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 2
  71: l6 -> l12 : i2^0'=i^0, -999+i^0 <= 0, cost: 3
  72: l6 -> l12 : i2^0'=i^0, -999+i^0 <= 0, cost: 6
  42: l12 -> l6 : i^0'=1+i^0, TRUE, cost: 1
  55: l18 -> l6 : i^0'=0, TRUE, cost: 2


Applied merging
first rule:
l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 6
second rule:
l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 7
new rule:
l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 6

Applied merging
first rule:
l6 -> l12 : i2^0'=i^0, -999+i^0 <= 0, cost: 3
second rule:
l6 -> l12 : i2^0'=i^0, -999+i^0 <= 0, cost: 6
new rule:
l6 -> l12 : i2^0'=i^0, -999+i^0 <= 0, cost: 3

Merged rules
Start location: l18
  63: l1 -> l3 : -999+i^0 <= 0, cost: 3
  75: l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 6
  30: l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  61: l6 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 2
  76: l6 -> l12 : i2^0'=i^0, -999+i^0 <= 0, cost: 3
  42: l12 -> l6 : i^0'=1+i^0, TRUE, cost: 1
  55: l18 -> l6 : i^0'=0, TRUE, cost: 2


Eliminating location l12 by chaining:

Applied chaining
First rule:
l6 -> l12 : i2^0'=i^0, -999+i^0 <= 0, cost: 3
Second rule:
l12 -> l6 : i^0'=1+i^0, TRUE, cost: 1
New rule:
l6 -> l6 : i2^0'=i^0, i^0'=1+i^0, -999+i^0 <= 0, cost: 4

Applied deletion
Removed the following rules: 42 76

Eliminated locations on linear paths
Start location: l18
  63: l1 -> l3 : -999+i^0 <= 0, cost: 3
  75: l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 6
  30: l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  61: l6 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 2
  77: l6 -> l6 : i2^0'=i^0, i^0'=1+i^0, -999+i^0 <= 0, cost: 4
  55: l18 -> l6 : i^0'=0, TRUE, cost: 2


Applied acceleration
Original rule:
l6 -> l6 : i2^0'=i^0, i^0'=1+i^0, -999+i^0 <= 0, cost: 4
New rule:
l6 -> l6 : i2^0'=-1+i^0+n0, i^0'=i^0+n0, (-1+n0 >= 0 /\ 1000-i^0-n0 >= 0), cost: 4*n0

Applied instantiation
Original rule:
l6 -> l6 : i2^0'=-1+i^0+n0, i^0'=i^0+n0, (-1+n0 >= 0 /\ 1000-i^0-n0 >= 0), cost: 4*n0
New rule:
l6 -> l6 : i2^0'=999, i^0'=1000, (0 >= 0 /\ 999-i^0 >= 0), cost: 4000-4*i^0

Applied simplification
Original rule:
l6 -> l6 : i2^0'=999, i^0'=1000, (0 >= 0 /\ 999-i^0 >= 0), cost: 4000-4*i^0
New rule:
l6 -> l6 : i2^0'=999, i^0'=1000, -999+i^0 <= 0, cost: 4000-4*i^0

Applied deletion
Removed the following rules: 77

Accelerated simple loops
Start location: l18
  63: l1 -> l3 : -999+i^0 <= 0, cost: 3
  75: l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 6
  30: l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  61: l6 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 2
  79: l6 -> l6 : i2^0'=999, i^0'=1000, -999+i^0 <= 0, cost: 4000-4*i^0
  55: l18 -> l6 : i^0'=0, TRUE, cost: 2


Applied chaining
First rule:
l18 -> l6 : i^0'=0, TRUE, cost: 2
Second rule:
l6 -> l6 : i2^0'=999, i^0'=1000, -999+i^0 <= 0, cost: 4000-4*i^0
New rule:
l18 -> l6 : i2^0'=999, i^0'=1000, -999 <= 0, cost: 4002

Applied deletion
Removed the following rules: 79

Chained accelerated rules with incoming rules
Start location: l18
  63: l1 -> l3 : -999+i^0 <= 0, cost: 3
  75: l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 6
  30: l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
  61: l6 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 2
  55: l18 -> l6 : i^0'=0, TRUE, cost: 2
  80: l18 -> l6 : i2^0'=999, i^0'=1000, -999 <= 0, cost: 4002


Eliminating location l6 by chaining:

Applied chaining
First rule:
l18 -> l6 : i2^0'=999, i^0'=1000, -999 <= 0, cost: 4002
Second rule:
l6 -> l1 : i^0'=0, -1000+i^0 >= 0, cost: 2
New rule:
l18 -> l1 : i2^0'=999, i^0'=0, (0 >= 0 /\ -999 <= 0), cost: 4004

Applied deletion
Removed the following rules: 55 61 80

Eliminating location l3 by chaining:

Applied chaining
First rule:
l1 -> l3 : -999+i^0 <= 0, cost: 3
Second rule:
l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
New rule:
l1 -> l1 : i^0'=1+i^0, -999+i^0 <= 0, cost: 4

Applied chaining
First rule:
l1 -> l3 : r^0'=r^post9, -999+i^0 <= 0, cost: 6
Second rule:
l3 -> l1 : i^0'=1+i^0, TRUE, cost: 1
New rule:
l1 -> l1 : r^0'=r^post9, i^0'=1+i^0, -999+i^0 <= 0, cost: 7

Applied deletion
Removed the following rules: 30 63 75

Eliminated locations on tree-shaped paths
Start location: l18
  82: l1 -> l1 : i^0'=1+i^0, -999+i^0 <= 0, cost: 4
  83: l1 -> l1 : r^0'=r^post9, i^0'=1+i^0, -999+i^0 <= 0, cost: 7
  81: l18 -> l1 : i2^0'=999, i^0'=0, (0 >= 0 /\ -999 <= 0), cost: 4004


Applied acceleration
Original rule:
l1 -> l1 : i^0'=1+i^0, -999+i^0 <= 0, cost: 4
New rule:
l1 -> l1 : i^0'=i^0+n4, (1000-i^0-n4 >= 0 /\ n4 >= 0), cost: 4*n4

Applied instantiation
Original rule:
l1 -> l1 : i^0'=i^0+n4, (1000-i^0-n4 >= 0 /\ n4 >= 0), cost: 4*n4
New rule:
l1 -> l1 : i^0'=1000, (0 >= 0 /\ 1000-i^0 >= 0), cost: 4000-4*i^0

Applied acceleration
Original rule:
l1 -> l1 : r^0'=r^post9, i^0'=1+i^0, -999+i^0 <= 0, cost: 7
New rule:
l1 -> l1 : r^0'=r^post9, i^0'=n6+i^0, (-1+n6 >= 0 /\ 1000-n6-i^0 >= 0), cost: 7*n6

Applied instantiation
Original rule:
l1 -> l1 : r^0'=r^post9, i^0'=n6+i^0, (-1+n6 >= 0 /\ 1000-n6-i^0 >= 0), cost: 7*n6
New rule:
l1 -> l1 : r^0'=r^post9, i^0'=1000, (0 >= 0 /\ 999-i^0 >= 0), cost: 7000-7*i^0

Applied simplification
Original rule:
l1 -> l1 : i^0'=1000, (0 >= 0 /\ 1000-i^0 >= 0), cost: 4000-4*i^0
New rule:
l1 -> l1 : i^0'=1000, -1000+i^0 <= 0, cost: 4000-4*i^0

Applied simplification
Original rule:
l1 -> l1 : r^0'=r^post9, i^0'=1000, (0 >= 0 /\ 999-i^0 >= 0), cost: 7000-7*i^0
New rule:
l1 -> l1 : r^0'=r^post9, i^0'=1000, -999+i^0 <= 0, cost: 7000-7*i^0

Applied deletion
Removed the following rules: 82 83

Accelerated simple loops
Start location: l18
  86: l1 -> l1 : i^0'=1000, -1000+i^0 <= 0, cost: 4000-4*i^0
  87: l1 -> l1 : r^0'=r^post9, i^0'=1000, -999+i^0 <= 0, cost: 7000-7*i^0
  81: l18 -> l1 : i2^0'=999, i^0'=0, (0 >= 0 /\ -999 <= 0), cost: 4004


Applied chaining
First rule:
l18 -> l1 : i2^0'=999, i^0'=0, (0 >= 0 /\ -999 <= 0), cost: 4004
Second rule:
l1 -> l1 : i^0'=1000, -1000+i^0 <= 0, cost: 4000-4*i^0
New rule:
l18 -> l1 : i2^0'=999, i^0'=1000, (0 >= 0 /\ -999 <= 0 /\ -1000 <= 0), cost: 8004

Applied chaining
First rule:
l18 -> l1 : i2^0'=999, i^0'=0, (0 >= 0 /\ -999 <= 0), cost: 4004
Second rule:
l1 -> l1 : r^0'=r^post9, i^0'=1000, -999+i^0 <= 0, cost: 7000-7*i^0
New rule:
l18 -> l1 : i2^0'=999, r^0'=r^post9, i^0'=1000, (0 >= 0 /\ -999 <= 0), cost: 11004

Applied deletion
Removed the following rules: 86 87

Chained accelerated rules with incoming rules
Start location: l18
  81: l18 -> l1 : i2^0'=999, i^0'=0, (0 >= 0 /\ -999 <= 0), cost: 4004
  88: l18 -> l1 : i2^0'=999, i^0'=1000, (0 >= 0 /\ -999 <= 0 /\ -1000 <= 0), cost: 8004
  89: l18 -> l1 : i2^0'=999, r^0'=r^post9, i^0'=1000, (0 >= 0 /\ -999 <= 0), cost: 11004


Removed unreachable locations and irrelevant leafs
Start location: l18
  <empty>


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0