FVO — Formal Verification Online
Lesson 10.1 · Taming Complexity

Diagnosing a hard proof

"The proof doesn't converge" is a symptom, not a diagnosis. Before changing anything, collect facts:

MeasurementWhat it tells you
Flops in the property's cone of influenceSize of the problem. Hundreds: usually fine. Tens of thousands: expect to reduce.
Bounded depth reachedHow far the engines got. Compare it with how deep the behaviour is (from covers).
Which engine made progressBMC good but no proof → the property is probably true but not inductive: think helper invariants.
Large counters, memories, wide arithmetic in the coneClassic sources of difficulty — candidates for abstraction.
Does the same property prove on a smaller configuration?If yes, the logic is right and the problem is scale.
InconclusiveCOI large?yesReduce: parameters,black boxes, cut pointsnoBMC deep, no proof?→ helper invariantsBig counters /memories → abstractOften several apply — iterate, re-measure after each change
A rough complexity triage. Measure first, then pick a technique that addresses the actual cause.
Was this page helpful?

Tip: select any text on the page before clicking Report and it will be quoted in your report.