Description
Five verification questions arrive on one morning. For each, choose the method to try first and the reason.
Five verification questions each come with one recorded formal run on a small model. For each question, choose whether formal or simulation should go first on the real design, and select the reason.
Pinned interface
| Port | Direction | Bits |
|---|---|---|
| clk | input | 1 |
| rst | input | 1 |
| go_a | input | 1 |
| go_b | input | 1 |
| push | input | 1 |
| pop | input | 1 |
| wdata | input | 8 |
| send | input | 1 |
| sel | input | 1 |
| a | input | 1 |
| b | input | 1 |
| sa | output | 2 |
| sb | output | 2 |
| rdata | output | 8 |
| empty | output | 1 |
| full | output | 1 |
| sent | output | 2 |
| ready | output | 1 |
| y | output | 1 |
Full specification
Each card is one question about a design, with one recorded formal run on a small model of it. The run is evidence, not the answer. Decide which method should go first on the real design.
For every card, choose formal or simulation. Then select the numbered reason that fits. The five reasons are the same on every card.
| Recorded case | Local contract |
|---|---|
| Can the two controllers ever wait for each other forever? | The recorded run is a bounded check of "both wait" on the two controllers. |
| How many packets per second does the link carry under the customer traffic mix? | The recorded run is a cover: the fastest way to send three packets. |
| Can the FIFO overflow when the producer obeys the full flag? | The recorded run is a bounded check of the count on the FIFO. |
| Does the block become ready after the firmware has loaded its table? | The recorded run is a cover of ready at depth 20. |
| Does every pad follow its row of the connection table? | The recorded run checks one row of the table. |
| Execution rule | Meaning |
|---|---|
| Interface | Use the pinned port names, directions and bit widths shown above. Observed state and tracker outputs are not environment inputs. |
| Sampling | One positive edge of clk; binary values. Non-overlapping implication observes the next sample. Reset and initialization follow the source and contract above. |
| Submission | Select a cause and a numbered line for every recorded case. Checking these choices runs no engine. |
| How this is graded | The cause and responsible line must agree with each recorded local contract. A timeout or induction candidate must not be diagnosed as a reachable RTL failure. |
Can the Two Controllers Ever Wait for Each Other Forever?
The recorded run is a bounded check of "both wait" on the two controllers.
FAIL · bmc · depth 12 · 2343 ms
Samples from the measured run. Free input lanes are shaded; the terminal VCD record is omitted.
Numbered source and task
1 1 The block is small control logic, and the question is about every input sequence.
2 2 The question is structural, and its specification is a table.
3 3 The answer is a measured number under typical traffic, not a yes or a no.
4 4 The behaviour is millions of cycles deep and depends on software.
5 5 The block has no state at all, so no method is needed.How Many Packets per Second Does the Link Carry Under the Customer Traffic Mix?
The recorded run is a cover: the fastest way to send three packets.
PASS · cover · depth 20 · 1647 ms
Samples from the measured run. Free input lanes are shaded; the terminal VCD record is omitted.
Numbered source and task
1 1 The block is small control logic, and the question is about every input sequence.
2 2 The question is structural, and its specification is a table.
3 3 The answer is a measured number under typical traffic, not a yes or a no.
4 4 The behaviour is millions of cycles deep and depends on software.
5 5 The block has no state at all, so no method is needed.Can the FIFO Overflow When the Producer Obeys the Full Flag?
The recorded run is a bounded check of the count on the FIFO.
FAIL · bmc · depth 20 · 1268 ms
Samples from the measured run. Free input lanes are shaded; the terminal VCD record is omitted.
Numbered source and task
1 1 The block is small control logic, and the question is about every input sequence.
2 2 The question is structural, and its specification is a table.
3 3 The answer is a measured number under typical traffic, not a yes or a no.
4 4 The behaviour is millions of cycles deep and depends on software.
5 5 The block has no state at all, so no method is needed.Does the Block Become Ready After the Firmware Has Loaded Its Table?
The recorded run is a cover of ready at depth 20.
FAIL · cover · depth 20 · 1150 ms
No witness was produced for this query.
Numbered source and task
1 1 The block is small control logic, and the question is about every input sequence.
2 2 The question is structural, and its specification is a table.
3 3 The answer is a measured number under typical traffic, not a yes or a no.
4 4 The behaviour is millions of cycles deep and depends on software.
5 5 The block has no state at all, so no method is needed.Does Every Pad Follow Its Row of the Connection Table?
The recorded run checks one row of the table.
FAIL · bmc · depth 4 · 1065 ms
Samples from the measured run. Free input lanes are shaded; the terminal VCD record is omitted.
Numbered source and task
1 1 The block is small control logic, and the question is about every input sequence.
2 2 The question is structural, and its specification is a table.
3 3 The answer is a measured number under typical traffic, not a yes or a no.
4 4 The behaviour is millions of cycles deep and depends on software.
5 5 The block has no state at all, so no method is needed.Requirements
- Use the published ports and widths. The checker and the DUT variants are owned by the judge.
- Do not add assumptions unless the statement explicitly asks for one. A passing assertion without a reachable trigger is insufficient.
Hints
Hint 1
Ask what kind of answer the question wants: a yes or no about all behaviour, or a number about typical behaviour.
Hint 2
Look at how many cycles the recorded run needed, or failed to reach.
Hint 3
Use the "Where formal sits beside simulation" diagram and the "What formal cannot do" section of F1.1.
Single clock, binary values, synchronous reset. The judge checks the pinned interface, reachability and the declared proof or bound. UNKNOWN, resource limits and timeouts remain inconclusive.
The recordings are fixed. Checking a diagnosis does not run an engine.
More problems on this topic