YES(?, 2)

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

Complexity upper bound 2

Time: 0.020 sec (SMT: 0.019 sec)