plan: reject impossible coverings before the search
Every data region needs at least one dedupe or copy edge, since a copy
run never crosses the hole between regions, and every hole is already
one op. When that floor exceeds rewrite.total-max no covering exists,
but the search only found out after walking the whole extent, which is
O(V^2) in its boundary count.
With total-max = 10, a reference run on a disk-image corpus counted
582,604 searches ending with no covering under the limit (270 at
total-max = 100). Check the floor up front and count the rejection the
same way.