details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.015675 seconds
cpu usage	0.010248
user time	0.004456
system time	0.005792
max virtual memory	0.0
max residence set size	3684.0

stage attributes

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

output

WORST_CASE(Omega(0),?) Initial ITS Start location: l3 0: l0 -> l1 : x^0'=x^post0, y^0'=y^post0, (1-x^0 <= 0 /\ -x^0+y^10 == 0 /\ y^10 <= 0 /\ -1-y^10+y^post0 == 0 /\ x^0-x^post0 == 0), cost: 1 1: l1 -> l0 : x^0'=x^post1, y^0'=y^post1, (-y^post1+y^0 == 0 /\ x^0-x^post1 == 0), cost: 1 2: l2 -> l0 : x^0'=x^post2, y^0'=y^post2, (y^0-y^post2 == 0 /\ x^0-x^post2 == 0), cost: 1 3: l3 -> l2 : x^0'=x^post3, y^0'=y^post3, (x^0-x^post3 == 0 /\ -y^post3+y^0 == 0), cost: 1 Removed rules with unsatisfiable guard Start location: l3 1: l1 -> l0 : x^0'=x^post1, y^0'=y^post1, (-y^post1+y^0 == 0 /\ x^0-x^post1 == 0), cost: 1 2: l2 -> l0 : x^0'=x^post2, y^0'=y^post2, (y^0-y^post2 == 0 /\ x^0-x^post2 == 0), cost: 1 3: l3 -> l2 : x^0'=x^post3, y^0'=y^post3, (x^0-x^post3 == 0 /\ -y^post3+y^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l3 <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