For testing, the input space is formed from the set of
shape point buffer data stored in a global array and the
position of the car supplied as parameters of the function.
The function uses a flag, update points, to identify a situation
where an update is required. The flag is assigned inside
a loop traversing the shape point buffer. The flag becomes
true if any shape point from the buffer is outside a certain
area. The branch marked /* target */ is hard to execute
because input situations rarely lead to update points
being assigned false. The search space for the predicate
if (!update points) is precisely the worst case flag landscape
described in Figure 1.