Skip to content
DenseChip
Learn
PracticeCode labInterview

DenseChip

Navigate

Menu

LearnPracticeCode labInterview

Tools

All toolsSV editorCode repoResume
DenseChip

Practice, courses, and chip-design tools in one focused workspace.

LearnPracticeCode labInterviewToolsLearning paths

© 2026 DenseChip

AboutRoadmapCareersInternshipsFAQContactPrivacyTerms
Skip to lesson

Course contents

  • How to Use This Puzzle Bank
  • SystemVerilog Language Puzzles25
  • Difficulty Guide
  • Full Topic Map
  • Interview-Day Tips
  • Study Route: One Week Before the Interview
  • Study Route: Two Weeks
  • Study Route: Four Weeks (Full Course)4
  • OOP & Testbench Puzzles25
  • Concurrency & Timing Puzzles25
  • Randomization & Constraint Puzzles25
  • SVA Assertion Puzzles25
  • Functional Coverage Puzzles25
    • Covergroup and Coverpoint Puzzles
    • Cross Coverage Puzzles
      • Named cross bins that group tuples
      • Pure auto cross count
      • Explicit ignore_bins instead of a default catch-all
      • intersect filter removes one tuple
      • illegal cross tuple does not close coverage
      • Three-way cross with overlapping ignore_bins
    • Coverage Options Puzzles
    • Coverage Closure and Sampling Timing Puzzles
    • Functional Coverage Puzzles: Tricky Q&A
  • Logic & Aptitude Puzzles25
  • Scenario & Debug Puzzles25
  • UVM Testbench Puzzles25
  • Clock, Reset & CDC Puzzles25
  • Bus and Interface Protocol Puzzles25
  • Interview Prep: Puzzle Rounds7
  • DV Puzzle Cheatsheet
Loading lesson

←Cross Coverage Puzzles
  1. Topics
  2. DV Interview Puzzles
  3. Functional Coverage Puzzles
  4. Cross Coverage Puzzles
  5. illegal cross tuple does not close coverage
On this page

    VLSI DV Interview PuzzlesAll levels

    illegal cross tuple does not close coverage

    Calculate legal cross coverage and identify illegal activity. Options: none set (all defaults: at_least = 1, weight = 1, auto_bin_max = 64).

    Puzzle

    Difficulty: Medium · Puzzle 5 of 6 · Topic: Cross Coverage Puzzles

    Calculate legal cross coverage and identify illegal activity. Options: none set (all defaults: at_least = 1, weight = 1, auto_bin_max = 64).

    Code

    design.sv
    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    covergroup cg with function sample(bit [2:0] len, bit [1:0] typ);
      cp_len: coverpoint len {
        bins short = {[1:2]};
        bins long  = {[3:4]};
      }
      cp_typ: coverpoint typ {
        bins rd    = {0};
        bins wr    = {1};
        bins probe = {2};
      }
      x_len_typ: cross cp_len, cp_typ {
        illegal_bins short_probe = binsof(cp_len.short) && binsof(cp_typ.probe);
      }
    endgroup
    
    initial begin
      cg c = new();
      c.sample(1,0);
      c.sample(4,1);
      c.sample(2,2);
      c.sample(3,2);
      c.sample(1,1);
    end

    Hint

    Start from 2x3 tuples, then remove the illegal tuple from legal denominator.

    Step-by-step solution

    Diagram
    1) Raw tuple count is 2 * 3 = 6.
    2) short_probe is illegal, so legal scored bins are 5.
    3) Legal tuples hit: short-rd, long-wr, long-probe, short-wr -> 4 legal bins.
    4) short-probe is hit once but is illegal activity, not legal progress.
    5) Legal cross coverage = 4/5 = 80%.

    Answer

    Answer: Legal cross coverage is 80% with one illegal short-probe hit.

    How this was checked

    Checked by running a model of the rule in a Python model. A model of the cross rule: the illegal short-probe hit is reported but only legal tuples count, 4 of 5.

    Why candidates get it wrong

    An illegal tuple can be frequently exercised while legal closure remains incomplete.

    Interviewer follow-up

    Would you also assert that short+probe is forbidden, and why is that useful beyond coverage? Model answer: Yes. illegal_bins only reports when coverage is enabled and sampled; an assertion is always on, fires at the exact cycle with a message, and can be proven or falsified by formal. Coverage then just records that the legal space was exercised.

    Say it out loud

    I would separate legal and illegal tuples first. Legal cross coverage is 80 percent, and the illegal short-probe tuple was hit once, which is reported as an error. Illegal hits do not move the legal numerator. The trap is that an illegal tuple can be hit very often while legal closure stays incomplete, so I would next find the missing legal tuple.

    Related topics

    • Pruning Crosses: ignore_bins & illegal_bins

    • Crosses and Plan Traceability

    • Back to Cross Coverage Puzzles

    • Functional Coverage Puzzles section

    Previous

    146 / 293

    Next: Three-way cross with overlapping ignore_bins

    Up next

    Up nextThree-way cross with overlapping ignore_bins

    Sign in to save progress

    Practice this lessonPrevious lessonReport an error

    See also

    • Named cross bins that group tuples
    • Pure auto cross count
    • Explicit ignore_bins instead of a default catch-all