details

property	value
status	complete
benchmark	n-15a.t2_fixed.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n144.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.227101 seconds
cpu usage	0.231429
user time	0.201205
system time	0.030224
max virtual memory	113188.0
max residence set size	19256.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: l9 0: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1 1: l1 -> l3 : Result_4^0'=Result_4^post1, x_5^0'=x_5^post1, (1+x_5^post1-x_5^0 == 0 /\ Result_4^0-Result_4^post1 == 0), cost: 1 6: l1 -> l6 : Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (1+x_5^post6-x_5^0 == 0 /\ Result_4^0-Result_4^post6 == 0), cost: 1 10: l1 -> l8 : Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (0 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ -13+x_5^10 <= 0 /\ 1-x_5^0+x_5^10 == 0 /\ -x_5^post10 <= 0 /\ 13-x_5^10 <= 0), cost: 1 12: l1 -> l5 : Result_4^0'=Result_4^post12, x_5^0'=x_5^post12, (0 == 0 /\ -13+x_5^11 <= 0 /\ 1+x_5^11-x_5^0 == 0 /\ 13-x_5^11 <= 0 /\ 1+x_5^post12 <= 0), cost: 1 2: l3 -> l4 : Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (-12+x_5^0 <= 0 /\ -x_5^post2+x_5^0 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1 3: l3 -> l4 : Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (Result_4^0-Result_4^post3 == 0 /\ 14-x_5^0 <= 0 /\ x_5^0-x_5^post3 == 0), cost: 1 4: l4 -> l2 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (Result_4^0-Result_4^post4 == 0 /\ -x_5^0 <= 0 /\ -x_5^post4+x_5^0 == 0), cost: 1 5: l2 -> l1 : Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (x_5^0-x_5^post5 == 0 /\ Result_4^0-Result_4^post5 == 0), cost: 1 7: l6 -> l7 : Result_4^0'=Result_4^post7, x_5^0'=x_5^post7, (-12+x_5^0 <= 0 /\ Result_4^0-Result_4^post7 == 0 /\ -x_5^post7+x_5^0 == 0), cost: 1 8: l6 -> l7 : Result_4^0'=Result_4^post8, x_5^0'=x_5^post8, (Result_4^0-Result_4^post8 == 0 /\ 14-x_5^0 <= 0 /\ x_5^0-x_5^post8 == 0), cost: 1 9: l7 -> l5 : Result_4^0'=Result_4^post9, x_5^0'=x_5^post9, (0 == 0 /\ 1+x_5^0 <= 0 /\ -x_5^post9+x_5^0 == 0), cost: 1 11: l8 -> l1 : Result_4^0'=Result_4^post11, x_5^0'=x_5^post11, (Result_4^0-Result_4^post11 == 0 /\ x_5^0-x_5^post11 == 0), cost: 1 13: l9 -> l0 : Result_4^0'=Result_4^post13, x_5^0'=x_5^post13, (Result_4^0-Result_4^post13 == 0 /\ -x_5^post13+x_5^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l9 0: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1 1: l1 -> l3 : Result_4^0'=Result_4^post1, x_5^0'=x_5^post1, (1+x_5^post1-x_5^0 == 0 /\ Result_4^0-Result_4^post1 == 0), cost: 1 10: l1 -> l8 : Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (0 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ -13+x_5^10 <= 0 /\ 1-x_5^0+x_5^10 == 0 /\ -x_5^post10 <= 0 /\ 13-x_5^10 <= 0), cost: 1 2: l3 -> l4 : Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (-12+x_5^0 <= 0 /\ -x_5^post2+x_5^0 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1 3: l3 -> l4 : Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (Result_4^0-Result_4^post3 == 0 /\ 14-x_5^0 <= 0 /\ x_5^0-x_5^post3 == 0), cost: 1 4: l4 -> l2 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (Result_4^0-Result_4^post4 == 0 /\ -x_5^0 <= 0 /\ -x_5^post4+x_5^0 == 0), cost: 1 5: l2 -> l1 : Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (x_5^0-x_5^post5 == 0 /\ Result_4^0-Result_4^post5 == 0), cost: 1 11: l8 -> l1 : Result_4^0'=Result_4^post11, x_5^0'=x_5^post11, (Result_4^0-Result_4^post11 == 0 /\ x_5^0-x_5^post11 == 0), cost: 1 13: l9 -> l0 : Result_4^0'=Result_4^post13, x_5^0'=x_5^post13, (Result_4^0-Result_4^post13 == 0 /\ -x_5^post13+x_5^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l3 : Result_4^0'=Result_4^post1, x_5^0'=x_5^post1, (1+x_5^post1-x_5^0 == 0 /\ Result_4^0-Result_4^post1 == 0), cost: 1 New rule: l1 -> l3 : x_5^0'=-1+x_5^0, TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l4 : Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (-12+x_5^0 <= 0 /\ -x_5^post2+x_5^0 == 0 /\ Result_4^0-Result_4^post2 == 0), cost: 1 New rule: l3 -> l4 : -12+x_5^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l4 : Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (Result_4^0-Result_4^post3 == 0 /\ 14-x_5^0 <= 0 /\ x_5^0-x_5^post3 == 0), cost: 1 New rule: l3 -> l4 : -14+x_5^0 >= 0, cost: 1 Applied preprocessing Original rule: l4 -> l2 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (Result_4^0-Result_4^post4 == 0 /\ -x_5^0 <= 0 /\ -x_5^post4+x_5^0 == 0), cost: 1 New rule: l4 -> l2 : x_5^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l1 : Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (x_5^0-x_5^post5 == 0 /\ Result_4^0-Result_4^post5 == 0), cost: 1 New rule: l2 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l8 : Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (0 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ -13+x_5^10 <= 0 /\ 1-x_5^0+x_5^10 == 0 /\ -x_5^post10 <= 0 /\ 13-x_5^10 <= 0), cost: 1 New rule: l1 -> l8 : x_5^0'=x_5^post10, (x_5^post10 >= 0 /\ -14+x_5^0 == 0), cost: 1 Applied preprocessing Original rule: l8 -> l1 : Result_4^0'=Result_4^post11, x_5^0'=x_5^post11, (Result_4^0-Result_4^post11 == 0 /\ x_5^0-x_5^post11 == 0), cost: 1 New rule: l8 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l9 -> l0 : Result_4^0'=Result_4^post13, x_5^0'=x_5^post13, (Result_4^0-Result_4^post13 == 0 /\ -x_5^post13+x_5^0 == 0), cost: 1 New rule: l9 -> l0 : TRUE, cost: 1 Simplified rules Start location: l9 14: l0 -> l1 : TRUE, cost: 1 15: l1 -> l3 : x_5^0'=-1+x_5^0, TRUE, cost: 1 20: l1 -> l8 : x_5^0'=x_5^post10, (x_5^post10 >= 0 /\ -14+x_5^0 == 0), cost: 1 16: l3 -> l4 : -12+x_5^0 <= 0, cost: 1 17: l3 -> l4 : -14+x_5^0 >= 0, cost: 1 18: l4 -> l2 : x_5^0 >= 0, cost: 1 19: l2 -> l1 : TRUE, cost: 1 21: l8 -> l1 : TRUE, cost: 1 22: l9 -> l0 : TRUE, cost: 1 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to ITS