details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	2.99365 seconds
cpu usage	3.03376
user time	1.64523
system time	1.38853
max virtual memory	721592.0
max residence set size	8712.0

stage attributes

key	value
starexec-result	YES

output

YES DP problem for innermost termination. P = init#(x1, x2) -> f1#(rnd1, rnd2) f3#(I0, I1) -> f3#(I0 + 1, I1) [I0 <= I1 - 1] f3#(I2, I3) -> f2#(I3 - 1, I4) [I3 <= I2] f2#(I5, I6) -> f3#(0, I5) [0 <= I5 - 1] f1#(I7, I8) -> f2#(I9, I10) [0 <= I7 - 1 /\ -1 <= I9 - 1 /\ -1 <= I8 - 1] R = init(x1, x2) -> f1(rnd1, rnd2) f3(I0, I1) -> f3(I0 + 1, I1) [I0 <= I1 - 1] f3(I2, I3) -> f2(I3 - 1, I4) [I3 <= I2] f2(I5, I6) -> f3(0, I5) [0 <= I5 - 1] f1(I7, I8) -> f2(I9, I10) [0 <= I7 - 1 /\ -1 <= I9 - 1 /\ -1 <= I8 - 1] The dependency graph for this problem is: 0 -> 4 1 -> 1, 2 2 -> 3 3 -> 1 4 -> 3 Where: 0) init#(x1, x2) -> f1#(rnd1, rnd2) 1) f3#(I0, I1) -> f3#(I0 + 1, I1) [I0 <= I1 - 1] 2) f3#(I2, I3) -> f2#(I3 - 1, I4) [I3 <= I2] 3) f2#(I5, I6) -> f3#(0, I5) [0 <= I5 - 1] 4) f1#(I7, I8) -> f2#(I9, I10) [0 <= I7 - 1 /\ -1 <= I9 - 1 /\ -1 <= I8 - 1] We have the following SCCs. { 1, 2, 3 } DP problem for innermost termination. P = f3#(I0, I1) -> f3#(I0 + 1, I1) [I0 <= I1 - 1] f3#(I2, I3) -> f2#(I3 - 1, I4) [I3 <= I2] f2#(I5, I6) -> f3#(0, I5) [0 <= I5 - 1] R = init(x1, x2) -> f1(rnd1, rnd2) f3(I0, I1) -> f3(I0 + 1, I1) [I0 <= I1 - 1] f3(I2, I3) -> f2(I3 - 1, I4) [I3 <= I2] f2(I5, I6) -> f3(0, I5) [0 <= I5 - 1] f1(I7, I8) -> f2(I9, I10) [0 <= I7 - 1 /\ -1 <= I9 - 1 /\ -1 <= I8 - 1] We use the reverse value criterion with the projection function NU: NU[f2#(z1,z2)] = z1 - 1 + -1 * 0 NU[f3#(z1,z2)] = z2 - 1 - 1 + -1 * 0 This gives the following inequalities: I0 <= I1 - 1 ==> I1 - 1 - 1 + -1 * 0 >= I1 - 1 - 1 + -1 * 0 I3 <= I2 ==> I3 - 1 - 1 + -1 * 0 >= I3 - 1 - 1 + -1 * 0 0 <= I5 - 1 ==> I5 - 1 + -1 * 0 > I5 - 1 - 1 + -1 * 0 with I5 - 1 + -1 * 0 >= 0 We remove all the strictly oriented dependency pairs. DP problem for innermost termination. P = f3#(I0, I1) -> f3#(I0 + 1, I1) [I0 <= I1 - 1] f3#(I2, I3) -> f2#(I3 - 1, I4) [I3 <= I2] R = init(x1, x2) -> f1(rnd1, rnd2) f3(I0, I1) -> f3(I0 + 1, I1) [I0 <= I1 - 1] f3(I2, I3) -> f2(I3 - 1, I4) [I3 <= I2] f2(I5, I6) -> f3(0, I5) [0 <= I5 - 1] f1(I7, I8) -> f2(I9, I10) [0 <= I7 - 1 /\ -1 <= I9 - 1 /\ -1 <= I8 - 1] The dependency graph for this problem is: 1 -> 1, 2 2 -> Where: 1) f3#(I0, I1) -> f3#(I0 + 1, I1) [I0 <= I1 - 1] 2) f3#(I2, I3) -> f2#(I3 - 1, I4) [I3 <= I2] We have the following SCCs. { 1 } DP problem for innermost termination. P = f3#(I0, I1) -> f3#(I0 + 1, I1) [I0 <= I1 - 1] R = init(x1, x2) -> f1(rnd1, rnd2) f3(I0, I1) -> f3(I0 + 1, I1) [I0 <= I1 - 1] f3(I2, I3) -> f2(I3 - 1, I4) [I3 <= I2] f2(I5, I6) -> f3(0, I5) [0 <= I5 - 1] f1(I7, I8) -> f2(I9, I10) [0 <= I7 - 1 /\ -1 <= I9 - 1 /\ -1 <= I8 - 1] We use the reverse value criterion with the projection function NU: NU[f3#(z1,z2)] = z2 - 1 + -1 * z1 This gives the following inequalities: I0 <= I1 - 1 ==> I1 - 1 + -1 * I0 > I1 - 1 + -1 * (I0 + 1) with I1 - 1 + -1 * I0 >= 0 All dependency pairs are strictly oriented, so the entire dependency pair problem may be removed. popout

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

job log

popout

actions

all output return to ITS