details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	1.62746 seconds
cpu usage	1.64845
user time	0.910301
system time	0.738148
max virtual memory	685140.0
max residence set size	8528.0

stage attributes

key	value
starexec-result	MAYBE

output

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