details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	10.2328579426 seconds
cpu usage	10.915378928
max memory	2.5071616E7

stage attributes

key	value
output-size	6421
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_Transition /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES DP problem for innermost termination. P = f9#(x1, x2, x3, x4, x5, x6, x7) -> f8#(x1, x2, x3, x4, x5, x6, x7) f8#(I0, I1, I2, I3, I4, I5, I6) -> f4#(I0, I1, I2, 400, 0, 0, I6) f2#(I7, I8, I9, I10, I11, I12, I13) -> f4#(I7, I8, I9, I10, 1 + I11, I12, I13) f4#(I14, I15, I16, I17, I18, I19, I20) -> f2#(rnd1, I20, I16, I17, I18, rnd6, I20) [I19 <= 0 /\ 0 <= I19 /\ 0 <= -1 + I17 - I18 /\ y1 = I20 /\ rnd6 = y1 /\ rnd1 = rnd1] f4#(I37, I38, I39, I40, I41, I42, I43) -> f5#(I37, I38, I39, I40, I41, I42, I43) [1 <= I42] f4#(I44, I45, I46, I47, I48, I49, I50) -> f5#(I44, I45, I46, I47, I48, I49, I50) [1 + I49 <= 0] f3#(I51, I52, I53, I54, I55, I56, I57) -> f4#(I58, I57, I53, I54, 1 + I55, I59, I57) [I60 = I57 /\ I59 = I60 /\ I58 = I58] f1#(I61, I62, I63, I64, I65, I66, I67) -> f2#(I68, I67, I63, I64, I65, I69, I67) [I70 = I67 /\ I69 = I70 /\ I68 = I68] R = f9(x1, x2, x3, x4, x5, x6, x7) -> f8(x1, x2, x3, x4, x5, x6, x7) f8(I0, I1, I2, I3, I4, I5, I6) -> f4(I0, I1, I2, 400, 0, 0, I6) f2(I7, I8, I9, I10, I11, I12, I13) -> f4(I7, I8, I9, I10, 1 + I11, I12, I13) f4(I14, I15, I16, I17, I18, I19, I20) -> f2(rnd1, I20, I16, I17, I18, rnd6, I20) [I19 <= 0 /\ 0 <= I19 /\ 0 <= -1 + I17 - I18 /\ y1 = I20 /\ rnd6 = y1 /\ rnd1 = rnd1] f4(I21, I22, I23, I24, I25, I26, I27) -> f7(I28, I22, I26, I24, I25, I26, I27) [I28 = I26 /\ I24 - I25 <= 0 /\ 0 <= I26 /\ I26 <= 0] f5(I29, I30, I31, I32, I33, I34, I35) -> f6(I36, I30, I34, I32, I33, I34, I35) [I36 = I34] f4(I37, I38, I39, I40, I41, I42, I43) -> f5(I37, I38, I39, I40, I41, I42, I43) [1 <= I42] f4(I44, I45, I46, I47, I48, I49, I50) -> f5(I44, I45, I46, I47, I48, I49, I50) [1 + I49 <= 0] f3(I51, I52, I53, I54, I55, I56, I57) -> f4(I58, I57, I53, I54, 1 + I55, I59, I57) [I60 = I57 /\ I59 = I60 /\ I58 = I58] f1(I61, I62, I63, I64, I65, I66, I67) -> f2(I68, I67, I63, I64, I65, I69, I67) [I70 = I67 /\ I69 = I70 /\ I68 = I68] The dependency graph for this problem is: 0 -> 1 1 -> 3 2 -> 3, 4, 5 3 -> 2 4 -> 5 -> 6 -> 3, 4, 5 7 -> 2 Where: 0) f9#(x1, x2, x3, x4, x5, x6, x7) -> f8#(x1, x2, x3, x4, x5, x6, x7) 1) f8#(I0, I1, I2, I3, I4, I5, I6) -> f4#(I0, I1, I2, 400, 0, 0, I6) 2) f2#(I7, I8, I9, I10, I11, I12, I13) -> f4#(I7, I8, I9, I10, 1 + I11, I12, I13) 3) f4#(I14, I15, I16, I17, I18, I19, I20) -> f2#(rnd1, I20, I16, I17, I18, rnd6, I20) [I19 <= 0 /\ 0 <= I19 /\ 0 <= -1 + I17 - I18 /\ y1 = I20 /\ rnd6 = y1 /\ rnd1 = rnd1] 4) f4#(I37, I38, I39, I40, I41, I42, I43) -> f5#(I37, I38, I39, I40, I41, I42, I43) [1 <= I42] 5) f4#(I44, I45, I46, I47, I48, I49, I50) -> f5#(I44, I45, I46, I47, I48, I49, I50) [1 + I49 <= 0] 6) f3#(I51, I52, I53, I54, I55, I56, I57) -> f4#(I58, I57, I53, I54, 1 + I55, I59, I57) [I60 = I57 /\ I59 = I60 /\ I58 = I58] 7) f1#(I61, I62, I63, I64, I65, I66, I67) -> f2#(I68, I67, I63, I64, I65, I69, I67) [I70 = I67 /\ I69 = I70 /\ I68 = I68] We have the following SCCs. { 2, 3 } DP problem for innermost termination. P = f2#(I7, I8, I9, I10, I11, I12, I13) -> f4#(I7, I8, I9, I10, 1 + I11, I12, I13) f4#(I14, I15, I16, I17, I18, I19, I20) -> f2#(rnd1, I20, I16, I17, I18, rnd6, I20) [I19 <= 0 /\ 0 <= I19 /\ 0 <= -1 + I17 - I18 /\ y1 = I20 /\ rnd6 = y1 /\ rnd1 = rnd1] R = f9(x1, x2, x3, x4, x5, x6, x7) -> f8(x1, x2, x3, x4, x5, x6, x7) f8(I0, I1, I2, I3, I4, I5, I6) -> f4(I0, I1, I2, 400, 0, 0, I6) f2(I7, I8, I9, I10, I11, I12, I13) -> f4(I7, I8, I9, I10, 1 + I11, I12, I13) f4(I14, I15, I16, I17, I18, I19, I20) -> f2(rnd1, I20, I16, I17, I18, rnd6, I20) [I19 <= 0 /\ 0 <= I19 /\ 0 <= -1 + I17 - I18 /\ y1 = I20 /\ rnd6 = y1 /\ rnd1 = rnd1] f4(I21, I22, I23, I24, I25, I26, I27) -> f7(I28, I22, I26, I24, I25, I26, I27) [I28 = I26 /\ I24 - I25 <= 0 /\ 0 <= I26 /\ I26 <= 0] f5(I29, I30, I31, I32, I33, I34, I35) -> f6(I36, I30, I34, I32, I33, I34, I35) [I36 = I34] f4(I37, I38, I39, I40, I41, I42, I43) -> f5(I37, I38, I39, I40, I41, I42, I43) [1 <= I42] f4(I44, I45, I46, I47, I48, I49, I50) -> f5(I44, I45, I46, I47, I48, I49, I50) [1 + I49 <= 0] f3(I51, I52, I53, I54, I55, I56, I57) -> f4(I58, I57, I53, I54, 1 + I55, I59, I57) [I60 = I57 /\ I59 = I60 /\ I58 = I58] f1(I61, I62, I63, I64, I65, I66, I67) -> f2(I68, I67, I63, I64, I65, I69, I67) [I70 = I67 /\ I69 = I70 /\ I68 = I68] We use the reverse value criterion with the projection function NU: NU[f4#(z1,z2,z3,z4,z5,z6,z7)] = -1 + z4 - z5 + -1 * 0 NU[f2#(z1,z2,z3,z4,z5,z6,z7)] = -1 + z4 - (1 + z5) + -1 * 0 This gives the following inequalities: ==> -1 + I10 - (1 + I11) + -1 * 0 >= -1 + I10 - (1 + I11) + -1 * 0 I19 <= 0 /\ 0 <= I19 /\ 0 <= -1 + I17 - I18 /\ y1 = I20 /\ rnd6 = y1 /\ rnd1 = rnd1 ==> -1 + I17 - I18 + -1 * 0 > -1 + I17 - (1 + I18) + -1 * 0 with -1 + I17 - I18 + -1 * 0 >= 0 We remove all the strictly oriented dependency pairs. DP problem for innermost termination. P = f2#(I7, I8, I9, I10, I11, I12, I13) -> f4#(I7, I8, I9, I10, 1 + I11, I12, I13) R = f9(x1, x2, x3, x4, x5, x6, x7) -> f8(x1, x2, x3, x4, x5, x6, x7) f8(I0, I1, I2, I3, I4, I5, I6) -> f4(I0, I1, I2, 400, 0, 0, I6) f2(I7, I8, I9, I10, I11, I12, I13) -> f4(I7, I8, I9, I10, 1 + I11, I12, I13) f4(I14, I15, I16, I17, I18, I19, I20) -> f2(rnd1, I20, I16, I17, I18, rnd6, I20) [I19 <= 0 /\ 0 <= I19 /\ 0 <= -1 + I17 - I18 /\ y1 = I20 /\ rnd6 = y1 /\ rnd1 = rnd1] f4(I21, I22, I23, I24, I25, I26, I27) -> f7(I28, I22, I26, I24, I25, I26, I27) [I28 = I26 /\ I24 - I25 <= 0 /\ 0 <= I26 /\ I26 <= 0] f5(I29, I30, I31, I32, I33, I34, I35) -> f6(I36, I30, I34, I32, I33, I34, I35) [I36 = I34] f4(I37, I38, I39, I40, I41, I42, I43) -> f5(I37, I38, I39, I40, I41, I42, I43) [1 <= I42] f4(I44, I45, I46, I47, I48, I49, I50) -> f5(I44, I45, I46, I47, I48, I49, I50) [1 + I49 <= 0] f3(I51, I52, I53, I54, I55, I56, I57) -> f4(I58, I57, I53, I54, 1 + I55, I59, I57) [I60 = I57 /\ I59 = I60 /\ I58 = I58] f1(I61, I62, I63, I64, I65, I66, I67) -> f2(I68, I67, I63, I64, I65, I69, I67) [I70 = I67 /\ I69 = I70 /\ I68 = I68] The dependency graph for this problem is: 2 -> Where: 2) f2#(I7, I8, I9, I10, I11, I12, I13) -> f4#(I7, I8, I9, I10, 1 + I11, I12, I13) We have the following SCCs. popout

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

job log

popout

actions

all output return to Integer Transition Systems