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 ↗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
Energy saving car shutdown: reactivation trigger · case 01
A car is reactivated at exactly 45 s, or reactivation runs past the fleet size.
Energy saving car shutdown: reactivation trigger · case 02
A car is reactivated at exactly 45 s, or reactivation runs past the fleet size.
Energy saving car shutdown: reactivation trigger · case 03
A car is reactivated at exactly 45 s, or reactivation runs past the fleet size.
Energy saving car shutdown: reactivation trigger · case 04
A car is reactivated at exactly 45 s, or reactivation runs past the fleet size.
Energy saving car shutdown: reactivation trigger · case 05
A car is reactivated at exactly 45 s, or reactivation runs past the fleet size.
Energy saving car shutdown: timer restart after shutdown · case 01
Cars are shut down on every quiet sample after the first shutdown.
Energy saving car shutdown: timer restart after shutdown · case 02
Cars are shut down on every quiet sample after the first shutdown.
Energy saving car shutdown: timer restart after shutdown · case 03
Cars are shut down on every quiet sample after the first shutdown.
Energy saving car shutdown: timer restart after shutdown · case 04
Cars are shut down on every quiet sample after the first shutdown.
Energy saving car shutdown: timer restart after shutdown · case 05
Cars are shut down on every quiet sample after the first shutdown.
Energy saving car shutdown: minimum fleet guard · case 01
The group shuts down below the minimum number of active cars.
Energy saving car shutdown: minimum fleet guard · case 02
The group shuts down below the minimum number of active cars.
Energy saving car shutdown: minimum fleet guard · case 03
The group shuts down below the minimum number of active cars.
Energy saving car shutdown: minimum fleet guard · case 04
The group shuts down below the minimum number of active cars.
Energy saving car shutdown: minimum fleet guard · case 05
The group shuts down below the minimum number of active cars.
Energy saving car shutdown: timer clearing on demand · case 01
A brief quiet spell after busy traffic triggers a shutdown.
Energy saving car shutdown: timer clearing on demand · case 02
A brief quiet spell after busy traffic triggers a shutdown.
Energy saving car shutdown: timer clearing on demand · case 03
A brief quiet spell after busy traffic triggers a shutdown.
Energy saving car shutdown: timer clearing on demand · case 04
A brief quiet spell after busy traffic triggers a shutdown.
Energy saving car shutdown: timer clearing on demand · case 05
A brief quiet spell after busy traffic triggers a shutdown.
Encoder position and door zone detection: pulse unit conversion · case 01
The car position drifts or barely moves with encoder pulses.
Encoder position and door zone detection: pulse unit conversion · case 02
The car position drifts or barely moves with encoder pulses.
Encoder position and door zone detection: pulse unit conversion · case 03
The car position drifts or barely moves with encoder pulses.
Encoder position and door zone detection: pulse unit conversion · case 04
The car position drifts or barely moves with encoder pulses.
Encoder position and door zone detection: pulse unit conversion · case 05
The car position drifts or barely moves with encoder pulses.
Encoder position and door zone detection: magnet correction · case 01
Passing a door-zone magnet throws the position far off.
Encoder position and door zone detection: magnet correction · case 02
Passing a door-zone magnet throws the position far off.
Encoder position and door zone detection: magnet correction · case 03
Passing a door-zone magnet throws the position far off.
Encoder position and door zone detection: magnet correction · case 04
Passing a door-zone magnet throws the position far off.
Encoder position and door zone detection: magnet correction · case 05
Passing a door-zone magnet throws the position far off.
Encoder position and door zone detection: door zone test · case 01
A car exactly at the zone edge is reported between floors.
Encoder position and door zone detection: door zone test · case 02
A car exactly at the zone edge is reported between floors.
Encoder position and door zone detection: door zone test · case 03
A car exactly at the zone edge is reported between floors.
Encoder position and door zone detection: door zone test · case 04
A car exactly at the zone edge is reported between floors.
Encoder position and door zone detection: door zone test · case 05
A car exactly at the zone edge is reported between floors.
Encoder position and door zone detection: millimetre rounding · case 01
Positions just short of the zone edge are rounded into it.
Encoder position and door zone detection: millimetre rounding · case 02
Positions just short of the zone edge are rounded into it.
Encoder position and door zone detection: millimetre rounding · case 03
Positions just short of the zone edge are rounded into it.
Encoder position and door zone detection: millimetre rounding · case 04
Positions just short of the zone edge are rounded into it.
Encoder position and door zone detection: millimetre rounding · case 05
Positions just short of the zone edge are rounded into it.
Webster cycle length: critical ratio sums every lane group of a phase · case 01
Webster cycle length returns a wrong result when critical ratio sums every lane group of a phase.
Webster cycle length: critical ratio sums every lane group of a phase · case 02
Webster cycle length returns a wrong result when critical ratio sums every lane group of a phase.
Webster cycle length: critical ratio sums every lane group of a phase · case 03
Webster cycle length returns a wrong result when critical ratio sums every lane group of a phase.
Webster cycle length: critical ratio sums every lane group of a phase · case 04
Webster cycle length returns a wrong result when critical ratio sums every lane group of a phase.
Webster cycle length: critical ratio sums every lane group of a phase · case 05
Webster cycle length returns a wrong result when critical ratio sums every lane group of a phase.
Webster cycle length: lost time is counted once per cycle instead of once per phase · case 01
Webster cycle length returns a wrong result when lost time is counted once per cycle instead of once per phase.
Webster cycle length: lost time is counted once per cycle instead of once per phase · case 02
Webster cycle length returns a wrong result when lost time is counted once per cycle instead of once per phase.
Webster cycle length: lost time is counted once per cycle instead of once per phase · case 03
Webster cycle length returns a wrong result when lost time is counted once per cycle instead of once per phase.
Webster cycle length: lost time is counted once per cycle instead of once per phase · case 04
Webster cycle length returns a wrong result when lost time is counted once per cycle instead of once per phase.
Webster cycle length: lost time is counted once per cycle instead of once per phase · case 05
Webster cycle length returns a wrong result when lost time is counted once per cycle instead of once per phase.
Webster cycle length: the constant 5 s is scaled together with lost time · case 01
Webster cycle length returns a wrong result when the constant 5 s is scaled together with lost time.
Webster cycle length: the constant 5 s is scaled together with lost time · case 02
Webster cycle length returns a wrong result when the constant 5 s is scaled together with lost time.
Webster cycle length: the constant 5 s is scaled together with lost time · case 03
Webster cycle length returns a wrong result when the constant 5 s is scaled together with lost time.
Webster cycle length: the constant 5 s is scaled together with lost time · case 04
Webster cycle length returns a wrong result when the constant 5 s is scaled together with lost time.
Webster cycle length: the constant 5 s is scaled together with lost time · case 05
Webster cycle length returns a wrong result when the constant 5 s is scaled together with lost time.
Webster cycle length: the computed cycle is rounded down to a 5 s multiple · case 01
Webster cycle length returns a wrong result when the computed cycle is rounded down to a 5 s multiple.
Webster cycle length: the computed cycle is rounded down to a 5 s multiple · case 02
Webster cycle length returns a wrong result when the computed cycle is rounded down to a 5 s multiple.
Webster cycle length: the computed cycle is rounded down to a 5 s multiple · case 03
Webster cycle length returns a wrong result when the computed cycle is rounded down to a 5 s multiple.
Webster cycle length: the computed cycle is rounded down to a 5 s multiple · case 04
Webster cycle length returns a wrong result when the computed cycle is rounded down to a 5 s multiple.
Webster cycle length: the computed cycle is rounded down to a 5 s multiple · case 05
Webster cycle length returns a wrong result when the computed cycle is rounded down to a 5 s multiple.
Webster cycle length: the oversaturation guard only trips above Y = 1 · case 01
Webster cycle length returns a wrong result when the oversaturation guard only trips above Y = 1.
Webster cycle length: the oversaturation guard only trips above Y = 1 · case 02
Webster cycle length returns a wrong result when the oversaturation guard only trips above Y = 1.
Webster cycle length: the oversaturation guard only trips above Y = 1 · case 03
Webster cycle length returns a wrong result when the oversaturation guard only trips above Y = 1.
Webster cycle length: the oversaturation guard only trips above Y = 1 · case 04
Webster cycle length returns a wrong result when the oversaturation guard only trips above Y = 1.
Webster cycle length: the oversaturation guard only trips above Y = 1 · case 05
Webster cycle length returns a wrong result when the oversaturation guard only trips above Y = 1.
Webster cycle length: the cycle is not capped at the controller maximum · case 01
Webster cycle length returns a wrong result when the cycle is not capped at the controller maximum.
Webster cycle length: the cycle is not capped at the controller maximum · case 02
Webster cycle length returns a wrong result when the cycle is not capped at the controller maximum.
Webster cycle length: the cycle is not capped at the controller maximum · case 03
Webster cycle length returns a wrong result when the cycle is not capped at the controller maximum.
Webster cycle length: the cycle is not capped at the controller maximum · case 04
Webster cycle length returns a wrong result when the cycle is not capped at the controller maximum.
Webster cycle length: the cycle is not capped at the controller maximum · case 05
Webster cycle length returns a wrong result when the cycle is not capped at the controller maximum.
Green split allocation: the whole cycle is distributed as green · case 01
Green split allocation returns a wrong result when the whole cycle is distributed as green.
Green split allocation: the whole cycle is distributed as green · case 02
Green split allocation returns a wrong result when the whole cycle is distributed as green.
Green split allocation: the whole cycle is distributed as green · case 03
Green split allocation returns a wrong result when the whole cycle is distributed as green.
Green split allocation: the whole cycle is distributed as green · case 04
Green split allocation returns a wrong result when the whole cycle is distributed as green.
Green split allocation: the whole cycle is distributed as green · case 05
Green split allocation returns a wrong result when the whole cycle is distributed as green.
Green split allocation: leftover seconds go to the smallest remainders · case 01
Green split allocation returns a wrong result when leftover seconds go to the smallest remainders.
Green split allocation: leftover seconds go to the smallest remainders · case 02
Green split allocation returns a wrong result when leftover seconds go to the smallest remainders.
Green split allocation: leftover seconds go to the smallest remainders · case 03
Green split allocation returns a wrong result when leftover seconds go to the smallest remainders.
Green split allocation: leftover seconds go to the smallest remainders · case 04
Green split allocation returns a wrong result when leftover seconds go to the smallest remainders.
Green split allocation: leftover seconds go to the smallest remainders · case 05
Green split allocation returns a wrong result when leftover seconds go to the smallest remainders.
Green split allocation: base shares are rounded to nearest before remainder distribution · case 01
Green split allocation returns a wrong result when base shares are rounded to nearest before remainder distribution.
Green split allocation: base shares are rounded to nearest before remainder distribution · case 02
Green split allocation returns a wrong result when base shares are rounded to nearest before remainder distribution.
Green split allocation: base shares are rounded to nearest before remainder distribution · case 03
Green split allocation returns a wrong result when base shares are rounded to nearest before remainder distribution.
Green split allocation: base shares are rounded to nearest before remainder distribution · case 04
Green split allocation returns a wrong result when base shares are rounded to nearest before remainder distribution.
Green split allocation: base shares are rounded to nearest before remainder distribution · case 05
Green split allocation returns a wrong result when base shares are rounded to nearest before remainder distribution.
Green split allocation: critical flow ratios are read as den over num · case 01
Green split allocation returns a wrong result when critical flow ratios are read as den over num.
Green split allocation: critical flow ratios are read as den over num · case 02
Green split allocation returns a wrong result when critical flow ratios are read as den over num.
Green split allocation: critical flow ratios are read as den over num · case 03
Green split allocation returns a wrong result when critical flow ratios are read as den over num.
Green split allocation: critical flow ratios are read as den over num · case 04
Green split allocation returns a wrong result when critical flow ratios are read as den over num.
Green split allocation: critical flow ratios are read as den over num · case 05
Green split allocation returns a wrong result when critical flow ratios are read as den over num.
Green split allocation: feasibility compares the single largest minimum with G · case 01
Green split allocation returns a wrong result when feasibility compares the single largest minimum with G.
Green split allocation: feasibility compares the single largest minimum with G · case 02
Green split allocation returns a wrong result when feasibility compares the single largest minimum with G.
Green split allocation: feasibility compares the single largest minimum with G · case 03
Green split allocation returns a wrong result when feasibility compares the single largest minimum with G.
Green split allocation: feasibility compares the single largest minimum with G · case 04
Green split allocation returns a wrong result when feasibility compares the single largest minimum with G.
Green split allocation: feasibility compares the single largest minimum with G · case 05
Green split allocation returns a wrong result when feasibility compares the single largest minimum with G.
Green split allocation: minimum green seconds are taken from the longest green regardless of its own minimum · case 01
Green split allocation returns a wrong result when minimum green seconds are taken from the longest green regardless of its own minimum.
Green split allocation: minimum green seconds are taken from the longest green regardless of its own minimum · case 02
Green split allocation returns a wrong result when minimum green seconds are taken from the longest green regardless of its own minimum.
Green split allocation: minimum green seconds are taken from the longest green regardless of its own minimum · case 03
Green split allocation returns a wrong result when minimum green seconds are taken from the longest green regardless of its own minimum.
Green split allocation: minimum green seconds are taken from the longest green regardless of its own minimum · case 04
Green split allocation returns a wrong result when minimum green seconds are taken from the longest green regardless of its own minimum.
Green split allocation: minimum green seconds are taken from the longest green regardless of its own minimum · case 05
Green split allocation returns a wrong result when minimum green seconds are taken from the longest green regardless of its own minimum.
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 ↗