YES(?, 3)

Initial complexity problem:
1:	T:
		(1, 1)    f0(a) -> f8(a) [ 0 >= b + 1 ]
		(1, 1)    f0(a) -> f8(a)
		(1, 1)    f0(a) -> f8(b)
	start location:	f0
	leaf cost:	0

Complexity upper bound 3

Time: 0.008 sec (SMT: 0.008 sec)