details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	0.418962955475 seconds
cpu usage	0.446161185
max memory	9904128.0

stage attributes

key	value
output-size	1869
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) -> f1#(rnd1, rnd2) f2#(I0, I1) -> f2#(I0 - 1, I2) [5 <= I0 - 1 /\ I0 <= 9] f2#(I3, I4) -> f2#(I3, I5) [9 <= I3 - 1] f1#(I6, I7) -> f2#(I7, I8) [-1 <= I7 - 1 /\ 0 <= I6 - 1] R = init(x1, x2) -> f1(rnd1, rnd2) f2(I0, I1) -> f2(I0 - 1, I2) [5 <= I0 - 1 /\ I0 <= 9] f2(I3, I4) -> f2(I3, I5) [9 <= I3 - 1] f1(I6, I7) -> f2(I7, I8) [-1 <= I7 - 1 /\ 0 <= I6 - 1] The dependency graph for this problem is: 0 -> 3 1 -> 1 2 -> 2 3 -> 1, 2 Where: 0) init#(x1, x2) -> f1#(rnd1, rnd2) 1) f2#(I0, I1) -> f2#(I0 - 1, I2) [5 <= I0 - 1 /\ I0 <= 9] 2) f2#(I3, I4) -> f2#(I3, I5) [9 <= I3 - 1] 3) f1#(I6, I7) -> f2#(I7, I8) [-1 <= I7 - 1 /\ 0 <= I6 - 1] We have the following SCCs. { 2 } { 1 } DP problem for innermost termination. P = f2#(I0, I1) -> f2#(I0 - 1, I2) [5 <= I0 - 1 /\ I0 <= 9] R = init(x1, x2) -> f1(rnd1, rnd2) f2(I0, I1) -> f2(I0 - 1, I2) [5 <= I0 - 1 /\ I0 <= 9] f2(I3, I4) -> f2(I3, I5) [9 <= I3 - 1] f1(I6, I7) -> f2(I7, I8) [-1 <= I7 - 1 /\ 0 <= I6 - 1] We use the basic value criterion with the projection function NU: NU[f2#(z1,z2)] = z1 This gives the following inequalities: 5 <= I0 - 1 /\ I0 <= 9 ==> I0 >! I0 - 1 All dependency pairs are strictly oriented, so the entire dependency pair problem may be removed. DP problem for innermost termination. P = f2#(I3, I4) -> f2#(I3, I5) [9 <= I3 - 1] R = init(x1, x2) -> f1(rnd1, rnd2) f2(I0, I1) -> f2(I0 - 1, I2) [5 <= I0 - 1 /\ I0 <= 9] f2(I3, I4) -> f2(I3, I5) [9 <= I3 - 1] f1(I6, I7) -> f2(I7, I8) [-1 <= I7 - 1 /\ 0 <= I6 - 1] popout

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

job log

popout

actions

all output return to Integer Transition Systems