details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	1.6678 seconds
cpu usage	1.6982
user time	0.871314
system time	0.826883
max virtual memory	577192.0
max residence set size	8612.0

stage attributes

key	value
starexec-result	MAYBE

output

1.63/1.66 MAYBE 1.63/1.66 1.63/1.66 DP problem for innermost termination. 1.63/1.66 P = 1.63/1.66 f4#(x1, x2, x3) -> f3#(x1, x2, x3) 1.63/1.66 f3#(I0, I1, I2) -> f1#(I0, I1, I2) 1.63/1.66 f2#(I3, I4, I5) -> f1#(I3, I4, I5) 1.63/1.66 f1#(I6, I7, I8) -> f2#(I6, I7, I6 + I8) [1 + I7 <= I6 + I8] 1.63/1.66 R = 1.63/1.66 f4(x1, x2, x3) -> f3(x1, x2, x3) 1.63/1.66 f3(I0, I1, I2) -> f1(I0, I1, I2) 1.63/1.66 f2(I3, I4, I5) -> f1(I3, I4, I5) 1.63/1.66 f1(I6, I7, I8) -> f2(I6, I7, I6 + I8) [1 + I7 <= I6 + I8] 1.63/1.66 1.63/1.66 The dependency graph for this problem is: 1.63/1.66 0 -> 1 1.63/1.66 1 -> 3 1.63/1.66 2 -> 3 1.63/1.66 3 -> 2 1.63/1.66 Where: 1.63/1.66 0) f4#(x1, x2, x3) -> f3#(x1, x2, x3) 1.63/1.66 1) f3#(I0, I1, I2) -> f1#(I0, I1, I2) 1.63/1.66 2) f2#(I3, I4, I5) -> f1#(I3, I4, I5) 1.63/1.66 3) f1#(I6, I7, I8) -> f2#(I6, I7, I6 + I8) [1 + I7 <= I6 + I8] 1.63/1.66 1.63/1.66 We have the following SCCs. 1.63/1.66 { 2, 3 } 1.63/1.66 1.63/1.66 DP problem for innermost termination. 1.63/1.66 P = 1.63/1.66 f2#(I3, I4, I5) -> f1#(I3, I4, I5) 1.63/1.66 f1#(I6, I7, I8) -> f2#(I6, I7, I6 + I8) [1 + I7 <= I6 + I8] 1.63/1.66 R = 1.63/1.66 f4(x1, x2, x3) -> f3(x1, x2, x3) 1.63/1.66 f3(I0, I1, I2) -> f1(I0, I1, I2) 1.63/1.66 f2(I3, I4, I5) -> f1(I3, I4, I5) 1.63/1.66 f1(I6, I7, I8) -> f2(I6, I7, I6 + I8) [1 + I7 <= I6 + I8] 1.63/1.66 1.63/1.66 EOF 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