details

property	value
status	complete
benchmark	java_Continue1.c.t2_fixed.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n154.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0769820213318 seconds
cpu usage	0.073159192
max memory	1.2582912E7

stage attributes

key	value
output-size	11356
starexec-result	WORST_CASE(Omega(0),?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: l6 0: l0 -> l1 : oldX0^0'=oldX0^post0, x0^0'=x0^post0, oldX1^0'=oldX1^post0, (0 == 0 /\ -oldX1^post0+x0^post0 == 0 /\ -x0^0+oldX0^post0 == 0), cost: 1 1: l2 -> l3 : oldX0^0'=oldX0^post1, x0^0'=x0^post1, oldX1^0'=oldX1^post1, (-1-oldX0^post1+x0^post1 == 0 /\ oldX1^0-oldX1^post1 == 0 /\ -x0^0+oldX0^post1 == 0), cost: 1 2: l3 -> l0 : oldX0^0'=oldX0^post2, x0^0'=x0^post2, oldX1^0'=oldX1^post2, (oldX0^post2-x0^0 == 0 /\ -oldX0^post2+x0^post2 == 0 /\ 20-oldX0^post2 <= 0 /\ oldX1^0-oldX1^post2 == 0), cost: 1 3: l3 -> l2 : oldX0^0'=oldX0^post3, x0^0'=x0^post3, oldX1^0'=oldX1^post3, (oldX1^0-oldX1^post3 == 0 /\ -oldX0^post3+x0^post3 == 0 /\ -19+oldX0^post3 <= 0 /\ oldX0^post3-x0^0 == 0), cost: 1 4: l4 -> l3 : oldX0^0'=oldX0^post4, x0^0'=x0^post4, oldX1^0'=oldX1^post4, (x0^post4 == 0 /\ oldX0^post4-x0^0 == 0 /\ oldX1^0-oldX1^post4 == 0), cost: 1 5: l5 -> l4 : oldX0^0'=oldX0^post5, x0^0'=x0^post5, oldX1^0'=oldX1^post5, (0 == 0 /\ oldX0^post5-x0^0 == 0 /\ x0^post5-oldX1^post5 == 0), cost: 1 6: l5 -> l1 : oldX0^0'=oldX0^post6, x0^0'=x0^post6, oldX1^0'=oldX1^post6, (oldX1^0-oldX1^post6 == 0 /\ oldX0^0-oldX0^post6 == 0 /\ x0^0-x0^post6 == 0), cost: 1 7: l5 -> l0 : oldX0^0'=oldX0^post7, x0^0'=x0^post7, oldX1^0'=oldX1^post7, (x0^0-x0^post7 == 0 /\ oldX1^0-oldX1^post7 == 0 /\ oldX0^0-oldX0^post7 == 0), cost: 1 8: l5 -> l2 : oldX0^0'=oldX0^post8, x0^0'=x0^post8, oldX1^0'=oldX1^post8, (oldX0^0-oldX0^post8 == 0 /\ x0^0-x0^post8 == 0 /\ oldX1^0-oldX1^post8 == 0), cost: 1 9: l5 -> l3 : oldX0^0'=oldX0^post9, x0^0'=x0^post9, oldX1^0'=oldX1^post9, (oldX0^0-oldX0^post9 == 0 /\ x0^0-x0^post9 == 0 /\ -oldX1^post9+oldX1^0 == 0), cost: 1 10: l5 -> l4 : oldX0^0'=oldX0^post10, x0^0'=x0^post10, oldX1^0'=oldX1^post10, (-x0^post10+x0^0 == 0 /\ oldX0^0-oldX0^post10 == 0 /\ -oldX1^post10+oldX1^0 == 0), cost: 1 11: l6 -> l5 : oldX0^0'=oldX0^post11, x0^0'=x0^post11, oldX1^0'=oldX1^post11, (-x0^post11+x0^0 == 0 /\ -oldX1^post11+oldX1^0 == 0 /\ oldX0^0-oldX0^post11 == 0), cost: 1 Removed unreachable rules and leafs Start location: l6 1: l2 -> l3 : oldX0^0'=oldX0^post1, x0^0'=x0^post1, oldX1^0'=oldX1^post1, (-1-oldX0^post1+x0^post1 == 0 /\ oldX1^0-oldX1^post1 == 0 /\ -x0^0+oldX0^post1 == 0), cost: 1 3: l3 -> l2 : oldX0^0'=oldX0^post3, x0^0'=x0^post3, oldX1^0'=oldX1^post3, (oldX1^0-oldX1^post3 == 0 /\ -oldX0^post3+x0^post3 == 0 /\ -19+oldX0^post3 <= 0 /\ oldX0^post3-x0^0 == 0), cost: 1 4: l4 -> l3 : oldX0^0'=oldX0^post4, x0^0'=x0^post4, oldX1^0'=oldX1^post4, (x0^post4 == 0 /\ oldX0^post4-x0^0 == 0 /\ oldX1^0-oldX1^post4 == 0), cost: 1 5: l5 -> l4 : oldX0^0'=oldX0^post5, x0^0'=x0^post5, oldX1^0'=oldX1^post5, (0 == 0 /\ oldX0^post5-x0^0 == 0 /\ x0^post5-oldX1^post5 == 0), cost: 1 8: l5 -> l2 : oldX0^0'=oldX0^post8, x0^0'=x0^post8, oldX1^0'=oldX1^post8, (oldX0^0-oldX0^post8 == 0 /\ x0^0-x0^post8 == 0 /\ oldX1^0-oldX1^post8 == 0), cost: 1 9: l5 -> l3 : oldX0^0'=oldX0^post9, x0^0'=x0^post9, oldX1^0'=oldX1^post9, (oldX0^0-oldX0^post9 == 0 /\ x0^0-x0^post9 == 0 /\ -oldX1^post9+oldX1^0 == 0), cost: 1 10: l5 -> l4 : oldX0^0'=oldX0^post10, x0^0'=x0^post10, oldX1^0'=oldX1^post10, (-x0^post10+x0^0 == 0 /\ oldX0^0-oldX0^post10 == 0 /\ -oldX1^post10+oldX1^0 == 0), cost: 1 11: l6 -> l5 : oldX0^0'=oldX0^post11, x0^0'=x0^post11, oldX1^0'=oldX1^post11, (-x0^post11+x0^0 == 0 /\ -oldX1^post11+oldX1^0 == 0 /\ oldX0^0-oldX0^post11 == 0), cost: 1 Applied preprocessing Original rule: l2 -> l3 : oldX0^0'=oldX0^post1, x0^0'=x0^post1, oldX1^0'=oldX1^post1, (-1-oldX0^post1+x0^post1 == 0 /\ oldX1^0-oldX1^post1 == 0 /\ -x0^0+oldX0^post1 == 0), cost: 1 New rule: l2 -> l3 : oldX0^0'=x0^0, x0^0'=1+x0^0, TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l2 : oldX0^0'=oldX0^post3, x0^0'=x0^post3, oldX1^0'=oldX1^post3, (oldX1^0-oldX1^post3 == 0 /\ -oldX0^post3+x0^post3 == 0 /\ -19+oldX0^post3 <= 0 /\ oldX0^post3-x0^0 == 0), cost: 1 New rule: l3 -> l2 : oldX0^0'=x0^0, -19+x0^0 <= 0, cost: 1 Applied preprocessing Original rule: l4 -> l3 : oldX0^0'=oldX0^post4, x0^0'=x0^post4, oldX1^0'=oldX1^post4, (x0^post4 == 0 /\ oldX0^post4-x0^0 == 0 /\ oldX1^0-oldX1^post4 == 0), cost: 1 New rule: l4 -> l3 : oldX0^0'=x0^0, x0^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l4 : oldX0^0'=oldX0^post5, x0^0'=x0^post5, oldX1^0'=oldX1^post5, (0 == 0 /\ oldX0^post5-x0^0 == 0 /\ x0^post5-oldX1^post5 == 0), cost: 1 New rule: l5 -> l4 : oldX0^0'=x0^0, x0^0'=oldX1^post5, oldX1^0'=oldX1^post5, 0 == 0, cost: 1 Applied preprocessing Original rule: l5 -> l2 : oldX0^0'=oldX0^post8, x0^0'=x0^post8, oldX1^0'=oldX1^post8, (oldX0^0-oldX0^post8 == 0 /\ x0^0-x0^post8 == 0 /\ oldX1^0-oldX1^post8 == 0), cost: 1 New rule: l5 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l3 : oldX0^0'=oldX0^post9, x0^0'=x0^post9, oldX1^0'=oldX1^post9, (oldX0^0-oldX0^post9 == 0 /\ x0^0-x0^post9 == 0 /\ -oldX1^post9+oldX1^0 == 0), cost: 1 New rule: l5 -> l3 : TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l4 : oldX0^0'=oldX0^post10, x0^0'=x0^post10, oldX1^0'=oldX1^post10, (-x0^post10+x0^0 == 0 /\ oldX0^0-oldX0^post10 == 0 /\ -oldX1^post10+oldX1^0 == 0), cost: 1 New rule: l5 -> l4 : TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l5 : oldX0^0'=oldX0^post11, x0^0'=x0^post11, oldX1^0'=oldX1^post11, (-x0^post11+x0^0 == 0 /\ -oldX1^post11+oldX1^0 == 0 /\ oldX0^0-oldX0^post11 == 0), cost: 1 New rule: l6 -> l5 : TRUE, cost: 1 Simplified rules Start location: l6 12: l2 -> l3 : oldX0^0'=x0^0, x0^0'=1+x0^0, TRUE, cost: 1 13: l3 -> l2 : oldX0^0'=x0^0, -19+x0^0 <= 0, cost: 1 14: l4 -> l3 : oldX0^0'=x0^0, x0^0'=0, TRUE, cost: 1 15: l5 -> l4 : oldX0^0'=x0^0, x0^0'=oldX1^post5, oldX1^0'=oldX1^post5, 0 == 0, cost: 1 16: l5 -> l2 : TRUE, cost: 1 17: l5 -> l3 : TRUE, cost: 1 18: l5 -> l4 : TRUE, cost: 1 19: l6 -> l5 : TRUE, cost: 1 Eliminating location l5 by chaining: Applied chaining First rule: popout

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

job log

popout

actions

all output return to Integer Transition Systems