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


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


WORST_CASE(?, O(1))
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, 1).

(0) CpxIntTrs
(1) Koat Proof [FINISHED, 50 ms]
(2) BOUNDS(1, 1)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
eval_foo_start(v_.0, v_.01, v_tmp, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_tmp, v_x, v_y)) :|: TRUE
eval_foo_bb0_in(v_.0, v_.01, v_tmp, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_tmp, v_x, v_y)) :|: TRUE
eval_foo_bb1_in(v_.0, v_.01, v_tmp, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.01, v_.0, v_tmp, v_x, v_y)) :|: v_.0 > v_.01
eval_foo_bb1_in(v_.0, v_.01, v_tmp, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_tmp, v_x, v_y)) :|: v_.0 <= v_.01
eval_foo_bb2_in(v_.0, v_.01, v_tmp, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_tmp, v_x, v_y)) :|: TRUE

The start-symbols are:[eval_foo_start_5]


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

(1) Koat Proof (FINISHED)
YES(?, 7)



Initial complexity problem:

1:	T:

		(Comp: ?, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3))

		(Comp: ?, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3))

		(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_0, ar_3)) [ ar_0 >= ar_2 + 1 ]

		(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_0 ]

		(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3))

		(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]

	start location:	koat_start

	leaf cost:	0



Repeatedly propagating knowledge in problem 1 produces the following problem:

2:	T:

		(Comp: 1, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3))

		(Comp: 1, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3))

		(Comp: 1, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_0, ar_3)) [ ar_0 >= ar_2 + 1 ]

		(Comp: 2, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_0 ]

		(Comp: 2, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3))

		(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]

	start location:	koat_start

	leaf cost:	0



Complexity upper bound 7



Time: 0.029 sec (SMT: 0.027 sec)


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

(2)
BOUNDS(1, 1)