details

property	value
status	complete
benchmark	ChenFlurMukhopadhyay-SAS2012-Ex2.02_false-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n154.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	3.21904 seconds
cpu usage	4.1121
user time	3.81805
system time	0.294057
max virtual memory	1.8510328E7
max residence set size	183304.0

stage attributes

key	value
starexec-result	MAYBE

output

4.00/3.18 MAYBE 4.00/3.19 proof of /export/starexec/sandbox/output/output_files/bench.koat 4.00/3.19 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.00/3.19 4.00/3.19 4.00/3.19 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). 4.00/3.19 4.00/3.19 (0) CpxIntTrs 4.00/3.19 4.00/3.19 4.00/3.19 ---------------------------------------- 4.00/3.19 4.00/3.19 (0) 4.00/3.19 Obligation: 4.00/3.19 Complexity Int TRS consisting of the following rules: 4.00/3.19 eval_foo_start(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_x, v_y)) :|: TRUE 4.00/3.19 eval_foo_bb0_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_x, v_y)) :|: TRUE 4.00/3.19 eval_foo_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 < 0 4.00/3.19 eval_foo_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 >= 0 4.00/3.19 eval_foo_bb2_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0 + v_.01, v_.01 - 1, v_x, v_y)) :|: TRUE 4.00/3.19 eval_foo_bb3_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_x, v_y)) :|: TRUE 4.00/3.19 4.00/3.19 The start-symbols are:[eval_foo_start_4] 4.00/3.19 4.00/3.21 EOF popout

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

job log

popout

actions

all output return to Complexity_C_Integer 2019-03-21 04.38