details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.174674034119 seconds
cpu usage	0.106052595
max memory	2.2892544E7

stage attributes

key	value
output-size	6112
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: l4 0: l0 -> l1 : rt_11^0'=rt_11^post0, x_13^0'=x_13^post0, st_14^0'=st_14^post0, y_15^0'=y_15^post0, (-y_15^post0+y_15^0 == 0 /\ st_14^0-st_14^post0 == 0 /\ rt_11^0-rt_11^post0 == 0 /\ x_13^0-x_13^post0 == 0), cost: 1 1: l1 -> l2 : rt_11^0'=rt_11^post1, x_13^0'=x_13^post1, st_14^0'=st_14^post1, y_15^0'=y_15^post1, (-st_14^post1+st_14^0 == 0 /\ x_13^0 <= 0 /\ -st_14^0+rt_11^post1 == 0 /\ -x_13^post1+x_13^0 == 0 /\ -y_15^post1+y_15^0 == 0), cost: 1 2: l1 -> l3 : rt_11^0'=rt_11^post2, x_13^0'=x_13^post2, st_14^0'=st_14^post2, y_15^0'=y_15^post2, (1-x_13^0 <= 0 /\ -st_14^post2+st_14^0 == 0 /\ 1+y_15^post2-y_15^0 == 0 /\ -x_13^0+x_13^post2-y_15^0 == 0 /\ rt_11^0-rt_11^post2 == 0), cost: 1 3: l3 -> l1 : rt_11^0'=rt_11^post3, x_13^0'=x_13^post3, st_14^0'=st_14^post3, y_15^0'=y_15^post3, (rt_11^0-rt_11^post3 == 0 /\ x_13^0-x_13^post3 == 0 /\ st_14^0-st_14^post3 == 0 /\ -y_15^post3+y_15^0 == 0), cost: 1 4: l4 -> l0 : rt_11^0'=rt_11^post4, x_13^0'=x_13^post4, st_14^0'=st_14^post4, y_15^0'=y_15^post4, (rt_11^0-rt_11^post4 == 0 /\ -y_15^post4+y_15^0 == 0 /\ -st_14^post4+st_14^0 == 0 /\ -x_13^post4+x_13^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l4 0: l0 -> l1 : rt_11^0'=rt_11^post0, x_13^0'=x_13^post0, st_14^0'=st_14^post0, y_15^0'=y_15^post0, (-y_15^post0+y_15^0 == 0 /\ st_14^0-st_14^post0 == 0 /\ rt_11^0-rt_11^post0 == 0 /\ x_13^0-x_13^post0 == 0), cost: 1 2: l1 -> l3 : rt_11^0'=rt_11^post2, x_13^0'=x_13^post2, st_14^0'=st_14^post2, y_15^0'=y_15^post2, (1-x_13^0 <= 0 /\ -st_14^post2+st_14^0 == 0 /\ 1+y_15^post2-y_15^0 == 0 /\ -x_13^0+x_13^post2-y_15^0 == 0 /\ rt_11^0-rt_11^post2 == 0), cost: 1 3: l3 -> l1 : rt_11^0'=rt_11^post3, x_13^0'=x_13^post3, st_14^0'=st_14^post3, y_15^0'=y_15^post3, (rt_11^0-rt_11^post3 == 0 /\ x_13^0-x_13^post3 == 0 /\ st_14^0-st_14^post3 == 0 /\ -y_15^post3+y_15^0 == 0), cost: 1 4: l4 -> l0 : rt_11^0'=rt_11^post4, x_13^0'=x_13^post4, st_14^0'=st_14^post4, y_15^0'=y_15^post4, (rt_11^0-rt_11^post4 == 0 /\ -y_15^post4+y_15^0 == 0 /\ -st_14^post4+st_14^0 == 0 /\ -x_13^post4+x_13^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : rt_11^0'=rt_11^post0, x_13^0'=x_13^post0, st_14^0'=st_14^post0, y_15^0'=y_15^post0, (-y_15^post0+y_15^0 == 0 /\ st_14^0-st_14^post0 == 0 /\ rt_11^0-rt_11^post0 == 0 /\ x_13^0-x_13^post0 == 0), cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l3 : rt_11^0'=rt_11^post2, x_13^0'=x_13^post2, st_14^0'=st_14^post2, y_15^0'=y_15^post2, (1-x_13^0 <= 0 /\ -st_14^post2+st_14^0 == 0 /\ 1+y_15^post2-y_15^0 == 0 /\ -x_13^0+x_13^post2-y_15^0 == 0 /\ rt_11^0-rt_11^post2 == 0), cost: 1 New rule: l1 -> l3 : x_13^0'=x_13^0+y_15^0, y_15^0'=-1+y_15^0, -1+x_13^0 >= 0, cost: 1 Applied preprocessing Original rule: l3 -> l1 : rt_11^0'=rt_11^post3, x_13^0'=x_13^post3, st_14^0'=st_14^post3, y_15^0'=y_15^post3, (rt_11^0-rt_11^post3 == 0 /\ x_13^0-x_13^post3 == 0 /\ st_14^0-st_14^post3 == 0 /\ -y_15^post3+y_15^0 == 0), cost: 1 New rule: l3 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l0 : rt_11^0'=rt_11^post4, x_13^0'=x_13^post4, st_14^0'=st_14^post4, y_15^0'=y_15^post4, (rt_11^0-rt_11^post4 == 0 /\ -y_15^post4+y_15^0 == 0 /\ -st_14^post4+st_14^0 == 0 /\ -x_13^post4+x_13^0 == 0), cost: 1 New rule: l4 -> l0 : TRUE, cost: 1 Simplified rules Start location: l4 5: l0 -> l1 : TRUE, cost: 1 6: l1 -> l3 : x_13^0'=x_13^0+y_15^0, y_15^0'=-1+y_15^0, -1+x_13^0 >= 0, cost: 1 7: l3 -> l1 : TRUE, cost: 1 8: l4 -> l0 : TRUE, cost: 1 Eliminating location l0 by chaining: Applied chaining First rule: l4 -> l0 : TRUE, cost: 1 Second rule: l0 -> l1 : TRUE, cost: 1 New rule: l4 -> l1 : TRUE, cost: 2 Applied deletion Removed the following rules: 5 8 Eliminating location l3 by chaining: Applied chaining First rule: l1 -> l3 : x_13^0'=x_13^0+y_15^0, y_15^0'=-1+y_15^0, -1+x_13^0 >= 0, cost: 1 Second rule: l3 -> l1 : TRUE, cost: 1 New rule: l1 -> l1 : x_13^0'=x_13^0+y_15^0, y_15^0'=-1+y_15^0, -1+x_13^0 >= 0, cost: 2 Applied deletion Removed the following rules: 6 7 Eliminated locations on linear paths Start location: l4 10: l1 -> l1 : x_13^0'=x_13^0+y_15^0, y_15^0'=-1+y_15^0, -1+x_13^0 >= 0, cost: 2 9: l4 -> l1 : TRUE, cost: 2 Applied acceleration Original rule: l1 -> l1 : x_13^0'=x_13^0+y_15^0, y_15^0'=-1+y_15^0, -1+x_13^0 >= 0, cost: 2 New rule: l1 -> l1 : x_13^0'=-1/2*n0^2+x_13^0+1/2*n0+n0*y_15^0, y_15^0'=-n0+y_15^0, (-1+x_13^0 >= 0 /\ n0 >= 0 /\ -3/2-1/2*(-1+n0)^2+x_13^0+1/2*n0+(-1+n0)*y_15^0 >= 0), cost: 2*n0 Applied deletion Removed the following rules: 10 Accelerated simple loops Start location: l4 popout

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

job log

popout

actions

all output return to Integer Transition Systems