2.72/1.97	MAYBE
2.72/1.98	proof of /export/starexec/sandbox/output/output_files/bench.koat
2.72/1.98	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.72/1.98	
2.72/1.98	
2.72/1.98	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
2.72/1.98	
2.72/1.98	(0) CpxIntTrs
2.72/1.98	
2.72/1.98	
2.72/1.98	----------------------------------------
2.72/1.98	
2.72/1.98	(0)
2.72/1.98	Obligation:
2.72/1.98	Complexity Int TRS consisting of the following rules:
2.72/1.98	eval_foo_start(v_.1, v_2, v_i, v_k) -> Com_1(eval_foo_bb0_in(v_.1, v_2, v_i, v_k)) :|: TRUE
2.72/1.98	eval_foo_bb0_in(v_.1, v_2, v_i, v_k) -> Com_1(eval_foo_bb1_in(v_i, v_2, v_i, v_k)) :|: v_k >= 0
2.72/1.98	eval_foo_bb0_in(v_.1, v_2, v_i, v_k) -> Com_1(eval_foo_bb1_in(-(1), v_2, v_i, v_k)) :|: v_k < 0
2.72/1.98	eval_foo_bb1_in(v_.1, v_2, v_i, v_k) -> Com_1(eval_foo_bb2_in(v_.1, v_2, v_i, v_k)) :|: v_.1 >= 0
2.72/1.98	eval_foo_bb1_in(v_.1, v_2, v_i, v_k) -> Com_1(eval_foo_bb3_in(v_.1, v_2, v_i, v_k)) :|: v_.1 < 0
2.72/1.98	eval_foo_bb2_in(v_.1, v_2, v_i, v_k) -> Com_1(eval_foo_2(v_.1, v_2, v_i, v_k)) :|: TRUE
2.72/1.98	eval_foo_2(v_.1, v_2, v_i, v_k) -> Com_2(eval___VERIFIER_nondet_int_start(v_.1, v_2, v_i, v_k), eval_foo_3(v_.1, nondef.0, v_i, v_k)) :|: TRUE
2.72/1.98	eval_foo_3(v_.1, v_2, v_i, v_k) -> Com_1(eval_foo_bb1_in(v_2, v_2, v_i, v_k)) :|: TRUE
2.72/1.98	eval_foo_bb3_in(v_.1, v_2, v_i, v_k) -> Com_1(eval_foo_stop(v_.1, v_2, v_i, v_k)) :|: TRUE
2.72/1.98	
2.72/1.98	The start-symbols are:[eval_foo_start_4]
2.72/1.98	
2.80/2.00	EOF