details

property	value
status	complete
benchmark	Et3-rec.jar-obl-8.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n151.star.cs.uiowa.edu
space	From_AProVE_2014

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	0.524549007416 seconds
cpu usage	0.55735
max memory	1.0584064E7

stage attributes

key	value
output-size	2210
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 = init#(x1, x2, x3) -> f1#(rnd1, rnd2, rnd3) f2#(I0, I1, I2) -> f2#(I0 + I1, I1 - 1, I0 + I1) [I0 = I2 /\ I1 - 1 <= I1 - 1 /\ 0 <= I0 - 1] f1#(I3, I4, I5) -> f2#(I6, I7, I8) [I6 = I8 /\ 0 <= I3 - 1 /\ -1 <= I6 - 1 /\ 1 <= I4 - 1 /\ -1 <= I7 - 1] f1#(I9, I10, I11) -> f2#(I12, 0, I13) [I12 = I13 /\ 1 = I10 /\ -1 <= I12 - 1 /\ 0 <= I9 - 1] f1#(I14, I15, I16) -> f2#(0, 0, 0) [0 = I15 /\ 0 <= I14 - 1] R = init(x1, x2, x3) -> f1(rnd1, rnd2, rnd3) f2(I0, I1, I2) -> f2(I0 + I1, I1 - 1, I0 + I1) [I0 = I2 /\ I1 - 1 <= I1 - 1 /\ 0 <= I0 - 1] f1(I3, I4, I5) -> f2(I6, I7, I8) [I6 = I8 /\ 0 <= I3 - 1 /\ -1 <= I6 - 1 /\ 1 <= I4 - 1 /\ -1 <= I7 - 1] f1(I9, I10, I11) -> f2(I12, 0, I13) [I12 = I13 /\ 1 = I10 /\ -1 <= I12 - 1 /\ 0 <= I9 - 1] f1(I14, I15, I16) -> f2(0, 0, 0) [0 = I15 /\ 0 <= I14 - 1] The dependency graph for this problem is: 0 -> 2, 3, 4 1 -> 1 2 -> 1 3 -> 1 4 -> Where: 0) init#(x1, x2, x3) -> f1#(rnd1, rnd2, rnd3) 1) f2#(I0, I1, I2) -> f2#(I0 + I1, I1 - 1, I0 + I1) [I0 = I2 /\ I1 - 1 <= I1 - 1 /\ 0 <= I0 - 1] 2) f1#(I3, I4, I5) -> f2#(I6, I7, I8) [I6 = I8 /\ 0 <= I3 - 1 /\ -1 <= I6 - 1 /\ 1 <= I4 - 1 /\ -1 <= I7 - 1] 3) f1#(I9, I10, I11) -> f2#(I12, 0, I13) [I12 = I13 /\ 1 = I10 /\ -1 <= I12 - 1 /\ 0 <= I9 - 1] 4) f1#(I14, I15, I16) -> f2#(0, 0, 0) [0 = I15 /\ 0 <= I14 - 1] We have the following SCCs. { 1 } DP problem for innermost termination. P = f2#(I0, I1, I2) -> f2#(I0 + I1, I1 - 1, I0 + I1) [I0 = I2 /\ I1 - 1 <= I1 - 1 /\ 0 <= I0 - 1] R = init(x1, x2, x3) -> f1(rnd1, rnd2, rnd3) f2(I0, I1, I2) -> f2(I0 + I1, I1 - 1, I0 + I1) [I0 = I2 /\ I1 - 1 <= I1 - 1 /\ 0 <= I0 - 1] f1(I3, I4, I5) -> f2(I6, I7, I8) [I6 = I8 /\ 0 <= I3 - 1 /\ -1 <= I6 - 1 /\ 1 <= I4 - 1 /\ -1 <= I7 - 1] f1(I9, I10, I11) -> f2(I12, 0, I13) [I12 = I13 /\ 1 = I10 /\ -1 <= I12 - 1 /\ 0 <= I9 - 1] f1(I14, I15, I16) -> f2(0, 0, 0) [0 = I15 /\ 0 <= I14 - 1] popout

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

job log

popout

actions

all output return to Integer Transition Systems