details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.67514204979 seconds
cpu usage	2.728119286
max memory	2.94580224E8

stage attributes

key	value
output-size	1435
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/output/output_files/bench.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). (0) CpxIntTrs ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_foo_start(v_.0, v_i) -> Com_1(eval_foo_bb0_in(v_.0, v_i)) :|: TRUE eval_foo_bb0_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(3, v_i)) :|: TRUE eval_foo_bb1_in(v_.0, v_i) -> Com_1(eval_foo_bb2_in(v_.0, v_i)) :|: v_.0 >= 3 eval_foo_bb1_in(v_.0, v_i) -> Com_1(eval_foo_bb5_in(v_.0, v_i)) :|: v_.0 < 3 eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb3_in(v_.0, v_i)) :|: v_.0 > 5 eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb4_in(v_.0, v_i)) :|: v_.0 <= 5 eval_foo_bb3_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_.0 + 3, v_i)) :|: TRUE eval_foo_bb4_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_.0 - 2, v_i)) :|: v_.0 > 10 eval_foo_bb4_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_i)) :|: v_.0 <= 10 eval_foo_bb5_in(v_.0, v_i) -> Com_1(eval_foo_stop(v_.0, v_i)) :|: TRUE The start-symbols are:[eval_foo_start_2] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445