User guide

24-93
SystemVerilog Testbench Constructs
2. The constraint is solved when the lowest priority variables incident
on it are solved.
3. When the constraint is solved, all lowest priority variables incident
on it get solved.
4. hard solve-before constraints in OFF constraint blocks are
ignored, and do not affect partitioning in any way.
Example 24-4
constraint b1 {
y inside {2,3};
x % y == 0;
x != y;
z == x * y;
solve y before x hard;
solve x before z hard;
}
Figure 24-2 Dependencies between variables
The constraint(s) used for solving x,y and z:
1. y is solved using the constraint: y inside (2,3};
Table 24-3
Constraint Early Late
y in{2,3}; y
x%y == 0; y x
x !=y; y x
z==x*y; x,y z