WORST_CASE(?, O(1))

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18) -> Com_1(f12(3, Fresh_5, 3, 1, 0, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18))
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18) -> Com_1(f12(Ar_0, Ar_1, Ar_2, Fresh_4, Ar_4 + 1, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18)) [ Ar_2 >= Ar_4 + 1 ]
		(Comp: ?, Cost: 1)    f24(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18) -> Com_1(f24(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6 + 1, Fresh_3, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18)) [ Ar_5 >= Ar_6 + 1 ]
		(Comp: ?, Cost: 1)    f36(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18) -> Com_1(f36(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9 + 1, Fresh_2, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18)) [ Ar_8 >= Ar_9 + 1 ]
		(Comp: ?, Cost: 1)    f36(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18) -> Com_1(f46(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_10, Ar_10, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18)) [ Ar_9 >= Ar_8 ]
		(Comp: ?, Cost: 1)    f24(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18) -> Com_1(f36(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_0, 0, 1, Ar_11, Ar_12, Ar_7, Ar_7, Fresh_1, Ar_16, Ar_17, Ar_18)) [ Ar_6 >= Ar_5 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18) -> Com_1(f24(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_0, 0, 1, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_3, Ar_3, Fresh_0)) [ Ar_4 >= Ar_2 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18) -> Com_1(f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Slicing away variables that do not contribute to conditions from problem 1 leaves variables [Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9].
We thus obtain the following problem:
2:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_0, 0, Ar_8, Ar_9)) [ Ar_4 >= Ar_2 ]
		(Comp: ?, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_0, 0)) [ Ar_6 >= Ar_5 ]
		(Comp: ?, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f46(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_9 >= Ar_8 ]
		(Comp: ?, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9 + 1)) [ Ar_8 >= Ar_9 + 1 ]
		(Comp: ?, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6 + 1, Ar_8, Ar_9)) [ Ar_5 >= Ar_6 + 1 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(Ar_0, Ar_2, Ar_4 + 1, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_2 >= Ar_4 + 1 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(3, 3, 0, Ar_5, Ar_6, Ar_8, Ar_9))
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 2 produces the following problem:
3:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_0, 0, Ar_8, Ar_9)) [ Ar_4 >= Ar_2 ]
		(Comp: ?, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_0, 0)) [ Ar_6 >= Ar_5 ]
		(Comp: ?, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f46(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_9 >= Ar_8 ]
		(Comp: ?, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9 + 1)) [ Ar_8 >= Ar_9 + 1 ]
		(Comp: ?, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6 + 1, Ar_8, Ar_9)) [ Ar_5 >= Ar_6 + 1 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(Ar_0, Ar_2, Ar_4 + 1, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_2 >= Ar_4 + 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(3, 3, 0, Ar_5, Ar_6, Ar_8, Ar_9))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 3
	Pol(f0) = 3
	Pol(f12) = 3
	Pol(f24) = 2
	Pol(f36) = 1
	Pol(f46) = 0
orients all transitions weakly and the transitions
	f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f46(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_9 >= Ar_8 ]
	f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_0, 0)) [ Ar_6 >= Ar_5 ]
	f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_0, 0, Ar_8, Ar_9)) [ Ar_4 >= Ar_2 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ 0 <= 0 ]
		(Comp: 3, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_0, 0, Ar_8, Ar_9)) [ Ar_4 >= Ar_2 ]
		(Comp: 3, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_0, 0)) [ Ar_6 >= Ar_5 ]
		(Comp: 3, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f46(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_9 >= Ar_8 ]
		(Comp: ?, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9 + 1)) [ Ar_8 >= Ar_9 + 1 ]
		(Comp: ?, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6 + 1, Ar_8, Ar_9)) [ Ar_5 >= Ar_6 + 1 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(Ar_0, Ar_2, Ar_4 + 1, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_2 >= Ar_4 + 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(3, 3, 0, Ar_5, Ar_6, Ar_8, Ar_9))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 3
	Pol(f0) = 3
	Pol(f12) = V_2 - V_3
	Pol(f24) = -V_1 + V_2 - V_3 + V_4 - 3*V_5 - 2
	Pol(f36) = V_1 + V_2 - V_3 + V_4 - 3*V_5 - 2*V_6 - V_7 - 2
	Pol(f46) = V_1 + V_2 - V_3 + V_4 - 3*V_5 - 3*V_7 - 2
orients all transitions weakly and the transition
	f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(Ar_0, Ar_2, Ar_4 + 1, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_2 >= Ar_4 + 1 ]
strictly and produces the following problem:
5:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ 0 <= 0 ]
		(Comp: 3, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_0, 0, Ar_8, Ar_9)) [ Ar_4 >= Ar_2 ]
		(Comp: 3, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_0, 0)) [ Ar_6 >= Ar_5 ]
		(Comp: 3, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f46(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_9 >= Ar_8 ]
		(Comp: ?, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9 + 1)) [ Ar_8 >= Ar_9 + 1 ]
		(Comp: ?, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6 + 1, Ar_8, Ar_9)) [ Ar_5 >= Ar_6 + 1 ]
		(Comp: 3, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(Ar_0, Ar_2, Ar_4 + 1, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_2 >= Ar_4 + 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(3, 3, 0, Ar_5, Ar_6, Ar_8, Ar_9))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 3
	Pol(f0) = 3
	Pol(f12) = V_1
	Pol(f24) = V_4 - V_5
	Pol(f36) = -V_1 + V_4 - V_5 + V_6 - V_7 - 2
	Pol(f46) = -V_1 + V_4 - V_5 + V_6 - V_7 - 2
orients all transitions weakly and the transition
	f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6 + 1, Ar_8, Ar_9)) [ Ar_5 >= Ar_6 + 1 ]
strictly and produces the following problem:
6:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ 0 <= 0 ]
		(Comp: 3, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_0, 0, Ar_8, Ar_9)) [ Ar_4 >= Ar_2 ]
		(Comp: 3, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_0, 0)) [ Ar_6 >= Ar_5 ]
		(Comp: 3, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f46(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_9 >= Ar_8 ]
		(Comp: ?, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9 + 1)) [ Ar_8 >= Ar_9 + 1 ]
		(Comp: 3, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6 + 1, Ar_8, Ar_9)) [ Ar_5 >= Ar_6 + 1 ]
		(Comp: 3, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(Ar_0, Ar_2, Ar_4 + 1, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_2 >= Ar_4 + 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(3, 3, 0, Ar_5, Ar_6, Ar_8, Ar_9))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 3
	Pol(f0) = 3
	Pol(f12) = V_1
	Pol(f24) = V_1
	Pol(f36) = V_6 - V_7
	Pol(f46) = V_6 - V_7
orients all transitions weakly and the transition
	f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9 + 1)) [ Ar_8 >= Ar_9 + 1 ]
strictly and produces the following problem:
7:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ 0 <= 0 ]
		(Comp: 3, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_0, 0, Ar_8, Ar_9)) [ Ar_4 >= Ar_2 ]
		(Comp: 3, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_0, 0)) [ Ar_6 >= Ar_5 ]
		(Comp: 3, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f46(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_9 >= Ar_8 ]
		(Comp: 3, Cost: 1)    f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f36(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9 + 1)) [ Ar_8 >= Ar_9 + 1 ]
		(Comp: 3, Cost: 1)    f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f24(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6 + 1, Ar_8, Ar_9)) [ Ar_5 >= Ar_6 + 1 ]
		(Comp: 3, Cost: 1)    f12(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(Ar_0, Ar_2, Ar_4 + 1, Ar_5, Ar_6, Ar_8, Ar_9)) [ Ar_2 >= Ar_4 + 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_2, Ar_4, Ar_5, Ar_6, Ar_8, Ar_9) -> Com_1(f12(3, 3, 0, Ar_5, Ar_6, Ar_8, Ar_9))
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 19

Time: 1.247 sec (SMT: 1.190 sec)