details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	0.833183050156 seconds
cpu usage	0.888886394
max memory	1.1767808E7

stage attributes

key	value
output-size	1098
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_Transition /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE 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) [1 <= I4] 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) [1 <= I4] The dependency graph for this problem is: 0 -> 1 1 -> 3 2 -> 3 3 -> 2 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) [1 <= I4] We have the following SCCs. { 2, 3 } DP problem for innermost termination. P = f2#(I2, I3) -> f1#(I2, I3) f1#(I4, I5) -> f2#(I4 - I5, 1 + I5) [1 <= I4] 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) [1 <= I4] popout

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

job log

popout

actions

all output return to Integer Transition Systems