details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	0.0202331 seconds
cpu usage	0.01753
user time	0.01049
system time	0.00704
max virtual memory	0.0
max residence set size	5752.0

stage attributes

key	value
starexec-result	YES

output

YES DP problem for innermost termination. P = f4#(x1) -> f3#(x1) f3#(I0) -> f1#(I0) f2#(I1) -> f1#(I1) f1#(I2) -> f2#(I2) [1 + I2 <= I2] R = f4(x1) -> f3(x1) f3(I0) -> f1(I0) f2(I1) -> f1(I1) f1(I2) -> f2(I2) [1 + I2 <= I2] The dependency graph for this problem is: 0 -> 1 1 -> 2 -> 3 -> Where: 0) f4#(x1) -> f3#(x1) 1) f3#(I0) -> f1#(I0) 2) f2#(I1) -> f1#(I1) 3) f1#(I2) -> f2#(I2) [1 + I2 <= I2] We have the following SCCs. popout

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

job log

popout

actions

all output return to ITS