Advice for simplifying constraint

In reply to bhupeshpaliwal:

I was able to get a result for num == 63, which is the largest possible value, for all simulators on EDAPlayground. I noticed you had some typos (= instead of ==), so maybe you did not copy the example correctly and missed something. Or maybe you have hit a tool specific issue. Some comments for optimizations:

  1. Use dynamic arrays instead of queues [$] for quicker access unless you plan on pushing or popping values.
  2. You only need to check s_addr[0] for byte alignment.
  3. You could calculate bsz, bl, and the array sizes in pre_randomize to simplify the constraint equations.
  4. You could calculate e_addr in post_randomize to simplify the constraint equations.