Description
The consumer bench assumes three things about its producer. Each assumption was given to the producer as an assertion. Decide which ones the consumer may keep.
A consumer bench assumes three things about its producer. Each line was asserted on the producer, and the runs are recorded. For each, decide whether the consumer may keep the assumption, and select the producer line that keeps or breaks it.
Pinned interface
| Port | Direction | Bits |
|---|---|---|
| clk | input | 1 |
| rst | input | 1 |
| req | input | 1 |
| req_len | input | 2 |
| rdy | input | 1 |
| vld | output | 1 |
| len | output | 2 |
Full specification
The producer sends packets with vld and a length. The consumer takes one with rdy. The specification allows empty packets and allows a new packet right after a take.
An assumption in one bench is a promise from the neighbour. The same line, asserted on the neighbour, shows whether the promise is kept. Each card is one such run on the producer.
For every card, choose what the run means for the consumer bench. Then select the producer line that keeps or breaks the promise.
| Recorded case | Local contract |
|---|---|
| Promise 1: a waiting packet stays | The consumer bench wants to assume this line. Here it is asserted on the producer. The companion trace is a cover on the producer: a packet that has to wait. |
| Promise 2: a packet is never empty | The consumer bench wants to assume this line. Here it is asserted on the producer. The trace is the failure on the producer. |
| Promise 3: one idle cycle after every take | The consumer bench wants to assume this line. Here it is asserted on the producer. The trace is the failure on the producer. |
| 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. |
Promise 1: A Waiting Packet Stays
The consumer bench wants to assume this line. Here it is asserted on the producer. The companion trace is a cover on the producer: a packet that has to wait.
PASS · bmc · depth 8 · 1013 ms
Samples from the separately reported companion check. Free input lanes are shaded; the terminal VCD record is omitted.
Companion check: PASS · reported step 3
Numbered source and task
1 module top(input clk, input rst, req, input [1:0] req_len, input rdy, output reg vld=0, output reg [1:0] len=0);
2 always @(posedge clk)
3 if (rst) begin vld <= 0; len <= 0; end
4 else if (vld && !rdy) vld <= 1; // hold the packet until it is taken
5 else if (req) begin vld <= 1; len <= req_len; end // a new packet, also right after a take
6 else vld <= 0;
7 always @(posedge clk) begin if ($initstate) begin assume(rst); end else begin assume(!rst); end end
8 endmodule
9 // props.sv
10 assert property (@(posedge clk) disable iff (rst) vld && !rdy |=> vld);Promise 2: A Packet Is Never Empty
The consumer bench wants to assume this line. Here it is asserted on the producer. The trace is the failure on the producer.
FAIL · bmc · depth 8 · 986 ms
Samples from the measured run. Free input lanes are shaded; the terminal VCD record is omitted.
Numbered source and task
1 module top(input clk, input rst, req, input [1:0] req_len, input rdy, output reg vld=0, output reg [1:0] len=0);
2 always @(posedge clk)
3 if (rst) begin vld <= 0; len <= 0; end
4 else if (vld && !rdy) vld <= 1; // hold the packet until it is taken
5 else if (req) begin vld <= 1; len <= req_len; end // a new packet, also right after a take
6 else vld <= 0;
7 always @(posedge clk) begin if ($initstate) begin assume(rst); end else begin assume(!rst); end end
8 endmodule
9 // props.sv
10 assert property (@(posedge clk) disable iff (rst) vld |-> len != 0);Promise 3: One Idle Cycle After Every Take
The consumer bench wants to assume this line. Here it is asserted on the producer. The trace is the failure on the producer.
FAIL · bmc · depth 8 · 1049 ms
Samples from the measured run. Free input lanes are shaded; the terminal VCD record is omitted.
Numbered source and task
1 module top(input clk, input rst, req, input [1:0] req_len, input rdy, output reg vld=0, output reg [1:0] len=0);
2 always @(posedge clk)
3 if (rst) begin vld <= 0; len <= 0; end
4 else if (vld && !rdy) vld <= 1; // hold the packet until it is taken
5 else if (req) begin vld <= 1; len <= req_len; end // a new packet, also right after a take
6 else vld <= 0;
7 always @(posedge clk) begin if ($initstate) begin assume(rst); end else begin assume(!rst); end end
8 endmodule
9 // props.sv
10 assert property (@(posedge clk) disable iff (rst) vld && rdy |=> !vld);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
A failing assertion on the producer is not always a producer bug. Read what the specification allows.
Hint 2
For the promise that holds, find the branch that makes it hold.
Hint 3
Use the "One line, two verbs" section of F7.4.
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