details

property	value
status	complete
benchmark	round.itrs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n146.star.cs.uiowa.edu
space	Mixed_ITRS_2014

run statistics

property	value
solver	Ctrl
configuration	Itrs
runtime (wallclock)	0.163897 seconds
cpu usage	0.166905
user time	0.096924
system time	0.069981
max virtual memory	113188.0
max residence set size	7776.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE DP problem for innermost termination. P = f#(I1, y) -> f#(I1, round(I1)) [I1 >= 1 && y = I1 - 1] f#(I1, y) -> round#(I1) [I1 >= 1 && y = I1 - 1] R = round(x) -> x + 1 round(I0) -> I0 f(I1, y) -> f(I1, round(I1)) [I1 >= 1 && y = I1 - 1] The dependency graph for this problem is: 0 -> 0, 1 1 -> Where: 0) f#(I1, y) -> f#(I1, round(I1)) [I1 >= 1 && y = I1 - 1] 1) f#(I1, y) -> round#(I1) [I1 >= 1 && y = I1 - 1] We have the following SCCs. { 0 } DP problem for innermost termination. P = f#(I1, y) -> f#(I1, round(I1)) [I1 >= 1 && y = I1 - 1] R = round(x) -> x + 1 round(I0) -> I0 f(I1, y) -> f(I1, round(I1)) [I1 >= 1 && y = I1 - 1] popout

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

job log

popout

actions

all output return to Integer TRS Innermost