NO

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


Removed unreachable rules and leafs
Start location: l13
   0: l0 -> l1 : WItemsNum^0'=WItemsNum^post0, ___rho_2_^0'=___rho_2_^post0, ___rho_1_^0'=___rho_1_^post0, (WItemsNum^0-WItemsNum^post0 == 0 /\ ___rho_2_^0-___rho_2_^post0 == 0 /\ -___rho_1_^post0+___rho_1_^0 == 0), cost: 1
   1: l1 -> l2 : WItemsNum^0'=WItemsNum^post1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post1, (0 == 0 /\ WItemsNum^0-WItemsNum^post1 == 0 /\ ___rho_1_^0-___rho_1_^post1 == 0), cost: 1
  13: l2 -> l10 : WItemsNum^0'=WItemsNum^post13, ___rho_2_^0'=___rho_2_^post13, ___rho_1_^0'=___rho_1_^post13, (-___rho_1_^post13+___rho_1_^0 == 0 /\ 6-WItemsNum^0 <= 0 /\ WItemsNum^0-WItemsNum^post13 == 0 /\ ___rho_2_^0-___rho_2_^post13 == 0), cost: 1
  14: l2 -> l11 : WItemsNum^0'=WItemsNum^post14, ___rho_2_^0'=___rho_2_^post14, ___rho_1_^0'=___rho_1_^post14, (-___rho_1_^post14+___rho_1_^0 == 0 /\ ___rho_2_^0-___rho_2_^post14 == 0 /\ -5+WItemsNum^0 <= 0 /\ WItemsNum^0-WItemsNum^post14 == 0), cost: 1
   3: l5 -> l6 : WItemsNum^0'=WItemsNum^post3, ___rho_2_^0'=___rho_2_^post3, ___rho_1_^0'=___rho_1_^post3, (___rho_1_^0-___rho_1_^post3 == 0 /\ WItemsNum^0-WItemsNum^post3 == 0 /\ ___rho_2_^0-___rho_2_^post3 == 0), cost: 1
   5: l6 -> l5 : WItemsNum^0'=WItemsNum^post5, ___rho_2_^0'=___rho_2_^post5, ___rho_1_^0'=___rho_1_^post5, (3-WItemsNum^0 <= 0 /\ ___rho_2_^0-___rho_2_^post5 == 0 /\ ___rho_1_^0-___rho_1_^post5 == 0 /\ 1-WItemsNum^0+WItemsNum^post5 == 0), cost: 1
   6: l6 -> l0 : WItemsNum^0'=WItemsNum^post6, ___rho_2_^0'=___rho_2_^post6, ___rho_1_^0'=___rho_1_^post6, (___rho_1_^0-___rho_1_^post6 == 0 /\ -1+WItemsNum^post6 == 0 /\ -2+WItemsNum^0 <= 0 /\ ___rho_2_^0-___rho_2_^post6 == 0), cost: 1
   9: l10 -> l1 : WItemsNum^0'=WItemsNum^post9, ___rho_2_^0'=___rho_2_^post9, ___rho_1_^0'=___rho_1_^post9, (___rho_2_^0-___rho_2_^post9 == 0 /\ -1-WItemsNum^0+WItemsNum^post9 == 0 /\ -___rho_1_^post9+___rho_1_^0 == 0 /\ 6-WItemsNum^0 <= 0), cost: 1
  10: l10 -> l1 : WItemsNum^0'=WItemsNum^post10, ___rho_2_^0'=___rho_2_^post10, ___rho_1_^0'=___rho_1_^post10, (-___rho_2_^post10+___rho_2_^0 == 0 /\ -___rho_1_^post10+___rho_1_^0 == 0 /\ -1-WItemsNum^0+WItemsNum^post10 == 0 /\ -5+WItemsNum^0 <= 0), cost: 1
  11: l11 -> l10 : WItemsNum^0'=WItemsNum^post11, ___rho_2_^0'=___rho_2_^post11, ___rho_1_^0'=___rho_1_^post11, (___rho_2_^0 <= 0 /\ -___rho_2_^post11+___rho_2_^0 == 0 /\ -___rho_1_^post11+___rho_1_^0 == 0 /\ WItemsNum^0-WItemsNum^post11 == 0), cost: 1
  12: l11 -> l5 : WItemsNum^0'=WItemsNum^post12, ___rho_2_^0'=___rho_2_^post12, ___rho_1_^0'=___rho_1_^post12, (1-___rho_2_^0 <= 0 /\ WItemsNum^0-WItemsNum^post12 == 0 /\ -___rho_2_^post12+___rho_2_^0 == 0 /\ -___rho_1_^post12+___rho_1_^0 == 0), cost: 1
  15: l12 -> l0 : WItemsNum^0'=WItemsNum^post15, ___rho_2_^0'=___rho_2_^post15, ___rho_1_^0'=___rho_1_^post15, (0 == 0 /\ WItemsNum^post15-___rho_1_^post15 == 0 /\ ___rho_2_^0-___rho_2_^post15 == 0), cost: 1
  16: l13 -> l12 : WItemsNum^0'=WItemsNum^post16, ___rho_2_^0'=___rho_2_^post16, ___rho_1_^0'=___rho_1_^post16, (___rho_1_^0-___rho_1_^post16 == 0 /\ WItemsNum^0-WItemsNum^post16 == 0 /\ ___rho_2_^0-___rho_2_^post16 == 0), cost: 1


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

Applied preprocessing
Original rule:
l1 -> l2 : WItemsNum^0'=WItemsNum^post1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post1, (0 == 0 /\ WItemsNum^0-WItemsNum^post1 == 0 /\ ___rho_1_^0-___rho_1_^post1 == 0), cost: 1
New rule:
l1 -> l2 : ___rho_2_^0'=___rho_2_^post1, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l6 : WItemsNum^0'=WItemsNum^post3, ___rho_2_^0'=___rho_2_^post3, ___rho_1_^0'=___rho_1_^post3, (___rho_1_^0-___rho_1_^post3 == 0 /\ WItemsNum^0-WItemsNum^post3 == 0 /\ ___rho_2_^0-___rho_2_^post3 == 0), cost: 1
New rule:
l5 -> l6 : TRUE, cost: 1

Applied preprocessing
Original rule:
l6 -> l5 : WItemsNum^0'=WItemsNum^post5, ___rho_2_^0'=___rho_2_^post5, ___rho_1_^0'=___rho_1_^post5, (3-WItemsNum^0 <= 0 /\ ___rho_2_^0-___rho_2_^post5 == 0 /\ ___rho_1_^0-___rho_1_^post5 == 0 /\ 1-WItemsNum^0+WItemsNum^post5 == 0), cost: 1
New rule:
l6 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l6 -> l0 : WItemsNum^0'=WItemsNum^post6, ___rho_2_^0'=___rho_2_^post6, ___rho_1_^0'=___rho_1_^post6, (___rho_1_^0-___rho_1_^post6 == 0 /\ -1+WItemsNum^post6 == 0 /\ -2+WItemsNum^0 <= 0 /\ ___rho_2_^0-___rho_2_^post6 == 0), cost: 1
New rule:
l6 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l10 -> l1 : WItemsNum^0'=WItemsNum^post9, ___rho_2_^0'=___rho_2_^post9, ___rho_1_^0'=___rho_1_^post9, (___rho_2_^0-___rho_2_^post9 == 0 /\ -1-WItemsNum^0+WItemsNum^post9 == 0 /\ -___rho_1_^post9+___rho_1_^0 == 0 /\ 6-WItemsNum^0 <= 0), cost: 1
New rule:
l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l10 -> l1 : WItemsNum^0'=WItemsNum^post10, ___rho_2_^0'=___rho_2_^post10, ___rho_1_^0'=___rho_1_^post10, (-___rho_2_^post10+___rho_2_^0 == 0 /\ -___rho_1_^post10+___rho_1_^0 == 0 /\ -1-WItemsNum^0+WItemsNum^post10 == 0 /\ -5+WItemsNum^0 <= 0), cost: 1
New rule:
l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l11 -> l10 : WItemsNum^0'=WItemsNum^post11, ___rho_2_^0'=___rho_2_^post11, ___rho_1_^0'=___rho_1_^post11, (___rho_2_^0 <= 0 /\ -___rho_2_^post11+___rho_2_^0 == 0 /\ -___rho_1_^post11+___rho_1_^0 == 0 /\ WItemsNum^0-WItemsNum^post11 == 0), cost: 1
New rule:
l11 -> l10 : ___rho_2_^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l11 -> l5 : WItemsNum^0'=WItemsNum^post12, ___rho_2_^0'=___rho_2_^post12, ___rho_1_^0'=___rho_1_^post12, (1-___rho_2_^0 <= 0 /\ WItemsNum^0-WItemsNum^post12 == 0 /\ -___rho_2_^post12+___rho_2_^0 == 0 /\ -___rho_1_^post12+___rho_1_^0 == 0), cost: 1
New rule:
l11 -> l5 : -1+___rho_2_^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l2 -> l10 : WItemsNum^0'=WItemsNum^post13, ___rho_2_^0'=___rho_2_^post13, ___rho_1_^0'=___rho_1_^post13, (-___rho_1_^post13+___rho_1_^0 == 0 /\ 6-WItemsNum^0 <= 0 /\ WItemsNum^0-WItemsNum^post13 == 0 /\ ___rho_2_^0-___rho_2_^post13 == 0), cost: 1
New rule:
l2 -> l10 : -6+WItemsNum^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l2 -> l11 : WItemsNum^0'=WItemsNum^post14, ___rho_2_^0'=___rho_2_^post14, ___rho_1_^0'=___rho_1_^post14, (-___rho_1_^post14+___rho_1_^0 == 0 /\ ___rho_2_^0-___rho_2_^post14 == 0 /\ -5+WItemsNum^0 <= 0 /\ WItemsNum^0-WItemsNum^post14 == 0), cost: 1
New rule:
l2 -> l11 : -5+WItemsNum^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l12 -> l0 : WItemsNum^0'=WItemsNum^post15, ___rho_2_^0'=___rho_2_^post15, ___rho_1_^0'=___rho_1_^post15, (0 == 0 /\ WItemsNum^post15-___rho_1_^post15 == 0 /\ ___rho_2_^0-___rho_2_^post15 == 0), cost: 1
New rule:
l12 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l13 -> l12 : WItemsNum^0'=WItemsNum^post16, ___rho_2_^0'=___rho_2_^post16, ___rho_1_^0'=___rho_1_^post16, (___rho_1_^0-___rho_1_^post16 == 0 /\ WItemsNum^0-WItemsNum^post16 == 0 /\ ___rho_2_^0-___rho_2_^post16 == 0), cost: 1
New rule:
l13 -> l12 : TRUE, cost: 1

Simplified rules
Start location: l13
  17: l0 -> l1 : TRUE, cost: 1
  18: l1 -> l2 : ___rho_2_^0'=___rho_2_^post1, 0 == 0, cost: 1
  26: l2 -> l10 : -6+WItemsNum^0 >= 0, cost: 1
  27: l2 -> l11 : -5+WItemsNum^0 <= 0, cost: 1
  19: l5 -> l6 : TRUE, cost: 1
  20: l6 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 1
  21: l6 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 1
  22: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1
  23: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1
  24: l11 -> l10 : ___rho_2_^0 <= 0, cost: 1
  25: l11 -> l5 : -1+___rho_2_^0 >= 0, cost: 1
  28: l12 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 1
  29: l13 -> l12 : TRUE, cost: 1


Eliminating location l12 by chaining:

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 1
New rule:
l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2

Applied deletion
Removed the following rules: 28 29

Eliminated locations on linear paths
Start location: l13
  17: l0 -> l1 : TRUE, cost: 1
  18: l1 -> l2 : ___rho_2_^0'=___rho_2_^post1, 0 == 0, cost: 1
  26: l2 -> l10 : -6+WItemsNum^0 >= 0, cost: 1
  27: l2 -> l11 : -5+WItemsNum^0 <= 0, cost: 1
  19: l5 -> l6 : TRUE, cost: 1
  20: l6 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 1
  21: l6 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 1
  22: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1
  23: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1
  24: l11 -> l10 : ___rho_2_^0 <= 0, cost: 1
  25: l11 -> l5 : -1+___rho_2_^0 >= 0, cost: 1
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Eliminating location l2 by chaining:

Applied chaining
First rule:
l1 -> l2 : ___rho_2_^0'=___rho_2_^post1, 0 == 0, cost: 1
Second rule:
l2 -> l10 : -6+WItemsNum^0 >= 0, cost: 1
New rule:
l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, (0 == 0 /\ -6+WItemsNum^0 >= 0), cost: 2

Applied simplification
Original rule:
l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, (0 == 0 /\ -6+WItemsNum^0 >= 0), cost: 2
New rule:
l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 2

Applied chaining
First rule:
l1 -> l2 : ___rho_2_^0'=___rho_2_^post1, 0 == 0, cost: 1
Second rule:
l2 -> l11 : -5+WItemsNum^0 <= 0, cost: 1
New rule:
l1 -> l11 : ___rho_2_^0'=___rho_2_^post1, (0 == 0 /\ -5+WItemsNum^0 <= 0), cost: 2

Applied simplification
Original rule:
l1 -> l11 : ___rho_2_^0'=___rho_2_^post1, (0 == 0 /\ -5+WItemsNum^0 <= 0), cost: 2
New rule:
l1 -> l11 : ___rho_2_^0'=___rho_2_^post1, -5+WItemsNum^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 18 26 27

Eliminating location l6 by chaining:

Applied chaining
First rule:
l5 -> l6 : TRUE, cost: 1
Second rule:
l6 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 1
New rule:
l5 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 2

Applied chaining
First rule:
l5 -> l6 : TRUE, cost: 1
Second rule:
l6 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 1
New rule:
l5 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 19 20 21

Eliminated locations on tree-shaped paths
Start location: l13
  17: l0 -> l1 : TRUE, cost: 1
  31: l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 2
  32: l1 -> l11 : ___rho_2_^0'=___rho_2_^post1, -5+WItemsNum^0 <= 0, cost: 2
  33: l5 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 2
  34: l5 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 2
  22: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1
  23: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1
  24: l11 -> l10 : ___rho_2_^0 <= 0, cost: 1
  25: l11 -> l5 : -1+___rho_2_^0 >= 0, cost: 1
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Applied acceleration
Original rule:
l5 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 2
New rule:
l5 -> l5 : WItemsNum^0'=WItemsNum^0-n0, (n0 >= 0 /\ -2+WItemsNum^0-n0 >= 0), cost: 2*n0

Applied instantiation
Original rule:
l5 -> l5 : WItemsNum^0'=WItemsNum^0-n0, (n0 >= 0 /\ -2+WItemsNum^0-n0 >= 0), cost: 2*n0
New rule:
l5 -> l5 : WItemsNum^0'=2, (0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: -4+2*WItemsNum^0

Applied simplification
Original rule:
l5 -> l5 : WItemsNum^0'=2, (0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: -4+2*WItemsNum^0
New rule:
l5 -> l5 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -4+2*WItemsNum^0

Applied deletion
Removed the following rules: 33

Accelerated simple loops
Start location: l13
  17: l0 -> l1 : TRUE, cost: 1
  31: l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 2
  32: l1 -> l11 : ___rho_2_^0'=___rho_2_^post1, -5+WItemsNum^0 <= 0, cost: 2
  34: l5 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 2
  36: l5 -> l5 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -4+2*WItemsNum^0
  22: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1
  23: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1
  24: l11 -> l10 : ___rho_2_^0 <= 0, cost: 1
  25: l11 -> l5 : -1+___rho_2_^0 >= 0, cost: 1
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Applied chaining
First rule:
l11 -> l5 : -1+___rho_2_^0 >= 0, cost: 1
Second rule:
l5 -> l5 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -4+2*WItemsNum^0
New rule:
l11 -> l5 : WItemsNum^0'=2, (-1+___rho_2_^0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: -3+2*WItemsNum^0

Applied deletion
Removed the following rules: 36

Chained accelerated rules with incoming rules
Start location: l13
  17: l0 -> l1 : TRUE, cost: 1
  31: l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 2
  32: l1 -> l11 : ___rho_2_^0'=___rho_2_^post1, -5+WItemsNum^0 <= 0, cost: 2
  34: l5 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 2
  22: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1
  23: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1
  24: l11 -> l10 : ___rho_2_^0 <= 0, cost: 1
  25: l11 -> l5 : -1+___rho_2_^0 >= 0, cost: 1
  37: l11 -> l5 : WItemsNum^0'=2, (-1+___rho_2_^0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: -3+2*WItemsNum^0
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Eliminating location l11 by chaining:

Applied chaining
First rule:
l1 -> l11 : ___rho_2_^0'=___rho_2_^post1, -5+WItemsNum^0 <= 0, cost: 2
Second rule:
l11 -> l10 : ___rho_2_^0 <= 0, cost: 1
New rule:
l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 3

Applied chaining
First rule:
l1 -> l11 : ___rho_2_^0'=___rho_2_^post1, -5+WItemsNum^0 <= 0, cost: 2
Second rule:
l11 -> l5 : -1+___rho_2_^0 >= 0, cost: 1
New rule:
l1 -> l5 : ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3

Applied chaining
First rule:
l1 -> l11 : ___rho_2_^0'=___rho_2_^post1, -5+WItemsNum^0 <= 0, cost: 2
Second rule:
l11 -> l5 : WItemsNum^0'=2, (-1+___rho_2_^0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: -3+2*WItemsNum^0
New rule:
l1 -> l5 : WItemsNum^0'=2, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: -1+2*WItemsNum^0

Applied deletion
Removed the following rules: 24 25 32 37

Eliminated locations on tree-shaped paths
Start location: l13
  17: l0 -> l1 : TRUE, cost: 1
  31: l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 2
  38: l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 3
  39: l1 -> l5 : ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3
  40: l1 -> l5 : WItemsNum^0'=2, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: -1+2*WItemsNum^0
  34: l5 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 2
  22: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1
  23: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Applied merging
first rule:
l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 2
second rule:
l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 3
new rule:
l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 \/ -6+WItemsNum^0 >= 0), cost: 2

Merged rules
Start location: l13
  17: l0 -> l1 : TRUE, cost: 1
  39: l1 -> l5 : ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3
  40: l1 -> l5 : WItemsNum^0'=2, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: -1+2*WItemsNum^0
  41: l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 \/ -6+WItemsNum^0 >= 0), cost: 2
  34: l5 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 2
  22: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1
  23: l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Eliminating location l5 by chaining:

Applied chaining
First rule:
l1 -> l5 : ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3
Second rule:
l5 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 2
New rule:
l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 5

Applied simplification
Original rule:
l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 5
New rule:
l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 5

Applied chaining
First rule:
l1 -> l5 : WItemsNum^0'=2, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: -1+2*WItemsNum^0
Second rule:
l5 -> l0 : WItemsNum^0'=1, -2+WItemsNum^0 <= 0, cost: 2
New rule:
l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (0 <= 0 /\ -1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 1+2*WItemsNum^0

Applied simplification
Original rule:
l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (0 <= 0 /\ -1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 1+2*WItemsNum^0
New rule:
l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 1+2*WItemsNum^0

Applied deletion
Removed the following rules: 34 39 40

Eliminating location l10 by chaining:

Applied chaining
First rule:
l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 \/ -6+WItemsNum^0 >= 0), cost: 2
Second rule:
l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1
New rule:
l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, (-6+WItemsNum^0 >= 0 /\ (___rho_2_^post1 <= 0 \/ -6+WItemsNum^0 >= 0)), cost: 3

Applied simplification
Original rule:
l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, (-6+WItemsNum^0 >= 0 /\ (___rho_2_^post1 <= 0 \/ -6+WItemsNum^0 >= 0)), cost: 3
New rule:
l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 3

Applied chaining
First rule:
l1 -> l10 : ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 \/ -6+WItemsNum^0 >= 0), cost: 2
Second rule:
l10 -> l1 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1
New rule:
l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, (-5+WItemsNum^0 <= 0 /\ (___rho_2_^post1 <= 0 \/ -6+WItemsNum^0 >= 0)), cost: 3

Applied simplification
Original rule:
l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, (-5+WItemsNum^0 <= 0 /\ (___rho_2_^post1 <= 0 \/ -6+WItemsNum^0 >= 0)), cost: 3
New rule:
l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 3

Applied deletion
Removed the following rules: 22 23 41

Eliminated locations on tree-shaped paths
Start location: l13
  17: l0 -> l1 : TRUE, cost: 1
  42: l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 5
  43: l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 1+2*WItemsNum^0
  44: l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 3
  45: l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 3
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Applied nonterm
Original rule:
l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 3
New rule:
l1 -> [15] : -6+WItemsNum^0 >= 0, cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 3
New rule:
l1 -> l1 : WItemsNum^0'=WItemsNum^0+n4, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 3*n4

Applied acceleration
Original rule:
l1 -> l1 : WItemsNum^0'=1+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 3
New rule:
l1 -> l1 : WItemsNum^0'=n6+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, (-___rho_2_^post1 >= 0 /\ -1+n6 >= 0 /\ 6-n6-WItemsNum^0 >= 0), cost: 3*n6

Applied instantiation
Original rule:
l1 -> l1 : WItemsNum^0'=n6+WItemsNum^0, ___rho_2_^0'=___rho_2_^post1, (-___rho_2_^post1 >= 0 /\ -1+n6 >= 0 /\ 6-n6-WItemsNum^0 >= 0), cost: 3*n6
New rule:
l1 -> l1 : WItemsNum^0'=6, ___rho_2_^0'=___rho_2_^post1, (0 >= 0 /\ -___rho_2_^post1 >= 0 /\ 5-WItemsNum^0 >= 0), cost: 18-3*WItemsNum^0

Applied simplification
Original rule:
l1 -> l1 : WItemsNum^0'=6, ___rho_2_^0'=___rho_2_^post1, (0 >= 0 /\ -___rho_2_^post1 >= 0 /\ 5-WItemsNum^0 >= 0), cost: 18-3*WItemsNum^0
New rule:
l1 -> l1 : WItemsNum^0'=6, ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 18-3*WItemsNum^0

Applied deletion
Removed the following rules: 44 45

Accelerated simple loops
Start location: l13
  17: l0 -> l1 : TRUE, cost: 1
  42: l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 5
  43: l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 1+2*WItemsNum^0
  46: l1 -> [15] : -6+WItemsNum^0 >= 0, cost: NONTERM
  47: l1 -> l1 : WItemsNum^0'=WItemsNum^0+n4, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 3*n4
  49: l1 -> l1 : WItemsNum^0'=6, ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 18-3*WItemsNum^0
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Applied chaining
First rule:
l0 -> l1 : TRUE, cost: 1
Second rule:
l1 -> [15] : -6+WItemsNum^0 >= 0, cost: NONTERM
New rule:
l0 -> [15] : -6+WItemsNum^0 >= 0, cost: NONTERM

Applied chaining
First rule:
l0 -> l1 : TRUE, cost: 1
Second rule:
l1 -> l1 : WItemsNum^0'=WItemsNum^0+n4, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 3*n4
New rule:
l0 -> l1 : WItemsNum^0'=WItemsNum^0+n4, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 1+3*n4

Applied chaining
First rule:
l0 -> l1 : TRUE, cost: 1
Second rule:
l1 -> l1 : WItemsNum^0'=6, ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 18-3*WItemsNum^0
New rule:
l0 -> l1 : WItemsNum^0'=6, ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 19-3*WItemsNum^0

Applied deletion
Removed the following rules: 46 47 49

Chained accelerated rules with incoming rules
Start location: l13
  17: l0 -> l1 : TRUE, cost: 1
  50: l0 -> [15] : -6+WItemsNum^0 >= 0, cost: NONTERM
  51: l0 -> l1 : WItemsNum^0'=WItemsNum^0+n4, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 1+3*n4
  52: l0 -> l1 : WItemsNum^0'=6, ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 19-3*WItemsNum^0
  42: l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 5
  43: l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 1+2*WItemsNum^0
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Eliminating location l1 by chaining:

Applied chaining
First rule:
l0 -> l1 : TRUE, cost: 1
Second rule:
l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 5
New rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 6

Applied chaining
First rule:
l0 -> l1 : TRUE, cost: 1
Second rule:
l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 1+2*WItemsNum^0
New rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 2+2*WItemsNum^0

Applied chaining
First rule:
l0 -> l1 : WItemsNum^0'=WItemsNum^0+n4, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 1+3*n4
Second rule:
l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 5
New rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0+n4 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 6+3*n4

Applied chaining
First rule:
l0 -> l1 : WItemsNum^0'=WItemsNum^0+n4, ___rho_2_^0'=___rho_2_^post1, -6+WItemsNum^0 >= 0, cost: 1+3*n4
Second rule:
l1 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 1+2*WItemsNum^0
New rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0+n4 >= 0 /\ -5+WItemsNum^0+n4 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 2+2*WItemsNum^0+5*n4

Applied partial deletion
Original rule:
l0 -> l1 : WItemsNum^0'=6, ___rho_2_^0'=___rho_2_^post1, (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 19-3*WItemsNum^0
New rule:
l0 -> [16] : (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 19-3*WItemsNum^0

Applied deletion
Removed the following rules: 17 42 43 51 52

Eliminated locations on tree-shaped paths
Start location: l13
  50: l0 -> [15] : -6+WItemsNum^0 >= 0, cost: NONTERM
  53: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 6
  54: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 2+2*WItemsNum^0
  55: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0+n4 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 6+3*n4
  56: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0+n4 >= 0 /\ -5+WItemsNum^0+n4 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 2+2*WItemsNum^0+5*n4
  57: l0 -> [16] : (___rho_2_^post1 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 19-3*WItemsNum^0
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Applied pruning (of leafs and parallel rules):
Start location: l13
  50: l0 -> [15] : -6+WItemsNum^0 >= 0, cost: NONTERM
  53: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 6
  54: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 2+2*WItemsNum^0
  55: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0+n4 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 6+3*n4
  56: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0+n4 >= 0 /\ -5+WItemsNum^0+n4 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 2+2*WItemsNum^0+5*n4
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Applied nonterm
Original rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 6
New rule:
l0 -> [17] : (-1+___rho_2_^post1 >= 0 /\ 2-WItemsNum^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 6
New rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ 2-WItemsNum^0 >= 0), cost: 6*n19

Applied simplification
Original rule:
l0 -> [17] : (-1+___rho_2_^post1 >= 0 /\ 2-WItemsNum^0 >= 0), cost: NONTERM
New rule:
l0 -> [17] : (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ 2-WItemsNum^0 >= 0), cost: 6*n19
New rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 6*n19

Applied deletion
Removed the following rules: 53

Accelerated simple loops
Start location: l13
  50: l0 -> [15] : -6+WItemsNum^0 >= 0, cost: NONTERM
  54: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 2+2*WItemsNum^0
  55: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0+n4 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 6+3*n4
  56: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0+n4 >= 0 /\ -5+WItemsNum^0+n4 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 2+2*WItemsNum^0+5*n4
  60: l0 -> [17] : (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: NONTERM
  61: l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 6*n19
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2


Applied chaining
First rule:
l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2
Second rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 2+2*WItemsNum^0
New rule:
l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -2+___rho_1_^post15 >= 0 /\ -5+___rho_1_^post15 <= 0), cost: 4+2*___rho_1_^post15

Applied chaining
First rule:
l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2
Second rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0+n4 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 6+3*n4
New rule:
l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -6+___rho_1_^post15 >= 0 /\ -2+n4+___rho_1_^post15 <= 0), cost: 8+3*n4

Applied chaining
First rule:
l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2
Second rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0+n4 >= 0 /\ -5+WItemsNum^0+n4 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 2+2*WItemsNum^0+5*n4
New rule:
l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -6+___rho_1_^post15 >= 0 /\ -2+n4+___rho_1_^post15 >= 0 /\ -5+n4+___rho_1_^post15 <= 0), cost: 4+5*n4+2*___rho_1_^post15

Applied chaining
First rule:
l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2
Second rule:
l0 -> [17] : (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: NONTERM
New rule:
l13 -> [17] : 0 == 0, cost: NONTERM

Applied chaining
First rule:
l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2
Second rule:
l0 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, (-1+___rho_2_^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: 6*n19
New rule:
l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -2+___rho_1_^post15 <= 0), cost: 2+6*n19

Applied deletion
Removed the following rules: 54 55 56 60 61

Chained accelerated rules with incoming rules
Start location: l13
  50: l0 -> [15] : -6+WItemsNum^0 >= 0, cost: NONTERM
  30: l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2
  62: l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -2+___rho_1_^post15 >= 0 /\ -5+___rho_1_^post15 <= 0), cost: 4+2*___rho_1_^post15
  63: l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -6+___rho_1_^post15 >= 0 /\ -2+n4+___rho_1_^post15 <= 0), cost: 8+3*n4
  64: l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -6+___rho_1_^post15 >= 0 /\ -2+n4+___rho_1_^post15 >= 0 /\ -5+n4+___rho_1_^post15 <= 0), cost: 4+5*n4+2*___rho_1_^post15
  65: l13 -> [17] : 0 == 0, cost: NONTERM
  66: l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -2+___rho_1_^post15 <= 0), cost: 2+6*n19


Eliminating location l0 by chaining:

Applied chaining
First rule:
l13 -> l0 : WItemsNum^0'=___rho_1_^post15, ___rho_1_^0'=___rho_1_^post15, 0 == 0, cost: 2
Second rule:
l0 -> [15] : -6+WItemsNum^0 >= 0, cost: NONTERM
New rule:
l13 -> [15] : (0 == 0 /\ -6+___rho_1_^post15 >= 0), cost: NONTERM

Applied simplification
Original rule:
l13 -> [15] : (0 == 0 /\ -6+___rho_1_^post15 >= 0), cost: NONTERM
New rule:
l13 -> [15] : -6+___rho_1_^post15 >= 0, cost: NONTERM

Applied partial deletion
Original rule:
l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -2+___rho_1_^post15 >= 0 /\ -5+___rho_1_^post15 <= 0), cost: 4+2*___rho_1_^post15
New rule:
l13 -> [18] : (-1+___rho_2_^post1 >= 0 /\ -2+___rho_1_^post15 >= 0 /\ -5+___rho_1_^post15 <= 0), cost: 4+2*___rho_1_^post15

Applied partial deletion
Original rule:
l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -6+___rho_1_^post15 >= 0 /\ -2+n4+___rho_1_^post15 <= 0), cost: 8+3*n4
New rule:
l13 -> [18] : (-1+___rho_2_^post1 >= 0 /\ -6+___rho_1_^post15 >= 0 /\ -2+n4+___rho_1_^post15 <= 0), cost: 8+3*n4

Applied partial deletion
Original rule:
l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -6+___rho_1_^post15 >= 0 /\ -2+n4+___rho_1_^post15 >= 0 /\ -5+n4+___rho_1_^post15 <= 0), cost: 4+5*n4+2*___rho_1_^post15
New rule:
l13 -> [18] : (-1+___rho_2_^post1 >= 0 /\ -6+___rho_1_^post15 >= 0 /\ -2+n4+___rho_1_^post15 >= 0 /\ -5+n4+___rho_1_^post15 <= 0), cost: 4+5*n4+2*___rho_1_^post15

Applied partial deletion
Original rule:
l13 -> l0 : WItemsNum^0'=1, ___rho_2_^0'=___rho_2_^post1, ___rho_1_^0'=___rho_1_^post15, (-1+___rho_2_^post1 >= 0 /\ -2+___rho_1_^post15 <= 0), cost: 2+6*n19
New rule:
l13 -> [18] : (-1+___rho_2_^post1 >= 0 /\ -2+___rho_1_^post15 <= 0), cost: 2+6*n19

Applied deletion
Removed the following rules: 30 50 62 63 64 66

Eliminated locations on tree-shaped paths
Start location: l13
  65: l13 -> [17] : 0 == 0, cost: NONTERM
  67: l13 -> [15] : -6+___rho_1_^post15 >= 0, cost: NONTERM
  68: l13 -> [18] : (-1+___rho_2_^post1 >= 0 /\ -2+___rho_1_^post15 >= 0 /\ -5+___rho_1_^post15 <= 0), cost: 4+2*___rho_1_^post15
  69: l13 -> [18] : (-1+___rho_2_^post1 >= 0 /\ -6+___rho_1_^post15 >= 0 /\ -2+n4+___rho_1_^post15 <= 0), cost: 8+3*n4
  70: l13 -> [18] : (-1+___rho_2_^post1 >= 0 /\ -6+___rho_1_^post15 >= 0 /\ -2+n4+___rho_1_^post15 >= 0 /\ -5+n4+___rho_1_^post15 <= 0), cost: 4+5*n4+2*___rho_1_^post15
  71: l13 -> [18] : (-1+___rho_2_^post1 >= 0 /\ -2+___rho_1_^post15 <= 0), cost: 2+6*n19


Computing asymptotic complexity
Proved nontermination of rule 65 via SMT.

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

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