Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275439
details
property
value
status
complete
benchmark
matmul.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n123.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
Ctrl
configuration
Transition
runtime (wallclock)
20.1374 seconds
cpu usage
20.3769
user time
10.5981
system time
9.77877
max virtual memory
752868.0
max residence set size
11576.0
stage attributes
key
value
starexec-result
YES
output
20.29/20.13 YES 20.29/20.13 20.29/20.13 DP problem for innermost termination. 20.29/20.13 P = 20.29/20.13 f13#(x1, x2, x3) -> f12#(x1, x2, x3) 20.29/20.13 f12#(I0, I1, I2) -> f1#(1, I1, I2) 20.29/20.13 f2#(I3, I4, I5) -> f3#(I3, 1, I5) [I3 <= 5] 20.29/20.13 f2#(I6, I7, I8) -> f5#(1, I7, I8) [6 <= I6] 20.29/20.13 f4#(I9, I10, I11) -> f3#(I9, 1 + I10, I11) [I10 <= 5] 20.29/20.13 f4#(I12, I13, I14) -> f1#(1 + I12, I13, I14) [6 <= I13] 20.29/20.13 f10#(I15, I16, I17) -> f9#(I15, I16, I17) 20.29/20.13 f6#(I18, I19, I20) -> f7#(I18, 1, I20) [I18 <= 5] 20.29/20.13 f8#(I24, I25, I26) -> f10#(I24, I25, 1) [I25 <= 5] 20.29/20.13 f8#(I27, I28, I29) -> f5#(1 + I27, I28, I29) [6 <= I28] 20.29/20.13 f9#(I30, I31, I32) -> f10#(I30, I31, 1 + I32) [I32 <= 5] 20.29/20.13 f9#(I33, I34, I35) -> f7#(I33, 1 + I34, I35) [6 <= I35] 20.29/20.13 f7#(I36, I37, I38) -> f8#(I36, I37, I38) 20.29/20.13 f5#(I39, I40, I41) -> f6#(I39, I40, I41) 20.29/20.13 f3#(I42, I43, I44) -> f4#(I42, I43, I44) 20.29/20.13 f1#(I45, I46, I47) -> f2#(I45, I46, I47) 20.29/20.13 R = 20.29/20.13 f13(x1, x2, x3) -> f12(x1, x2, x3) 20.29/20.13 f12(I0, I1, I2) -> f1(1, I1, I2) 20.29/20.13 f2(I3, I4, I5) -> f3(I3, 1, I5) [I3 <= 5] 20.29/20.13 f2(I6, I7, I8) -> f5(1, I7, I8) [6 <= I6] 20.29/20.13 f4(I9, I10, I11) -> f3(I9, 1 + I10, I11) [I10 <= 5] 20.29/20.13 f4(I12, I13, I14) -> f1(1 + I12, I13, I14) [6 <= I13] 20.29/20.13 f10(I15, I16, I17) -> f9(I15, I16, I17) 20.29/20.13 f6(I18, I19, I20) -> f7(I18, 1, I20) [I18 <= 5] 20.29/20.13 f6(I21, I22, I23) -> f11(I21, I22, I23) [6 <= I21] 20.29/20.13 f8(I24, I25, I26) -> f10(I24, I25, 1) [I25 <= 5] 20.29/20.13 f8(I27, I28, I29) -> f5(1 + I27, I28, I29) [6 <= I28] 20.29/20.13 f9(I30, I31, I32) -> f10(I30, I31, 1 + I32) [I32 <= 5] 20.29/20.13 f9(I33, I34, I35) -> f7(I33, 1 + I34, I35) [6 <= I35] 20.29/20.13 f7(I36, I37, I38) -> f8(I36, I37, I38) 20.29/20.13 f5(I39, I40, I41) -> f6(I39, I40, I41) 20.29/20.13 f3(I42, I43, I44) -> f4(I42, I43, I44) 20.29/20.13 f1(I45, I46, I47) -> f2(I45, I46, I47) 20.29/20.13 20.29/20.13 The dependency graph for this problem is: 20.29/20.13 0 -> 1 20.29/20.13 1 -> 15 20.29/20.13 2 -> 14 20.29/20.13 3 -> 13 20.29/20.13 4 -> 14 20.29/20.13 5 -> 15 20.29/20.13 6 -> 10, 11 20.29/20.13 7 -> 12 20.29/20.13 8 -> 6 20.29/20.13 9 -> 13 20.29/20.13 10 -> 6 20.29/20.13 11 -> 12 20.29/20.13 12 -> 8, 9 20.29/20.13 13 -> 7 20.29/20.13 14 -> 4, 5 20.29/20.13 15 -> 2, 3 20.29/20.13 Where: 20.29/20.13 0) f13#(x1, x2, x3) -> f12#(x1, x2, x3) 20.29/20.13 1) f12#(I0, I1, I2) -> f1#(1, I1, I2) 20.29/20.13 2) f2#(I3, I4, I5) -> f3#(I3, 1, I5) [I3 <= 5] 20.29/20.13 3) f2#(I6, I7, I8) -> f5#(1, I7, I8) [6 <= I6] 20.29/20.13 4) f4#(I9, I10, I11) -> f3#(I9, 1 + I10, I11) [I10 <= 5] 20.29/20.13 5) f4#(I12, I13, I14) -> f1#(1 + I12, I13, I14) [6 <= I13] 20.29/20.13 6) f10#(I15, I16, I17) -> f9#(I15, I16, I17) 20.29/20.13 7) f6#(I18, I19, I20) -> f7#(I18, 1, I20) [I18 <= 5] 20.29/20.13 8) f8#(I24, I25, I26) -> f10#(I24, I25, 1) [I25 <= 5] 20.29/20.13 9) f8#(I27, I28, I29) -> f5#(1 + I27, I28, I29) [6 <= I28] 20.29/20.13 10) f9#(I30, I31, I32) -> f10#(I30, I31, 1 + I32) [I32 <= 5] 20.29/20.13 11) f9#(I33, I34, I35) -> f7#(I33, 1 + I34, I35) [6 <= I35] 20.29/20.13 12) f7#(I36, I37, I38) -> f8#(I36, I37, I38) 20.29/20.13 13) f5#(I39, I40, I41) -> f6#(I39, I40, I41) 20.29/20.13 14) f3#(I42, I43, I44) -> f4#(I42, I43, I44) 20.29/20.13 15) f1#(I45, I46, I47) -> f2#(I45, I46, I47) 20.29/20.13 20.29/20.13 We have the following SCCs. 20.29/20.13 { 2, 4, 5, 14, 15 } 20.29/20.13 { 6, 7, 8, 9, 10, 11, 12, 13 } 20.29/20.13 20.29/20.13 DP problem for innermost termination. 20.29/20.13 P = 20.29/20.13 f10#(I15, I16, I17) -> f9#(I15, I16, I17) 20.29/20.13 f6#(I18, I19, I20) -> f7#(I18, 1, I20) [I18 <= 5] 20.29/20.13 f8#(I24, I25, I26) -> f10#(I24, I25, 1) [I25 <= 5] 20.29/20.13 f8#(I27, I28, I29) -> f5#(1 + I27, I28, I29) [6 <= I28] 20.29/20.13 f9#(I30, I31, I32) -> f10#(I30, I31, 1 + I32) [I32 <= 5] 20.29/20.13 f9#(I33, I34, I35) -> f7#(I33, 1 + I34, I35) [6 <= I35] 20.29/20.13 f7#(I36, I37, I38) -> f8#(I36, I37, I38) 20.29/20.13 f5#(I39, I40, I41) -> f6#(I39, I40, I41) 20.29/20.13 R = 20.29/20.13 f13(x1, x2, x3) -> f12(x1, x2, x3) 20.29/20.13 f12(I0, I1, I2) -> f1(1, I1, I2) 20.29/20.13 f2(I3, I4, I5) -> f3(I3, 1, I5) [I3 <= 5] 20.29/20.13 f2(I6, I7, I8) -> f5(1, I7, I8) [6 <= I6] 20.29/20.13 f4(I9, I10, I11) -> f3(I9, 1 + I10, I11) [I10 <= 5] 20.29/20.13 f4(I12, I13, I14) -> f1(1 + I12, I13, I14) [6 <= I13] 20.29/20.13 f10(I15, I16, I17) -> f9(I15, I16, I17) 20.29/20.13 f6(I18, I19, I20) -> f7(I18, 1, I20) [I18 <= 5] 20.29/20.13 f6(I21, I22, I23) -> f11(I21, I22, I23) [6 <= I21] 20.29/20.13 f8(I24, I25, I26) -> f10(I24, I25, 1) [I25 <= 5] 20.29/20.13 f8(I27, I28, I29) -> f5(1 + I27, I28, I29) [6 <= I28]
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
