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-40801

Indexed erase fills the selected hole instead of shifting unrelated heap slots · case 01

The bounded indexed erase routing certificate reports an incorrect slots.

Heap invariants● Open access↗
FA-40802

Indexed erase fills the selected hole instead of shifting unrelated heap slots · case 02

The bounded indexed erase routing certificate reports an incorrect slots.

Heap invariants◈ Members↗
FA-40803

Indexed erase fills the selected hole instead of shifting unrelated heap slots · case 03

The bounded indexed erase routing certificate reports an incorrect slots.

Heap invariants◈ Members↗
FA-40804

Indexed erase fills the selected hole instead of shifting unrelated heap slots · case 04

The bounded indexed erase routing certificate reports an incorrect slots.

Heap invariants◈ Members↗
FA-40805

Indexed erase fills the selected hole instead of shifting unrelated heap slots · case 05

The bounded indexed erase routing certificate reports an incorrect slots.

Heap invariants◈ Members↗
FA-40806

Indexed erase invalidates the selected handle instead of the moved tail handle · case 01

The bounded indexed erase routing certificate reports an incorrect removed.

Heap invariants● Open access↗
FA-40807

Indexed erase invalidates the selected handle instead of the moved tail handle · case 02

The bounded indexed erase routing certificate reports an incorrect removed.

Heap invariants◈ Members↗
FA-40808

Indexed erase invalidates the selected handle instead of the moved tail handle · case 03

The bounded indexed erase routing certificate reports an incorrect removed.

Heap invariants◈ Members↗
FA-40809

Indexed erase invalidates the selected handle instead of the moved tail handle · case 04

The bounded indexed erase routing certificate reports an incorrect removed.

Heap invariants◈ Members↗
FA-40810

Indexed erase invalidates the selected handle instead of the moved tail handle · case 05

The bounded indexed erase routing certificate reports an incorrect removed.

Heap invariants◈ Members↗
FA-40811

Indexed erase can require upward repair when a tail crosses subtree priority boundaries · case 01

The bounded indexed erase routing certificate reports an incorrect direction.

Heap invariants● Open access↗
FA-40812

Indexed erase can require upward repair when a tail crosses subtree priority boundaries · case 02

The bounded indexed erase routing certificate reports an incorrect direction.

Heap invariants◈ Members↗
FA-40813

Indexed erase can require upward repair when a tail crosses subtree priority boundaries · case 03

The bounded indexed erase routing certificate reports an incorrect direction.

Heap invariants◈ Members↗
FA-40814

Indexed erase can require upward repair when a tail crosses subtree priority boundaries · case 04

The bounded indexed erase routing certificate reports an incorrect direction.

Heap invariants◈ Members↗
FA-40815

Indexed erase can require upward repair when a tail crosses subtree priority boundaries · case 05

The bounded indexed erase routing certificate reports an incorrect direction.

Heap invariants◈ Members↗
FA-40816

Indexed erase remaps the tail handle to its new hole · case 01

The bounded indexed erase routing certificate reports an incorrect replacement location.

Heap invariants● Open access↗
FA-40817

Indexed erase remaps the tail handle to its new hole · case 02

The bounded indexed erase routing certificate reports an incorrect replacement location.

Heap invariants◈ Members↗
FA-40818

Indexed erase remaps the tail handle to its new hole · case 03

The bounded indexed erase routing certificate reports an incorrect replacement location.

Heap invariants◈ Members↗
FA-40819

Indexed erase remaps the tail handle to its new hole · case 04

The bounded indexed erase routing certificate reports an incorrect replacement location.

Heap invariants◈ Members↗
FA-40820

Indexed erase remaps the tail handle to its new hole · case 05

The bounded indexed erase routing certificate reports an incorrect replacement location.

Heap invariants◈ Members↗
FA-40821

Indexed erase preserves every other identity including equal-priority members · case 01

The bounded indexed erase routing certificate reports an incorrect retained.

Heap invariants● Open access↗
FA-40822

Indexed erase preserves every other identity including equal-priority members · case 02

The bounded indexed erase routing certificate reports an incorrect retained.

Heap invariants◈ Members↗
FA-40823

Indexed erase preserves every other identity including equal-priority members · case 03

The bounded indexed erase routing certificate reports an incorrect retained.

Heap invariants◈ Members↗
FA-40824

Indexed erase preserves every other identity including equal-priority members · case 04

The bounded indexed erase routing certificate reports an incorrect retained.

Heap invariants◈ Members↗
FA-40825

Indexed erase preserves every other identity including equal-priority members · case 05

The bounded indexed erase routing certificate reports an incorrect retained.

Heap invariants◈ Members↗
FA-40826

Indexed erase shrinks logical size exactly once even for tail deletion · case 01

The bounded indexed erase routing certificate reports an incorrect size.

Heap invariants● Open access↗
FA-40827

Indexed erase shrinks logical size exactly once even for tail deletion · case 02

The bounded indexed erase routing certificate reports an incorrect size.

Heap invariants◈ Members↗
FA-40828

Indexed erase shrinks logical size exactly once even for tail deletion · case 03

The bounded indexed erase routing certificate reports an incorrect size.

Heap invariants◈ Members↗
FA-40829

Indexed erase shrinks logical size exactly once even for tail deletion · case 04

The bounded indexed erase routing certificate reports an incorrect size.

Heap invariants◈ Members↗
FA-40830

Indexed erase shrinks logical size exactly once even for tail deletion · case 05

The bounded indexed erase routing certificate reports an incorrect size.

Heap invariants◈ Members↗
FA-40831

Bucket priority bitmap encodes priority positions rather than counts · case 01

The bounded priority bitset certificate reports an incorrect actual mask.

Heap invariants● Open access↗
FA-40832

Bucket priority bitmap encodes priority positions rather than counts · case 02

The bounded priority bitset certificate reports an incorrect actual mask.

Heap invariants◈ Members↗
FA-40833

Bucket priority bitmap encodes priority positions rather than counts · case 03

The bounded priority bitset certificate reports an incorrect actual mask.

Heap invariants◈ Members↗
FA-40834

Bucket priority bitmap encodes priority positions rather than counts · case 04

The bounded priority bitset certificate reports an incorrect actual mask.

Heap invariants◈ Members↗
FA-40835

Bucket priority bitmap encodes priority positions rather than counts · case 05

The bounded priority bitset certificate reports an incorrect actual mask.

Heap invariants◈ Members↗
FA-40836

Bucket priority minimum uses the least set bit with zero-based position · case 01

The bounded priority bitset certificate reports an incorrect minimum.

Heap invariants● Open access↗
FA-40837

Bucket priority minimum uses the least set bit with zero-based position · case 02

The bounded priority bitset certificate reports an incorrect minimum.

Heap invariants◈ Members↗
FA-40838

Bucket priority minimum uses the least set bit with zero-based position · case 03

The bounded priority bitset certificate reports an incorrect minimum.

Heap invariants◈ Members↗
FA-40839

Bucket priority minimum uses the least set bit with zero-based position · case 04

The bounded priority bitset certificate reports an incorrect minimum.

Heap invariants◈ Members↗
FA-40840

Bucket priority minimum uses the least set bit with zero-based position · case 05

The bounded priority bitset certificate reports an incorrect minimum.

Heap invariants◈ Members↗
FA-40841

Bucket priority maximum uses the highest set bit with zero-based position · case 01

The bounded priority bitset certificate reports an incorrect maximum.

Heap invariants● Open access↗
FA-40842

Bucket priority maximum uses the highest set bit with zero-based position · case 02

The bounded priority bitset certificate reports an incorrect maximum.

Heap invariants◈ Members↗
FA-40843

Bucket priority maximum uses the highest set bit with zero-based position · case 03

The bounded priority bitset certificate reports an incorrect maximum.

Heap invariants◈ Members↗
FA-40844

Bucket priority maximum uses the highest set bit with zero-based position · case 04

The bounded priority bitset certificate reports an incorrect maximum.

Heap invariants◈ Members↗
FA-40845

Bucket priority maximum uses the highest set bit with zero-based position · case 05

The bounded priority bitset certificate reports an incorrect maximum.

Heap invariants◈ Members↗
FA-40846

Bucket bitmap consistency identifies set bits whose buckets are empty · case 01

The bounded priority bitset certificate reports an incorrect ghosts.

Heap invariants● Open access↗
FA-40847

Bucket bitmap consistency identifies set bits whose buckets are empty · case 02

The bounded priority bitset certificate reports an incorrect ghosts.

Heap invariants◈ Members↗
FA-40848

Bucket bitmap consistency identifies set bits whose buckets are empty · case 03

The bounded priority bitset certificate reports an incorrect ghosts.

Heap invariants◈ Members↗
FA-40849

Bucket bitmap consistency identifies set bits whose buckets are empty · case 04

The bounded priority bitset certificate reports an incorrect ghosts.

Heap invariants◈ Members↗
FA-40850

Bucket bitmap consistency identifies set bits whose buckets are empty · case 05

The bounded priority bitset certificate reports an incorrect ghosts.

Heap invariants◈ Members↗
FA-40851

Bucket bitmap consistency identifies occupied buckets lacking their bit · case 01

The bounded priority bitset certificate reports an incorrect missing.

Heap invariants● Open access↗
FA-40852

Bucket bitmap consistency identifies occupied buckets lacking their bit · case 02

The bounded priority bitset certificate reports an incorrect missing.

Heap invariants◈ Members↗
FA-40853

Bucket bitmap consistency identifies occupied buckets lacking their bit · case 03

The bounded priority bitset certificate reports an incorrect missing.

Heap invariants◈ Members↗
FA-40854

Bucket bitmap consistency identifies occupied buckets lacking their bit · case 04

The bounded priority bitset certificate reports an incorrect missing.

Heap invariants◈ Members↗
FA-40855

Bucket bitmap consistency identifies occupied buckets lacking their bit · case 05

The bounded priority bitset certificate reports an incorrect missing.

Heap invariants◈ Members↗
FA-40856

Bucket pop clears occupancy only when the bucket becomes empty · case 01

The bounded priority bitset certificate reports an incorrect after pop.

Heap invariants● Open access↗
FA-40857

Bucket pop clears occupancy only when the bucket becomes empty · case 02

The bounded priority bitset certificate reports an incorrect after pop.

Heap invariants◈ Members↗
FA-40858

Bucket pop clears occupancy only when the bucket becomes empty · case 03

The bounded priority bitset certificate reports an incorrect after pop.

Heap invariants◈ Members↗
FA-40859

Bucket pop clears occupancy only when the bucket becomes empty · case 04

The bounded priority bitset certificate reports an incorrect after pop.

Heap invariants◈ Members↗
FA-40860

Bucket pop clears occupancy only when the bucket becomes empty · case 05

The bounded priority bitset certificate reports an incorrect after pop.

Heap invariants◈ Members↗
FA-40861

Cyclic priority buckets use absolute-key residue independent of the current cursor · case 01

The bounded dial window certificate reports an incorrect buckets.

Heap invariants● Open access↗
FA-40862

Cyclic priority buckets use absolute-key residue independent of the current cursor · case 02

The bounded dial window certificate reports an incorrect buckets.

Heap invariants◈ Members↗
FA-40863

Cyclic priority buckets use absolute-key residue independent of the current cursor · case 03

The bounded dial window certificate reports an incorrect buckets.

Heap invariants◈ Members↗
FA-40864

Cyclic priority buckets use absolute-key residue independent of the current cursor · case 04

The bounded dial window certificate reports an incorrect buckets.

Heap invariants◈ Members↗
FA-40865

Cyclic priority buckets use absolute-key residue independent of the current cursor · case 05

The bounded dial window certificate reports an incorrect buckets.

Heap invariants◈ Members↗
FA-40866

Cyclic priority expiry compares absolute keys rather than residues · case 01

The bounded dial window certificate reports an incorrect expired.

Heap invariants● Open access↗
FA-40867

Cyclic priority expiry compares absolute keys rather than residues · case 02

The bounded dial window certificate reports an incorrect expired.

Heap invariants◈ Members↗
FA-40868

Cyclic priority expiry compares absolute keys rather than residues · case 03

The bounded dial window certificate reports an incorrect expired.

Heap invariants◈ Members↗
FA-40869

Cyclic priority expiry compares absolute keys rather than residues · case 04

The bounded dial window certificate reports an incorrect expired.

Heap invariants◈ Members↗
FA-40870

Cyclic priority expiry compares absolute keys rather than residues · case 05

The bounded dial window certificate reports an incorrect expired.

Heap invariants◈ Members↗
FA-40871

Cyclic priority queue excludes the next revolution boundary from the active window · case 01

The bounded dial window certificate reports an incorrect future.

Heap invariants● Open access↗
FA-40872

Cyclic priority queue excludes the next revolution boundary from the active window · case 02

The bounded dial window certificate reports an incorrect future.

Heap invariants◈ Members↗
FA-40873

Cyclic priority queue excludes the next revolution boundary from the active window · case 03

The bounded dial window certificate reports an incorrect future.

Heap invariants◈ Members↗
FA-40874

Cyclic priority queue excludes the next revolution boundary from the active window · case 04

The bounded dial window certificate reports an incorrect future.

Heap invariants◈ Members↗
FA-40875

Cyclic priority queue excludes the next revolution boundary from the active window · case 05

The bounded dial window certificate reports an incorrect future.

Heap invariants◈ Members↗
FA-40876

Cyclic priority extraction selects an absolute active key rather than a stale or modulo minimum · case 01

The bounded dial window certificate reports an incorrect next.

Heap invariants● Open access↗
FA-40877

Cyclic priority extraction selects an absolute active key rather than a stale or modulo minimum · case 02

The bounded dial window certificate reports an incorrect next.

Heap invariants◈ Members↗
FA-40878

Cyclic priority extraction selects an absolute active key rather than a stale or modulo minimum · case 03

The bounded dial window certificate reports an incorrect next.

Heap invariants◈ Members↗
FA-40879

Cyclic priority extraction selects an absolute active key rather than a stale or modulo minimum · case 04

The bounded dial window certificate reports an incorrect next.

Heap invariants◈ Members↗
FA-40880

Cyclic priority extraction selects an absolute active key rather than a stale or modulo minimum · case 05

The bounded dial window certificate reports an incorrect next.

Heap invariants◈ Members↗
FA-40881

Cyclic priority cursor advance handles physical wrap and distinguishes no candidate · case 01

The bounded dial window certificate reports an incorrect advance.

Heap invariants● Open access↗
FA-40882

Cyclic priority cursor advance handles physical wrap and distinguishes no candidate · case 02

The bounded dial window certificate reports an incorrect advance.

Heap invariants◈ Members↗
FA-40883

Cyclic priority cursor advance handles physical wrap and distinguishes no candidate · case 03

The bounded dial window certificate reports an incorrect advance.

Heap invariants◈ Members↗
FA-40884

Cyclic priority cursor advance handles physical wrap and distinguishes no candidate · case 04

The bounded dial window certificate reports an incorrect advance.

Heap invariants◈ Members↗
FA-40885

Cyclic priority cursor advance handles physical wrap and distinguishes no candidate · case 05

The bounded dial window certificate reports an incorrect advance.

Heap invariants◈ Members↗
FA-40886

Cyclic bucket traversal follows logical key order across wraparound · case 01

The bounded dial window certificate reports an incorrect active order.

Heap invariants● Open access↗
FA-40887

Cyclic bucket traversal follows logical key order across wraparound · case 02

The bounded dial window certificate reports an incorrect active order.

Heap invariants◈ Members↗
FA-40888

Cyclic bucket traversal follows logical key order across wraparound · case 03

The bounded dial window certificate reports an incorrect active order.

Heap invariants◈ Members↗
FA-40889

Cyclic bucket traversal follows logical key order across wraparound · case 04

The bounded dial window certificate reports an incorrect active order.

Heap invariants◈ Members↗
FA-40890

Cyclic bucket traversal follows logical key order across wraparound · case 05

The bounded dial window certificate reports an incorrect active order.

Heap invariants◈ Members↗
FA-40891

Calendar queue virtual bucket uses floor division relative to origin including negative offsets · case 01

The bounded calendar placement certificate reports an incorrect virtual.

Heap invariants● Open access↗
FA-40892

Calendar queue virtual bucket uses floor division relative to origin including negative offsets · case 02

The bounded calendar placement certificate reports an incorrect virtual.

Heap invariants◈ Members↗
FA-40893

Calendar queue virtual bucket uses floor division relative to origin including negative offsets · case 03

The bounded calendar placement certificate reports an incorrect virtual.

Heap invariants◈ Members↗
FA-40894

Calendar queue virtual bucket uses floor division relative to origin including negative offsets · case 04

The bounded calendar placement certificate reports an incorrect virtual.

Heap invariants◈ Members↗
FA-40895

Calendar queue virtual bucket uses floor division relative to origin including negative offsets · case 05

The bounded calendar placement certificate reports an incorrect virtual.

Heap invariants◈ Members↗
FA-40896

Calendar queue physical bucket wraps negative and positive virtual indices by modulo · case 01

The bounded calendar placement certificate reports an incorrect physical.

Heap invariants● Open access↗
FA-40897

Calendar queue physical bucket wraps negative and positive virtual indices by modulo · case 02

The bounded calendar placement certificate reports an incorrect physical.

Heap invariants◈ Members↗
FA-40898

Calendar queue physical bucket wraps negative and positive virtual indices by modulo · case 03

The bounded calendar placement certificate reports an incorrect physical.

Heap invariants◈ Members↗
FA-40899

Calendar queue physical bucket wraps negative and positive virtual indices by modulo · case 04

The bounded calendar placement certificate reports an incorrect physical.

Heap invariants◈ Members↗
FA-40900

Calendar queue physical bucket wraps negative and positive virtual indices by modulo · case 05

The bounded calendar placement certificate reports an incorrect physical.

Heap invariants◈ 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 ↗