NO

Initial ITS
Start location: l6
   0: l0 -> l1 : CRITICAL^0'=CRITICAL^post0, NONCRITICAL^0'=NONCRITICAL^post0, j_min^0'=j_min^post0, MAX^0'=MAX^post0, P^0'=P^post0, pid^0'=pid^post0, MIN^0'=MIN^post0, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post0, NUM_MIN^0'=NUM_MIN^post0, num^0'=num^post0, MAX_MIN^0'=MAX_MIN^post0, Q^0'=Q^post0, (0 == 0 /\ INCREASE^0-INCREASE^post0 == 0 /\ -MAX^post0+MAX^0 == 0 /\ MAX_MIN^0-MAX_MIN^post0 == 0 /\ P^0-P^post0 == 0 /\ -num^post0+num^0 == 0 /\ -1+conditional^0 <= 0 /\ CRITICAL^0-CRITICAL^post0 == 0 /\ NONCRITICAL^0-NONCRITICAL^post0 == 0 /\ -Q^post0+Q^0 == 0 /\ NUM_MIN^0-NUM_MIN^post0 == 0 /\ pid^0-pid^post0 == 0 /\ -MIN^post0+MIN^0 == 0 /\ j_min^0-j_min^post0 == 0), cost: 1
   1: l0 -> l1 : CRITICAL^0'=CRITICAL^post1, NONCRITICAL^0'=NONCRITICAL^post1, j_min^0'=j_min^post1, MAX^0'=MAX^post1, P^0'=P^post1, pid^0'=pid^post1, MIN^0'=MIN^post1, conditional^0'=conditional^post1, INCREASE^0'=INCREASE^post1, NUM_MIN^0'=NUM_MIN^post1, num^0'=num^post1, MAX_MIN^0'=MAX_MIN^post1, Q^0'=Q^post1, (0 == 0 /\ -P^post1+P^0 == 0 /\ 2-conditional^0 <= 0 /\ NONCRITICAL^0-NONCRITICAL^post1 == 0 /\ 1-INCREASE^post1 <= 0 /\ -Q^post1+Q^0 == 0 /\ -num^post1+num^0 == 0 /\ NUM_MIN^0-NUM_MIN^post1 == 0 /\ CRITICAL^0-CRITICAL^post1 == 0 /\ -j_min^0-INCREASE^post1+j_min^post1 == 0 /\ -MAX_MIN^post1+MAX_MIN^0 == 0 /\ -MIN^post1+MIN^0 == 0 /\ MAX^0-MAX^post1 == 0 /\ pid^0-pid^post1 == 0), cost: 1
   6: l1 -> l3 : CRITICAL^0'=CRITICAL^post6, NONCRITICAL^0'=NONCRITICAL^post6, j_min^0'=j_min^post6, MAX^0'=MAX^post6, P^0'=P^post6, pid^0'=pid^post6, MIN^0'=MIN^post6, conditional^0'=conditional^post6, INCREASE^0'=INCREASE^post6, NUM_MIN^0'=NUM_MIN^post6, num^0'=num^post6, MAX_MIN^0'=MAX_MIN^post6, Q^0'=Q^post6, (0 == 0 /\ P^0-P^post6 == 0 /\ j_min^0-j_min^post6 == 0 /\ -Q^post6+Q^0 == 0 /\ -MAX_MIN^post6+MAX_MIN^0 == 0 /\ -MIN^post6+MIN^0 == 0 /\ NONCRITICAL^0-NONCRITICAL^post6 == 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ pid^0-pid^post6 == 0 /\ CRITICAL^0-CRITICAL^post6 == 0 /\ -num^post6+num^0 == 0 /\ -MAX^post6+MAX^0 == 0 /\ INCREASE^0-INCREASE^post6 == 0 /\ NUM_MIN^0-NUM_MIN^post6 == 0), cost: 1
   7: l1 -> l4 : CRITICAL^0'=CRITICAL^post7, NONCRITICAL^0'=NONCRITICAL^post7, j_min^0'=j_min^post7, MAX^0'=MAX^post7, P^0'=P^post7, pid^0'=pid^post7, MIN^0'=MIN^post7, conditional^0'=conditional^post7, INCREASE^0'=INCREASE^post7, NUM_MIN^0'=NUM_MIN^post7, num^0'=num^post7, MAX_MIN^0'=MAX_MIN^post7, Q^0'=Q^post7, (Q^post7 == 0 /\ -MAX_MIN^post7+MAX_MIN^0 == 0 /\ j_min^0-j_min^post7 == 0 /\ -1+CRITICAL^post7 == 0 /\ -num^post7+num^0 == 0 /\ NONCRITICAL^0-NONCRITICAL^post7 == 0 /\ P^post7 == 0 /\ -MIN^post7+MIN^0 == 0 /\ conditional^0-conditional^post7 == 0 /\ pid^0-pid^post7 == 0 /\ -j_min^0+pid^0 <= 0 /\ INCREASE^0-INCREASE^post7 == 0 /\ -MAX^post7+MAX^0 == 0 /\ NUM_MIN^0-NUM_MIN^post7 == 0), cost: 1
   8: l1 -> l4 : CRITICAL^0'=CRITICAL^post8, NONCRITICAL^0'=NONCRITICAL^post8, j_min^0'=j_min^post8, MAX^0'=MAX^post8, P^0'=P^post8, pid^0'=pid^post8, MIN^0'=MIN^post8, conditional^0'=conditional^post8, INCREASE^0'=INCREASE^post8, NUM_MIN^0'=NUM_MIN^post8, num^0'=num^post8, MAX_MIN^0'=MAX_MIN^post8, Q^0'=Q^post8, (conditional^0-conditional^post8 == 0 /\ MIN^0-MIN^post8 == 0 /\ -1+CRITICAL^post8 == 0 /\ -MAX_MIN^post8+MAX_MIN^0 == 0 /\ -NUM_MIN^post8+NUM_MIN^0 == 0 /\ Q^post8 == 0 /\ INCREASE^0-INCREASE^post8 == 0 /\ MAX^0-MAX^post8 == 0 /\ P^post8 == 0 /\ -pid^post8+pid^0 == 0 /\ j_min^0-j_min^post8 == 0 /\ 1-MIN^0+num^0 <= 0 /\ -num^post8+num^0 == 0 /\ NONCRITICAL^0-NONCRITICAL^post8 == 0), cost: 1
   2: l2 -> l0 : CRITICAL^0'=CRITICAL^post2, NONCRITICAL^0'=NONCRITICAL^post2, j_min^0'=j_min^post2, MAX^0'=MAX^post2, P^0'=P^post2, pid^0'=pid^post2, MIN^0'=MIN^post2, conditional^0'=conditional^post2, INCREASE^0'=INCREASE^post2, NUM_MIN^0'=NUM_MIN^post2, num^0'=num^post2, MAX_MIN^0'=MAX_MIN^post2, Q^0'=Q^post2, (0 == 0 /\ j_min^0-j_min^post2 == 0 /\ NONCRITICAL^0-NONCRITICAL^post2 == 0 /\ -1+conditional^0 <= 0 /\ -Q^post2+Q^0 == 0 /\ pid^0-pid^post2 == 0 /\ -MIN^post2+MIN^0 == 0 /\ NUM_MIN^0-NUM_MIN^post2 == 0 /\ -num^post2+num^0 == 0 /\ -1+P^post2 == 0 /\ -INCREASE^post2+INCREASE^0 == 0 /\ CRITICAL^0-CRITICAL^post2 == 0 /\ MAX^0-MAX^post2 == 0 /\ -MAX_MIN^post2+MAX_MIN^0 == 0), cost: 1
   3: l2 -> l1 : CRITICAL^0'=CRITICAL^post3, NONCRITICAL^0'=NONCRITICAL^post3, j_min^0'=j_min^post3, MAX^0'=MAX^post3, P^0'=P^post3, pid^0'=pid^post3, MIN^0'=MIN^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=NUM_MIN^post3, num^0'=num^post3, MAX_MIN^0'=MAX_MIN^post3, Q^0'=Q^post3, (0 == 0 /\ -MAX^post3+MAX^0 == 0 /\ 2-conditional^0 <= 0 /\ -NUM_MIN^post3+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ 1-j_min^post3 <= 0 /\ NUM_MIN^post3+MIN^0-num^0 == 0 /\ -num^post3+num^0 == 0 /\ NONCRITICAL^0-NONCRITICAL^post3 == 0 /\ -MAX^0+MIN^0+MAX_MIN^post3 == 0 /\ P^0-P^post3 == 0 /\ -1+Q^post3 == 0 /\ MIN^post3-MIN^0-INCREASE^post3 == 0 /\ CRITICAL^0-CRITICAL^post3 == 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ -pid^post3+pid^0 == 0), cost: 1
   4: l3 -> l2 : CRITICAL^0'=CRITICAL^post4, NONCRITICAL^0'=NONCRITICAL^post4, j_min^0'=j_min^post4, MAX^0'=MAX^post4, P^0'=P^post4, pid^0'=pid^post4, MIN^0'=MIN^post4, conditional^0'=conditional^post4, INCREASE^0'=INCREASE^post4, NUM_MIN^0'=NUM_MIN^post4, num^0'=num^post4, MAX_MIN^0'=MAX_MIN^post4, Q^0'=Q^post4, (0 == 0 /\ -MAX^post4+MAX^0 == 0 /\ INCREASE^0-INCREASE^post4 == 0 /\ CRITICAL^0-CRITICAL^post4 == 0 /\ -Q^post4+Q^0 == 0 /\ -1+conditional^0 <= 0 /\ MAX_MIN^0-MAX_MIN^post4 == 0 /\ j_min^0-j_min^post4 == 0 /\ -num^post4+num^0 == 0 /\ -NUM_MIN^post4+NUM_MIN^0 == 0 /\ -MIN^post4+MIN^0 == 0 /\ P^0-P^post4 == 0 /\ NONCRITICAL^0-NONCRITICAL^post4 == 0 /\ -pid^post4+pid^0 == 0), cost: 1
   5: l3 -> l2 : CRITICAL^0'=CRITICAL^post5, NONCRITICAL^0'=NONCRITICAL^post5, j_min^0'=j_min^post5, MAX^0'=MAX^post5, P^0'=P^post5, pid^0'=pid^post5, MIN^0'=MIN^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=NUM_MIN^post5, num^0'=num^post5, MAX_MIN^0'=MAX_MIN^post5, Q^0'=Q^post5, (0 == 0 /\ 1-INCREASE^post5 <= 0 /\ -MAX_MIN^post5+MAX_MIN^0 == 0 /\ 2-conditional^0 <= 0 /\ CRITICAL^0-CRITICAL^post5 == 0 /\ MAX^post5-MAX^0-INCREASE^post5 == 0 /\ -Q^post5+Q^0 == 0 /\ j_min^0-j_min^post5 == 0 /\ NUM_MIN^0-NUM_MIN^post5 == 0 /\ pid^0-pid^post5 == 0 /\ -MIN^post5+MIN^0 == 0 /\ P^0-P^post5 == 0 /\ NONCRITICAL^0-NONCRITICAL^post5 == 0 /\ -num^post5+num^0 == 0), cost: 1
   9: l4 -> l1 : CRITICAL^0'=CRITICAL^post9, NONCRITICAL^0'=NONCRITICAL^post9, j_min^0'=j_min^post9, MAX^0'=MAX^post9, P^0'=P^post9, pid^0'=pid^post9, MIN^0'=MIN^post9, conditional^0'=conditional^post9, INCREASE^0'=INCREASE^post9, NUM_MIN^0'=NUM_MIN^post9, num^0'=num^post9, MAX_MIN^0'=MAX_MIN^post9, Q^0'=Q^post9, (-1-MAX^0+num^post9 == 0 /\ -1-MAX^0+MAX^post9 == 0 /\ -1+NONCRITICAL^post9 == 0 /\ conditional^0-conditional^post9 == 0 /\ MIN^0-MIN^post9 == 0 /\ INCREASE^0-INCREASE^post9 == 0 /\ -MAX_MIN^post9+MAX_MIN^0 == 0 /\ -NUM_MIN^post9+NUM_MIN^0 == 0 /\ CRITICAL^post9 == 0 /\ P^0-P^post9 == 0 /\ -pid^post9+pid^0 == 0 /\ j_min^0-j_min^post9 == 0 /\ -Q^post9+Q^0 == 0), cost: 1
  10: l5 -> l4 : CRITICAL^0'=CRITICAL^post10, NONCRITICAL^0'=NONCRITICAL^post10, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=P^post10, pid^0'=pid^post10, MIN^0'=MIN^post10, conditional^0'=conditional^post10, INCREASE^0'=INCREASE^post10, NUM_MIN^0'=NUM_MIN^post10, num^0'=num^post10, MAX_MIN^0'=MAX_MIN^post10, Q^0'=Q^post10, (0 == 0 /\ -1+NONCRITICAL^post10 == 0 /\ -num^post10+num^0 == 0 /\ -MAX_MIN^post10+MAX_MIN^0 == 0 /\ 1-pid^post10 <= 0 /\ 1-j_min^post10 <= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ Q^post10 == 0 /\ P^post10 == 0 /\ CRITICAL^post10 == 0 /\ NUM_MIN^0-NUM_MIN^post10 == 0 /\ 1-MIN^post10 <= 0 /\ conditional^0-conditional^post10 == 0 /\ INCREASE^0-INCREASE^post10 == 0), cost: 1
  11: l6 -> l5 : CRITICAL^0'=CRITICAL^post11, NONCRITICAL^0'=NONCRITICAL^post11, j_min^0'=j_min^post11, MAX^0'=MAX^post11, P^0'=P^post11, pid^0'=pid^post11, MIN^0'=MIN^post11, conditional^0'=conditional^post11, INCREASE^0'=INCREASE^post11, NUM_MIN^0'=NUM_MIN^post11, num^0'=num^post11, MAX_MIN^0'=MAX_MIN^post11, Q^0'=Q^post11, (-MIN^post11+MIN^0 == 0 /\ MAX_MIN^0-MAX_MIN^post11 == 0 /\ -pid^post11+pid^0 == 0 /\ P^0-P^post11 == 0 /\ CRITICAL^0-CRITICAL^post11 == 0 /\ NONCRITICAL^0-NONCRITICAL^post11 == 0 /\ -num^post11+num^0 == 0 /\ -Q^post11+Q^0 == 0 /\ -MAX^post11+MAX^0 == 0 /\ NUM_MIN^0-NUM_MIN^post11 == 0 /\ j_min^0-j_min^post11 == 0 /\ INCREASE^0-INCREASE^post11 == 0 /\ conditional^0-conditional^post11 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : CRITICAL^0'=CRITICAL^post0, NONCRITICAL^0'=NONCRITICAL^post0, j_min^0'=j_min^post0, MAX^0'=MAX^post0, P^0'=P^post0, pid^0'=pid^post0, MIN^0'=MIN^post0, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post0, NUM_MIN^0'=NUM_MIN^post0, num^0'=num^post0, MAX_MIN^0'=MAX_MIN^post0, Q^0'=Q^post0, (0 == 0 /\ INCREASE^0-INCREASE^post0 == 0 /\ -MAX^post0+MAX^0 == 0 /\ MAX_MIN^0-MAX_MIN^post0 == 0 /\ P^0-P^post0 == 0 /\ -num^post0+num^0 == 0 /\ -1+conditional^0 <= 0 /\ CRITICAL^0-CRITICAL^post0 == 0 /\ NONCRITICAL^0-NONCRITICAL^post0 == 0 /\ -Q^post0+Q^0 == 0 /\ NUM_MIN^0-NUM_MIN^post0 == 0 /\ pid^0-pid^post0 == 0 /\ -MIN^post0+MIN^0 == 0 /\ j_min^0-j_min^post0 == 0), cost: 1
New rule:
l0 -> l1 : conditional^0'=conditional^post0, -1+conditional^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l0 -> l1 : CRITICAL^0'=CRITICAL^post1, NONCRITICAL^0'=NONCRITICAL^post1, j_min^0'=j_min^post1, MAX^0'=MAX^post1, P^0'=P^post1, pid^0'=pid^post1, MIN^0'=MIN^post1, conditional^0'=conditional^post1, INCREASE^0'=INCREASE^post1, NUM_MIN^0'=NUM_MIN^post1, num^0'=num^post1, MAX_MIN^0'=MAX_MIN^post1, Q^0'=Q^post1, (0 == 0 /\ -P^post1+P^0 == 0 /\ 2-conditional^0 <= 0 /\ NONCRITICAL^0-NONCRITICAL^post1 == 0 /\ 1-INCREASE^post1 <= 0 /\ -Q^post1+Q^0 == 0 /\ -num^post1+num^0 == 0 /\ NUM_MIN^0-NUM_MIN^post1 == 0 /\ CRITICAL^0-CRITICAL^post1 == 0 /\ -j_min^0-INCREASE^post1+j_min^post1 == 0 /\ -MAX_MIN^post1+MAX_MIN^0 == 0 /\ -MIN^post1+MIN^0 == 0 /\ MAX^0-MAX^post1 == 0 /\ pid^0-pid^post1 == 0), cost: 1
New rule:
l0 -> l1 : j_min^0'=j_min^post1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -2+conditional^0 >= 0), cost: 1

Applied preprocessing
Original rule:
l2 -> l0 : CRITICAL^0'=CRITICAL^post2, NONCRITICAL^0'=NONCRITICAL^post2, j_min^0'=j_min^post2, MAX^0'=MAX^post2, P^0'=P^post2, pid^0'=pid^post2, MIN^0'=MIN^post2, conditional^0'=conditional^post2, INCREASE^0'=INCREASE^post2, NUM_MIN^0'=NUM_MIN^post2, num^0'=num^post2, MAX_MIN^0'=MAX_MIN^post2, Q^0'=Q^post2, (0 == 0 /\ j_min^0-j_min^post2 == 0 /\ NONCRITICAL^0-NONCRITICAL^post2 == 0 /\ -1+conditional^0 <= 0 /\ -Q^post2+Q^0 == 0 /\ pid^0-pid^post2 == 0 /\ -MIN^post2+MIN^0 == 0 /\ NUM_MIN^0-NUM_MIN^post2 == 0 /\ -num^post2+num^0 == 0 /\ -1+P^post2 == 0 /\ -INCREASE^post2+INCREASE^0 == 0 /\ CRITICAL^0-CRITICAL^post2 == 0 /\ MAX^0-MAX^post2 == 0 /\ -MAX_MIN^post2+MAX_MIN^0 == 0), cost: 1
New rule:
l2 -> l0 : P^0'=1, conditional^0'=conditional^post2, -1+conditional^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l2 -> l1 : CRITICAL^0'=CRITICAL^post3, NONCRITICAL^0'=NONCRITICAL^post3, j_min^0'=j_min^post3, MAX^0'=MAX^post3, P^0'=P^post3, pid^0'=pid^post3, MIN^0'=MIN^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=NUM_MIN^post3, num^0'=num^post3, MAX_MIN^0'=MAX_MIN^post3, Q^0'=Q^post3, (0 == 0 /\ -MAX^post3+MAX^0 == 0 /\ 2-conditional^0 <= 0 /\ -NUM_MIN^post3+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ 1-j_min^post3 <= 0 /\ NUM_MIN^post3+MIN^0-num^0 == 0 /\ -num^post3+num^0 == 0 /\ NONCRITICAL^0-NONCRITICAL^post3 == 0 /\ -MAX^0+MIN^0+MAX_MIN^post3 == 0 /\ P^0-P^post3 == 0 /\ -1+Q^post3 == 0 /\ MIN^post3-MIN^0-INCREASE^post3 == 0 /\ CRITICAL^0-CRITICAL^post3 == 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ -pid^post3+pid^0 == 0), cost: 1
New rule:
l2 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ -2+conditional^0 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 1

Applied preprocessing
Original rule:
l3 -> l2 : CRITICAL^0'=CRITICAL^post4, NONCRITICAL^0'=NONCRITICAL^post4, j_min^0'=j_min^post4, MAX^0'=MAX^post4, P^0'=P^post4, pid^0'=pid^post4, MIN^0'=MIN^post4, conditional^0'=conditional^post4, INCREASE^0'=INCREASE^post4, NUM_MIN^0'=NUM_MIN^post4, num^0'=num^post4, MAX_MIN^0'=MAX_MIN^post4, Q^0'=Q^post4, (0 == 0 /\ -MAX^post4+MAX^0 == 0 /\ INCREASE^0-INCREASE^post4 == 0 /\ CRITICAL^0-CRITICAL^post4 == 0 /\ -Q^post4+Q^0 == 0 /\ -1+conditional^0 <= 0 /\ MAX_MIN^0-MAX_MIN^post4 == 0 /\ j_min^0-j_min^post4 == 0 /\ -num^post4+num^0 == 0 /\ -NUM_MIN^post4+NUM_MIN^0 == 0 /\ -MIN^post4+MIN^0 == 0 /\ P^0-P^post4 == 0 /\ NONCRITICAL^0-NONCRITICAL^post4 == 0 /\ -pid^post4+pid^0 == 0), cost: 1
New rule:
l3 -> l2 : conditional^0'=conditional^post4, -1+conditional^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l2 : CRITICAL^0'=CRITICAL^post5, NONCRITICAL^0'=NONCRITICAL^post5, j_min^0'=j_min^post5, MAX^0'=MAX^post5, P^0'=P^post5, pid^0'=pid^post5, MIN^0'=MIN^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=NUM_MIN^post5, num^0'=num^post5, MAX_MIN^0'=MAX_MIN^post5, Q^0'=Q^post5, (0 == 0 /\ 1-INCREASE^post5 <= 0 /\ -MAX_MIN^post5+MAX_MIN^0 == 0 /\ 2-conditional^0 <= 0 /\ CRITICAL^0-CRITICAL^post5 == 0 /\ MAX^post5-MAX^0-INCREASE^post5 == 0 /\ -Q^post5+Q^0 == 0 /\ j_min^0-j_min^post5 == 0 /\ NUM_MIN^0-NUM_MIN^post5 == 0 /\ pid^0-pid^post5 == 0 /\ -MIN^post5+MIN^0 == 0 /\ P^0-P^post5 == 0 /\ NONCRITICAL^0-NONCRITICAL^post5 == 0 /\ -num^post5+num^0 == 0), cost: 1
New rule:
l3 -> l2 : MAX^0'=MAX^0+INCREASE^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -2+conditional^0 >= 0), cost: 1

Applied preprocessing
Original rule:
l1 -> l3 : CRITICAL^0'=CRITICAL^post6, NONCRITICAL^0'=NONCRITICAL^post6, j_min^0'=j_min^post6, MAX^0'=MAX^post6, P^0'=P^post6, pid^0'=pid^post6, MIN^0'=MIN^post6, conditional^0'=conditional^post6, INCREASE^0'=INCREASE^post6, NUM_MIN^0'=NUM_MIN^post6, num^0'=num^post6, MAX_MIN^0'=MAX_MIN^post6, Q^0'=Q^post6, (0 == 0 /\ P^0-P^post6 == 0 /\ j_min^0-j_min^post6 == 0 /\ -Q^post6+Q^0 == 0 /\ -MAX_MIN^post6+MAX_MIN^0 == 0 /\ -MIN^post6+MIN^0 == 0 /\ NONCRITICAL^0-NONCRITICAL^post6 == 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ pid^0-pid^post6 == 0 /\ CRITICAL^0-CRITICAL^post6 == 0 /\ -num^post6+num^0 == 0 /\ -MAX^post6+MAX^0 == 0 /\ INCREASE^0-INCREASE^post6 == 0 /\ NUM_MIN^0-NUM_MIN^post6 == 0), cost: 1
New rule:
l1 -> l3 : conditional^0'=conditional^post6, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 1

Applied preprocessing
Original rule:
l1 -> l4 : CRITICAL^0'=CRITICAL^post7, NONCRITICAL^0'=NONCRITICAL^post7, j_min^0'=j_min^post7, MAX^0'=MAX^post7, P^0'=P^post7, pid^0'=pid^post7, MIN^0'=MIN^post7, conditional^0'=conditional^post7, INCREASE^0'=INCREASE^post7, NUM_MIN^0'=NUM_MIN^post7, num^0'=num^post7, MAX_MIN^0'=MAX_MIN^post7, Q^0'=Q^post7, (Q^post7 == 0 /\ -MAX_MIN^post7+MAX_MIN^0 == 0 /\ j_min^0-j_min^post7 == 0 /\ -1+CRITICAL^post7 == 0 /\ -num^post7+num^0 == 0 /\ NONCRITICAL^0-NONCRITICAL^post7 == 0 /\ P^post7 == 0 /\ -MIN^post7+MIN^0 == 0 /\ conditional^0-conditional^post7 == 0 /\ pid^0-pid^post7 == 0 /\ -j_min^0+pid^0 <= 0 /\ INCREASE^0-INCREASE^post7 == 0 /\ -MAX^post7+MAX^0 == 0 /\ NUM_MIN^0-NUM_MIN^post7 == 0), cost: 1
New rule:
l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, -j_min^0+pid^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l1 -> l4 : CRITICAL^0'=CRITICAL^post8, NONCRITICAL^0'=NONCRITICAL^post8, j_min^0'=j_min^post8, MAX^0'=MAX^post8, P^0'=P^post8, pid^0'=pid^post8, MIN^0'=MIN^post8, conditional^0'=conditional^post8, INCREASE^0'=INCREASE^post8, NUM_MIN^0'=NUM_MIN^post8, num^0'=num^post8, MAX_MIN^0'=MAX_MIN^post8, Q^0'=Q^post8, (conditional^0-conditional^post8 == 0 /\ MIN^0-MIN^post8 == 0 /\ -1+CRITICAL^post8 == 0 /\ -MAX_MIN^post8+MAX_MIN^0 == 0 /\ -NUM_MIN^post8+NUM_MIN^0 == 0 /\ Q^post8 == 0 /\ INCREASE^0-INCREASE^post8 == 0 /\ MAX^0-MAX^post8 == 0 /\ P^post8 == 0 /\ -pid^post8+pid^0 == 0 /\ j_min^0-j_min^post8 == 0 /\ 1-MIN^0+num^0 <= 0 /\ -num^post8+num^0 == 0 /\ NONCRITICAL^0-NONCRITICAL^post8 == 0), cost: 1
New rule:
l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, 1-MIN^0+num^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l1 : CRITICAL^0'=CRITICAL^post9, NONCRITICAL^0'=NONCRITICAL^post9, j_min^0'=j_min^post9, MAX^0'=MAX^post9, P^0'=P^post9, pid^0'=pid^post9, MIN^0'=MIN^post9, conditional^0'=conditional^post9, INCREASE^0'=INCREASE^post9, NUM_MIN^0'=NUM_MIN^post9, num^0'=num^post9, MAX_MIN^0'=MAX_MIN^post9, Q^0'=Q^post9, (-1-MAX^0+num^post9 == 0 /\ -1-MAX^0+MAX^post9 == 0 /\ -1+NONCRITICAL^post9 == 0 /\ conditional^0-conditional^post9 == 0 /\ MIN^0-MIN^post9 == 0 /\ INCREASE^0-INCREASE^post9 == 0 /\ -MAX_MIN^post9+MAX_MIN^0 == 0 /\ -NUM_MIN^post9+NUM_MIN^0 == 0 /\ CRITICAL^post9 == 0 /\ P^0-P^post9 == 0 /\ -pid^post9+pid^0 == 0 /\ j_min^0-j_min^post9 == 0 /\ -Q^post9+Q^0 == 0), cost: 1
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l5 -> l4 : CRITICAL^0'=CRITICAL^post10, NONCRITICAL^0'=NONCRITICAL^post10, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=P^post10, pid^0'=pid^post10, MIN^0'=MIN^post10, conditional^0'=conditional^post10, INCREASE^0'=INCREASE^post10, NUM_MIN^0'=NUM_MIN^post10, num^0'=num^post10, MAX_MIN^0'=MAX_MIN^post10, Q^0'=Q^post10, (0 == 0 /\ -1+NONCRITICAL^post10 == 0 /\ -num^post10+num^0 == 0 /\ -MAX_MIN^post10+MAX_MIN^0 == 0 /\ 1-pid^post10 <= 0 /\ 1-j_min^post10 <= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ Q^post10 == 0 /\ P^post10 == 0 /\ CRITICAL^post10 == 0 /\ NUM_MIN^0-NUM_MIN^post10 == 0 /\ 1-MIN^post10 <= 0 /\ conditional^0-conditional^post10 == 0 /\ INCREASE^0-INCREASE^post10 == 0), cost: 1
New rule:
l5 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 1

Applied preprocessing
Original rule:
l6 -> l5 : CRITICAL^0'=CRITICAL^post11, NONCRITICAL^0'=NONCRITICAL^post11, j_min^0'=j_min^post11, MAX^0'=MAX^post11, P^0'=P^post11, pid^0'=pid^post11, MIN^0'=MIN^post11, conditional^0'=conditional^post11, INCREASE^0'=INCREASE^post11, NUM_MIN^0'=NUM_MIN^post11, num^0'=num^post11, MAX_MIN^0'=MAX_MIN^post11, Q^0'=Q^post11, (-MIN^post11+MIN^0 == 0 /\ MAX_MIN^0-MAX_MIN^post11 == 0 /\ -pid^post11+pid^0 == 0 /\ P^0-P^post11 == 0 /\ CRITICAL^0-CRITICAL^post11 == 0 /\ NONCRITICAL^0-NONCRITICAL^post11 == 0 /\ -num^post11+num^0 == 0 /\ -Q^post11+Q^0 == 0 /\ -MAX^post11+MAX^0 == 0 /\ NUM_MIN^0-NUM_MIN^post11 == 0 /\ j_min^0-j_min^post11 == 0 /\ INCREASE^0-INCREASE^post11 == 0 /\ conditional^0-conditional^post11 == 0), cost: 1
New rule:
l6 -> l5 : TRUE, cost: 1

Simplified rules
Start location: l6
  12: l0 -> l1 : conditional^0'=conditional^post0, -1+conditional^0 <= 0, cost: 1
  13: l0 -> l1 : j_min^0'=j_min^post1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -2+conditional^0 >= 0), cost: 1
  18: l1 -> l3 : conditional^0'=conditional^post6, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 1
  19: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, -j_min^0+pid^0 <= 0, cost: 1
  20: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, 1-MIN^0+num^0 <= 0, cost: 1
  14: l2 -> l0 : P^0'=1, conditional^0'=conditional^post2, -1+conditional^0 <= 0, cost: 1
  15: l2 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ -2+conditional^0 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 1
  16: l3 -> l2 : conditional^0'=conditional^post4, -1+conditional^0 <= 0, cost: 1
  17: l3 -> l2 : MAX^0'=MAX^0+INCREASE^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -2+conditional^0 >= 0), cost: 1
  21: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
  22: l5 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 1
  23: l6 -> l5 : TRUE, cost: 1


Eliminating location l5 by chaining:

Applied chaining
First rule:
l6 -> l5 : TRUE, cost: 1
Second rule:
l5 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 1
New rule:
l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2

Applied deletion
Removed the following rules: 22 23

Eliminated locations on linear paths
Start location: l6
  12: l0 -> l1 : conditional^0'=conditional^post0, -1+conditional^0 <= 0, cost: 1
  13: l0 -> l1 : j_min^0'=j_min^post1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -2+conditional^0 >= 0), cost: 1
  18: l1 -> l3 : conditional^0'=conditional^post6, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 1
  19: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, -j_min^0+pid^0 <= 0, cost: 1
  20: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, 1-MIN^0+num^0 <= 0, cost: 1
  14: l2 -> l0 : P^0'=1, conditional^0'=conditional^post2, -1+conditional^0 <= 0, cost: 1
  15: l2 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ -2+conditional^0 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 1
  16: l3 -> l2 : conditional^0'=conditional^post4, -1+conditional^0 <= 0, cost: 1
  17: l3 -> l2 : MAX^0'=MAX^0+INCREASE^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -2+conditional^0 >= 0), cost: 1
  21: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Eliminating location l3 by chaining:

Applied chaining
First rule:
l1 -> l3 : conditional^0'=conditional^post6, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 1
Second rule:
l3 -> l2 : conditional^0'=conditional^post4, -1+conditional^0 <= 0, cost: 1
New rule:
l1 -> l2 : conditional^0'=conditional^post4, (-1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 2

Applied chaining
First rule:
l1 -> l3 : conditional^0'=conditional^post6, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 1
Second rule:
l3 -> l2 : MAX^0'=MAX^0+INCREASE^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -2+conditional^0 >= 0), cost: 1
New rule:
l1 -> l2 : MAX^0'=MAX^0+INCREASE^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0), cost: 2

Applied deletion
Removed the following rules: 16 17 18

Eliminating location l0 by chaining:

Applied chaining
First rule:
l2 -> l0 : P^0'=1, conditional^0'=conditional^post2, -1+conditional^0 <= 0, cost: 1
Second rule:
l0 -> l1 : conditional^0'=conditional^post0, -1+conditional^0 <= 0, cost: 1
New rule:
l2 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1+conditional^post2 <= 0 /\ -1+conditional^0 <= 0), cost: 2

Applied chaining
First rule:
l2 -> l0 : P^0'=1, conditional^0'=conditional^post2, -1+conditional^0 <= 0, cost: 1
Second rule:
l0 -> l1 : j_min^0'=j_min^post1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -2+conditional^0 >= 0), cost: 1
New rule:
l2 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+conditional^0 <= 0 /\ -2+conditional^post2 >= 0), cost: 2

Applied deletion
Removed the following rules: 12 13 14

Eliminated locations on tree-shaped paths
Start location: l6
  19: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, -j_min^0+pid^0 <= 0, cost: 1
  20: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, 1-MIN^0+num^0 <= 0, cost: 1
  25: l1 -> l2 : conditional^0'=conditional^post4, (-1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 2
  26: l1 -> l2 : MAX^0'=MAX^0+INCREASE^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0), cost: 2
  15: l2 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ -2+conditional^0 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 1
  27: l2 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1+conditional^post2 <= 0 /\ -1+conditional^0 <= 0), cost: 2
  28: l2 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+conditional^0 <= 0 /\ -2+conditional^post2 >= 0), cost: 2
  21: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Applied merging
first rule:
l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, -j_min^0+pid^0 <= 0, cost: 1
second rule:
l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, 1-MIN^0+num^0 <= 0, cost: 1
new rule:
l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, (-j_min^0+pid^0 <= 0 \/ 1-MIN^0+num^0 <= 0), cost: 1

Merged rules
Start location: l6
  25: l1 -> l2 : conditional^0'=conditional^post4, (-1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 2
  26: l1 -> l2 : MAX^0'=MAX^0+INCREASE^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0), cost: 2
  29: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, (-j_min^0+pid^0 <= 0 \/ 1-MIN^0+num^0 <= 0), cost: 1
  15: l2 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ -2+conditional^0 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 1
  27: l2 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1+conditional^post2 <= 0 /\ -1+conditional^0 <= 0), cost: 2
  28: l2 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+conditional^0 <= 0 /\ -2+conditional^post2 >= 0), cost: 2
  21: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Eliminating location l2 by chaining:

Applied chaining
First rule:
l1 -> l2 : conditional^0'=conditional^post4, (-1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 2
Second rule:
l2 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ -2+conditional^0 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 1
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (-2+conditional^post4 >= 0 /\ -1+conditional^post6 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3

Applied chaining
First rule:
l1 -> l2 : conditional^0'=conditional^post4, (-1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 2
Second rule:
l2 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1+conditional^post2 <= 0 /\ -1+conditional^0 <= 0), cost: 2
New rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1+conditional^post2 <= 0 /\ -1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+conditional^post4 <= 0), cost: 4

Applied chaining
First rule:
l1 -> l2 : conditional^0'=conditional^post4, (-1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 2
Second rule:
l2 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+conditional^0 <= 0 /\ -2+conditional^post2 >= 0), cost: 2
New rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post2 >= 0 /\ -1+conditional^post4 <= 0), cost: 4

Applied chaining
First rule:
l1 -> l2 : MAX^0'=MAX^0+INCREASE^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0), cost: 2
Second rule:
l2 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ -2+conditional^0 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 1
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0 /\ -2+conditional^post5 >= 0), cost: 3

Applied chaining
First rule:
l1 -> l2 : MAX^0'=MAX^0+INCREASE^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0), cost: 2
Second rule:
l2 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1+conditional^post2 <= 0 /\ -1+conditional^0 <= 0), cost: 2
New rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1+conditional^post2 <= 0 /\ -1+conditional^post5 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0), cost: 4

Applied chaining
First rule:
l1 -> l2 : MAX^0'=MAX^0+INCREASE^post5, conditional^0'=conditional^post5, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0), cost: 2
Second rule:
l2 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+conditional^0 <= 0 /\ -2+conditional^post2 >= 0), cost: 2
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+conditional^post5 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0 /\ -2+conditional^post2 >= 0), cost: 4

Applied deletion
Removed the following rules: 15 25 26 27 28

Eliminated locations on tree-shaped paths
Start location: l6
  29: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, (-j_min^0+pid^0 <= 0 \/ 1-MIN^0+num^0 <= 0), cost: 1
  30: l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (-2+conditional^post4 >= 0 /\ -1+conditional^post6 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
  31: l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1+conditional^post2 <= 0 /\ -1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+conditional^post4 <= 0), cost: 4
  32: l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post2 >= 0 /\ -1+conditional^post4 <= 0), cost: 4
  33: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0 /\ -2+conditional^post5 >= 0), cost: 3
  34: l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1+conditional^post2 <= 0 /\ -1+conditional^post5 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0), cost: 4
  35: l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+conditional^post5 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0 /\ -2+conditional^post2 >= 0), cost: 4
  21: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (-2+conditional^post4 >= 0 /\ -1+conditional^post6 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3

Applied simplification
Original rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1+conditional^post2 <= 0 /\ -1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+conditional^post4 <= 0), cost: 4
New rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+conditional^post6 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post2 >= 0 /\ -1+conditional^post4 <= 0), cost: 4
New rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0 /\ -2+conditional^post5 >= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3

Applied simplification
Original rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1+conditional^post2 <= 0 /\ -1+conditional^post5 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0), cost: 4
New rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+conditional^post5 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+conditional^post6 >= 0 /\ -2+conditional^post2 >= 0), cost: 4
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4

Simplified simple loops
Start location: l6
  29: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, (-j_min^0+pid^0 <= 0 \/ 1-MIN^0+num^0 <= 0), cost: 1
  36: l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
  37: l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
  38: l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
  39: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
  40: l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
  41: l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
  21: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+n5*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n5)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0-MIN^0-(-1+n5)*INCREASE^post3, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n5 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n5)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n5)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n5)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3*n5

Applied fixed-point processor
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
New rule:
l1 -> [7] : (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ j_min^0-j_min^post3 == 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: NONTERM

Applied nonterm
Original rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4*n7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n9, MIN^0'=MIN^0+INCREASE^post3*n9, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n9)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n9), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n9) >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ ((-(-1+n9)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n9)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-(-1+n9)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 3*n9

Applied recurrent set
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
New rule:
l1 -> [7] : (0 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+2*INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -j_min^0+j_min^post3 <= 0), cost: NONTERM

Applied nonterm
Original rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : MAX^0'=MAX^0+n11*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4*n11

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
Second rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-(-1+n13)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n13

Applied chaining
First rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-(-1+n13)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n13
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ ((-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n13)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n13

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ 1-j_min^post1+j_min^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ 1-j_min^post1+j_min^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-(-1+n15)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n15

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-(-1+n15)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n15
New rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-(-1+n15)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0))), cost: 4+7*n15

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+2*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+2*INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ MIN^0-num^0+2*INCREASE^post3 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 6

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+2*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+2*INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ MIN^0-num^0+2*INCREASE^post3 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 6
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n17 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-INCREASE^post3 >= 0 /\ ((INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-2*(-1+n17)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0))), cost: 6*n17

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n17 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-INCREASE^post3 >= 0 /\ ((INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-2*(-1+n17)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0))), cost: 6*n17
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5+INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n17 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((MAX^0-MIN^0+2*INCREASE^post5-3*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-3*INCREASE^post3 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-3*INCREASE^post3 >= 0)) /\ ((-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-3*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+6*n17

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
Second rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n19)+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n19

Applied chaining
First rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n19)+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n19
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n19 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n19)+num^0 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 4+7*n19

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ 1-j_min^post1+j_min^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ 1-j_min^post1+j_min^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n21

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n21
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n21)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n21

Applied chaining
First rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23), Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n23 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n23

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23), Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n23 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n23
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n23 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n23)+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n23

Applied chaining
First rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ ((-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n26

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ ((-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n26
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n26 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n26)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n26

Applied chaining
First rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 8

Applied nonterm
Original rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 8
New rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 8
New rule:
l1 -> l1 : MAX^0'=MAX^0+n28*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 8*n28

Applied chaining
First rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM
New rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM

Applied chaining
First rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : MAX^0'=MAX^0+n28*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 8*n28
New rule:
l1 -> l1 : MAX^0'=MAX^0+n28*INCREASE^post5+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: 4+8*n28

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ MIN^0-num^0 <= 0 /\ 2+j_min^0-pid^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ MIN^0-num^0 <= 0 /\ 2+j_min^0-pid^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n31), Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n31

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n31), Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n31
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n31

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ MIN^0-num^0 <= 0 /\ 2+j_min^0-pid^0 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ MIN^0-num^0 <= 0 /\ 2+j_min^0-pid^0 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-(-1+n34)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n34

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-(-1+n34)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n34
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0)) /\ ((-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n34

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+2*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -MAX^0+MIN^0-INCREASE^post5+2*INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ MIN^0-num^0+2*INCREASE^post3 <= 0), cost: 6

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+2*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -MAX^0+MIN^0-INCREASE^post5+2*INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ MIN^0-num^0+2*INCREASE^post3 <= 0), cost: 6
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0))), cost: 6*n37

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0))), cost: 6*n37
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-3*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+INCREASE^post5-3*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+6*n37

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
Second rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n39 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n39)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0))), cost: 7*n39

Applied chaining
First rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n39 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n39)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0))), cost: 7*n39
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n39 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n39)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 4+7*n39

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ 1-j_min^post1+j_min^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ 1-j_min^post1+j_min^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n41)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n41

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n41)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n41
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0-(-1+n41)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n41

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
Second rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n43 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n43

Applied chaining
First rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n43 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n43
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n43)+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n43

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+2*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ 1-j_min^post1+j_min^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+2*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ 1-pid^0+j_min^post3 <= 0 /\ 1-j_min^post1+j_min^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n45

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n45
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 4+7*n45

Applied chaining
First rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n47

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n47
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0))), cost: 3+7*n47

Applied chaining
First rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 8

Applied nonterm
Original rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 8
New rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 8
New rule:
l1 -> l1 : MAX^0'=MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 8*n49

Applied chaining
First rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM
New rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM

Applied chaining
First rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : MAX^0'=MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 8*n49
New rule:
l1 -> l1 : MAX^0'=MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: 4+8*n49

Applied chaining
First rule:
l1 -> l1 : MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+2*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0-2*INCREASE^post5+INCREASE^post3 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+2*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0-2*INCREASE^post5+INCREASE^post3 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5-INCREASE^post3 >= 0 /\ ((-MIN^0-(-1+n52)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n52

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5-INCREASE^post3 >= 0 /\ ((-MIN^0-(-1+n52)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n52
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-INCREASE^post3, Q^0'=1, (MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ MAX^0-MIN^0+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0-(-1+n52)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-(-1+n52)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n52

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ MIN^0-num^0 <= 0 /\ 2+j_min^0-pid^0 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ MIN^0-num^0 <= 0 /\ 2+j_min^0-pid^0 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-(-1+n55)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n55

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0, Q^0'=1, (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-(-1+n55)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n55
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-2*INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n55

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+2*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0-2*INCREASE^post5+INCREASE^post3 <= 0 /\ 2+j_min^0-pid^0 <= 0), cost: 7

Applied acceleration
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+2*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0-2*INCREASE^post5+INCREASE^post3 <= 0 /\ 2+j_min^0-pid^0 <= 0), cost: 7
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n58

Applied chaining
First rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5, MIN^0'=MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0, MAX_MIN^0'=MAX^0-MIN^0+INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 3
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n58
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-(-1+n58)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n58)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n58

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+n5*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n5)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0-MIN^0-(-1+n5)*INCREASE^post3, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n5 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n5)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n5)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n5)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3*n5
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+n5*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n5)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0-MIN^0-(-1+n5)*INCREASE^post3, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -MIN^0-(-1+n5)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n5 >= 0 /\ -MIN^0+num^0 >= 0), cost: 3*n5

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n9, MIN^0'=MIN^0+INCREASE^post3*n9, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n9)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n9), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n9) >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ ((-(-1+n9)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n9)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-(-1+n9)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 3*n9
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n9, MIN^0'=MIN^0+INCREASE^post3*n9, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n9)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n9), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n9) >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -(-1+n9)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ -MIN^0+num^0 >= 0), cost: 3*n9

Applied simplification
Original rule:
l1 -> [7] : (0 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+2*INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -j_min^0+j_min^post3 <= 0), cost: NONTERM
New rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+2*INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -j_min^0+j_min^post3 <= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-(-1+n13)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n13
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0), cost: 7*n13

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ ((-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n13)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n13
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0), cost: 4+7*n13

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-(-1+n15)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n15
New rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0), cost: 7*n15

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-(-1+n15)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0))), cost: 4+7*n15
New rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0), cost: 4+7*n15

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n17 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-INCREASE^post3 >= 0 /\ ((INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-2*(-1+n17)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0))), cost: 6*n17
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n17 >= 0 /\ -MIN^0+num^0 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-INCREASE^post3 >= 0), cost: 6*n17

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5+INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n17 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((MAX^0-MIN^0+2*INCREASE^post5-3*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-3*INCREASE^post3 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-3*INCREASE^post3 >= 0)) /\ ((-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-3*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+6*n17
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5+INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n17 >= 0 /\ ((-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-3*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((MAX^0-MIN^0+2*INCREASE^post5-3*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-3*INCREASE^post3 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-3*INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+6*n17

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n19)+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n19
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n19 >= 0), cost: 7*n19

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n19 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n19)+num^0 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 4+7*n19
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n19 >= 0), cost: 4+7*n19

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n21
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n21

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n21)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n21
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n21)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n21

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23), Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n23 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n23
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23), Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n23 >= 0), cost: 7*n23

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n23 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n23)+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n23
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, Q^0'=1, (-1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n23 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3+7*n23

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ ((-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n26
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ -(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n26

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n26 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n26)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n26
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n26 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n26)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n26

Applied simplification
Original rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM
New rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> l1 : MAX^0'=MAX^0+n28*INCREASE^post5+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: 4+8*n28
New rule:
l1 -> l1 : MAX^0'=MAX^0+n28*INCREASE^post5+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: 4+8*n28

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n31), Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n31
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n31), Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n31

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n31
New rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), Q^0'=1, (-MIN^0+num^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3+7*n31

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-(-1+n34)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n34
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n34)*INCREASE^post5, Q^0'=1, (-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n34

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0)) /\ ((-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n34
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n34

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0))), cost: 6*n37
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 6*n37

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-3*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+INCREASE^post5-3*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+6*n37
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-3*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+INCREASE^post5-3*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0)) /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+6*n37

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n39 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n39)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0))), cost: 7*n39
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n39 >= 0), cost: 7*n39

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n39 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n39)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 4+7*n39
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n39 >= 0), cost: 4+7*n39

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n41)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n41
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n41

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0-(-1+n41)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n41
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4+7*n41

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n43 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n43
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n43 >= 0), cost: 7*n43

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n43)+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n43
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n43

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n45
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0), cost: 7*n45

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 4+7*n45
New rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4+7*n45

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n47
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n47

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0))), cost: 3+7*n47
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0))), cost: 3+7*n47

Applied simplification
Original rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM
New rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> l1 : MAX^0'=MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: 4+8*n49
New rule:
l1 -> l1 : MAX^0'=MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: 4+8*n49

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5-INCREASE^post3 >= 0 /\ ((-MIN^0-(-1+n52)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 7*n52
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5, Q^0'=1, (-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n52

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-INCREASE^post3, Q^0'=1, (MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ MAX^0-MIN^0+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0-(-1+n52)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-(-1+n52)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n52
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-INCREASE^post3, Q^0'=1, (MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ MAX^0-MIN^0+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ ((-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-(-1+n52)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0-(-1+n52)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n52

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-(-1+n55)*INCREASE^post3-MIN^0+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n55
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -MIN^0+num^0 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n55

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-2*INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n55
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-2*INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n55

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 7*n58
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ -MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n58

Applied simplification
Original rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-(-1+n58)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n58)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n58
New rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-(-1+n58)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n58

Applied deletion
Removed the following rules: 36 37 39 40

Applied deletion
Removed the following rules: 48 64 111

Accelerated simple loops
Start location: l6
  29: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, (-j_min^0+pid^0 <= 0 \/ 1-MIN^0+num^0 <= 0), cost: 1
  38: l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
  41: l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
  43: l1 -> [7] : (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ j_min^0-j_min^post3 == 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: NONTERM
  44: l1 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM
  45: l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4*n7
  49: l1 -> l1 : MAX^0'=MAX^0+n11*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4*n11
  66: l1 -> l1 : MAX^0'=MAX^0+n28*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 8*n28
  84: l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM
  86: l1 -> l1 : MAX^0'=MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 8*n49
  94: l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+n5*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n5)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0-MIN^0-(-1+n5)*INCREASE^post3, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -MIN^0-(-1+n5)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n5 >= 0 /\ -MIN^0+num^0 >= 0), cost: 3*n5
  95: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n9, MIN^0'=MIN^0+INCREASE^post3*n9, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n9)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n9), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n9) >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -(-1+n9)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ -MIN^0+num^0 >= 0), cost: 3*n9
  96: l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+2*INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -j_min^0+j_min^post3 <= 0), cost: NONTERM
  97: l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0), cost: 7*n13
  98: l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0), cost: 4+7*n13
  99: l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0), cost: 7*n15
 100: l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0), cost: 4+7*n15
 101: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n17 >= 0 /\ -MIN^0+num^0 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-INCREASE^post3 >= 0), cost: 6*n17
 102: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5+INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n17 >= 0 /\ ((-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-3*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((MAX^0-MIN^0+2*INCREASE^post5-3*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-3*INCREASE^post3 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-3*INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+6*n17
 103: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n19 >= 0), cost: 7*n19
 104: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n19 >= 0), cost: 4+7*n19
 105: l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n21
 106: l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n21)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n21
 107: l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23), Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n23 >= 0), cost: 7*n23
 108: l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, Q^0'=1, (-1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n23 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3+7*n23
 109: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ -(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n26
 110: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n26 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n26)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n26
 112: l1 -> l1 : MAX^0'=MAX^0+n28*INCREASE^post5+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: 4+8*n28
 113: l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n31), Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n31
 114: l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), Q^0'=1, (-MIN^0+num^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3+7*n31
 115: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n34)*INCREASE^post5, Q^0'=1, (-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n34
 116: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n34
 117: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 6*n37
 118: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-3*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+INCREASE^post5-3*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0)) /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+6*n37
 119: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n39 >= 0), cost: 7*n39
 120: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n39 >= 0), cost: 4+7*n39
 121: l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n41
 122: l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4+7*n41
 123: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n43 >= 0), cost: 7*n43
 124: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n43
 125: l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0), cost: 7*n45
 126: l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4+7*n45
 127: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n47
 128: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0))), cost: 3+7*n47
 129: l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM
 130: l1 -> l1 : MAX^0'=MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: 4+8*n49
 131: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5, Q^0'=1, (-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n52
 132: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-INCREASE^post3, Q^0'=1, (MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ MAX^0-MIN^0+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ ((-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-(-1+n52)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0-(-1+n52)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n52
 133: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -MIN^0+num^0 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n55
 134: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-2*INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n55
 135: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ -MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n58
 136: l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-(-1+n58)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n58
  21: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 5

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0), cost: 4
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 5

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> [7] : (num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ j_min^0-j_min^post3 == 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: NONTERM
New rule:
l4 -> [7] : (-1+j_min^0 >= 0 /\ MIN^0 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM
New rule:
l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : P^0'=1, conditional^0'=conditional^post0, (-1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4*n7
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, P^0'=1, conditional^0'=conditional^post0, num^0'=1+MAX^0, (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : MAX^0'=MAX^0+n11*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4*n11
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n11*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n11

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : MAX^0'=MAX^0+n28*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 8*n28
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n28*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n28

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM
New rule:
l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : MAX^0'=MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0+num^0 >= 0), cost: 8*n49
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n49

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MIN^0'=MIN^0+n5*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n5)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0-MIN^0-(-1+n5)*INCREASE^post3, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -MIN^0-(-1+n5)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n5 >= 0 /\ -MIN^0+num^0 >= 0), cost: 3*n5
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, MIN^0'=MIN^0+n5*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n5 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n5

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n9, MIN^0'=MIN^0+INCREASE^post3*n9, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n9)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n9), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n9) >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -(-1+n9)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ -MIN^0+num^0 >= 0), cost: 3*n9
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n9, MIN^0'=MIN^0+INCREASE^post3*n9, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n9), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ 1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n9

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+2*INCREASE^post3 <= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -j_min^0+j_min^post3 <= 0), cost: NONTERM
New rule:
l4 -> [7] : (-1+j_min^0 >= 0 /\ -1-MAX^0+2*INCREASE^post3 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0), cost: 7*n13
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n13

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n13)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-(-1+n13)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0), cost: 4+7*n13
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n13

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0), cost: 7*n15
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n15

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-(-1+n15)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0 /\ -(-1+n15)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0), cost: 4+7*n15
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n15

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+n17 >= 0 /\ -MIN^0+num^0 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-INCREASE^post3 >= 0), cost: 6*n17
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n17*INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n17

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n17*INCREASE^post5+INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-2*INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n17 >= 0 /\ ((-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-3*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n17)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((MAX^0-MIN^0+2*INCREASE^post5-3*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-3*INCREASE^post3 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-3*INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n17)*INCREASE^post3+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+6*n17
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n17*INCREASE^post5+INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n17 >= 0), cost: 4+6*n17

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n19 >= 0), cost: 7*n19
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n19+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n19), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n19

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n19+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n19)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n19)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n19 >= 0), cost: 4+7*n19
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n19+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n19), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n19

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n21
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n21)*INCREASE^post5+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n21

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n21)*INCREASE^post3, MAX_MIN^0'=(-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n21)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ (-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-(-1+n21)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n21
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n21)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n21

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23), Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n23 >= 0), cost: 7*n23
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23), Q^0'=1, (1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n23

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+INCREASE^post3+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n23)+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, Q^0'=1, (-1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n23)+num^0-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -1+n23 >= 0 /\ MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3+7*n23
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, Q^0'=1, (-1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0), cost: 4+7*n23

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ -(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n26
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n26

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n26 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3+(-1+n26)*INCREASE^post5 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n26)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n26)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+7*n26
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -1+n26 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n26

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : MAX^0'=MAX^0+n28*INCREASE^post5+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: 4+8*n28
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n28*INCREASE^post5+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n28

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3*(-1+n31), Q^0'=1, (-num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n31
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n31), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n31), Q^0'=1, (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n31

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3-INCREASE^post3*(-1+n31), MAX_MIN^0'=MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), Q^0'=1, (-MIN^0+num^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0), cost: 3+7*n31
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), Q^0'=1, (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0), cost: 4+7*n31

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n34)*INCREASE^post5, Q^0'=1, (-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n34
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n34

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3+(-1+n34)*INCREASE^post5 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-2*INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n34)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n34)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n34
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n34

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0-2*(-1+n37)*INCREASE^post3+num^0 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 6*n37
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n37

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-2*INCREASE^post3, MAX_MIN^0'=INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3 >= 0 /\ INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-3*INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+INCREASE^post5-3*INCREASE^post3 >= 0 /\ -1+n37 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0-2*(-1+n37)*INCREASE^post3+num^0-3*INCREASE^post3 >= 0)) /\ ((-MIN^0-2*(-1+n37)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-3*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0))), cost: 3+6*n37
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n37 >= 0), cost: 4+6*n37

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n39 >= 0), cost: 7*n39
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n39), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n39

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n39)+num^0, MAX_MIN^0'=MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n39)+num^0-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n39 >= 0), cost: 4+7*n39
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n39), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n39

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n41
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n41

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0-(-1+n41)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -MIN^0-(-1+n41)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4+7*n41
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n41

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -1+n43 >= 0), cost: 7*n43
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+2*INCREASE^post5*n43+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n43), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n43

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=2*INCREASE^post5*n43+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=-MIN^0-INCREASE^post3*(-1+n43)+num^0, MAX_MIN^0'=MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ ((-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1+pid^0-j_min^post3 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0-INCREASE^post3*(-1+n43)+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0)) /\ ((-MIN^0-INCREASE^post3*(-1+n43)+num^0 >= 0 /\ -MIN^0+num^0 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0))), cost: 4+7*n43
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+2*INCREASE^post5*n43+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n43), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n43

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0), cost: 7*n45
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n45)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n45

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post1, MAX^0'=MAX^0+INCREASE^post5+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n45)*INCREASE^post3, MAX_MIN^0'=2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ -MIN^0+num^0 >= 0), cost: 4+7*n45
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n45)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n45

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n47
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n47)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n47

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3, MAX_MIN^0'=(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ (-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0))), cost: 3+7*n47
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n47

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> [7] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: NONTERM
New rule:
l4 -> [7] : (1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : MAX^0'=MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -MIN^0+num^0 >= 0), cost: 4+8*n49
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n49

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5, Q^0'=1, (-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0 >= 0), cost: 7*n52
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n52*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n52

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n52*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-INCREASE^post3, Q^0'=1, (MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -1+INCREASE^post5 >= 0 /\ MAX^0-MIN^0+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ ((-MIN^0-(-1+n52)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-(-1+n52)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0-(-1+n52)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n52
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n52*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-2*INCREASE^post3 >= 0), cost: 4+7*n52

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -MIN^0+num^0 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n55
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n55

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3, MAX_MIN^0'=MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-2*INCREASE^post3+INCREASE^post5*(-1+n55) >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+INCREASE^post5-2*INCREASE^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ -MAX^0+MIN^0+INCREASE^post3 <= 0 /\ ((-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-(-1+n55)*INCREASE^post3-MIN^0+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0+num^0-INCREASE^post3 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -(-1+n55)*INCREASE^post3-MIN^0+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n55
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-2*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n55 >= 0), cost: 4+7*n55

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -num^0+INCREASE^post3 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ -MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -MIN^0+num^0 >= 0 /\ -2-j_min^0+pid^0 >= 0), cost: 7*n58
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n58*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n58

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l1 : j_min^0'=j_min^post3, MAX^0'=MAX^0+2*n58*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3, MAX_MIN^0'=2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ MAX^0-MIN^0+3*INCREASE^post5-2*INCREASE^post3 >= 0 /\ -MAX^0+MIN^0-INCREASE^post5+INCREASE^post3 <= 0 /\ -num^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ num^0-INCREASE^post3 <= 0 /\ -1+j_min^post3 >= 0 /\ MIN^0-num^0+INCREASE^post3 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ MIN^0-num^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0-INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0)) /\ ((-MIN^0-(-1+n58)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0+num^0-INCREASE^post3 >= 0) \/ (-MIN^0+num^0-2*INCREASE^post3 >= 0 /\ -MIN^0-(-1+n58)*INCREASE^post3+num^0-2*INCREASE^post3 >= 0))), cost: 3+7*n58
New rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n58*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n58 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n58

Applied deletion
Removed the following rules: 38 41 43 44 45 49 66 84 86 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136

Chained accelerated rules with incoming rules
Start location: l6
  29: l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, (-j_min^0+pid^0 <= 0 \/ 1-MIN^0+num^0 <= 0), cost: 1
  21: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
 137: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 5
 138: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 5
 139: l4 -> [7] : (-1+j_min^0 >= 0 /\ MIN^0 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: NONTERM
 140: l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
 141: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, P^0'=1, conditional^0'=conditional^post0, num^0'=1+MAX^0, (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7
 142: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n11*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n11
 143: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n28*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n28
 144: l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
 145: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n49
 146: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, MIN^0'=MIN^0+n5*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n5 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n5
 147: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n9, MIN^0'=MIN^0+INCREASE^post3*n9, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n9), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ 1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n9
 148: l4 -> [7] : (-1+j_min^0 >= 0 /\ -1-MAX^0+2*INCREASE^post3 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: NONTERM
 149: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n13
 150: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n13
 151: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n15
 152: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n15
 153: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n17*INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n17
 154: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n17*INCREASE^post5+INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n17 >= 0), cost: 4+6*n17
 155: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n19+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n19), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n19
 156: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n19+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n19), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n19
 157: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n21)*INCREASE^post5+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n21
 158: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n21)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n21
 159: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23), Q^0'=1, (1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n23
 160: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, Q^0'=1, (-1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0), cost: 4+7*n23
 161: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n26
 162: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -1+n26 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n26
 163: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n28*INCREASE^post5+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n28
 164: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n31), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n31), Q^0'=1, (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n31
 165: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), Q^0'=1, (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0), cost: 4+7*n31
 166: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n34
 167: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n34
 168: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n37
 169: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n37 >= 0), cost: 4+6*n37
 170: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n39), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n39
 171: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n39), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n39
 172: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n41
 173: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n41
 174: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+2*INCREASE^post5*n43+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n43), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n43
 175: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+2*INCREASE^post5*n43+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n43), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n43
 176: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n45)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n45
 177: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n45)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n45
 178: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n47)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n47
 179: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n47
 180: l4 -> [7] : (1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
 181: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n49
 182: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n52*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n52
 183: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n52*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-2*INCREASE^post3 >= 0), cost: 4+7*n52
 184: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n55
 185: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-2*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n55 >= 0), cost: 4+7*n55
 186: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n58*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n58
 187: l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n58*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n58 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n58
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Eliminating location l1 by chaining:

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, num^0'=1+MAX^0, TRUE, cost: 1
Second rule:
l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, (-j_min^0+pid^0 <= 0 \/ 1-MIN^0+num^0 <= 0), cost: 1
New rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, P^0'=0, num^0'=1+MAX^0, Q^0'=0, (2+MAX^0-MIN^0 <= 0 \/ -j_min^0+pid^0 <= 0), cost: 2

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 5
Second rule:
l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, (-j_min^0+pid^0 <= 0 \/ 1-MIN^0+num^0 <= 0), cost: 1
New rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ (pid^0-j_min^post1 <= 0 \/ 2+MAX^0-MIN^0 <= 0)), cost: 6

Applied simplification
Original rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ (pid^0-j_min^post1 <= 0 \/ 2+MAX^0-MIN^0 <= 0)), cost: 6
New rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6

Applied chaining
First rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=1, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 5
Second rule:
l1 -> l4 : CRITICAL^0'=1, P^0'=0, Q^0'=0, (-j_min^0+pid^0 <= 0 \/ 1-MIN^0+num^0 <= 0), cost: 1
New rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ (pid^0-j_min^post1 <= 0 \/ 2+MAX^0-MIN^0 <= 0)), cost: 6

Applied simplification
Original rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ (pid^0-j_min^post1 <= 0 \/ 2+MAX^0-MIN^0 <= 0)), cost: 6
New rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, P^0'=1, conditional^0'=conditional^post0, num^0'=1+MAX^0, (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7
New rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n11*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n11
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n11

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n28*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n28
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n28

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n49
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n49

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, MIN^0'=MIN^0+n5*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n5 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n5
New rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n5 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n5

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n9, MIN^0'=MIN^0+INCREASE^post3*n9, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n9), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ 1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n9
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ 1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n9

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n13
New rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n13

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n13*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n13
New rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n13

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n15
New rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n15

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n15*INCREASE^post3, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n15
New rule:
l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n15

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n17*INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n17
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n17

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n17*INCREASE^post5+INCREASE^post5, MIN^0'=MIN^0+2*n17*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n17)+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3+2*INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n17 >= 0), cost: 4+6*n17
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n17 >= 0), cost: 4+6*n17

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n19+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n19), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n19)-MIN^0-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n19
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n19

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n19+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n19, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n19), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n19)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n19), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n19
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n19

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n21)*INCREASE^post5+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n21
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n21

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5+INCREASE^post5*n21, P^0'=1, MIN^0'=n21*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n21)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n21)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n21)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n21
New rule:
l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n21

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23), Q^0'=1, (1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n23
New rule:
l4 -> [8] : (1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n23

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3+n23*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3, Q^0'=1, (-1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0), cost: 4+7*n23
New rule:
l4 -> [8] : (-1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0), cost: 4+7*n23

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n26
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n26

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5+INCREASE^post5*n26, P^0'=1, MIN^0'=n26*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n26)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -1+n26 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n26
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -1+n26 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n26

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n28*INCREASE^post5+INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n28
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n28

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n31), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n31), Q^0'=1, (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n31
New rule:
l4 -> [8] : (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n31

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0, P^0'=1, MIN^0'=MIN^0+n31*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31), Q^0'=1, (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0), cost: 4+7*n31
New rule:
l4 -> [8] : (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0), cost: 4+7*n31

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+INCREASE^post5+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n34
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n34

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5+INCREASE^post5*n34, P^0'=1, MIN^0'=n34*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0+2*INCREASE^post5-INCREASE^post3+(-1+n34)*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n34
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n34

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n37
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n37

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+INCREASE^post5*n37+MAX^0, MIN^0'=MIN^0+2*n37*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+INCREASE^post5*(-1+n37)+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3+INCREASE^post5-2*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n37 >= 0), cost: 4+6*n37
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n37 >= 0), cost: 4+6*n37

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n39), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n39
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n39

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+n39*INCREASE^post5+MAX^0, P^0'=1, MIN^0'=MIN^0+n39*INCREASE^post3, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n39), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+INCREASE^post5*(-1+n39)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n39), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n39
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n39

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n41
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n41

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+n41*INCREASE^post5, P^0'=1, MIN^0'=n41*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+(-1+n41)*INCREASE^post5-MIN^0+INCREASE^post5-(-1+n41)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n41
New rule:
l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n41

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+2*INCREASE^post5*n43+MAX^0, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n43), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n43
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n43

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+2*INCREASE^post5*n43+MAX^0+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n43, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3*(-1+n43), num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*INCREASE^post5*(-1+n43)-MIN^0+2*INCREASE^post5-INCREASE^post3*(-1+n43), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n43
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n43

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n45)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n45
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n45

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5+2*n45*INCREASE^post5, P^0'=1, MIN^0'=n45*INCREASE^post3+MIN^0, conditional^0'=conditional^post1, INCREASE^0'=j_min^post1-j_min^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n45)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n45)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n45)*INCREASE^post3, Q^0'=1, (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n45
New rule:
l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n45

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n47)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n47
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n47

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+n47*INCREASE^post5, P^0'=1, MIN^0'=n47*INCREASE^post3+MIN^0+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+(-1+n47)*INCREASE^post5+MAX^0-MIN^0+INCREASE^post5-INCREASE^post3-(-1+n47)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n47
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n47

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, MAX^0'=1+MAX^0+n49*INCREASE^post5, P^0'=1, conditional^0'=conditional^post0, INCREASE^0'=INCREASE^post5, num^0'=1+MAX^0, (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n49
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n49

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n52*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+2*INCREASE^post5, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n52
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n52

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n52*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n52*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0+2*(-1+n52)*INCREASE^post5-MIN^0-(-1+n52)*INCREASE^post3+3*INCREASE^post5-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-2*INCREASE^post3 >= 0), cost: 4+7*n52
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-2*INCREASE^post3 >= 0), cost: 4+7*n52

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n55
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n55

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+INCREASE^post5*n55, P^0'=1, MIN^0'=MIN^0+INCREASE^post3*n55+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0+INCREASE^post5-INCREASE^post3+INCREASE^post5*(-1+n55), Q^0'=1, (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-2*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n55 >= 0), cost: 4+7*n55
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-2*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n55 >= 0), cost: 4+7*n55

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n58*INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+2*INCREASE^post5-(-1+n58)*INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n58
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n58

Applied partial deletion
Original rule:
l4 -> l1 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post3, MAX^0'=1+MAX^0+2*n58*INCREASE^post5+INCREASE^post5, P^0'=1, MIN^0'=MIN^0+n58*INCREASE^post3+INCREASE^post3, conditional^0'=conditional^post3, INCREASE^0'=INCREASE^post3, NUM_MIN^0'=1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3, num^0'=1+MAX^0, MAX_MIN^0'=1+2*(-1+n58)*INCREASE^post5+MAX^0-MIN^0+3*INCREASE^post5-(-1+n58)*INCREASE^post3-INCREASE^post3, Q^0'=1, (-1+INCREASE^post5 >= 0 /\ -1+n58 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n58
New rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n58 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n58

Applied deletion
Removed the following rules: 21 29 137 138 141 142 143 145 146 147 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 181 182 183 184 185 186 187

Eliminated locations on tree-shaped paths
Start location: l6
 139: l4 -> [7] : (-1+j_min^0 >= 0 /\ MIN^0 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: NONTERM
 140: l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
 144: l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
 148: l4 -> [7] : (-1+j_min^0 >= 0 /\ -1-MAX^0+2*INCREASE^post3 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: NONTERM
 180: l4 -> [7] : (1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
 188: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, P^0'=0, num^0'=1+MAX^0, Q^0'=0, (2+MAX^0-MIN^0 <= 0 \/ -j_min^0+pid^0 <= 0), cost: 2
 189: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6
 190: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6
 191: l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7
 192: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n11
 193: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n28
 194: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n49
 195: l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n5 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n5
 196: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ 1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n9
 197: l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n13
 198: l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n13
 199: l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n15
 200: l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n15
 201: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n17
 202: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n17 >= 0), cost: 4+6*n17
 203: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n19
 204: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n19
 205: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n21
 206: l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n21
 207: l4 -> [8] : (1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n23
 208: l4 -> [8] : (-1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0), cost: 4+7*n23
 209: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n26
 210: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -1+n26 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n26
 211: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n28
 212: l4 -> [8] : (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n31
 213: l4 -> [8] : (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0), cost: 4+7*n31
 214: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n34
 215: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n34
 216: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n37
 217: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n37 >= 0), cost: 4+6*n37
 218: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n39
 219: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n39
 220: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n41
 221: l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n41
 222: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n43
 223: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n43
 224: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n45
 225: l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n45
 226: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n47
 227: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n47
 228: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n49
 229: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n52
 230: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-2*INCREASE^post3 >= 0), cost: 4+7*n52
 231: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n55
 232: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-2*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n55 >= 0), cost: 4+7*n55
 233: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n58
 234: l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n58 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n58
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Applied merging
first rule:
l4 -> [7] : (-1+j_min^0 >= 0 /\ MIN^0 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: NONTERM
second rule:
l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
new rule:
l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM

Applied merging
first rule:
l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
second rule:
l4 -> [7] : (-1+j_min^0 >= 0 /\ -1-MAX^0+2*INCREASE^post3 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: NONTERM
new rule:
l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM

Applied merging
first rule:
l4 -> [7] : (1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
second rule:
l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
new rule:
l4 -> [7] : (1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM

Applied merging
first rule:
l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
second rule:
l4 -> [7] : (1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
new rule:
l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM

Applied merging
first rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n11
new rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n28
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n49
new rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n28

Applied merging
first rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n5 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n5
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ 1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+3*n9
new rule:
l4 -> [8] : ((-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n5 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ 1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+3*n5

Applied merging
first rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n13
second rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n13
new rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n13

Applied merging
first rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n15
second rule:
l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n15
new rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n15

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n17
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n17 >= 0), cost: 4+6*n17
new rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n17

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n19
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n19
new rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n19

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n21
second rule:
l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n21
new rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n21

Applied merging
first rule:
l4 -> [8] : (1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n23
second rule:
l4 -> [8] : (-1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-2*INCREASE^post3 >= 0), cost: 4+7*n23
new rule:
l4 -> [8] : (1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n23

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n26
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -1+n26 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n26
new rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n26

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n28
second rule:
l4 -> [8] : (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n31
new rule:
l4 -> [8] : ((-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+8*n28

Applied merging
first rule:
l4 -> [8] : (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0), cost: 4+7*n31
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n34
new rule:
l4 -> [8] : ((-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 4+7*n31

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n34
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n37
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0)), cost: 4+7*n34

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n37 >= 0), cost: 4+6*n37
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n39
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n37 >= 0)), cost: 4+6*n37

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n39
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n41
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n39

Applied merging
first rule:
l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n41
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n43
new rule:
l4 -> [8] : ((1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n41

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n43
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n45
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n43

Applied merging
first rule:
l4 -> [8] : (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n45
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n47
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n45

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n47 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n47
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+8*n49
new rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 4+7*n47

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n52
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-2*INCREASE^post3 >= 0), cost: 4+7*n52
new rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n52

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n55
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-2*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n55 >= 0), cost: 4+7*n55
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-2*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n55 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n55

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n58
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1+n58 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0), cost: 4+7*n58
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1+n58 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0)), cost: 1+7*n58

Applied merging
first rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+8*n28
new rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7

Applied merging
first rule:
l4 -> [8] : ((-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n5 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ 1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+3*n5
second rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n13
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ 1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n5 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+3*n5

Applied merging
first rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n15
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+6*n17
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n15

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n19
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n21
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n19

Applied merging
first rule:
l4 -> [8] : (1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n23
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n26
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n23

Applied merging
first rule:
l4 -> [8] : ((-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+8*n28
second rule:
l4 -> [8] : ((-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 4+7*n31
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0)), cost: 5+8*n28

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0)), cost: 4+7*n34
second rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-3*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n37 >= 0)), cost: 4+6*n37
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 4+7*n34

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n39
second rule:
l4 -> [8] : ((1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n41
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n39

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n43
second rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (1+j_min^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n45
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n43

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 4+7*n47
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n52)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+n52 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n52
new rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 4+7*n47

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-2*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n55 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n55
second rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1+n58 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0)), cost: 1+7*n58
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1+n58 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-2*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n55 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n55

Applied merging
first rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7
second rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n9 >= 0 /\ 1+MAX^0-(-1+n9)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+n13 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n13)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n5)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n5 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+3*n5
new rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n15
second rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n19
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n15

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n26 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1-(-1+n26)*INCREASE^post3+MAX^0-MIN^0-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n23
second rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0)), cost: 5+8*n28
new rule:
l4 -> [8] : ((1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n23

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 4+7*n34
second rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n39
new rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 4+7*n34

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n47 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n47)*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n45)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n45 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 5+7*n43
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 4+7*n47
new rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n43

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1+n58 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+n58 >= 0 /\ 1+MAX^0-MIN^0-(-1+n58)*INCREASE^post3-INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-2*INCREASE^post3 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ -1+n55 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n55 >= 0 /\ 1+MAX^0-(-1+n55)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n55
second rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+4*n7
new rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n55

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n17)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n17 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n19)-INCREASE^post3 >= 0 /\ -1+n19 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1+n21 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-(-1+n21)*INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n15
second rule:
l4 -> [8] : ((1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n23
new rule:
l4 -> [8] : ((1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0) \/ (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n15

Applied merging
first rule:
l4 -> [8] : ((-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n39)-INCREASE^post3 >= 0 /\ -1+n39 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-2*(-1+n37)*INCREASE^post3-2*INCREASE^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n37 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1+n34 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1-(-1+n34)*INCREASE^post3+MAX^0-MIN^0-2*INCREASE^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3*(-1+n43)-INCREASE^post3 >= 0 /\ -1+n43 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n41 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0-(-1+n41)*INCREASE^post3-INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 4+7*n34
second rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 5+7*n43
new rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 4+7*n34

Applied merging
first rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n55
second rule:
l4 -> [8] : ((1+MAX^0-MIN^0-INCREASE^post3*(-1+n23)-INCREASE^post3 >= 0 /\ -1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post3 >= 0 /\ -1+j_min^post3 >= 0 /\ -1+n23 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-MAX^0+MIN^0 <= 0 /\ -1+j_min^post3 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ 1+MAX^0-INCREASE^post3 <= 0 /\ 1+MAX^0-MIN^0-2*INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+n31 >= 0) \/ (-1-MAX^0+INCREASE^post3 >= 0 /\ 1+MAX^0-MIN^0-INCREASE^post3-INCREASE^post3*(-1+n31) >= 0 /\ -1+j_min^post3 >= 0 /\ -2+pid^0-j_min^post3 >= 0 /\ -1+n31 >= 0 /\ -2-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0) \/ (-1-j_min^0+pid^0 >= 0 /\ -1-MAX^0+INCREASE^post3 >= 0 /\ -1+j_min^post1-j_min^post3 >= 0 /\ -1+n15 >= 0 /\ -1+j_min^post3 >= 0 /\ 1+MAX^0-(-1+n15)*INCREASE^post3-MIN^0-INCREASE^post3 >= 0 /\ -1+pid^0-j_min^post1 >= 0 /\ 1+MAX^0-MIN^0 >= 0)), cost: 1+7*n15
new rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n55

Applied merging
first rule:
l4 -> [8] : (-1+INCREASE^post5 >= 0 /\ 1+j_min^0-pid^0 <= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 4+7*n34
second rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 1+7*n55
new rule:
l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 4+7*n34

Merged rules
Start location: l6
 188: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, P^0'=0, num^0'=1+MAX^0, Q^0'=0, (2+MAX^0-MIN^0 <= 0 \/ -j_min^0+pid^0 <= 0), cost: 2
 189: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6
 190: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6
 238: l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
 281: l4 -> [8] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: 4+7*n34
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Applied pruning (of leafs and parallel rules):
Start location: l6
 188: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, P^0'=0, num^0'=1+MAX^0, Q^0'=0, (2+MAX^0-MIN^0 <= 0 \/ -j_min^0+pid^0 <= 0), cost: 2
 189: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6
 190: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6
 238: l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Applied nonterm
Original rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, P^0'=0, num^0'=1+MAX^0, Q^0'=0, (2+MAX^0-MIN^0 <= 0 \/ -j_min^0+pid^0 <= 0), cost: 2
New rule:
l4 -> [9] : j_min^0-pid^0 >= 0, cost: NONTERM

Applied acceleration
Original rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=1+MAX^0, P^0'=0, num^0'=1+MAX^0, Q^0'=0, (2+MAX^0-MIN^0 <= 0 \/ -j_min^0+pid^0 <= 0), cost: 2
New rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=n92+MAX^0, P^0'=0, num^0'=n92+MAX^0, Q^0'=0, (-1+n92 >= 0 /\ (-1-n92-MAX^0+MIN^0 >= 0 \/ j_min^0-pid^0 >= 0)), cost: 2*n92

Applied instantiation
Original rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=n92+MAX^0, P^0'=0, num^0'=n92+MAX^0, Q^0'=0, (-1+n92 >= 0 /\ (-1-n92-MAX^0+MIN^0 >= 0 \/ j_min^0-pid^0 >= 0)), cost: 2*n92
New rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=-1+MIN^0, P^0'=0, num^0'=-1+MIN^0, Q^0'=0, (-2-MAX^0+MIN^0 >= 0 /\ (0 >= 0 \/ j_min^0-pid^0 >= 0)), cost: -2-2*MAX^0+2*MIN^0

Applied simplification
Original rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=-1+MIN^0, P^0'=0, num^0'=-1+MIN^0, Q^0'=0, (-2-MAX^0+MIN^0 >= 0 /\ (0 >= 0 \/ j_min^0-pid^0 >= 0)), cost: -2-2*MAX^0+2*MIN^0
New rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=-1+MIN^0, P^0'=0, num^0'=-1+MIN^0, Q^0'=0, -2-MAX^0+MIN^0 >= 0, cost: -2-2*MAX^0+2*MIN^0

Applied deletion
Removed the following rules: 188

Accelerated simple loops
Start location: l6
 189: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6
 190: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6
 238: l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
 282: l4 -> [9] : j_min^0-pid^0 >= 0, cost: NONTERM
 284: l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, MAX^0'=-1+MIN^0, P^0'=0, num^0'=-1+MIN^0, Q^0'=0, -2-MAX^0+MIN^0 >= 0, cost: -2-2*MAX^0+2*MIN^0
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2


Applied chaining
First rule:
l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2
Second rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6
New rule:
l6 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, conditional^0'=conditional^post1, INCREASE^0'=-j_min^post10+j_min^post1, num^0'=1+MAX^post10, Q^0'=0, (-1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ pid^post10-j_min^post1 <= 0 /\ -1+MIN^post10 >= 0 /\ 1+j_min^post10-pid^post10 <= 0), cost: 8

Applied chaining
First rule:
l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2
Second rule:
l4 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^0+INCREASE^post5, P^0'=0, conditional^0'=conditional^post1, INCREASE^0'=-j_min^0+j_min^post1, num^0'=1+MAX^0, Q^0'=0, (pid^0-j_min^post1 <= 0 /\ -1+INCREASE^post5 >= 0 /\ -1-MAX^0+MIN^0 <= 0 /\ 1+j_min^0-pid^0 <= 0), cost: 6
New rule:
l6 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^post10+INCREASE^post5, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, conditional^0'=conditional^post1, INCREASE^0'=-j_min^post10+j_min^post1, num^0'=1+MAX^post10, Q^0'=0, (-1+INCREASE^post5 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ pid^post10-j_min^post1 <= 0 /\ -1+MIN^post10 >= 0 /\ 1+j_min^post10-pid^post10 <= 0), cost: 8

Applied chaining
First rule:
l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2
Second rule:
l4 -> [9] : j_min^0-pid^0 >= 0, cost: NONTERM
New rule:
l6 -> [9] : TRUE, cost: NONTERM

Applied deletion
Removed the following rules: 189 190 282 284

Chained accelerated rules with incoming rules
Start location: l6
 238: l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
  24: l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2
 285: l6 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, conditional^0'=conditional^post1, INCREASE^0'=-j_min^post10+j_min^post1, num^0'=1+MAX^post10, Q^0'=0, (-1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ pid^post10-j_min^post1 <= 0 /\ -1+MIN^post10 >= 0 /\ 1+j_min^post10-pid^post10 <= 0), cost: 8
 286: l6 -> l4 : CRITICAL^0'=1, NONCRITICAL^0'=1, j_min^0'=j_min^post1, MAX^0'=1+MAX^post10+INCREASE^post5, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, conditional^0'=conditional^post1, INCREASE^0'=-j_min^post10+j_min^post1, num^0'=1+MAX^post10, Q^0'=0, (-1+INCREASE^post5 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ pid^post10-j_min^post1 <= 0 /\ -1+MIN^post10 >= 0 /\ 1+j_min^post10-pid^post10 <= 0), cost: 8
 287: l6 -> [9] : TRUE, cost: NONTERM


Eliminating location l4 by chaining:

Applied chaining
First rule:
l6 -> l4 : CRITICAL^0'=0, NONCRITICAL^0'=1, j_min^0'=j_min^post10, MAX^0'=MAX^post10, P^0'=0, pid^0'=pid^post10, MIN^0'=MIN^post10, Q^0'=0, (-1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1+MIN^post10 >= 0), cost: 2
Second rule:
l4 -> [7] : (-1-j_min^0+pid^0 >= 0 /\ 1+MAX^0-MIN^0 >= 0), cost: NONTERM
New rule:
l6 -> [7] : (1+MAX^post10-MIN^post10 >= 0 /\ -1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1-j_min^post10+pid^post10 >= 0 /\ -1+MIN^post10 >= 0), cost: NONTERM

Applied simplification
Original rule:
l6 -> [7] : (1+MAX^post10-MIN^post10 >= 0 /\ -1+pid^post10 >= 0 /\ -1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1-j_min^post10+pid^post10 >= 0 /\ -1+MIN^post10 >= 0), cost: NONTERM
New rule:
l6 -> [7] : (-1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1-j_min^post10+pid^post10 >= 0 /\ -1+MIN^post10 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 24 238 285 286

Eliminated locations on tree-shaped paths
Start location: l6
 287: l6 -> [9] : TRUE, cost: NONTERM
 288: l6 -> [7] : (-1+j_min^post10 >= 0 /\ -MAX^post10+MIN^post10 <= 0 /\ -1-j_min^post10+pid^post10 >= 0 /\ -1+MIN^post10 >= 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 287 via SMT.

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

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