Two threads, one counter count: 0
shared memorycount = 0
🧵 T1 read +1 write 🔒 lock reg: —
🧵 T2 read +1 write 🔒 lock reg: —
🧵 T1 idle 🔑 A free 🔑 B free 🧵 T2 idle holds wants holds wants
💀 DEADLOCK
shared resource🍽 free
🐷Hog A served: 0
🐷Hog B served: 0
🙂Polite waited: 0
count++ is three steps, not one
Click ▶ Interleave to run two threads one micro-step at a time.
▸ A race passes 99 test runs and fails in production — the bug is the timing, not the code you can see.