4.36/3.33	MAYBE
4.42/3.34	proof of /export/starexec/sandbox/output/output_files/bench.koat
4.42/3.34	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.42/3.34	
4.42/3.34	
4.42/3.34	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
4.42/3.34	
4.42/3.34	(0) CpxIntTrs
4.42/3.34	
4.42/3.34	
4.42/3.34	----------------------------------------
4.42/3.34	
4.42/3.34	(0)
4.42/3.34	Obligation:
4.42/3.34	Complexity Int TRS consisting of the following rules:
4.42/3.34	eval_foo_start(v_.0, v_1, v_x) -> Com_1(eval_foo_bb0_in(v_.0, v_1, v_x)) :|: TRUE
4.42/3.34	eval_foo_bb0_in(v_.0, v_1, v_x) -> Com_1(eval_foo_bb1_in(v_x, v_1, v_x)) :|: TRUE
4.42/3.34	eval_foo_bb1_in(v_.0, v_1, v_x) -> Com_1(eval_foo_bb2_in(v_.0, v_1, v_x)) :|: v_.0 <= 100
4.42/3.34	eval_foo_bb1_in(v_.0, v_1, v_x) -> Com_1(eval_foo_bb5_in(v_.0, v_1, v_x)) :|: v_.0 > 100
4.42/3.34	eval_foo_bb2_in(v_.0, v_1, v_x) -> Com_1(eval_foo_0(v_.0, v_1, v_x)) :|: TRUE
4.42/3.34	eval_foo_0(v_.0, v_1, v_x) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_1, v_x), eval_foo_1(v_.0, nondef.0, v_x)) :|: TRUE
4.42/3.34	eval_foo_1(v_.0, v_1, v_x) -> Com_1(eval_foo_bb3_in(v_.0, v_1, v_x)) :|: v_1 < 0
4.42/3.34	eval_foo_1(v_.0, v_1, v_x) -> Com_1(eval_foo_bb3_in(v_.0, v_1, v_x)) :|: v_1 > 0
4.42/3.34	eval_foo_1(v_.0, v_1, v_x) -> Com_1(eval_foo_bb4_in(v_.0, v_1, v_x)) :|: v_1 >= 0 && v_1 <= 0
4.42/3.34	eval_foo_bb3_in(v_.0, v_1, v_x) -> Com_1(eval_foo_bb1_in(-(2) * v_.0 + 2, v_1, v_x)) :|: TRUE
4.42/3.34	eval_foo_bb4_in(v_.0, v_1, v_x) -> Com_1(eval_foo_bb1_in(-(3) * v_.0 - 2, v_1, v_x)) :|: TRUE
4.42/3.34	eval_foo_bb5_in(v_.0, v_1, v_x) -> Com_1(eval_foo_stop(v_.0, v_1, v_x)) :|: TRUE
4.42/3.34	
4.42/3.34	The start-symbols are:[eval_foo_start_3]
4.42/3.34	
4.42/3.37	EOF