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


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


WORST_CASE(?, O(n^1))
proof of /export/starexec/sandbox/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, n^1).

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


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
eval_zwritehexstring_at_extracted_start(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb0_in(v_.0, v_.0., v_count.0, v_len)) :|: TRUE
eval_zwritehexstring_at_extracted_bb0_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb1_in(v_len, v_.0., v_count.0, v_len)) :|: TRUE
eval_zwritehexstring_at_extracted_bb1_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb2_in(v_.0, v_.0., v_count.0, v_len)) :|: v_.0 > 0
eval_zwritehexstring_at_extracted_bb1_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb5_in(v_.0, v_.0., v_count.0, v_len)) :|: v_.0 <= 0
eval_zwritehexstring_at_extracted_bb2_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb3_in(v_.0, v_.0, v_.0, v_len)) :|: v_.0 < 64
eval_zwritehexstring_at_extracted_bb2_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb3_in(v_.0, 64, 64, v_len)) :|: v_.0 >= 64
eval_zwritehexstring_at_extracted_bb3_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb3_in(v_.0, v_.0., v_count.0 - 1, v_len)) :|: v_count.0 - 1 > 0
eval_zwritehexstring_at_extracted_bb3_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb4_in(v_.0, v_.0., v_count.0, v_len)) :|: v_count.0 - 1 <= 0
eval_zwritehexstring_at_extracted_bb4_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb1_in(v_.0 - v_.0., v_.0., v_count.0, v_len)) :|: TRUE
eval_zwritehexstring_at_extracted_bb5_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_stop(v_.0, v_.0., v_count.0, v_len)) :|: TRUE

The start-symbols are:[eval_zwritehexstring_at_extracted_start_4]


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

(1) Koat Proof (FINISHED)
YES(?, 402*ar_1 + 6)



Initial complexity problem:

1:	T:

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3))

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_1, ar_1, ar_2, ar_3))

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

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_0, ar_0)) [ 63 >= ar_0 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, 64, 64)) [ ar_0 >= 64 ]

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

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

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_0 - ar_2, ar_1, ar_2, ar_3))

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedstop(ar_0, ar_1, ar_2, ar_3))

		(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedstart(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)    evalzwritehexstringatextractedstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3))

		(Comp: 1, Cost: 1)    evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_1, ar_1, ar_2, ar_3))

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

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_0, ar_0)) [ 63 >= ar_0 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, 64, 64)) [ ar_0 >= 64 ]

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

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

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_0 - ar_2, ar_1, ar_2, ar_3))

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedstop(ar_0, ar_1, ar_2, ar_3))

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

	start location:	koat_start

	leaf cost:	0



A polynomial rank function with

	Pol(evalzwritehexstringatextractedstart) = 2

	Pol(evalzwritehexstringatextractedbb0in) = 2

	Pol(evalzwritehexstringatextractedbb1in) = 2

	Pol(evalzwritehexstringatextractedbb2in) = 2

	Pol(evalzwritehexstringatextractedbb5in) = 1

	Pol(evalzwritehexstringatextractedbb3in) = 2

	Pol(evalzwritehexstringatextractedbb4in) = 2

	Pol(evalzwritehexstringatextractedstop) = 0

	Pol(koat_start) = 2

orients all transitions weakly and the transitions

	evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedstop(ar_0, ar_1, ar_2, ar_3))

	evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ]

strictly and produces the following problem:

3:	T:

		(Comp: 1, Cost: 1)    evalzwritehexstringatextractedstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3))

		(Comp: 1, Cost: 1)    evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_1, ar_1, ar_2, ar_3))

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

		(Comp: 2, Cost: 1)    evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_0, ar_0)) [ 63 >= ar_0 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, 64, 64)) [ ar_0 >= 64 ]

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

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

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_0 - ar_2, ar_1, ar_2, ar_3))

		(Comp: 2, Cost: 1)    evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedstop(ar_0, ar_1, ar_2, ar_3))

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

	start location:	koat_start

	leaf cost:	0



Applied AI with 'oct' on problem 3 to obtain the following invariants:

  For symbol evalzwritehexstringatextractedbb1in: -X_1 + X_2 >= 0

  For symbol evalzwritehexstringatextractedbb2in: X_2 - 1 >= 0 /\ X_1 + X_2 - 2 >= 0 /\ -X_1 + X_2 >= 0 /\ X_1 - 1 >= 0

  For symbol evalzwritehexstringatextractedbb3in: -X_4 + 64 >= 0 /\ X_3 - X_4 >= 0 /\ -X_3 - X_4 + 128 >= 0 /\ X_2 - X_4 >= 0 /\ X_1 - X_4 >= 0 /\ X_4 - 1 >= 0 /\ X_3 + X_4 - 2 >= 0 /\ -X_3 + X_4 + 63 >= 0 /\ X_2 + X_4 - 2 >= 0 /\ X_1 + X_4 - 2 >= 0 /\ -X_3 + 64 >= 0 /\ X_2 - X_3 >= 0 /\ X_1 - X_3 >= 0 /\ X_3 - 1 >= 0 /\ X_2 + X_3 - 2 >= 0 /\ X_1 + X_3 - 2 >= 0 /\ X_2 - 1 >= 0 /\ X_1 + X_2 - 2 >= 0 /\ -X_1 + X_2 >= 0 /\ X_1 - 1 >= 0

  For symbol evalzwritehexstringatextractedbb4in: -X_4 + 1 >= 0 /\ X_3 - X_4 >= 0 /\ -X_3 - X_4 + 65 >= 0 /\ X_2 - X_4 >= 0 /\ X_1 - X_4 >= 0 /\ X_4 - 1 >= 0 /\ X_3 + X_4 - 2 >= 0 /\ -X_3 + X_4 + 63 >= 0 /\ X_2 + X_4 - 2 >= 0 /\ X_1 + X_4 - 2 >= 0 /\ -X_3 + 64 >= 0 /\ X_2 - X_3 >= 0 /\ X_1 - X_3 >= 0 /\ X_3 - 1 >= 0 /\ X_2 + X_3 - 2 >= 0 /\ X_1 + X_3 - 2 >= 0 /\ X_2 - 1 >= 0 /\ X_1 + X_2 - 2 >= 0 /\ -X_1 + X_2 >= 0 /\ X_1 - 1 >= 0

  For symbol evalzwritehexstringatextractedbb5in: -X_1 + X_2 >= 0 /\ -X_1 >= 0





This yielded the following problem:

4:	T:

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

		(Comp: 2, Cost: 1)    evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedstop(ar_0, ar_1, ar_2, ar_3)) [ -ar_0 + ar_1 >= 0 /\ -ar_0 >= 0 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_0 - ar_2, ar_1, ar_2, ar_3)) [ -ar_3 + 1 >= 0 /\ ar_2 - ar_3 >= 0 /\ -ar_2 - ar_3 + 65 >= 0 /\ ar_1 - ar_3 >= 0 /\ ar_0 - ar_3 >= 0 /\ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 2 >= 0 /\ -ar_2 + ar_3 + 63 >= 0 /\ ar_1 + ar_3 - 2 >= 0 /\ ar_0 + ar_3 - 2 >= 0 /\ -ar_2 + 64 >= 0 /\ ar_1 - ar_2 >= 0 /\ ar_0 - ar_2 >= 0 /\ ar_2 - 1 >= 0 /\ ar_1 + ar_2 - 2 >= 0 /\ ar_0 + ar_2 - 2 >= 0 /\ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3)) [ -ar_3 + 64 >= 0 /\ ar_2 - ar_3 >= 0 /\ -ar_2 - ar_3 + 128 >= 0 /\ ar_1 - ar_3 >= 0 /\ ar_0 - ar_3 >= 0 /\ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 2 >= 0 /\ -ar_2 + ar_3 + 63 >= 0 /\ ar_1 + ar_3 - 2 >= 0 /\ ar_0 + ar_3 - 2 >= 0 /\ -ar_2 + 64 >= 0 /\ ar_1 - ar_2 >= 0 /\ ar_0 - ar_2 >= 0 /\ ar_2 - 1 >= 0 /\ ar_1 + ar_2 - 2 >= 0 /\ ar_0 + ar_2 - 2 >= 0 /\ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ 1 >= ar_3 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3 - 1)) [ -ar_3 + 64 >= 0 /\ ar_2 - ar_3 >= 0 /\ -ar_2 - ar_3 + 128 >= 0 /\ ar_1 - ar_3 >= 0 /\ ar_0 - ar_3 >= 0 /\ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 2 >= 0 /\ -ar_2 + ar_3 + 63 >= 0 /\ ar_1 + ar_3 - 2 >= 0 /\ ar_0 + ar_3 - 2 >= 0 /\ -ar_2 + 64 >= 0 /\ ar_1 - ar_2 >= 0 /\ ar_0 - ar_2 >= 0 /\ ar_2 - 1 >= 0 /\ ar_1 + ar_2 - 2 >= 0 /\ ar_0 + ar_2 - 2 >= 0 /\ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ ar_3 >= 2 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, 64, 64)) [ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ ar_0 >= 64 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_0, ar_0)) [ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ 63 >= ar_0 ]

		(Comp: 2, Cost: 1)    evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3)) [ -ar_0 + ar_1 >= 0 /\ 0 >= ar_0 ]

		(Comp: ?, Cost: 1)    evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3)) [ -ar_0 + ar_1 >= 0 /\ ar_0 >= 1 ]

		(Comp: 1, Cost: 1)    evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_1, ar_1, ar_2, ar_3))

		(Comp: 1, Cost: 1)    evalzwritehexstringatextractedstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3))

	start location:	koat_start

	leaf cost:	0



A polynomial rank function with

	Pol(koat_start) = 67*V_2

	Pol(evalzwritehexstringatextractedstart) = 67*V_2

	Pol(evalzwritehexstringatextractedbb5in) = 67*V_1

	Pol(evalzwritehexstringatextractedstop) = 67*V_1

	Pol(evalzwritehexstringatextractedbb4in) = 67*V_1 - 67*V_3 + 68*V_4 - 67

	Pol(evalzwritehexstringatextractedbb1in) = 67*V_1

	Pol(evalzwritehexstringatextractedbb3in) = 67*V_1 + V_4 - 66

	Pol(evalzwritehexstringatextractedbb2in) = 67*V_1 - 1

	Pol(evalzwritehexstringatextractedbb0in) = 67*V_2

orients all transitions weakly and the transitions

	evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_0 - ar_2, ar_1, ar_2, ar_3)) [ -ar_3 + 1 >= 0 /\ ar_2 - ar_3 >= 0 /\ -ar_2 - ar_3 + 65 >= 0 /\ ar_1 - ar_3 >= 0 /\ ar_0 - ar_3 >= 0 /\ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 2 >= 0 /\ -ar_2 + ar_3 + 63 >= 0 /\ ar_1 + ar_3 - 2 >= 0 /\ ar_0 + ar_3 - 2 >= 0 /\ -ar_2 + 64 >= 0 /\ ar_1 - ar_2 >= 0 /\ ar_0 - ar_2 >= 0 /\ ar_2 - 1 >= 0 /\ ar_1 + ar_2 - 2 >= 0 /\ ar_0 + ar_2 - 2 >= 0 /\ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 ]

	evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3)) [ -ar_3 + 64 >= 0 /\ ar_2 - ar_3 >= 0 /\ -ar_2 - ar_3 + 128 >= 0 /\ ar_1 - ar_3 >= 0 /\ ar_0 - ar_3 >= 0 /\ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 2 >= 0 /\ -ar_2 + ar_3 + 63 >= 0 /\ ar_1 + ar_3 - 2 >= 0 /\ ar_0 + ar_3 - 2 >= 0 /\ -ar_2 + 64 >= 0 /\ ar_1 - ar_2 >= 0 /\ ar_0 - ar_2 >= 0 /\ ar_2 - 1 >= 0 /\ ar_1 + ar_2 - 2 >= 0 /\ ar_0 + ar_2 - 2 >= 0 /\ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ 1 >= ar_3 ]

	evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3 - 1)) [ -ar_3 + 64 >= 0 /\ ar_2 - ar_3 >= 0 /\ -ar_2 - ar_3 + 128 >= 0 /\ ar_1 - ar_3 >= 0 /\ ar_0 - ar_3 >= 0 /\ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 2 >= 0 /\ -ar_2 + ar_3 + 63 >= 0 /\ ar_1 + ar_3 - 2 >= 0 /\ ar_0 + ar_3 - 2 >= 0 /\ -ar_2 + 64 >= 0 /\ ar_1 - ar_2 >= 0 /\ ar_0 - ar_2 >= 0 /\ ar_2 - 1 >= 0 /\ ar_1 + ar_2 - 2 >= 0 /\ ar_0 + ar_2 - 2 >= 0 /\ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ ar_3 >= 2 ]

	evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, 64, 64)) [ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ ar_0 >= 64 ]

	evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_0, ar_0)) [ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ 63 >= ar_0 ]

	evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3)) [ -ar_0 + ar_1 >= 0 /\ ar_0 >= 1 ]

strictly and produces the following problem:

5:	T:

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

		(Comp: 2, Cost: 1)          evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedstop(ar_0, ar_1, ar_2, ar_3)) [ -ar_0 + ar_1 >= 0 /\ -ar_0 >= 0 ]

		(Comp: 67*ar_1, Cost: 1)    evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_0 - ar_2, ar_1, ar_2, ar_3)) [ -ar_3 + 1 >= 0 /\ ar_2 - ar_3 >= 0 /\ -ar_2 - ar_3 + 65 >= 0 /\ ar_1 - ar_3 >= 0 /\ ar_0 - ar_3 >= 0 /\ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 2 >= 0 /\ -ar_2 + ar_3 + 63 >= 0 /\ ar_1 + ar_3 - 2 >= 0 /\ ar_0 + ar_3 - 2 >= 0 /\ -ar_2 + 64 >= 0 /\ ar_1 - ar_2 >= 0 /\ ar_0 - ar_2 >= 0 /\ ar_2 - 1 >= 0 /\ ar_1 + ar_2 - 2 >= 0 /\ ar_0 + ar_2 - 2 >= 0 /\ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 ]

		(Comp: 67*ar_1, Cost: 1)    evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3)) [ -ar_3 + 64 >= 0 /\ ar_2 - ar_3 >= 0 /\ -ar_2 - ar_3 + 128 >= 0 /\ ar_1 - ar_3 >= 0 /\ ar_0 - ar_3 >= 0 /\ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 2 >= 0 /\ -ar_2 + ar_3 + 63 >= 0 /\ ar_1 + ar_3 - 2 >= 0 /\ ar_0 + ar_3 - 2 >= 0 /\ -ar_2 + 64 >= 0 /\ ar_1 - ar_2 >= 0 /\ ar_0 - ar_2 >= 0 /\ ar_2 - 1 >= 0 /\ ar_1 + ar_2 - 2 >= 0 /\ ar_0 + ar_2 - 2 >= 0 /\ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ 1 >= ar_3 ]

		(Comp: 67*ar_1, Cost: 1)    evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3 - 1)) [ -ar_3 + 64 >= 0 /\ ar_2 - ar_3 >= 0 /\ -ar_2 - ar_3 + 128 >= 0 /\ ar_1 - ar_3 >= 0 /\ ar_0 - ar_3 >= 0 /\ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 2 >= 0 /\ -ar_2 + ar_3 + 63 >= 0 /\ ar_1 + ar_3 - 2 >= 0 /\ ar_0 + ar_3 - 2 >= 0 /\ -ar_2 + 64 >= 0 /\ ar_1 - ar_2 >= 0 /\ ar_0 - ar_2 >= 0 /\ ar_2 - 1 >= 0 /\ ar_1 + ar_2 - 2 >= 0 /\ ar_0 + ar_2 - 2 >= 0 /\ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ ar_3 >= 2 ]

		(Comp: 67*ar_1, Cost: 1)    evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, 64, 64)) [ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ ar_0 >= 64 ]

		(Comp: 67*ar_1, Cost: 1)    evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_0, ar_0)) [ ar_1 - 1 >= 0 /\ ar_0 + ar_1 - 2 >= 0 /\ -ar_0 + ar_1 >= 0 /\ ar_0 - 1 >= 0 /\ 63 >= ar_0 ]

		(Comp: 2, Cost: 1)          evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3)) [ -ar_0 + ar_1 >= 0 /\ 0 >= ar_0 ]

		(Comp: 67*ar_1, Cost: 1)    evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3)) [ -ar_0 + ar_1 >= 0 /\ ar_0 >= 1 ]

		(Comp: 1, Cost: 1)          evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_1, ar_1, ar_2, ar_3))

		(Comp: 1, Cost: 1)          evalzwritehexstringatextractedstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3))

	start location:	koat_start

	leaf cost:	0



Complexity upper bound 402*ar_1 + 6



Time: 0.423 sec (SMT: 0.351 sec)


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

(2)
BOUNDS(1, n^1)