How is cyclomatic complexity counted?

I'm reading Kent Beck's “TTD by Example” and I can't understand why cyclomatic complexity of his program is fractional?

In Wikipedia the complexity is defined as M = E − N + 2P where E, N and P are integers.