details

property	value
status	complete
benchmark	Ex03.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n018.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.7177 seconds
cpu usage	2.59703
user time	2.35704
system time	0.239989
max virtual memory	1.8443084E7
max residence set size	179404.0

stage attributes

key	value
starexec-result	MAYBE

output

2.45/1.68 MAYBE 2.54/1.69 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.54/1.69 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.54/1.69 2.54/1.69 2.54/1.69 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). 2.54/1.69 2.54/1.69 (0) CpxIntTrs 2.54/1.69 2.54/1.69 2.54/1.69 ---------------------------------------- 2.54/1.69 2.54/1.69 (0) 2.54/1.69 Obligation: 2.54/1.69 Complexity Int TRS consisting of the following rules: 2.54/1.69 eval_foo_start(v_.0, v_i) -> Com_1(eval_foo_bb0_in(v_.0, v_i)) :|: TRUE 2.54/1.69 eval_foo_bb0_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_i, v_i)) :|: TRUE 2.54/1.69 eval_foo_bb1_in(v_.0, v_i) -> Com_1(eval_foo_bb2_in(v_.0, v_i)) :|: v_.0 < 0 2.54/1.69 eval_foo_bb1_in(v_.0, v_i) -> Com_1(eval_foo_bb3_in(v_.0, v_i)) :|: v_.0 >= 0 2.54/1.69 eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_i)) :|: v_.0 < -(5) 2.54/1.69 eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_i)) :|: v_.0 > -(5) 2.54/1.69 eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_.0, v_i)) :|: v_.0 >= -(5) && v_.0 <= -(5) 2.54/1.69 eval_foo_bb3_in(v_.0, v_i) -> Com_1(eval_foo_stop(v_.0, v_i)) :|: TRUE 2.54/1.69 2.54/1.69 The start-symbols are:[eval_foo_start_2] 2.54/1.69 2.54/1.71 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