FAILURE MAP
← Case archive

FA-20771 / Assistive announcements / Open access

Inherited and local speech priorities are added · case 01

The announcement trace violates the stated priority-inheritance contract.

Verified by executionVariant 1 · 7 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

Fault site: scores=[max(x[2],floors.get(x[1],0)) for x in q] is implemented as scores=[x[2]+floors.get(x[1],0) for x in q]

THE FAILURE

Fault site: scores=[max(x[2],floors.get(x[1],0)) for x in q] is implemented as scores=[x[2]+floors.get(x[1],0) for x in q]

Unsuccessful approach: The attempted repair substitutes scores=[floors.get(x[1],x[2]) for x in q] and still violates a regression oracle.

Case contract

Messages belong to groups. Set group priority affects future selection, not stored base. Enqueue [id,group,base,text]. Group floor combines with base using max. Drain picks largest effective priority, then earliest position; repeat drains remove only winner. Drop-group removes its messages and floor. Move changes only a message group. Reset-floor removes inheritance but retains messages. Report spoken IDs and pending [id,group].

Why this case matters

Deterministic controlled model of assistive announcement delivery.

1 / The failure

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(events):
    floors={}; q=[]; spoken=[]
    for e in events:
        if e[0]=='floor': floors[e[1]]=e[2]
        elif e[0]=='enqueue': q.append(e[1:])
        elif e[0]=='drop':
            q=[x for x in q if x[1]!=e[1]]
            floors.pop(e[1],None)
        elif e[0]=='move':
            for x in q:
                if x[0]==e[1]: x[1]=e[2]
        elif e[0]=='reset': floors.pop(e[1],None)
        elif e[0]=='drain' and q:
            scores=[x[2]+floors.get(x[1],0) for x in q]
            index=scores.index(max(scores))
            chosen=q.pop(index)
            spoken.append([chosen[0],chosen[3]])
    return [spoken,[x[:2] for x in q],sorted(floors.items())]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = ["[['floor','g',4],['enqueue','a','g',N+1,'alpha'],['enqueue','b','h',6,'beta'],['drain'],['drain']]", "[['enqueue','a','g',1,'first'*N],['enqueue','b','g',1,'second'],['drain']]", "[['floor','g',9],['floor','g',1],['enqueue','a','g',2,'a'*N],['enqueue','b','h',3,'b'],['drain']]", "[['floor','g',9],['floor','h',3],['enqueue','a','g',1,'x'*N],['enqueue','foreign','h',2,'foreign'],['drop','g'],['enqueue','b','g',1,'new'],['enqueue','c','h',2,'keep'],['drain']]", "[['floor','g',9],['floor','h',4],['enqueue','a','g',1,'a'*N],['enqueue','b','h',2,'b'],['move','a','h'],['reset','g'],['drain']]", '[]', "[['floor','g',2],['enqueue','a','g',8,'a'*N],['enqueue','b','h',7,'b'],['drain']]"]
expected = {1: [[[['b', 'beta'], ['a', 'alpha']], [], [('g', 4)]], [[['a', 'first']], [['b', 'g']], []], [[['b', 'b']], [['a', 'g']], [('g', 1)]], [[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [('h', 3)]], [[['a', 'a']], [['b', 'h']], [('h', 4)]], [[], [], []], [[['a', 'a']], [['b', 'h']], [('g', 2)]]], 2: [[[['b', 'beta'], ['a', 'alpha']], [], [('g', 4)]], [[['a', 'firstfirst']], [['b', 'g']], []], [[['b', 'b']], [['a', 'g']], [('g', 1)]], [[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [('h', 3)]], [[['a', 'aa']], [['b', 'h']], [('h', 4)]], [[], [], []], [[['a', 'aa']], [['b', 'h']], [('g', 2)]]], 3: [[[['b', 'beta'], ['a', 'alpha']], [], [('g', 4)]], [[['a', 'firstfirstfirst']], [['b', 'g']], []], [[['b', 'b']], [['a', 'g']], [('g', 1)]], [[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [('h', 3)]], [[['a', 'aaa']], [['b', 'h']], [('h', 4)]], [[], [], []], [[['a', 'aaa']], [['b', 'h']], [('g', 2)]]], 4: [[[['b', 'beta'], ['a', 'alpha']], [], [('g', 4)]], [[['a', 'firstfirstfirstfirst']], [['b', 'g']], []], [[['b', 'b']], [['a', 'g']], [('g', 1)]], [[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [('h', 3)]], [[['a', 'aaaa']], [['b', 'h']], [('h', 4)]], [[], [], []], [[['a', 'aaaa']], [['b', 'h']], [('g', 2)]]], 5: [[[['a', 'alpha'], ['b', 'beta']], [], [('g', 4)]], [[['a', 'firstfirstfirstfirstfirst']], [['b', 'g']], []], [[['b', 'b']], [['a', 'g']], [('g', 1)]], [[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [('h', 3)]], [[['a', 'aaaaa']], [['b', 'h']], [('h', 4)]], [[], [], []], [[['a', 'aaaaa']], [['b', 'h']], [('g', 2)]]]}[N]
for i, expression in enumerate(fixtures):
    check("trace-"+str(i+1), solve(eval(expression)), expected[i])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
Boundary fixtureActualExpectedOutcome
trace-1[[['a', 'alpha'], ['b', 'beta']], [], [['g', 4]]][[['b', 'beta'], ['a', 'alpha']], [], [['g', 4]]]Failed
trace-2[[['a', 'first']], [['b', 'g']], []][[['a', 'first']], [['b', 'g']], []]Passed
trace-3[[['a', 'a']], [['b', 'h']], [['g', 1]]][[['b', 'b']], [['a', 'g']], [['g', 1]]]Failed
trace-4[[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [['h', 3]]][[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [['h', 3]]]Passed
trace-5[[['b', 'b']], [['a', 'h']], [['h', 4]]][[['a', 'a']], [['b', 'h']], [['h', 4]]]Failed
trace-6[[], [], []][[], [], []]Passed
trace-7[[['a', 'a']], [['b', 'h']], [['g', 2]]][[['a', 'a']], [['b', 'h']], [['g', 2]]]Passed

SHA-256 / 2842191e282854a121462771cad458e60271c359bf924a84a369716376fa049f

2 / The unsuccessful fix

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(events):
    floors={}; q=[]; spoken=[]
    for e in events:
        if e[0]=='floor': floors[e[1]]=e[2]
        elif e[0]=='enqueue': q.append(e[1:])
        elif e[0]=='drop':
            q=[x for x in q if x[1]!=e[1]]
            floors.pop(e[1],None)
        elif e[0]=='move':
            for x in q:
                if x[0]==e[1]: x[1]=e[2]
        elif e[0]=='reset': floors.pop(e[1],None)
        elif e[0]=='drain' and q:
            scores=[floors.get(x[1],x[2]) for x in q]
            index=scores.index(max(scores))
            chosen=q.pop(index)
            spoken.append([chosen[0],chosen[3]])
    return [spoken,[x[:2] for x in q],sorted(floors.items())]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = ["[['floor','g',4],['enqueue','a','g',N+1,'alpha'],['enqueue','b','h',6,'beta'],['drain'],['drain']]", "[['enqueue','a','g',1,'first'*N],['enqueue','b','g',1,'second'],['drain']]", "[['floor','g',9],['floor','g',1],['enqueue','a','g',2,'a'*N],['enqueue','b','h',3,'b'],['drain']]", "[['floor','g',9],['floor','h',3],['enqueue','a','g',1,'x'*N],['enqueue','foreign','h',2,'foreign'],['drop','g'],['enqueue','b','g',1,'new'],['enqueue','c','h',2,'keep'],['drain']]", "[['floor','g',9],['floor','h',4],['enqueue','a','g',1,'a'*N],['enqueue','b','h',2,'b'],['move','a','h'],['reset','g'],['drain']]", '[]', "[['floor','g',2],['enqueue','a','g',8,'a'*N],['enqueue','b','h',7,'b'],['drain']]"]
expected = {1: [[[['b', 'beta'], ['a', 'alpha']], [], [('g', 4)]], [[['a', 'first']], [['b', 'g']], []], [[['b', 'b']], [['a', 'g']], [('g', 1)]], [[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [('h', 3)]], [[['a', 'a']], [['b', 'h']], [('h', 4)]], [[], [], []], [[['a', 'a']], [['b', 'h']], [('g', 2)]]], 2: [[[['b', 'beta'], ['a', 'alpha']], [], [('g', 4)]], [[['a', 'firstfirst']], [['b', 'g']], []], [[['b', 'b']], [['a', 'g']], [('g', 1)]], [[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [('h', 3)]], [[['a', 'aa']], [['b', 'h']], [('h', 4)]], [[], [], []], [[['a', 'aa']], [['b', 'h']], [('g', 2)]]], 3: [[[['b', 'beta'], ['a', 'alpha']], [], [('g', 4)]], [[['a', 'firstfirstfirst']], [['b', 'g']], []], [[['b', 'b']], [['a', 'g']], [('g', 1)]], [[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [('h', 3)]], [[['a', 'aaa']], [['b', 'h']], [('h', 4)]], [[], [], []], [[['a', 'aaa']], [['b', 'h']], [('g', 2)]]], 4: [[[['b', 'beta'], ['a', 'alpha']], [], [('g', 4)]], [[['a', 'firstfirstfirstfirst']], [['b', 'g']], []], [[['b', 'b']], [['a', 'g']], [('g', 1)]], [[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [('h', 3)]], [[['a', 'aaaa']], [['b', 'h']], [('h', 4)]], [[], [], []], [[['a', 'aaaa']], [['b', 'h']], [('g', 2)]]], 5: [[[['a', 'alpha'], ['b', 'beta']], [], [('g', 4)]], [[['a', 'firstfirstfirstfirstfirst']], [['b', 'g']], []], [[['b', 'b']], [['a', 'g']], [('g', 1)]], [[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [('h', 3)]], [[['a', 'aaaaa']], [['b', 'h']], [('h', 4)]], [[], [], []], [[['a', 'aaaaa']], [['b', 'h']], [('g', 2)]]]}[N]
for i, expression in enumerate(fixtures):
    check("trace-"+str(i+1), solve(eval(expression)), expected[i])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
Boundary fixtureActualExpectedOutcome
trace-1[[['b', 'beta'], ['a', 'alpha']], [], [['g', 4]]][[['b', 'beta'], ['a', 'alpha']], [], [['g', 4]]]Passed
trace-2[[['a', 'first']], [['b', 'g']], []][[['a', 'first']], [['b', 'g']], []]Passed
trace-3[[['b', 'b']], [['a', 'g']], [['g', 1]]][[['b', 'b']], [['a', 'g']], [['g', 1]]]Passed
trace-4[[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [['h', 3]]][[['foreign', 'foreign']], [['b', 'g'], ['c', 'h']], [['h', 3]]]Passed
trace-5[[['a', 'a']], [['b', 'h']], [['h', 4]]][[['a', 'a']], [['b', 'h']], [['h', 4]]]Passed
trace-6[[], [], []][[], [], []]Passed
trace-7[[['b', 'b']], [['a', 'g']], [['g', 2]]][[['a', 'a']], [['b', 'h']], [['g', 2]]]Failed

SHA-256 / f297ba982bcdfa7e4b55b5284e7402061f92f613f6fb31c680837a939c0292c7

HELD IN THE MEMBER ARCHIVE

The verified repair and its recorded checks are member-only.

This mechanism has 7 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.

Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.

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

Sign in to the archive ↗

Verification & scope

Stipulated bounded policy, not a browser, speech engine, platform API, or standards conformance claim. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.

Observations recorded using Python 3.12.14 at 2026-09-29T14:40:22.270905+00:00.

Case digest / 82fd228f1138dec24275050f2df878113b27cf445b04009948e3adffc62ff7f0