details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	4.39350986481 seconds
cpu usage	4.677714701
max memory	2.03776E7

stage attributes

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

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

job log

popout

actions

all output return to Integer Transition Systems