/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_.01, v_1, v_a, v_b, v_r) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_1, v_a, v_b, v_r)) :|: TRUE
eval_foo_bb0_in(v_.0, v_.01, v_1, v_a, v_b, v_r) -> Com_1(eval_foo_bb1_in(v_a, v_b, v_1, v_a, v_b, v_r)) :|: TRUE
eval_foo_bb1_in(v_.0, v_.01, v_1, v_a, v_b, v_r) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_1, v_a, v_b, v_r)) :|: v_.01 > 0
eval_foo_bb1_in(v_.0, v_.01, v_1, v_a, v_b, v_r) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_1, v_a, v_b, v_r)) :|: v_.01 <= 0
eval_foo_bb2_in(v_.0, v_.01, v_1, v_a, v_b, v_r) -> Com_1(eval_foo_0(v_.0, v_.01, v_1, v_a, v_b, v_r)) :|: TRUE
eval_foo_0(v_.0, v_.01, v_1, v_a, v_b, v_r) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_1, v_a, v_b, v_r), eval_foo_1(v_.0, v_.01, nondef.0, v_a, v_b, v_r)) :|: TRUE
eval_foo_1(v_.0, v_.01, v_1, v_a, v_b, v_r) -> Com_1(eval_foo_bb1_in(v_.0 - v_1 - 1, v_.0 - v_1 - 1, v_1, v_a, v_b, v_r)) :|: TRUE
eval_foo_bb3_in(v_.0, v_.01, v_1, v_a, v_b, v_r) -> Com_1(eval_foo_stop(v_.0, v_.01, v_1, v_a, v_b, v_r)) :|: TRUE

The start-symbols are:[eval_foo_start_6]