details

property	value
status	complete
benchmark	e-acqrel-fail.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n084.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0852649211884 seconds
cpu usage	0.082380546
max memory	2220032.0

stage attributes

key	value
output-size	15845
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Initial ITS Start location: l9 0: l0 -> l1 : A^0'=A^post0, dobreak^0'=dobreak^post0, R^0'=R^post0, n^0'=n^post0, (0 == 0 /\ A^post0 == 0 /\ dobreak^0 <= 0 /\ 1-n^post0 <= 0 /\ -1+A^10 == 0 /\ -R^post0+R^0 == 0 /\ dobreak^0-dobreak^post0 == 0), cost: 1 1: l0 -> l2 : A^0'=A^post1, dobreak^0'=dobreak^post1, R^0'=R^post1, n^0'=n^post1, (1-dobreak^0 <= 0 /\ A^0-A^post1 == 0 /\ -n^post1+n^0 == 0 /\ -R^post1+R^0 == 0 /\ -dobreak^post1+dobreak^0 == 0), cost: 1 3: l1 -> l4 : A^0'=A^post3, dobreak^0'=dobreak^post3, R^0'=R^post3, n^0'=n^post3, (R^0-R^post3 == 0 /\ A^0-A^post3 == 0 /\ dobreak^0-dobreak^post3 == 0 /\ -n^post3+n^0 == 0), cost: 1 5: l2 -> l7 : A^0'=A^post5, dobreak^0'=dobreak^post5, R^0'=R^post5, n^0'=n^post5, (-dobreak^post5+dobreak^0 == 0 /\ A^0-A^post5 == 0 /\ -n^post5+n^0 == 0 /\ -R^post5+R^0 == 0), cost: 1 2: l3 -> l0 : A^0'=A^post2, dobreak^0'=dobreak^post2, R^0'=R^post2, n^0'=n^post2, (A^0-A^post2 == 0 /\ -n^post2+n^0 == 0 /\ dobreak^0-dobreak^post2 == 0 /\ -R^post2+R^0 == 0), cost: 1 7: l4 -> l1 : A^0'=A^post7, dobreak^0'=dobreak^post7, R^0'=R^post7, n^0'=n^post7, (R^0-R^post7 == 0 /\ -n^post7+n^0 == 0 /\ dobreak^0-dobreak^post7 == 0 /\ A^0-A^post7 == 0 /\ 1-n^0 <= 0), cost: 1 8: l4 -> l3 : A^0'=A^post8, dobreak^0'=dobreak^post8, R^0'=R^post8, n^0'=n^post8, (0 == 0 /\ n^0-n^post8 == 0 /\ A^0-A^post8 == 0 /\ R^post8 == 0 /\ n^0 <= 0 /\ -1+R^10 == 0), cost: 1 4: l5 -> l6 : A^0'=A^post4, dobreak^0'=dobreak^post4, R^0'=R^post4, n^0'=n^post4, (-n^post4+n^0 == 0 /\ A^0-A^post4 == 0 /\ -R^post4+R^0 == 0 /\ dobreak^0-dobreak^post4 == 0), cost: 1 6: l7 -> l2 : A^0'=A^post6, dobreak^0'=dobreak^post6, R^0'=R^post6, n^0'=n^post6, (-n^post6+n^0 == 0 /\ -R^post6+R^0 == 0 /\ A^0-A^post6 == 0 /\ dobreak^0-dobreak^post6 == 0), cost: 1 9: l8 -> l3 : A^0'=A^post9, dobreak^0'=dobreak^post9, R^0'=R^post9, n^0'=n^post9, (0 == 0 /\ R^post9 == 0 /\ A^post9 == 0 /\ -n^post9+n^0 == 0), cost: 1 10: l9 -> l8 : A^0'=A^post10, dobreak^0'=dobreak^post10, R^0'=R^post10, n^0'=n^post10, (-R^post10+R^0 == 0 /\ A^0-A^post10 == 0 /\ -dobreak^post10+dobreak^0 == 0 /\ -n^post10+n^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l9 0: l0 -> l1 : A^0'=A^post0, dobreak^0'=dobreak^post0, R^0'=R^post0, n^0'=n^post0, (0 == 0 /\ A^post0 == 0 /\ dobreak^0 <= 0 /\ 1-n^post0 <= 0 /\ -1+A^10 == 0 /\ -R^post0+R^0 == 0 /\ dobreak^0-dobreak^post0 == 0), cost: 1 1: l0 -> l2 : A^0'=A^post1, dobreak^0'=dobreak^post1, R^0'=R^post1, n^0'=n^post1, (1-dobreak^0 <= 0 /\ A^0-A^post1 == 0 /\ -n^post1+n^0 == 0 /\ -R^post1+R^0 == 0 /\ -dobreak^post1+dobreak^0 == 0), cost: 1 3: l1 -> l4 : A^0'=A^post3, dobreak^0'=dobreak^post3, R^0'=R^post3, n^0'=n^post3, (R^0-R^post3 == 0 /\ A^0-A^post3 == 0 /\ dobreak^0-dobreak^post3 == 0 /\ -n^post3+n^0 == 0), cost: 1 5: l2 -> l7 : A^0'=A^post5, dobreak^0'=dobreak^post5, R^0'=R^post5, n^0'=n^post5, (-dobreak^post5+dobreak^0 == 0 /\ A^0-A^post5 == 0 /\ -n^post5+n^0 == 0 /\ -R^post5+R^0 == 0), cost: 1 2: l3 -> l0 : A^0'=A^post2, dobreak^0'=dobreak^post2, R^0'=R^post2, n^0'=n^post2, (A^0-A^post2 == 0 /\ -n^post2+n^0 == 0 /\ dobreak^0-dobreak^post2 == 0 /\ -R^post2+R^0 == 0), cost: 1 7: l4 -> l1 : A^0'=A^post7, dobreak^0'=dobreak^post7, R^0'=R^post7, n^0'=n^post7, (R^0-R^post7 == 0 /\ -n^post7+n^0 == 0 /\ dobreak^0-dobreak^post7 == 0 /\ A^0-A^post7 == 0 /\ 1-n^0 <= 0), cost: 1 8: l4 -> l3 : A^0'=A^post8, dobreak^0'=dobreak^post8, R^0'=R^post8, n^0'=n^post8, (0 == 0 /\ n^0-n^post8 == 0 /\ A^0-A^post8 == 0 /\ R^post8 == 0 /\ n^0 <= 0 /\ -1+R^10 == 0), cost: 1 6: l7 -> l2 : A^0'=A^post6, dobreak^0'=dobreak^post6, R^0'=R^post6, n^0'=n^post6, (-n^post6+n^0 == 0 /\ -R^post6+R^0 == 0 /\ A^0-A^post6 == 0 /\ dobreak^0-dobreak^post6 == 0), cost: 1 9: l8 -> l3 : A^0'=A^post9, dobreak^0'=dobreak^post9, R^0'=R^post9, n^0'=n^post9, (0 == 0 /\ R^post9 == 0 /\ A^post9 == 0 /\ -n^post9+n^0 == 0), cost: 1 10: l9 -> l8 : A^0'=A^post10, dobreak^0'=dobreak^post10, R^0'=R^post10, n^0'=n^post10, (-R^post10+R^0 == 0 /\ A^0-A^post10 == 0 /\ -dobreak^post10+dobreak^0 == 0 /\ -n^post10+n^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : A^0'=A^post0, dobreak^0'=dobreak^post0, R^0'=R^post0, n^0'=n^post0, (0 == 0 /\ A^post0 == 0 /\ dobreak^0 <= 0 /\ 1-n^post0 <= 0 /\ -1+A^10 == 0 /\ -R^post0+R^0 == 0 /\ dobreak^0-dobreak^post0 == 0), cost: 1 New rule: l0 -> l1 : A^0'=0, n^0'=n^post0, (dobreak^0 <= 0 /\ -1+n^post0 >= 0), cost: 1 Applied preprocessing Original rule: l0 -> l2 : A^0'=A^post1, dobreak^0'=dobreak^post1, R^0'=R^post1, n^0'=n^post1, (1-dobreak^0 <= 0 /\ A^0-A^post1 == 0 /\ -n^post1+n^0 == 0 /\ -R^post1+R^0 == 0 /\ -dobreak^post1+dobreak^0 == 0), cost: 1 New rule: l0 -> l2 : -1+dobreak^0 >= 0, cost: 1 Applied preprocessing Original rule: l3 -> l0 : A^0'=A^post2, dobreak^0'=dobreak^post2, R^0'=R^post2, n^0'=n^post2, (A^0-A^post2 == 0 /\ -n^post2+n^0 == 0 /\ dobreak^0-dobreak^post2 == 0 /\ -R^post2+R^0 == 0), cost: 1 New rule: l3 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l4 : A^0'=A^post3, dobreak^0'=dobreak^post3, R^0'=R^post3, n^0'=n^post3, (R^0-R^post3 == 0 /\ A^0-A^post3 == 0 /\ dobreak^0-dobreak^post3 == 0 /\ -n^post3+n^0 == 0), cost: 1 New rule: l1 -> l4 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l7 : A^0'=A^post5, dobreak^0'=dobreak^post5, R^0'=R^post5, n^0'=n^post5, (-dobreak^post5+dobreak^0 == 0 /\ A^0-A^post5 == 0 /\ -n^post5+n^0 == 0 /\ -R^post5+R^0 == 0), cost: 1 New rule: l2 -> l7 : TRUE, cost: 1 Applied preprocessing Original rule: l7 -> l2 : A^0'=A^post6, dobreak^0'=dobreak^post6, R^0'=R^post6, n^0'=n^post6, (-n^post6+n^0 == 0 /\ -R^post6+R^0 == 0 /\ A^0-A^post6 == 0 /\ dobreak^0-dobreak^post6 == 0), cost: 1 New rule: l7 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l1 : A^0'=A^post7, dobreak^0'=dobreak^post7, R^0'=R^post7, n^0'=n^post7, (R^0-R^post7 == 0 /\ -n^post7+n^0 == 0 /\ dobreak^0-dobreak^post7 == 0 /\ A^0-A^post7 == 0 /\ 1-n^0 <= 0), cost: 1 New rule: l4 -> l1 : -1+n^0 >= 0, cost: 1 Applied preprocessing Original rule: l4 -> l3 : A^0'=A^post8, dobreak^0'=dobreak^post8, R^0'=R^post8, n^0'=n^post8, (0 == 0 /\ n^0-n^post8 == 0 /\ A^0-A^post8 == 0 /\ R^post8 == 0 /\ n^0 <= 0 /\ -1+R^10 == 0), cost: 1 New rule: l4 -> l3 : dobreak^0'=dobreak^post8, R^0'=0, n^0 <= 0, cost: 1 Applied preprocessing Original rule: l8 -> l3 : A^0'=A^post9, dobreak^0'=dobreak^post9, R^0'=R^post9, n^0'=n^post9, (0 == 0 /\ R^post9 == 0 /\ A^post9 == 0 /\ -n^post9+n^0 == 0), cost: 1 New rule: l8 -> l3 : A^0'=0, dobreak^0'=dobreak^post9, R^0'=0, 0 == 0, cost: 1 Applied preprocessing Original rule: l9 -> l8 : A^0'=A^post10, dobreak^0'=dobreak^post10, R^0'=R^post10, n^0'=n^post10, (-R^post10+R^0 == 0 /\ A^0-A^post10 == 0 /\ -dobreak^post10+dobreak^0 == 0 /\ -n^post10+n^0 == 0), cost: 1 New rule: l9 -> l8 : TRUE, cost: 1 Simplified rules Start location: l9 11: l0 -> l1 : A^0'=0, n^0'=n^post0, (dobreak^0 <= 0 /\ -1+n^post0 >= 0), cost: 1 popout

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

job log

popout

actions

all output return to Integer Transition Systems