details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	0.0182011 seconds
cpu usage	0.018207
user time	0.011716
system time	0.006491
max virtual memory	113188.0
max residence set size	5776.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to ITS