details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	15.2135 seconds
cpu usage	14.9587
user time	7.68939
system time	7.26928
max virtual memory	723540.0
max residence set size	9240.0

stage attributes

key	value
starexec-result	YES

output

YES DP problem for innermost termination. P = f19#(x1, x2, x3) -> f18#(x1, x2, x3) f18#(I0, I1, I2) -> f7#(I0, 0, I2) [y1 = 0] f3#(I3, I4, I5) -> f17#(I3, I4, I5) f3#(I6, I7, I8) -> f13#(I6, I7, I8) f3#(I9, I10, I11) -> f17#(I9, I10, I11) f17#(I12, I13, I14) -> f16#(I12, I13, I14) f16#(I15, I16, I17) -> f15#(I15, I16, I17) f16#(I18, I19, I20) -> f14#(I18, I19, I20) f16#(I21, I22, I23) -> f14#(I21, I22, I23) f15#(I24, I25, I26) -> f13#(I24, I25, I26) f14#(I27, I28, I29) -> f15#(I27, I28, I29) f2#(I30, I31, I32) -> f11#(I30, I31, I32) f13#(I33, I34, I35) -> f7#(I33, 1 + I34, I35) f11#(I36, I37, I38) -> f10#(I36, I37, I38) [1 + I37 <= 10] f10#(I42, I43, I44) -> f9#(I42, I43, I44) f10#(I45, I46, I47) -> f4#(I45, I46, I47) f10#(I48, I49, I50) -> f9#(I48, I49, I50) f9#(I51, I52, I53) -> f8#(I51, I52, rnd3) [rnd3 = rnd3] f8#(I54, I55, I56) -> f6#(I54, I55, I56) f8#(I57, I58, I59) -> f5#(I57, I58, I59) f8#(I60, I61, I62) -> f5#(I60, I61, I62) f7#(I63, I64, I65) -> f1#(I63, I64, I65) f6#(I66, I67, I68) -> f4#(I66, I67, I68) f5#(I69, I70, I71) -> f6#(I69, I70, I71) f4#(I72, I73, I74) -> f2#(I72, 1 + I73, I74) f1#(I75, I76, I77) -> f3#(I76, I76, I77) [1 + I76 <= 10] f1#(I78, I79, I80) -> f2#(I78, 0, I80) [10 <= I79] R = f19(x1, x2, x3) -> f18(x1, x2, x3) f18(I0, I1, I2) -> f7(I0, 0, I2) [y1 = 0] f3(I3, I4, I5) -> f17(I3, I4, I5) f3(I6, I7, I8) -> f13(I6, I7, I8) f3(I9, I10, I11) -> f17(I9, I10, I11) f17(I12, I13, I14) -> f16(I12, I13, I14) f16(I15, I16, I17) -> f15(I15, I16, I17) f16(I18, I19, I20) -> f14(I18, I19, I20) f16(I21, I22, I23) -> f14(I21, I22, I23) f15(I24, I25, I26) -> f13(I24, I25, I26) f14(I27, I28, I29) -> f15(I27, I28, I29) f2(I30, I31, I32) -> f11(I30, I31, I32) f13(I33, I34, I35) -> f7(I33, 1 + I34, I35) f11(I36, I37, I38) -> f10(I36, I37, I38) [1 + I37 <= 10] f11(I39, I40, I41) -> f12(I39, I40, I41) [10 <= I40] f10(I42, I43, I44) -> f9(I42, I43, I44) f10(I45, I46, I47) -> f4(I45, I46, I47) f10(I48, I49, I50) -> f9(I48, I49, I50) f9(I51, I52, I53) -> f8(I51, I52, rnd3) [rnd3 = rnd3] f8(I54, I55, I56) -> f6(I54, I55, I56) f8(I57, I58, I59) -> f5(I57, I58, I59) f8(I60, I61, I62) -> f5(I60, I61, I62) f7(I63, I64, I65) -> f1(I63, I64, I65) f6(I66, I67, I68) -> f4(I66, I67, I68) f5(I69, I70, I71) -> f6(I69, I70, I71) f4(I72, I73, I74) -> f2(I72, 1 + I73, I74) f1(I75, I76, I77) -> f3(I76, I76, I77) [1 + I76 <= 10] f1(I78, I79, I80) -> f2(I78, 0, I80) [10 <= I79] The dependency graph for this problem is: 0 -> 1 1 -> 21 2 -> 5 3 -> 12 4 -> 5 5 -> 6, 7, 8 6 -> 9 7 -> 10 8 -> 10 9 -> 12 10 -> 9 11 -> 13 12 -> 21 13 -> 14, 15, 16 14 -> 17 15 -> 24 16 -> 17 17 -> 18, 19, 20 18 -> 22 19 -> 23 20 -> 23 21 -> 25, 26 22 -> 24 23 -> 22 24 -> 11 25 -> 2, 3, 4 26 -> 11 Where: 0) f19#(x1, x2, x3) -> f18#(x1, x2, x3) 1) f18#(I0, I1, I2) -> f7#(I0, 0, I2) [y1 = 0] 2) f3#(I3, I4, I5) -> f17#(I3, I4, I5) 3) f3#(I6, I7, I8) -> f13#(I6, I7, I8) 4) f3#(I9, I10, I11) -> f17#(I9, I10, I11) 5) f17#(I12, I13, I14) -> f16#(I12, I13, I14) 6) f16#(I15, I16, I17) -> f15#(I15, I16, I17) 7) f16#(I18, I19, I20) -> f14#(I18, I19, I20) 8) f16#(I21, I22, I23) -> f14#(I21, I22, I23) 9) f15#(I24, I25, I26) -> f13#(I24, I25, I26) popout

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

job log

popout

actions

all output return to ITS