Run the lab's counter at both widths, and decide what BDD reachability and abc pdr show.
An invariant is a property that must hold in every reachable state; in the lab it is !bad. Explore reachable states computes the reachable states to a fixpoint, then reports whether any of them sets bad, with a trace when one does. The lab's other engine, abc pdr, runs in SymbiYosys's prove mode, where a PASS means that the assertion holds in every reachable state, however many cycles it takes to reach it.
!bad
bad
The Johnson counter with a planted bug starts at 001 and rotates its bits instead of inverting the top one: 001, 010, 100, then 001 again. Its invariant is !illegal, where illegal is 1 on 010 and 101.
!illegal
illegal
Explore reachable states reaches 3 states, with the fixpoint at iteration 3. The state 010 is first reached at iteration 1, so the invariant fails.
The check walks back from 010 to the initial state and reports a trace of one clock cycle.
A failing invariant comes with a trace; a holding one comes with a fixpoint that contains no bad state.
In the lab, the W-bit counter wraps from 2^W - 2 back to 0, and the invariant is !bad, where bad is 1 on the all-ones value. Run the lab at both widths, in Explore reachable states and with abc pdr.
What do the two engines show?
The invariant holds at both widths.
The invariant holds at 4 bits and fails at 16 bits.
The invariant fails at both widths: the counter reaches all ones.
Neither engine can decide it at 16 bits.
Choose one of the four statements, after running the lab in the section linked above.
One statement.
At 4 bits, run Explore reachable states to its fixpoint and read the invariant check's verdict.
Run abc pdr at both widths and read each verdict; then ask whether the counter's wrap point can ever let it reach all ones, at any width.
If an engine stops without a verdict, ask whether that is a failure of the invariant or of the engine's budget.
Kata 8.1 of Binary Decision Diagrams with CUDD on formal.org. The site checks the answer when you press Check answer; sign in to keep your progress.