• Skip to main content
  • Skip to search
  • Skip to footer
Cadence Home
  • This search text may be transcribed, used, stored, or accessed by our third-party service providers per our Cookie Policy and Privacy Policy.

  1. Community Forums
  2. Functional Verification
  3. IFV PSL , using VHDL comparison operator

Stats

  • Locked Locked
  • Replies 8
  • Subscribers 65
  • Views 14804
  • Members are here 0
This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

IFV PSL , using VHDL comparison operator

Jentil
Jentil over 15 years ago

Hi ,

  I have an assertion in my PSL file -

 Assert1 : assert always ( { {R_seq} &&  {T /= A and (Z  = '0' ) } }  |=>  { D = ADDBUS }  ) @ (rising_edge(CLK)  ;  

 where  R_Seq is defined as - 

   sequence  R_Seq = { A1 and B1 } ;

 The assertion passed .

 Now , out of curiosity I have written a negative check -

 Assert2: assert always( { {R_seq} && { T/=A and (Z = '0' ) } }   |=>  {  D /= ADDBUS } ) @(rising_edge(CLK) ;

  This assertion also passed !!! .

  From my understanding , since the LHS are same and RHS are contradicting , either Assert1 or Assert2 should surely fail .

  Please explain to me , if my understanding is correct .

  I was using IFV version 8.20 .

 Also , would like to mention that trigger for both Assert1 and Assert2 passed .

 

 

 

  • Cancel
  • TAM1
    TAM1 over 15 years ago

    Adding the opposite of an assertion (one expected to "fail") is a useful sanity check. It can help uncover problems with a formal verification setup.

     

    In this instance, having both assertions pass is a possible result. An assertion can pass "vacuously" if the prefix of the assertion can never be reached. As an example, the assertion "a |=> b" will pass if 'a' can never occur. If 'a' is impossible, both "a |=> b" and "a |=> not b" will pass because neither can ever reach the failing state.

     

    So the first thing to look for is whether or not IFV says that the "trigger" of these assertions passes. If the trigger check fails, then the prefix of the assertion is impossible and the assertion itself will pass.

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
  • Jentil
    Jentil over 15 years ago
    Hi TAM1 ,
     
    Thank You for explaining .
     
    However , in this case , I could see trigger pass for both assertions .
     
    Thanks And Regards
    Jentil Jose
    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
  • JoergM
    JoergM over 15 years ago

    Hi,

    in this case it may be that the vacuity starts in the next cycle after the trigger. So please check whether the "Trace" check fails.

    Regards, Joerg.

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
  • Jentil
    Jentil over 15 years ago
    Hi Joerg ,
     
    The Trace is shown " Not Run" .
     
    I would like to know  -  If my assertion status is pass and trigger is also pass , does it guarnatees that the assertion is validated completely .
     
    Regards
    Jentil Jose
    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
  • JoergM
    JoergM over 15 years ago

    No, it does not. You need to look a the trace to detect such kind of vacuity. Example:

     assume a |=> b;

     assume a |=> !b;

    The 2 constraints create vacuity after the first occurence of "a". There is no solution for b that satisfies the constraints.

    assert a |=> false

    The property trigger is pass, but the trace is fail. Regardless, what the RHS says... In IEV you would get a deadend in such a situation

    Joerg.

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
  • Jentil
    Jentil over 15 years ago
    JoergM ,
     
    I have turned ON the witness . It failed .
     
    Could you please explain to me the meaning of trace fail .
     I am finding it difficult to understand the difference between asssertion fail and trace fail .
     
    Also please explain how to debugg trace fails .
     
    Thanks And Regards
    Jentil Jose
    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
  • JoergM
    JoergM over 15 years ago

    Hi Jentil,

    a trace or a trigger is a reachability check, just like any other cover statement. To understand why something is unreachable, you need to de-assemble the elements of that sequence or condition and anaylze their reachability, respectively. For example, if the following sequence is unreachable, you need to check if the sub components are reachable:

    cover { a; b; c } is unreachable

    Check sub components:

    cover {a; b } is also unreachable

    cover { a } is reachable

    So you look at the driver of b to determin why it is unreachable and so forth.

    Joerg.

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
  • Jentil
    Jentil over 15 years ago
    Hi JoergM  , TAM1 ,
     
    I understood this . Thank you so much.
     
    After using the trace witness , assertiions failed and we found real design issues .
     
    Regards
    Jentil Jose 
    • Cancel
    • Vote Up 0 Vote Down
    • Cancel

Community Guidelines

The Cadence Design Communities support Cadence users and technologists interacting to exchange ideas, news, technical information, and best practices to solve problems and get the most from Cadence technology. The community is open to everyone, and to provide the most value, we require participants to follow our Community Guidelines that facilitate a quality exchange of ideas and information. By accessing, contributing, using or downloading any materials from the site, you agree to be bound by the full Community Guidelines.

© 2025 Cadence Design Systems, Inc. All Rights Reserved.

  • Terms of Use
  • Privacy
  • Cookie Policy
  • US Trademarks
  • Do Not Sell or Share My Personal Information