details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	2.59499597549 seconds
cpu usage	2.781648314
max memory	1.9755008E7

stage attributes

key	value
output-size	2539
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 = f6#(x1, x2, x3) -> f5#(x1, x2, x3) f5#(I0, I1, I2) -> f4#(I0, 0, I2) f4#(I3, I4, I5) -> f3#(rnd1, I4, I5) [rnd1 = rnd1 /\ 1 <= I5] f4#(I6, I7, I8) -> f2#(I6, I7, I8) [I8 <= 0] f3#(I9, I10, I11) -> f4#(I9, I10, -1 + I11) [1 <= I9] f3#(I12, I13, I14) -> f4#(I12, I13, -2 + I14) [I12 <= 0] f2#(I15, I16, I17) -> f1#(I18, I16, I17) [I18 = I18] f1#(I19, I20, I21) -> f2#(I19, 1, I21) [1 <= I19] f1#(I22, I23, I24) -> f2#(I22, 2, I24) [I22 <= 0] R = f6(x1, x2, x3) -> f5(x1, x2, x3) f5(I0, I1, I2) -> f4(I0, 0, I2) f4(I3, I4, I5) -> f3(rnd1, I4, I5) [rnd1 = rnd1 /\ 1 <= I5] f4(I6, I7, I8) -> f2(I6, I7, I8) [I8 <= 0] f3(I9, I10, I11) -> f4(I9, I10, -1 + I11) [1 <= I9] f3(I12, I13, I14) -> f4(I12, I13, -2 + I14) [I12 <= 0] f2(I15, I16, I17) -> f1(I18, I16, I17) [I18 = I18] f1(I19, I20, I21) -> f2(I19, 1, I21) [1 <= I19] f1(I22, I23, I24) -> f2(I22, 2, I24) [I22 <= 0] The dependency graph for this problem is: 0 -> 1 1 -> 2, 3 2 -> 4, 5 3 -> 6 4 -> 2, 3 5 -> 2, 3 6 -> 7, 8 7 -> 6 8 -> 6 Where: 0) f6#(x1, x2, x3) -> f5#(x1, x2, x3) 1) f5#(I0, I1, I2) -> f4#(I0, 0, I2) 2) f4#(I3, I4, I5) -> f3#(rnd1, I4, I5) [rnd1 = rnd1 /\ 1 <= I5] 3) f4#(I6, I7, I8) -> f2#(I6, I7, I8) [I8 <= 0] 4) f3#(I9, I10, I11) -> f4#(I9, I10, -1 + I11) [1 <= I9] 5) f3#(I12, I13, I14) -> f4#(I12, I13, -2 + I14) [I12 <= 0] 6) f2#(I15, I16, I17) -> f1#(I18, I16, I17) [I18 = I18] 7) f1#(I19, I20, I21) -> f2#(I19, 1, I21) [1 <= I19] 8) f1#(I22, I23, I24) -> f2#(I22, 2, I24) [I22 <= 0] We have the following SCCs. { 2, 4, 5 } { 6, 7, 8 } DP problem for innermost termination. P = f2#(I15, I16, I17) -> f1#(I18, I16, I17) [I18 = I18] f1#(I19, I20, I21) -> f2#(I19, 1, I21) [1 <= I19] f1#(I22, I23, I24) -> f2#(I22, 2, I24) [I22 <= 0] R = f6(x1, x2, x3) -> f5(x1, x2, x3) f5(I0, I1, I2) -> f4(I0, 0, I2) f4(I3, I4, I5) -> f3(rnd1, I4, I5) [rnd1 = rnd1 /\ 1 <= I5] f4(I6, I7, I8) -> f2(I6, I7, I8) [I8 <= 0] f3(I9, I10, I11) -> f4(I9, I10, -1 + I11) [1 <= I9] f3(I12, I13, I14) -> f4(I12, I13, -2 + I14) [I12 <= 0] f2(I15, I16, I17) -> f1(I18, I16, I17) [I18 = I18] f1(I19, I20, I21) -> f2(I19, 1, I21) [1 <= I19] f1(I22, I23, I24) -> f2(I22, 2, I24) [I22 <= 0] popout

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

job log

popout

actions

all output return to Integer Transition Systems