The same clock path can pass at zero slack and then fail when one stage adds a little more delay. The arithmetic here treats each delay and the 6 second budget as exact training numbers; real timing decisions include derating, clock uncertainty, routing variation, setup characterization, and measured tolerance.

Changing one stage delay can turn zero slack into negative slack. Exact arithmetic here means exact results for the stated model inputs; measured inputs still carry uncertainty and significant-figure limits.

highlighted = computed this step

One extra second breaks the same path

Changing only the last stage to 2 seconds makes the total delay 7 seconds.

2+3+2=7 s2+3+2=7\ \text{s}
Longer delay chainOnly the final stage changed.period 8 sedges 4edge 1 at 8 slast 24 sd1 2 sd2 3 sd3 2 stotal 7 srequired at 14 sbudget 6 sslack -1 srejected

Delay rows cross from closed to rejected

Each row keeps the same clock budget and recomputes total delay and slack.

dtotalschaingate6 s0 spass7 s−1 sfail8 s−2 sfail\begin{array}{c|c|c}d_{\text{total}}&s_{\text{chain}}&\text{gate}\\6\ \text{s}&0\ \text{s}&\text{pass}\\7\ \text{s}&\mathord{-}1\ \text{s}&\text{fail}\\8\ \text{s}&\mathord{-}2\ \text{s}&\text{fail}\\\end{array}

The delay total exceeds the relative budget

The budget remains 6 seconds, so the slack becomes -1 second and the path is rejected.

6 s+(−7 s)=−1 s6\ \text{s}+(-7\ \text{s})=-1\ \text{s}
Delay rejectedThe rejected label is tied to negative chain slack.period 8 sedges 4edge 1 at 8 slast 24 sd1 2 sd2 3 sd3 2 stotal 7 srequired at 14 sbudget 6 sslack -1 srejected