/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1).

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


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
eval_foo_start -> Com_1(eval_foo_stop) :|: TRUE

The start-symbols are:[eval_foo_start]


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

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



Initial complexity problem:

1:	T:

		(Comp: ?, Cost: 1)    evalfoostart() -> Com_1(evalfoostop())

		(Comp: 1, Cost: 0)    koat_start() -> Com_1(evalfoostart()) [ 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() -> Com_1(evalfoostop())

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

	start location:	koat_start

	leaf cost:	0



Complexity upper bound 1



Time: 0.001 sec (SMT: 0.001 sec)


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

(2)
BOUNDS(1, 1)