details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.018765 seconds
cpu usage	0.013242
user time	0.002926
system time	0.010316
max virtual memory	0.0
max residence set size	3008.0

stage attributes

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

output

WORST_CASE(Omega(0),?) Initial ITS Start location: l2 0: l0 -> l1 : a^0'=a^post0, (1+a^post0 == 0 /\ -1+a^10 == 0), cost: 1 1: l2 -> l0 : a^0'=a^post1, a^0-a^post1 == 0, cost: 1 Removed unreachable rules and leafs Start location: l2 <empty> Computing asymptotic complexity Proved the following lower bound Complexity: Unknown Cpx degree: ? Solved cost: 0 Rule cost: 0 popout

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

job log

popout

actions

all output return to ITS