details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	0.163672924042 seconds
cpu usage	0.145650846
max memory	8794112.0

stage attributes

key	value
output-size	1549
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_Transition /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES DP problem for innermost termination. P = f4#(x1) -> f3#(x1) f3#(I0) -> f1#(I0) [1 <= I0] f2#(I1) -> f1#(I1) f1#(I2) -> f2#(-1 + I2) [1 <= -1 + I2] R = f4(x1) -> f3(x1) f3(I0) -> f1(I0) [1 <= I0] f2(I1) -> f1(I1) f1(I2) -> f2(-1 + I2) [1 <= -1 + I2] The dependency graph for this problem is: 0 -> 1 1 -> 3 2 -> 3 3 -> 2 Where: 0) f4#(x1) -> f3#(x1) 1) f3#(I0) -> f1#(I0) [1 <= I0] 2) f2#(I1) -> f1#(I1) 3) f1#(I2) -> f2#(-1 + I2) [1 <= -1 + I2] We have the following SCCs. { 2, 3 } DP problem for innermost termination. P = f2#(I1) -> f1#(I1) f1#(I2) -> f2#(-1 + I2) [1 <= -1 + I2] R = f4(x1) -> f3(x1) f3(I0) -> f1(I0) [1 <= I0] f2(I1) -> f1(I1) f1(I2) -> f2(-1 + I2) [1 <= -1 + I2] We use the basic value criterion with the projection function NU: NU[f1#(z1)] = z1 NU[f2#(z1)] = z1 This gives the following inequalities: ==> I1 (>! \union =) I1 1 <= -1 + I2 ==> I2 >! -1 + I2 We remove all the strictly oriented dependency pairs. DP problem for innermost termination. P = f2#(I1) -> f1#(I1) R = f4(x1) -> f3(x1) f3(I0) -> f1(I0) [1 <= I0] f2(I1) -> f1(I1) f1(I2) -> f2(-1 + I2) [1 <= -1 + I2] The dependency graph for this problem is: 2 -> Where: 2) f2#(I1) -> f1#(I1) We have the following SCCs. popout

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

job log

popout

actions

all output return to Integer Transition Systems