/export/starexec/sandbox/solver/bin/starexec_run_c_complexity /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


MAYBE
proof of /export/starexec/sandbox/output/output_files/bench.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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_i, v_j, v_n, v_t) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_i, v_j, v_n, v_t)) :|: TRUE
eval_foo_bb0_in(v_.0, v_.01, v_i, v_j, v_n, v_t) -> Com_1(eval_foo_bb1_in(0, 1, v_i, v_j, v_n, v_t)) :|: TRUE
eval_foo_bb1_in(v_.0, v_.01, v_i, v_j, v_n, v_t) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_i, v_j, v_n, v_t)) :|: v_.01 < v_n
eval_foo_bb1_in(v_.0, v_.01, v_i, v_j, v_n, v_t) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_i, v_j, v_n, v_t)) :|: v_.01 > v_n
eval_foo_bb1_in(v_.0, v_.01, v_i, v_j, v_n, v_t) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_i, v_j, v_n, v_t)) :|: v_.01 >= v_n && v_.01 <= v_n
eval_foo_bb2_in(v_.0, v_.01, v_i, v_j, v_n, v_t) -> Com_1(eval_foo_bb1_in(v_.01, v_.01 + v_.0, v_i, v_j, v_n, v_t)) :|: TRUE
eval_foo_bb3_in(v_.0, v_.01, v_i, v_j, v_n, v_t) -> Com_1(eval_foo_stop(v_.0, v_.01, v_i, v_j, v_n, v_t)) :|: TRUE

The start-symbols are:[eval_foo_start_6]