Integer_Transition_Systems 2019-03-29 01.54 pair #432274941

details
property	value
status	complete
benchmark	ex30.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n083.star.cs.uiowa.edu
space	From_T2
run statistics
property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	16.5586 seconds
cpu usage	16.3792
user time	8.49267
system time	7.88651
max virtual memory	732328.0
max residence set size	10400.0
stage attributes
key	value
starexec-result	YES
output
16.28/16.55	YES
16.28/16.55	
16.28/16.55	DP problem for innermost termination.
16.28/16.55	P =
16.28/16.55	  f7#(x1, x2, x3, x4, x5, x6, x7) -> f6#(x1, x2, x3, x4, x5, x6, x7) 
16.28/16.55	  f6#(I0, I1, I2, I3, I4, I5, I6) -> f1#(0, I1, I2, rnd4, rnd5, rnd6, I6) [rnd4 = rnd4 /\ rnd6 = rnd6 /\ rnd5 = rnd5]
16.28/16.55	  f2#(I7, I8, I9, I10, I11, I12, I13) -> f1#(1 + I7, I8, I9, I10, I11, I12, I13) [1 + I7 <= I10]
16.28/16.55	  f2#(I14, I15, I16, I17, I18, I19, I20) -> f5#(I14, 0, I18, I17, I18, I19, rnd7) [rnd7 = rnd7 /\ I17 <= I14]
16.28/16.55	  f5#(I21, I22, I23, I24, I25, I26, I27) -> f3#(I21, I22, I23, I24, I25, I26, I27) 
16.28/16.55	  f3#(I28, I29, I30, I31, I32, I33, I34) -> f5#(I28, 1 + I29, I30, I31, I32, I33, I34) [1 + I29 <= I30]
16.28/16.55	  f1#(I42, I43, I44, I45, I46, I47, I48) -> f2#(I42, I43, I44, I45, I46, I47, I48) 
16.28/16.55	R = 
16.28/16.55	  f7(x1, x2, x3, x4, x5, x6, x7) -> f6(x1, x2, x3, x4, x5, x6, x7) 
16.28/16.55	  f6(I0, I1, I2, I3, I4, I5, I6) -> f1(0, I1, I2, rnd4, rnd5, rnd6, I6) [rnd4 = rnd4 /\ rnd6 = rnd6 /\ rnd5 = rnd5]
16.28/16.55	  f2(I7, I8, I9, I10, I11, I12, I13) -> f1(1 + I7, I8, I9, I10, I11, I12, I13) [1 + I7 <= I10]
16.28/16.55	  f2(I14, I15, I16, I17, I18, I19, I20) -> f5(I14, 0, I18, I17, I18, I19, rnd7) [rnd7 = rnd7 /\ I17 <= I14]
16.28/16.55	  f5(I21, I22, I23, I24, I25, I26, I27) -> f3(I21, I22, I23, I24, I25, I26, I27) 
16.28/16.55	  f3(I28, I29, I30, I31, I32, I33, I34) -> f5(I28, 1 + I29, I30, I31, I32, I33, I34) [1 + I29 <= I30]
16.28/16.55	  f3(I35, I36, I37, I38, I39, I40, I41) -> f4(I35, I36, I37, I38, I39, I40, I41) [I37 <= I36]
16.28/16.55	  f1(I42, I43, I44, I45, I46, I47, I48) -> f2(I42, I43, I44, I45, I46, I47, I48) 
16.28/16.55	
16.28/16.55	The dependency graph for this problem is:
16.28/16.55	  0 -> 1
16.28/16.55	  1 -> 6
16.28/16.55	  2 -> 6
16.28/16.55	  3 -> 4
16.28/16.55	  4 -> 5
16.28/16.55	  5 -> 4
16.28/16.55	  6 -> 2, 3
16.28/16.55	Where:
16.28/16.55	  0) f7#(x1, x2, x3, x4, x5, x6, x7) -> f6#(x1, x2, x3, x4, x5, x6, x7) 
16.28/16.55	  1) f6#(I0, I1, I2, I3, I4, I5, I6) -> f1#(0, I1, I2, rnd4, rnd5, rnd6, I6) [rnd4 = rnd4 /\ rnd6 = rnd6 /\ rnd5 = rnd5]
16.28/16.55	  2) f2#(I7, I8, I9, I10, I11, I12, I13) -> f1#(1 + I7, I8, I9, I10, I11, I12, I13) [1 + I7 <= I10]
16.28/16.55	  3) f2#(I14, I15, I16, I17, I18, I19, I20) -> f5#(I14, 0, I18, I17, I18, I19, rnd7) [rnd7 = rnd7 /\ I17 <= I14]
16.28/16.55	  4) f5#(I21, I22, I23, I24, I25, I26, I27) -> f3#(I21, I22, I23, I24, I25, I26, I27) 
16.28/16.55	  5) f3#(I28, I29, I30, I31, I32, I33, I34) -> f5#(I28, 1 + I29, I30, I31, I32, I33, I34) [1 + I29 <= I30]
16.28/16.55	  6) f1#(I42, I43, I44, I45, I46, I47, I48) -> f2#(I42, I43, I44, I45, I46, I47, I48) 
16.28/16.55	
16.28/16.55	We have the following SCCs.
16.28/16.55	  { 2, 6 }
16.28/16.55	  { 4, 5 }
16.28/16.55	
16.28/16.55	DP problem for innermost termination.
16.28/16.55	P =
16.28/16.55	  f5#(I21, I22, I23, I24, I25, I26, I27) -> f3#(I21, I22, I23, I24, I25, I26, I27) 
16.28/16.55	  f3#(I28, I29, I30, I31, I32, I33, I34) -> f5#(I28, 1 + I29, I30, I31, I32, I33, I34) [1 + I29 <= I30]
16.28/16.55	R = 
16.28/16.55	  f7(x1, x2, x3, x4, x5, x6, x7) -> f6(x1, x2, x3, x4, x5, x6, x7) 
16.28/16.55	  f6(I0, I1, I2, I3, I4, I5, I6) -> f1(0, I1, I2, rnd4, rnd5, rnd6, I6) [rnd4 = rnd4 /\ rnd6 = rnd6 /\ rnd5 = rnd5]
16.28/16.55	  f2(I7, I8, I9, I10, I11, I12, I13) -> f1(1 + I7, I8, I9, I10, I11, I12, I13) [1 + I7 <= I10]
16.28/16.55	  f2(I14, I15, I16, I17, I18, I19, I20) -> f5(I14, 0, I18, I17, I18, I19, rnd7) [rnd7 = rnd7 /\ I17 <= I14]
16.28/16.55	  f5(I21, I22, I23, I24, I25, I26, I27) -> f3(I21, I22, I23, I24, I25, I26, I27) 
16.28/16.55	  f3(I28, I29, I30, I31, I32, I33, I34) -> f5(I28, 1 + I29, I30, I31, I32, I33, I34) [1 + I29 <= I30]
16.28/16.55	  f3(I35, I36, I37, I38, I39, I40, I41) -> f4(I35, I36, I37, I38, I39, I40, I41) [I37 <= I36]
16.28/16.55	  f1(I42, I43, I44, I45, I46, I47, I48) -> f2(I42, I43, I44, I45, I46, I47, I48) 
16.28/16.55	
16.28/16.55	We use the reverse value criterion with the projection function NU:
16.28/16.55	  NU[f3#(z1,z2,z3,z4,z5,z6,z7)] = z3 + -1 * (1 + z2)
16.28/16.55	  NU[f5#(z1,z2,z3,z4,z5,z6,z7)] = z3 + -1 * (1 + z2)
16.28/16.55	
16.28/16.55	This gives the following inequalities:
16.28/16.55	    ==>  I23 + -1 * (1 + I22) >= I23 + -1 * (1 + I22)
16.28/16.55	  1 + I29 <= I30  ==>  I30 + -1 * (1 + I29) > I30 + -1 * (1 + (1 + I29))  with  I30 + -1 * (1 + I29) >= 0
16.28/16.55	
16.28/16.55	We remove all the strictly oriented dependency pairs.
16.28/16.55	
16.28/16.55	DP problem for innermost termination.
16.28/16.55	P =
16.28/16.55	  f5#(I21, I22, I23, I24, I25, I26, I27) -> f3#(I21, I22, I23, I24, I25, I26, I27) 
16.28/16.55	R = 
16.28/16.55	  f7(x1, x2, x3, x4, x5, x6, x7) -> f6(x1, x2, x3, x4, x5, x6, x7) 
16.28/16.55	  f6(I0, I1, I2, I3, I4, I5, I6) -> f1(0, I1, I2, rnd4, rnd5, rnd6, I6) [rnd4 = rnd4 /\ rnd6 = rnd6 /\ rnd5 = rnd5]
16.28/16.55	  f2(I7, I8, I9, I10, I11, I12, I13) -> f1(1 + I7, I8, I9, I10, I11, I12, I13) [1 + I7 <= I10]
16.28/16.55	  f2(I14, I15, I16, I17, I18, I19, I20) -> f5(I14, 0, I18, I17, I18, I19, rnd7) [rnd7 = rnd7 /\ I17 <= I14]
16.28/16.55	  f5(I21, I22, I23, I24, I25, I26, I27) -> f3(I21, I22, I23, I24, I25, I26, I27) 
16.28/16.55	  f3(I28, I29, I30, I31, I32, I33, I34) -> f5(I28, 1 + I29, I30, I31, I32, I33, I34) [1 + I29 <= I30]
16.28/16.55	  f3(I35, I36, I37, I38, I39, I40, I41) -> f4(I35, I36, I37, I38, I39, I40, I41) [I37 <= I36]
16.28/16.55	  f1(I42, I43, I44, I45, I46, I47, I48) -> f2(I42, I43, I44, I45, I46, I47, I48) 
16.28/16.55	
16.28/16.55	The dependency graph for this problem is:
16.28/16.55	  4 -> 
16.28/16.55	Where:
16.28/16.55	  4) f5#(I21, I22, I23, I24, I25, I26, I27) -> f3#(I21, I22, I23, I24, I25, I26, I27) 
16.28/16.55	
16.28/16.55	We have the following SCCs.
16.28/16.55	  
16.28/16.55	
16.28/16.55	DP problem for innermost termination.
16.28/16.55	P =
16.28/16.55	  f2#(I7, I8, I9, I10, I11, I12, I13) -> f1#(1 + I7, I8, I9, I10, I11, I12, I13) [1 + I7 <= I10]
16.28/16.55	  f1#(I42, I43, I44, I45, I46, I47, I48) -> f2#(I42, I43, I44, I45, I46, I47, I48) 
16.28/16.55	R = 
16.28/16.55	  f7(x1, x2, x3, x4, x5, x6, x7) -> f6(x1, x2, x3, x4, x5, x6, x7) 
16.28/16.55	  f6(I0, I1, I2, I3, I4, I5, I6) -> f1(0, I1, I2, rnd4, rnd5, rnd6, I6) [rnd4 = rnd4 /\ rnd6 = rnd6 /\ rnd5 = rnd5]
16.28/16.55	  f2(I7, I8, I9, I10, I11, I12, I13) -> f1(1 + I7, I8, I9, I10, I11, I12, I13) [1 + I7 <= I10]
16.28/16.55	  f2(I14, I15, I16, I17, I18, I19, I20) -> f5(I14, 0, I18, I17, I18, I19, rnd7) [rnd7 = rnd7 /\ I17 <= I14]
16.28/16.55	  f5(I21, I22, I23, I24, I25, I26, I27) -> f3(I21, I22, I23, I24, I25, I26, I27) 
16.28/16.55	  f3(I28, I29, I30, I31, I32, I33, I34) -> f5(I28, 1 + I29, I30, I31, I32, I33, I34) [1 + I29 <= I30]
16.28/16.55	  f3(I35, I36, I37, I38, I39, I40, I41) -> f4(I35, I36, I37, I38, I39, I40, I41) [I37 <= I36]
16.28/16.55	  f1(I42, I43, I44, I45, I46, I47, I48) -> f2(I42, I43, I44, I45, I46, I47, I48)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions all output return to Integer_Transition_Systems 2019-03-29 01.54