FAILURE MAP

Understand the failure.
Verify the repair.

Small, reproducible software failures. The broken implementation, the fix that didn’t work, and the one that passed—preserved together.

Explore the cases ↓How results are verified ↗
100840Executable case variants
20168Distinct failure mechanisms
302520Executed implementations
20168Open-access cases

WHAT THE ARCHIVE CONTAINS

100840 executable cases. 20168 are open.

Every case records the implementation that fails, the fix that did not work, and the repair that passed its checks—with recorded outputs and source hashes. This release adds 100840 cases across 20168 failure mechanisms and 254 domains.

The open tier gives you the failure and the unsuccessful fix for one case in every mechanism. The remaining 80672 cases, 5 variants per mechanism, are member-only: the verified repair, its recorded checks, and the full fixture suite are held in the member archive. Read the methodology ↗

A RECORD OF WHAT WENT WRONG

Browse the archive / 100840

Python · Standard library
REFERENCEFAILURE MECHANISMDOMAINACCESS
FA-67301

Automatic route setting arbitration: arbitration order · case 01

A lower-class train wins a conflicting route over a higher-class train.

Railway interlocking logic● Open access↗
FA-67302

Automatic route setting arbitration: arbitration order · case 02

A lower-class train wins a conflicting route over a higher-class train.

Railway interlocking logic◈ Members↗
FA-67303

Automatic route setting arbitration: arbitration order · case 03

A lower-class train wins a conflicting route over a higher-class train.

Railway interlocking logic◈ Members↗
FA-67304

Automatic route setting arbitration: arbitration order · case 04

A lower-class train wins a conflicting route over a higher-class train.

Railway interlocking logic◈ Members↗
FA-67305

Automatic route setting arbitration: arbitration order · case 05

A lower-class train wins a conflicting route over a higher-class train.

Railway interlocking logic◈ Members↗
FA-67306

Automatic route setting arbitration: conflict symmetry · case 01

Two conflicting routes are both granted when the conflict is listed in the other order.

Railway interlocking logic● Open access↗
FA-67307

Automatic route setting arbitration: conflict symmetry · case 02

Two conflicting routes are both granted when the conflict is listed in the other order.

Railway interlocking logic◈ Members↗
FA-67308

Automatic route setting arbitration: conflict symmetry · case 03

Two conflicting routes are both granted when the conflict is listed in the other order.

Railway interlocking logic◈ Members↗
FA-67309

Automatic route setting arbitration: conflict symmetry · case 04

Two conflicting routes are both granted when the conflict is listed in the other order.

Railway interlocking logic◈ Members↗
FA-67310

Automatic route setting arbitration: conflict symmetry · case 05

Two conflicting routes are both granted when the conflict is listed in the other order.

Railway interlocking logic◈ Members↗
FA-67311

Automatic route setting arbitration: same route exclusion · case 01

The same route is granted to two trains.

Railway interlocking logic● Open access↗
FA-67312

Automatic route setting arbitration: same route exclusion · case 02

The same route is granted to two trains.

Railway interlocking logic◈ Members↗
FA-67313

Automatic route setting arbitration: same route exclusion · case 03

The same route is granted to two trains.

Railway interlocking logic◈ Members↗
FA-67314

Automatic route setting arbitration: same route exclusion · case 04

The same route is granted to two trains.

Railway interlocking logic◈ Members↗
FA-67315

Automatic route setting arbitration: same route exclusion · case 05

The same route is granted to two trains.

Railway interlocking logic◈ Members↗
FA-67316

Automatic route setting arbitration: conflict scope · case 01

A candidate conflicting with a later grant is still granted.

Railway interlocking logic● Open access↗
FA-67317

Automatic route setting arbitration: conflict scope · case 02

A candidate conflicting with a later grant is still granted.

Railway interlocking logic◈ Members↗
FA-67318

Automatic route setting arbitration: conflict scope · case 03

A candidate conflicting with a later grant is still granted.

Railway interlocking logic◈ Members↗
FA-67319

Automatic route setting arbitration: conflict scope · case 04

A candidate conflicting with a later grant is still granted.

Railway interlocking logic◈ Members↗
FA-67320

Automatic route setting arbitration: conflict scope · case 05

A candidate conflicting with a later grant is still granted.

Railway interlocking logic◈ Members↗
FA-67321

Temporary speed restriction over train length: rear clearance · case 01

The train accelerates when its front leaves the restriction while its rear is still inside.

Railway interlocking logic● Open access↗
FA-67322

Temporary speed restriction over train length: rear clearance · case 02

The train accelerates when its front leaves the restriction while its rear is still inside.

Railway interlocking logic◈ Members↗
FA-67323

Temporary speed restriction over train length: rear clearance · case 03

The train accelerates when its front leaves the restriction while its rear is still inside.

Railway interlocking logic◈ Members↗
FA-67324

Temporary speed restriction over train length: rear clearance · case 04

The train accelerates when its front leaves the restriction while its rear is still inside.

Railway interlocking logic◈ Members↗
FA-67325

Temporary speed restriction over train length: rear clearance · case 05

The train accelerates when its front leaves the restriction while its rear is still inside.

Railway interlocking logic◈ Members↗
FA-67326

Temporary speed restriction over train length: warning relevance · case 01

The driver is warned about a restriction that is faster than the one already in force.

Railway interlocking logic● Open access↗
FA-67327

Temporary speed restriction over train length: warning relevance · case 02

The driver is warned about a restriction that is faster than the one already in force.

Railway interlocking logic◈ Members↗
FA-67328

Temporary speed restriction over train length: warning relevance · case 03

The driver is warned about a restriction that is faster than the one already in force.

Railway interlocking logic◈ Members↗
FA-67329

Temporary speed restriction over train length: warning relevance · case 04

The driver is warned about a restriction that is faster than the one already in force.

Railway interlocking logic◈ Members↗
FA-67330

Temporary speed restriction over train length: warning relevance · case 05

The driver is warned about a restriction that is faster than the one already in force.

Railway interlocking logic◈ Members↗
FA-67331

Temporary speed restriction over train length: nearest restriction · case 01

The announced restriction is not the nearest one ahead.

Railway interlocking logic● Open access↗
FA-67332

Temporary speed restriction over train length: nearest restriction · case 02

The announced restriction is not the nearest one ahead.

Railway interlocking logic◈ Members↗
FA-67333

Temporary speed restriction over train length: nearest restriction · case 03

The announced restriction is not the nearest one ahead.

Railway interlocking logic◈ Members↗
FA-67334

Temporary speed restriction over train length: nearest restriction · case 04

The announced restriction is not the nearest one ahead.

Railway interlocking logic◈ Members↗
FA-67335

Temporary speed restriction over train length: nearest restriction · case 05

The announced restriction is not the nearest one ahead.

Railway interlocking logic◈ Members↗
FA-67336

Temporary speed restriction over train length: sighting distance reference · case 01

A restriction exactly at the sighting distance is not announced, or sighting is measured from the wrong end.

Railway interlocking logic● Open access↗
FA-67337

Temporary speed restriction over train length: sighting distance reference · case 02

A restriction exactly at the sighting distance is not announced, or sighting is measured from the wrong end.

Railway interlocking logic◈ Members↗
FA-67338

Temporary speed restriction over train length: sighting distance reference · case 03

A restriction exactly at the sighting distance is not announced, or sighting is measured from the wrong end.

Railway interlocking logic◈ Members↗
FA-67339

Temporary speed restriction over train length: sighting distance reference · case 04

A restriction exactly at the sighting distance is not announced, or sighting is measured from the wrong end.

Railway interlocking logic◈ Members↗
FA-67340

Temporary speed restriction over train length: sighting distance reference · case 05

A restriction exactly at the sighting distance is not announced, or sighting is measured from the wrong end.

Railway interlocking logic◈ Members↗
FA-67341

Directional collective next stop: same-direction call set · case 01

An up-travelling car stops for passengers who want to go down.

Elevator dispatch scheduling● Open access↗
FA-67342

Directional collective next stop: same-direction call set · case 02

An up-travelling car stops for passengers who want to go down.

Elevator dispatch scheduling◈ Members↗
FA-67343

Directional collective next stop: same-direction call set · case 03

An up-travelling car stops for passengers who want to go down.

Elevator dispatch scheduling◈ Members↗
FA-67344

Directional collective next stop: same-direction call set · case 04

An up-travelling car stops for passengers who want to go down.

Elevator dispatch scheduling◈ Members↗
FA-67345

Directional collective next stop: same-direction call set · case 05

An up-travelling car stops for passengers who want to go down.

Elevator dispatch scheduling◈ Members↗
FA-67346

Directional collective next stop: reversal call choice · case 01

The car reverses at the nearest down call and leaves higher down calls waiting.

Elevator dispatch scheduling● Open access↗
FA-67347

Directional collective next stop: reversal call choice · case 02

The car reverses at the nearest down call and leaves higher down calls waiting.

Elevator dispatch scheduling◈ Members↗
FA-67348

Directional collective next stop: reversal call choice · case 03

The car reverses at the nearest down call and leaves higher down calls waiting.

Elevator dispatch scheduling◈ Members↗
FA-67349

Directional collective next stop: reversal call choice · case 04

The car reverses at the nearest down call and leaves higher down calls waiting.

Elevator dispatch scheduling◈ Members↗
FA-67350

Directional collective next stop: reversal call choice · case 05

The car reverses at the nearest down call and leaves higher down calls waiting.

Elevator dispatch scheduling◈ Members↗
FA-67351

Directional collective next stop: idle tie-break · case 01

An idle car picks the wrong call when two are equally near, or ignores distance.

Elevator dispatch scheduling● Open access↗
FA-67352

Directional collective next stop: idle tie-break · case 02

An idle car picks the wrong call when two are equally near, or ignores distance.

Elevator dispatch scheduling◈ Members↗
FA-67353

Directional collective next stop: idle tie-break · case 03

An idle car picks the wrong call when two are equally near, or ignores distance.

Elevator dispatch scheduling◈ Members↗
FA-67354

Directional collective next stop: idle tie-break · case 04

An idle car picks the wrong call when two are equally near, or ignores distance.

Elevator dispatch scheduling◈ Members↗
FA-67355

Directional collective next stop: idle tie-break · case 05

An idle car picks the wrong call when two are equally near, or ignores distance.

Elevator dispatch scheduling◈ Members↗
FA-67356

Directional collective next stop: reversal fallback · case 01

A car with calls only behind it goes idle instead of reversing.

Elevator dispatch scheduling● Open access↗
FA-67357

Directional collective next stop: reversal fallback · case 02

A car with calls only behind it goes idle instead of reversing.

Elevator dispatch scheduling◈ Members↗
FA-67358

Directional collective next stop: reversal fallback · case 03

A car with calls only behind it goes idle instead of reversing.

Elevator dispatch scheduling◈ Members↗
FA-67359

Directional collective next stop: reversal fallback · case 04

A car with calls only behind it goes idle instead of reversing.

Elevator dispatch scheduling◈ Members↗
FA-67360

Directional collective next stop: reversal fallback · case 05

A car with calls only behind it goes idle instead of reversing.

Elevator dispatch scheduling◈ Members↗
FA-67361

Destination dispatch allocation: capacity boundary · case 01

A group that exactly fills the car is sent elsewhere, or an overfull car is chosen.

Elevator dispatch scheduling● Open access↗
FA-67362

Destination dispatch allocation: capacity boundary · case 02

A group that exactly fills the car is sent elsewhere, or an overfull car is chosen.

Elevator dispatch scheduling◈ Members↗
FA-67363

Destination dispatch allocation: capacity boundary · case 03

A group that exactly fills the car is sent elsewhere, or an overfull car is chosen.

Elevator dispatch scheduling◈ Members↗
FA-67364

Destination dispatch allocation: capacity boundary · case 04

A group that exactly fills the car is sent elsewhere, or an overfull car is chosen.

Elevator dispatch scheduling◈ Members↗
FA-67365

Destination dispatch allocation: capacity boundary · case 05

A group that exactly fills the car is sent elsewhere, or an overfull car is chosen.

Elevator dispatch scheduling◈ Members↗
FA-67366

Destination dispatch allocation: coincident stop credit · case 01

Passengers for the same floor are spread over several cars.

Elevator dispatch scheduling● Open access↗
FA-67367

Destination dispatch allocation: coincident stop credit · case 02

Passengers for the same floor are spread over several cars.

Elevator dispatch scheduling◈ Members↗
FA-67368

Destination dispatch allocation: coincident stop credit · case 03

Passengers for the same floor are spread over several cars.

Elevator dispatch scheduling◈ Members↗
FA-67369

Destination dispatch allocation: coincident stop credit · case 04

Passengers for the same floor are spread over several cars.

Elevator dispatch scheduling◈ Members↗
FA-67370

Destination dispatch allocation: coincident stop credit · case 05

Passengers for the same floor are spread over several cars.

Elevator dispatch scheduling◈ Members↗
FA-67371

Destination dispatch allocation: tie-break · case 01

Equal-cost allocations go to the highest car id.

Elevator dispatch scheduling● Open access↗
FA-67372

Destination dispatch allocation: tie-break · case 02

Equal-cost allocations go to the highest car id.

Elevator dispatch scheduling◈ Members↗
FA-67373

Destination dispatch allocation: tie-break · case 03

Equal-cost allocations go to the highest car id.

Elevator dispatch scheduling◈ Members↗
FA-67374

Destination dispatch allocation: tie-break · case 04

Equal-cost allocations go to the highest car id.

Elevator dispatch scheduling◈ Members↗
FA-67375

Destination dispatch allocation: tie-break · case 05

Equal-cost allocations go to the highest car id.

Elevator dispatch scheduling◈ Members↗
FA-67376

Destination dispatch allocation: load bookkeeping · case 01

A car keeps being allocated groups beyond its capacity.

Elevator dispatch scheduling● Open access↗
FA-67377

Destination dispatch allocation: load bookkeeping · case 02

A car keeps being allocated groups beyond its capacity.

Elevator dispatch scheduling◈ Members↗
FA-67378

Destination dispatch allocation: load bookkeeping · case 03

A car keeps being allocated groups beyond its capacity.

Elevator dispatch scheduling◈ Members↗
FA-67379

Destination dispatch allocation: load bookkeeping · case 04

A car keeps being allocated groups beyond its capacity.

Elevator dispatch scheduling◈ Members↗
FA-67380

Destination dispatch allocation: load bookkeeping · case 05

A car keeps being allocated groups beyond its capacity.

Elevator dispatch scheduling◈ Members↗
FA-67381

Destination dispatch allocation: stop bookkeeping · case 01

Later passengers for the same floor are not recognised as coincident.

Elevator dispatch scheduling● Open access↗
FA-67382

Destination dispatch allocation: stop bookkeeping · case 02

Later passengers for the same floor are not recognised as coincident.

Elevator dispatch scheduling◈ Members↗
FA-67383

Destination dispatch allocation: stop bookkeeping · case 03

Later passengers for the same floor are not recognised as coincident.

Elevator dispatch scheduling◈ Members↗
FA-67384

Destination dispatch allocation: stop bookkeeping · case 04

Later passengers for the same floor are not recognised as coincident.

Elevator dispatch scheduling◈ Members↗
FA-67385

Destination dispatch allocation: stop bookkeeping · case 05

Later passengers for the same floor are not recognised as coincident.

Elevator dispatch scheduling◈ Members↗
FA-67386

Door dwell time calculation: stop type base · case 01

A stop serving both hall and car calls closes its doors too quickly.

Elevator dispatch scheduling● Open access↗
FA-67387

Door dwell time calculation: stop type base · case 02

A stop serving both hall and car calls closes its doors too quickly.

Elevator dispatch scheduling◈ Members↗
FA-67388

Door dwell time calculation: stop type base · case 03

A stop serving both hall and car calls closes its doors too quickly.

Elevator dispatch scheduling◈ Members↗
FA-67389

Door dwell time calculation: stop type base · case 04

A stop serving both hall and car calls closes its doors too quickly.

Elevator dispatch scheduling◈ Members↗
FA-67390

Door dwell time calculation: stop type base · case 05

A stop serving both hall and car calls closes its doors too quickly.

Elevator dispatch scheduling◈ Members↗
FA-67391

Door dwell time calculation: accessible extension rounding · case 01

Accessible mode has no effect or yields fractional deciseconds.

Elevator dispatch scheduling● Open access↗
FA-67392

Door dwell time calculation: accessible extension rounding · case 02

Accessible mode has no effect or yields fractional deciseconds.

Elevator dispatch scheduling◈ Members↗
FA-67393

Door dwell time calculation: accessible extension rounding · case 03

Accessible mode has no effect or yields fractional deciseconds.

Elevator dispatch scheduling◈ Members↗
FA-67394

Door dwell time calculation: accessible extension rounding · case 04

Accessible mode has no effect or yields fractional deciseconds.

Elevator dispatch scheduling◈ Members↗
FA-67395

Door dwell time calculation: accessible extension rounding · case 05

Accessible mode has no effect or yields fractional deciseconds.

Elevator dispatch scheduling◈ Members↗
FA-67396

Door dwell time calculation: first passenger allowance · case 01

Every stop is ten deciseconds longer than stipulated, or shorter when nobody moves.

Elevator dispatch scheduling● Open access↗
FA-67397

Door dwell time calculation: first passenger allowance · case 02

Every stop is ten deciseconds longer than stipulated, or shorter when nobody moves.

Elevator dispatch scheduling◈ Members↗
FA-67398

Door dwell time calculation: first passenger allowance · case 03

Every stop is ten deciseconds longer than stipulated, or shorter when nobody moves.

Elevator dispatch scheduling◈ Members↗
FA-67399

Door dwell time calculation: first passenger allowance · case 04

Every stop is ten deciseconds longer than stipulated, or shorter when nobody moves.

Elevator dispatch scheduling◈ Members↗
FA-67400

Door dwell time calculation: first passenger allowance · case 05

Every stop is ten deciseconds longer than stipulated, or shorter when nobody moves.

Elevator dispatch scheduling◈ Members↗

INSPECTABLE BY DESIGN

Every result has a runnable source.

Runnable implementations with recorded outputs, source hashes, and explicit contracts. Related variants share a failure mechanism and belong together in evaluation splits.

Read the methodology ↗