FAILURE MAP
← Case archive

FA-92167 / PLC ladder logic scan cycles / Member archive

FIFO unload returns the most recent entry · case 02

Parts leave the queue last-in first-out.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

FIFO load (FFL) and unload (FFU) pair on one file of the given length. ops is a list of [op, value], one triggered instruction per scan. Load stores value at the position and increments it; when full (position == length) the load is ignored. Unload moves element 0 to dest, shifts the file toward 0 and zeroes the vacated last element; unloading an empty FIFO leaves dest unchanged. DN is position >= length and EM is position == 0. Return [position, dest, DN, EM, file] per scan.

Why this case matters

Ladder programs are executed as repeated scans; each defect here changes what a rung, timer, counter or data-table instruction reports on a particular scan, which is how commissioning and field faults are actually observed.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixtureActualExpectedOutcome
regression: interleaved[[1, 0, false, false, [1, 0, 0]], [2, 0, false, false, [1, 2, 0]], [1, 2, false, false, [1, 0, 0]], [2, 2, false, false, [1, 3, 0]], [1, 3, false, false, [1, 0, 0]], [0, 1, false, true, [0, 0, 0]]][[1, 0, false, false, [1, 0, 0]], [2, 0, false, false, [1, 2, 0]], [1, 1, false, false, [2, 0, 0]], [2, 1, false, false, [2, 3, 0]], [1, 2, false, false, [3, 0, 0]], [0, 3, false, true, [0, 0, 0]]]Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.

Sign in to the archive ↗