details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	0.503479957581 seconds
cpu usage	0.518932393
max memory	1.0784768E7

stage attributes

key	value
output-size	1136
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_Transition /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE DP problem for innermost termination. P = f4#(x1) -> f3#(x1) f3#(I0) -> f1#(I0) f2#(I1) -> f1#(-1 + I1) f2#(I2) -> f1#(rnd1) [rnd1 = rnd1] f1#(I3) -> f2#(I3) [1 <= I3] R = f4(x1) -> f3(x1) f3(I0) -> f1(I0) f2(I1) -> f1(-1 + I1) f2(I2) -> f1(rnd1) [rnd1 = rnd1] f1(I3) -> f2(I3) [1 <= I3] The dependency graph for this problem is: 0 -> 1 1 -> 4 2 -> 4 3 -> 4 4 -> 2, 3 Where: 0) f4#(x1) -> f3#(x1) 1) f3#(I0) -> f1#(I0) 2) f2#(I1) -> f1#(-1 + I1) 3) f2#(I2) -> f1#(rnd1) [rnd1 = rnd1] 4) f1#(I3) -> f2#(I3) [1 <= I3] We have the following SCCs. { 2, 3, 4 } DP problem for innermost termination. P = f2#(I1) -> f1#(-1 + I1) f2#(I2) -> f1#(rnd1) [rnd1 = rnd1] f1#(I3) -> f2#(I3) [1 <= I3] R = f4(x1) -> f3(x1) f3(I0) -> f1(I0) f2(I1) -> f1(-1 + I1) f2(I2) -> f1(rnd1) [rnd1 = rnd1] f1(I3) -> f2(I3) [1 <= I3] popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634