Hi,
I’m trying to ignore some bins of a cross.
bit [1:0] a;
bit [1:0] b;
cp_a : coverpoint a;
cp_b : coverpoint b;
cp_cross : cross a, b;
This results in all the following crosses
a[0]. b[0], a[1].b[0], a[2].b[0], a[3].b[0],
a[0]. b[1], a[1].b[1], a[2].b[1], a[3].b[1],
a[0]. b[2], a[1].b[2], a[2].b[2], a[3].b[2],
a[0]. b[3], a[1].b[3], a[2].b[3], a[3].b[3]; // total = 16 bins
out of these crosses, I want to ignore some crosses, like when b = 1, a=1,2,3 and when b=2 a=2,3. These specific crosses are to be ignored. (the resultant bins would be something like)
a[0]. b[0], a[1].b[0], a[2].b[0], a[3].b[0],
a[0]. b[1],
a[0]. b[2], a[1].b[2],
a[0]. b[3], a[1].b[3], a[2].b[3], a[3].b[3]; // total = 11 bins
This is just a representation of my problem and in actual case the total automatically generated bins and the bins to be ignored are very high so cant do them manually.
How can I do this? I tried using intersect but missing some concept of its functioning to get it right.
Thanks