/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_gcd_start(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb0_in(v_.0, v_.01, v_x, v_y)) :|: TRUE
eval_gcd_bb0_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb3_in(v_.0, v_.01, v_x, v_y)) :|: v_x <= 0
eval_gcd_bb0_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb3_in(v_.0, v_.01, v_x, v_y)) :|: v_y <= 0
eval_gcd_bb0_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb1_in(v_x, v_y, v_x, v_y)) :|: v_x > 0 && v_y > 0
eval_gcd_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb2_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 < v_.01
eval_gcd_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb2_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 > v_.01
eval_gcd_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb3_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 >= v_.01 && v_.0 <= v_.01
eval_gcd_bb2_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb1_in(v_.0, v_.01 - v_.0, v_x, v_y)) :|: v_.0 < v_.01
eval_gcd_bb2_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb1_in(v_.0 - v_.01, v_.01 - v_.0, v_x, v_y)) :|: v_.0 < v_.01 && v_.0 >= v_.01
eval_gcd_bb2_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb1_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 >= v_.01 && v_.0 < v_.01
eval_gcd_bb2_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_bb1_in(v_.0 - v_.01, v_.01, v_x, v_y)) :|: v_.0 >= v_.01
eval_gcd_bb3_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_gcd_stop(v_.0, v_.01, v_x, v_y)) :|: TRUE

The start-symbols are:[eval_gcd_start_4]