details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.026936 seconds
cpu usage	0.027492
user time	0.020424
system time	0.007068
max virtual memory	113188.0
max residence set size	7192.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: l3 0: l0 -> l1 : p^0'=p^post0, p^0-p^post0 == 0, cost: 1 1: l1 -> l0 : p^0'=p^post1, p^0-p^post1 == 0, cost: 1 2: l2 -> l0 : p^0'=p^post2, (p^10 == 0 /\ -1+p^20 == 0 /\ p^post2 == 0), cost: 1 3: l3 -> l2 : p^0'=p^post3, p^0-p^post3 == 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : p^0'=p^post0, p^0-p^post0 == 0, cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l0 : p^0'=p^post1, p^0-p^post1 == 0, cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : p^0'=p^post2, (p^10 == 0 /\ -1+p^20 == 0 /\ p^post2 == 0), cost: 1 New rule: l2 -> l0 : p^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l2 : p^0'=p^post3, p^0-p^post3 == 0, cost: 1 New rule: l3 -> l2 : TRUE, cost: 1 Simplified rules Start location: l3 4: l0 -> l1 : TRUE, cost: 1 5: l1 -> l0 : TRUE, cost: 1 6: l2 -> l0 : p^0'=0, TRUE, cost: 1 7: l3 -> l2 : TRUE, cost: 1 Eliminating location l2 by chaining: Applied chaining First rule: l3 -> l2 : TRUE, cost: 1 Second rule: l2 -> l0 : p^0'=0, TRUE, cost: 1 New rule: l3 -> l0 : p^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 6 7 Eliminating location l1 by chaining: Applied chaining First rule: l0 -> l1 : TRUE, cost: 1 Second rule: l1 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : TRUE, cost: 2 Applied deletion Removed the following rules: 4 5 Eliminated locations on linear paths Start location: l3 9: l0 -> l0 : TRUE, cost: 2 8: l3 -> l0 : p^0'=0, TRUE, cost: 2 Applied nonterm Original rule: l0 -> l0 : TRUE, cost: 2 New rule: l0 -> [4] : TRUE, cost: NONTERM Applied acceleration Original rule: l0 -> l0 : TRUE, cost: 2 New rule: l0 -> l0 : TRUE, cost: 2*n0 Applied deletion Removed the following rules: 9 Accelerated simple loops Start location: l3 10: l0 -> [4] : TRUE, cost: NONTERM 11: l0 -> l0 : TRUE, cost: 2*n0 8: l3 -> l0 : p^0'=0, TRUE, cost: 2 Applied chaining First rule: l3 -> l0 : p^0'=0, TRUE, cost: 2 Second rule: popout

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

job log

popout

actions

all output return to ITS