2.62/1.60	WORST_CASE(?, O(n^1))
2.62/1.61	proof of /export/starexec/sandbox/output/output_files/bench.koat
2.62/1.61	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.62/1.61	
2.62/1.61	
2.62/1.61	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1).
2.62/1.61	
2.62/1.61	(0) CpxIntTrs
2.62/1.61	(1) Koat Proof [FINISHED, 379 ms]
2.62/1.61	(2) BOUNDS(1, n^1)
2.62/1.61	
2.62/1.61	
2.62/1.61	----------------------------------------
2.62/1.61	
2.62/1.61	(0)
2.62/1.61	Obligation:
2.62/1.61	Complexity Int TRS consisting of the following rules:
2.62/1.61	eval_foo_start(v_.0, v_1, v_i) -> Com_1(eval_foo_bb0_in(v_.0, v_1, v_i)) :|: TRUE
2.62/1.61	eval_foo_bb0_in(v_.0, v_1, v_i) -> Com_1(eval_foo_bb1_in(v_i, v_1, v_i)) :|: TRUE
2.62/1.61	eval_foo_bb1_in(v_.0, v_1, v_i) -> Com_1(eval_foo_bb2_in(v_.0, v_1, v_i)) :|: v_.0 < 255
2.62/1.61	eval_foo_bb1_in(v_.0, v_1, v_i) -> Com_1(eval_foo_bb3_in(v_.0, v_1, v_i)) :|: v_.0 >= 255
2.62/1.61	eval_foo_bb2_in(v_.0, v_1, v_i) -> Com_1(eval_foo_0(v_.0, v_1, v_i)) :|: TRUE
2.62/1.61	eval_foo_0(v_.0, v_1, v_i) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_1, v_i), eval_foo_1(v_.0, nondef.0, v_i)) :|: TRUE
2.62/1.61	eval_foo_1(v_.0, v_1, v_i) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_1, v_i)) :|: v_1 < 0
2.62/1.61	eval_foo_1(v_.0, v_1, v_i) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_1, v_i)) :|: v_1 > 0
2.62/1.61	eval_foo_1(v_.0, v_1, v_i) -> Com_1(eval_foo_bb1_in(v_.0 + 2, v_1, v_i)) :|: v_1 >= 0 && v_1 <= 0
2.62/1.61	eval_foo_bb3_in(v_.0, v_1, v_i) -> Com_1(eval_foo_stop(v_.0, v_1, v_i)) :|: TRUE
2.62/1.61	
2.62/1.61	The start-symbols are:[eval_foo_start_3]
2.62/1.61	
2.62/1.61	
2.62/1.61	----------------------------------------
2.62/1.61	
2.62/1.61	(1) Koat Proof (FINISHED)
2.62/1.61	YES(?, 48*ar_1 + 12246)
2.62/1.61	
2.62/1.61	
2.62/1.61	
2.62/1.61	Initial complexity problem:
2.62/1.61	
2.62/1.61	1:	T:
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ 254 >= ar_0 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 255 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo0(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo00(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo01(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo1(ar_0, ar_1, ar_3, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo0(ar_0, ar_1, ar_2, ar_3) -> Com_2(evalfoo00(ar_0, ar_1, ar_2, e), evalfoo01(ar_0, ar_1, ar_2, e))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ 0 >= ar_2 + 1 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 >= 1 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 2, ar_1, ar_2, ar_3)) [ ar_2 = 0 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(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 ]
2.62/1.61	
2.62/1.61		start location:	koat_start
2.62/1.61	
2.62/1.61		leaf cost:	0
2.62/1.61	
2.62/1.61	
2.62/1.61	
2.62/1.61	Repeatedly propagating knowledge in problem 1 produces the following problem:
2.62/1.61	
2.62/1.61	2:	T:
2.62/1.61	
2.62/1.61			(Comp: 1, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: 1, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ 254 >= ar_0 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 255 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo0(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo00(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo01(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo1(ar_0, ar_1, ar_3, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo0(ar_0, ar_1, ar_2, ar_3) -> Com_2(evalfoo00(ar_0, ar_1, ar_2, e), evalfoo01(ar_0, ar_1, ar_2, e))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ 0 >= ar_2 + 1 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 >= 1 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 2, ar_1, ar_2, ar_3)) [ ar_2 = 0 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(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 ]
2.62/1.61	
2.62/1.61		start location:	koat_start
2.62/1.61	
2.62/1.61		leaf cost:	0
2.62/1.61	
2.62/1.61	
2.62/1.61	
2.62/1.61	A polynomial rank function with
2.62/1.61	
2.62/1.61		Pol(evalfoostart) = 2
2.62/1.61	
2.62/1.61		Pol(evalfoobb0in) = 2
2.62/1.61	
2.62/1.61		Pol(evalfoobb1in) = 2
2.62/1.61	
2.62/1.61		Pol(evalfoobb2in) = 2
2.62/1.61	
2.62/1.61		Pol(evalfoobb3in) = 1
2.62/1.61	
2.62/1.61		Pol(evalfoo0) = 2
2.62/1.61	
2.62/1.61		Pol(evalfoo00) = 0
2.62/1.61	
2.62/1.61		Pol(evalVERIFIERnondetintstart) = 0
2.62/1.61	
2.62/1.61		Pol(evalfoo01) = 2
2.62/1.61	
2.62/1.61		Pol(evalfoo1) = 2
2.62/1.61	
2.62/1.61		Pol(evalfoostop) = 0
2.62/1.61	
2.62/1.61		Pol(koat_start) = 2
2.62/1.61	
2.62/1.61	orients all transitions weakly and the transitions
2.62/1.61	
2.62/1.61		evalfoobb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61		evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 255 ]
2.62/1.61	
2.62/1.61	strictly and produces the following problem:
2.62/1.61	
2.62/1.61	3:	T:
2.62/1.61	
2.62/1.61			(Comp: 1, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: 1, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ 254 >= ar_0 ]
2.62/1.61	
2.62/1.61			(Comp: 2, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 255 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo0(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo00(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo01(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo1(ar_0, ar_1, ar_3, ar_3))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo0(ar_0, ar_1, ar_2, ar_3) -> Com_2(evalfoo00(ar_0, ar_1, ar_2, e), evalfoo01(ar_0, ar_1, ar_2, e))
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ 0 >= ar_2 + 1 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 >= 1 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 2, ar_1, ar_2, ar_3)) [ ar_2 = 0 ]
2.62/1.61	
2.62/1.61			(Comp: 2, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(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 ]
2.62/1.61	
2.62/1.61		start location:	koat_start
2.62/1.61	
2.62/1.61		leaf cost:	0
2.62/1.61	
2.62/1.61	
2.62/1.61	
2.62/1.61	Applied AI with 'oct' on problem 3 to obtain the following invariants:
2.62/1.61	
2.62/1.61	  For symbol evalfoo0: -X_2 + 254 >= 0 /\ X_1 - X_2 >= 0 /\ -X_1 - X_2 + 508 >= 0 /\ -X_1 + 254 >= 0
2.62/1.61	
2.62/1.61	  For symbol evalfoo00: -X_2 + 254 >= 0 /\ X_1 - X_2 >= 0 /\ -X_1 - X_2 + 508 >= 0 /\ -X_1 + 254 >= 0
2.62/1.61	
2.62/1.61	  For symbol evalfoo01: -X_2 + 254 >= 0 /\ X_1 - X_2 >= 0 /\ -X_1 - X_2 + 508 >= 0 /\ -X_1 + 254 >= 0
2.62/1.61	
2.62/1.61	  For symbol evalfoo1: X_3 - X_4 >= 0 /\ -X_3 + X_4 >= 0 /\ -X_2 + 254 >= 0 /\ X_1 - X_2 >= 0 /\ -X_1 - X_2 + 508 >= 0 /\ -X_1 + 254 >= 0
2.62/1.61	
2.62/1.61	  For symbol evalfoobb1in: X_1 - X_2 >= 0
2.62/1.61	
2.62/1.61	  For symbol evalfoobb2in: -X_2 + 254 >= 0 /\ X_1 - X_2 >= 0 /\ -X_1 - X_2 + 508 >= 0 /\ -X_1 + 254 >= 0
2.62/1.61	
2.62/1.61	  For symbol evalfoobb3in: X_1 - X_2 >= 0 /\ X_1 - 255 >= 0
2.62/1.61	
2.62/1.61	
2.62/1.61	
2.62/1.61	
2.62/1.61	
2.62/1.61	This yielded the following problem:
2.62/1.61	
2.62/1.61	4:	T:
2.62/1.61	
2.62/1.61			(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 ]
2.62/1.61	
2.62/1.61			(Comp: 2, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_1 >= 0 /\ ar_0 - 255 >= 0 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 2, ar_1, ar_2, ar_3)) [ ar_2 - ar_3 >= 0 /\ -ar_2 + ar_3 >= 0 /\ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 /\ ar_2 = 0 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 - ar_3 >= 0 /\ -ar_2 + ar_3 >= 0 /\ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 /\ ar_2 >= 1 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 - ar_3 >= 0 /\ -ar_2 + ar_3 >= 0 /\ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 /\ 0 >= ar_2 + 1 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo0(ar_0, ar_1, ar_2, ar_3) -> Com_2(evalfoo00(ar_0, ar_1, ar_2, e), evalfoo01(ar_0, ar_1, ar_2, e)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo01(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo1(ar_0, ar_1, ar_3, ar_3)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoo00(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo0(ar_0, ar_1, ar_2, ar_3)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61			(Comp: 2, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_1 >= 0 /\ ar_0 >= 255 ]
2.62/1.61	
2.62/1.61			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_1 >= 0 /\ 254 >= ar_0 ]
2.62/1.61	
2.62/1.61			(Comp: 1, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: 1, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61		start location:	koat_start
2.62/1.61	
2.62/1.61		leaf cost:	0
2.62/1.61	
2.62/1.61	
2.62/1.61	
2.62/1.61	A polynomial rank function with
2.62/1.61	
2.62/1.61		Pol(koat_start) = -6*V_2 + 1530
2.62/1.61	
2.62/1.61		Pol(evalfoostart) = -6*V_2 + 1530
2.62/1.61	
2.62/1.61		Pol(evalfoobb3in) = -6*V_1
2.62/1.61	
2.62/1.61		Pol(evalfoostop) = -6*V_1
2.62/1.61	
2.62/1.61		Pol(evalfoo1) = -6*V_1 + 1525
2.62/1.61	
2.62/1.61		Pol(evalfoobb1in) = -6*V_1 + 1530
2.62/1.61	
2.62/1.61		Pol(evalfoo0) = -6*V_1 + 1528
2.62/1.61	
2.62/1.61		Pol(evalfoo00) = 1
2.62/1.61	
2.62/1.61		Pol(evalfoo01) = -6*V_1 + 1526
2.62/1.61	
2.62/1.61		Pol(evalVERIFIERnondetintstart) = 0
2.62/1.61	
2.62/1.61		Pol(evalfoobb2in) = -6*V_1 + 1529
2.62/1.61	
2.62/1.61		Pol(evalfoobb0in) = -6*V_2 + 1530
2.62/1.61	
2.62/1.61	orients all transitions weakly and the transitions
2.62/1.61	
2.62/1.61		evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo0(ar_0, ar_1, ar_2, ar_3)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61		evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_1 >= 0 /\ 254 >= ar_0 ]
2.62/1.61	
2.62/1.61		evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 2, ar_1, ar_2, ar_3)) [ ar_2 - ar_3 >= 0 /\ -ar_2 + ar_3 >= 0 /\ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 /\ ar_2 = 0 ]
2.62/1.61	
2.62/1.61		evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 - ar_3 >= 0 /\ -ar_2 + ar_3 >= 0 /\ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 /\ ar_2 >= 1 ]
2.62/1.61	
2.62/1.61		evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 - ar_3 >= 0 /\ -ar_2 + ar_3 >= 0 /\ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 /\ 0 >= ar_2 + 1 ]
2.62/1.61	
2.62/1.61		evalfoo01(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo1(ar_0, ar_1, ar_3, ar_3)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61		evalfoo00(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61		evalfoo0(ar_0, ar_1, ar_2, ar_3) -> Com_2(evalfoo00(ar_0, ar_1, ar_2, e), evalfoo01(ar_0, ar_1, ar_2, e)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61	strictly and produces the following problem:
2.62/1.61	
2.62/1.61	5:	T:
2.62/1.61	
2.62/1.61			(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 ]
2.62/1.61	
2.62/1.61			(Comp: 2, Cost: 1)                evalfoobb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_1 >= 0 /\ ar_0 - 255 >= 0 ]
2.62/1.61	
2.62/1.61			(Comp: 6*ar_1 + 1530, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 2, ar_1, ar_2, ar_3)) [ ar_2 - ar_3 >= 0 /\ -ar_2 + ar_3 >= 0 /\ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 /\ ar_2 = 0 ]
2.62/1.61	
2.62/1.61			(Comp: 6*ar_1 + 1530, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 - ar_3 >= 0 /\ -ar_2 + ar_3 >= 0 /\ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 /\ ar_2 >= 1 ]
2.62/1.61	
2.62/1.61			(Comp: 6*ar_1 + 1530, Cost: 1)    evalfoo1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_2 - ar_3 >= 0 /\ -ar_2 + ar_3 >= 0 /\ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 /\ 0 >= ar_2 + 1 ]
2.62/1.61	
2.62/1.61			(Comp: 6*ar_1 + 1530, Cost: 1)    evalfoo0(ar_0, ar_1, ar_2, ar_3) -> Com_2(evalfoo00(ar_0, ar_1, ar_2, e), evalfoo01(ar_0, ar_1, ar_2, e)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61			(Comp: 6*ar_1 + 1530, Cost: 1)    evalfoo01(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo1(ar_0, ar_1, ar_3, ar_3)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61			(Comp: 6*ar_1 + 1530, Cost: 1)    evalfoo00(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61			(Comp: 6*ar_1 + 1530, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoo0(ar_0, ar_1, ar_2, ar_3)) [ -ar_1 + 254 >= 0 /\ ar_0 - ar_1 >= 0 /\ -ar_0 - ar_1 + 508 >= 0 /\ -ar_0 + 254 >= 0 ]
2.62/1.61	
2.62/1.61			(Comp: 2, Cost: 1)                evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_1 >= 0 /\ ar_0 >= 255 ]
2.62/1.61	
2.62/1.61			(Comp: 6*ar_1 + 1530, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_1 >= 0 /\ 254 >= ar_0 ]
2.62/1.61	
2.62/1.61			(Comp: 1, Cost: 1)                evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61			(Comp: 1, Cost: 1)                evalfoostart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3))
2.62/1.61	
2.62/1.61		start location:	koat_start
2.62/1.61	
2.62/1.61		leaf cost:	0
2.62/1.61	
2.62/1.61	
2.62/1.61	
2.62/1.61	Complexity upper bound 48*ar_1 + 12246
2.62/1.61	
2.62/1.61	
2.62/1.61	
2.62/1.61	Time: 0.354 sec (SMT: 0.307 sec)
2.62/1.61	
2.62/1.61	
2.62/1.61	----------------------------------------
2.62/1.61	
2.62/1.61	(2)
2.62/1.61	BOUNDS(1, n^1)
2.62/1.63	EOF