
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, 0, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_3)) [ Ar_3 < Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_4 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 + 1 < Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_4 + 1, Ar_4)) [ Ar_4 + 1 >= Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_7(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_start_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_0)) [ Ar_1 <= 0 ]
		(Comp: ?, Cost: 1)    eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 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)    eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, 0, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_3)) [ Ar_3 < Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_4 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 + 1 < Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_4 + 1, Ar_4)) [ Ar_4 + 1 >= Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_7(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_start_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_0)) [ Ar_1 <= 0 ]
		(Comp: ?, Cost: 1)    eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_start_start) = 2
	Pol(eval_start_bb0_in) = 2
	Pol(eval_start_0) = 2
	Pol(eval_start_1) = 2
	Pol(eval_start_2) = 2
	Pol(eval_start_3) = 2
	Pol(eval_start_bb1_in) = 2
	Pol(eval_start_bb2_in) = 2
	Pol(eval_start_bb4_in) = 1
	Pol(eval_start_bb3_in) = 2
	Pol(eval_start_6) = 2
	Pol(eval_start_7) = 2
	Pol(eval_start_stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
	eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_2 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, 0, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_3)) [ Ar_3 < Ar_2 ]
		(Comp: 2, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_4 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 + 1 < Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_4 + 1, Ar_4)) [ Ar_4 + 1 >= Ar_2 ]
		(Comp: ?, Cost: 1)    eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_7(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_start_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_0)) [ Ar_1 <= 0 ]
		(Comp: 2, Cost: 1)    eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_start_start) = 2*V_3
	Pol(eval_start_bb0_in) = 2*V_3
	Pol(eval_start_0) = 2*V_3
	Pol(eval_start_1) = 2*V_3
	Pol(eval_start_2) = 2*V_3
	Pol(eval_start_3) = 2*V_3
	Pol(eval_start_bb1_in) = 2*V_3 - 2*V_4
	Pol(eval_start_bb2_in) = 2*V_3 - 2*V_5 - 1
	Pol(eval_start_bb4_in) = 2*V_3 - 2*V_4
	Pol(eval_start_bb3_in) = -2*V_1 + 2*V_3
	Pol(eval_start_6) = -2*V_1 + 2*V_3
	Pol(eval_start_7) = -2*V_1 + 2*V_3
	Pol(eval_start_stop) = 2*V_3 - 2*V_4
	Pol(koat_start) = 2*V_3
orients all transitions weakly and the transitions
	eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_4 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 + 1 < Ar_2 ]
	eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_3)) [ Ar_3 < Ar_2 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 1)         eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)         eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)         eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)         eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)         eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)         eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, 0, Ar_4))
		(Comp: 2*Ar_2, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_3)) [ Ar_3 < Ar_2 ]
		(Comp: 2, Cost: 1)         eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_2 ]
		(Comp: 2*Ar_2, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_4 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 + 1 < Ar_2 ]
		(Comp: ?, Cost: 1)         eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_4 + 1, Ar_4)) [ Ar_4 + 1 >= Ar_2 ]
		(Comp: ?, Cost: 1)         eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)         eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_7(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)         eval_start_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)         eval_start_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_0)) [ Ar_1 <= 0 ]
		(Comp: 2, Cost: 1)         eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)         koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 4 produces the following problem:
5:	T:
		(Comp: 1, Cost: 1)         eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)         eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)         eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)         eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)         eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)         eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, 0, Ar_4))
		(Comp: 2*Ar_2, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_3)) [ Ar_3 < Ar_2 ]
		(Comp: 2, Cost: 1)         eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 >= Ar_2 ]
		(Comp: 2*Ar_2, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_4 + 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 + 1 < Ar_2 ]
		(Comp: 4*Ar_2, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_4 + 1, Ar_4)) [ Ar_4 + 1 >= Ar_2 ]
		(Comp: 2*Ar_2, Cost: 1)    eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 2*Ar_2, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_7(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 2*Ar_2, Cost: 1)    eval_start_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_0, Ar_4)) [ Ar_1 > 0 ]
		(Comp: 2*Ar_2, Cost: 1)    eval_start_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_0)) [ Ar_1 <= 0 ]
		(Comp: 2, Cost: 1)         eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)         koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 16*Ar_2 + 10

Time: 0.065 sec (SMT: 0.047 sec)
