FAILURE MAP
← Case archive

FA-31596 / Keyboard interactions / Open access

Keyboard macro deterministic playback scheduler: Macro playback emits one extra cycle or drops the first cycle · case 01

The event trace violates the loop count rule and produces incorrect keyboard state or command output.

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

ROOT CAUSE

Macro playback emits one extra cycle or drops the first cycle.

THE FAILURE

Macro playback emits one extra cycle or drops the first cycle.

Unsuccessful approach: The partial repair changes this transition to for cycle in range(1,loops):, which still violates the model contract on the explicit regression traces.

Case contract

Case [records,start,rate_num,rate_den,loops,gap]. Records [kind,key,offset] have ordered nonnegative integer offsets. Positive rational playback speed scales deadlines by floor(offset*den/num). Repeat cycles start after scaled final offset plus gap. End of each cycle synthesizes releases for remaining held keys in sorted order. Return emitted [kind,key,deadline] records. Loops nonnegative; gap positive. Inputs are finite ordered event traces; return the stated deterministic state. Batch entries are independent. N varies the number of independent input transactions.

Why this case matters

Controlled keyboard event processing model for debugging application event logic.

1 / The failure

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

N = 1
observations = []
def solve(cases):
    def run(c):
        records,start,num,den,loops,gap=c
        out=[]
        duration=(records[-1][2]*den//num) if records else 0
        for cycle in range(loops+1):
            base=start+cycle*(duration+gap)
            held=set()
            for kind,key,offset in records:
                due=base+offset*den//num
                if kind=='down': held.add(key)
                elif kind=='up': held.discard(key)
                out.append([kind,key,due])
            for key in sorted(held):
                out.append(['up',key,base+duration])
        return out
    return [run(c) for c in cases]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('macro-play scenario 0', solve([[[], 10, 1, 1, 0, 2]] * N), [[]] * N)
check('macro-play scenario 1', solve([[[], 10, 1, 1, 2, 2]] * N), [[]] * N)
check('macro-play scenario 2', solve([[[['down', 'A', 0], ['up', 'A', 3]], 10, 2, 1, 2, 4]] * N), [[['down', 'A', 10], ['up', 'A', 11], ['down', 'A', 15], ['up', 'A', 16]]] * N)
check('macro-play scenario 3', solve([[[['up', 'A', 0]], 10, 1, 1, 1, 2]] * N), [[['up', 'A', 10]]] * N)
check('macro-play scenario 4', solve([[[['down', 'A', 0], ['down', 'B', 1]], 10, 1, 1, 2, 2]] * N), [[['down', 'A', 10], ['down', 'B', 11], ['up', 'A', 11], ['up', 'B', 11], ['down', 'A', 13], ['down', 'B', 14], ['up', 'A', 14], ['up', 'B', 14]]] * N)
check('macro-play scenario 5', solve([[[['down', 'A', 0], ['down', 'A', 1]], 10, 1, 1, 1, 2]] * N), [[['down', 'A', 10], ['down', 'A', 11], ['up', 'A', 11]]] * N)
check('macro-play scenario 6', solve([[[['down', 'A', 0], ['down', 'B', 1], ['up', 'A', 2]], 10, 1, 1, 1, 2]] * N), [[['down', 'A', 10], ['down', 'B', 11], ['up', 'A', 12], ['up', 'B', 12]]] * N)
check('macro-play scenario 7', solve([[[['down', 'A', 1], ['up', 'A', 5]], 10, 3, 2, 2, 2]] * N), [[['down', 'A', 10], ['up', 'A', 13], ['down', 'A', 15], ['up', 'A', 18]]] * N)
check('macro-play scenario 8', solve([[[['down', 'A', 0], ['up', 'A', 2]], 10, 1, 1, 0, 2]] * N), [[]] * N)
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
macro-play scenario 0[[]][[]]Passed
macro-play scenario 1[[]][[]]Passed
macro-play scenario 2[[['down', 'A', 10], ['up', 'A', 11], ['down', 'A', 15], ['up', 'A', 16], ['down', 'A', 20], ['up', 'A', 21]]][[['down', 'A', 10], ['up', 'A', 11], ['down', 'A', 15], ['up', 'A', 16]]]Failed
macro-play scenario 3[[['up', 'A', 10], ['up', 'A', 12]]][[['up', 'A', 10]]]Failed
macro-play scenario 4[[['down', 'A', 10], ['down', 'B', 11], ['up', 'A', 11], ['up', 'B', 11], ['down', 'A', 13], ['down', 'B', 14], ['up', 'A', 14], ['up', 'B', 14], ['down', 'A', 16], ['down', 'B', 17], ['up', 'A', 17], ['up', 'B', 17]]][[['down', 'A', 10], ['down', 'B', 11], ['up', 'A', 11], ['up', 'B', 11], ['down', 'A', 13], ['down', 'B', 14], ['up', 'A', 14], ['up', 'B', 14]]]Failed
macro-play scenario 5[[['down', 'A', 10], ['down', 'A', 11], ['up', 'A', 11], ['down', 'A', 13], ['down', 'A', 14], ['up', 'A', 14]]][[['down', 'A', 10], ['down', 'A', 11], ['up', 'A', 11]]]Failed
macro-play scenario 6[[['down', 'A', 10], ['down', 'B', 11], ['up', 'A', 12], ['up', 'B', 12], ['down', 'A', 14], ['down', 'B', 15], ['up', 'A', 16], ['up', 'B', 16]]][[['down', 'A', 10], ['down', 'B', 11], ['up', 'A', 12], ['up', 'B', 12]]]Failed
macro-play scenario 7[[['down', 'A', 10], ['up', 'A', 13], ['down', 'A', 15], ['up', 'A', 18], ['down', 'A', 20], ['up', 'A', 23]]][[['down', 'A', 10], ['up', 'A', 13], ['down', 'A', 15], ['up', 'A', 18]]]Failed
macro-play scenario 8[[['down', 'A', 10], ['up', 'A', 12]]][[]]Failed

SHA-256 / 81dfc9195a284a475b081fd0f0afdcdda578690091c27eb347f6e9776573d752

2 / The unsuccessful fix

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

N = 1
observations = []
def solve(cases):
    def run(c):
        records,start,num,den,loops,gap=c
        out=[]
        duration=(records[-1][2]*den//num) if records else 0
        for cycle in range(1,loops):
            base=start+cycle*(duration+gap)
            held=set()
            for kind,key,offset in records:
                due=base+offset*den//num
                if kind=='down': held.add(key)
                elif kind=='up': held.discard(key)
                out.append([kind,key,due])
            for key in sorted(held):
                out.append(['up',key,base+duration])
        return out
    return [run(c) for c in cases]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('macro-play scenario 0', solve([[[], 10, 1, 1, 0, 2]] * N), [[]] * N)
check('macro-play scenario 1', solve([[[], 10, 1, 1, 2, 2]] * N), [[]] * N)
check('macro-play scenario 2', solve([[[['down', 'A', 0], ['up', 'A', 3]], 10, 2, 1, 2, 4]] * N), [[['down', 'A', 10], ['up', 'A', 11], ['down', 'A', 15], ['up', 'A', 16]]] * N)
check('macro-play scenario 3', solve([[[['up', 'A', 0]], 10, 1, 1, 1, 2]] * N), [[['up', 'A', 10]]] * N)
check('macro-play scenario 4', solve([[[['down', 'A', 0], ['down', 'B', 1]], 10, 1, 1, 2, 2]] * N), [[['down', 'A', 10], ['down', 'B', 11], ['up', 'A', 11], ['up', 'B', 11], ['down', 'A', 13], ['down', 'B', 14], ['up', 'A', 14], ['up', 'B', 14]]] * N)
check('macro-play scenario 5', solve([[[['down', 'A', 0], ['down', 'A', 1]], 10, 1, 1, 1, 2]] * N), [[['down', 'A', 10], ['down', 'A', 11], ['up', 'A', 11]]] * N)
check('macro-play scenario 6', solve([[[['down', 'A', 0], ['down', 'B', 1], ['up', 'A', 2]], 10, 1, 1, 1, 2]] * N), [[['down', 'A', 10], ['down', 'B', 11], ['up', 'A', 12], ['up', 'B', 12]]] * N)
check('macro-play scenario 7', solve([[[['down', 'A', 1], ['up', 'A', 5]], 10, 3, 2, 2, 2]] * N), [[['down', 'A', 10], ['up', 'A', 13], ['down', 'A', 15], ['up', 'A', 18]]] * N)
check('macro-play scenario 8', solve([[[['down', 'A', 0], ['up', 'A', 2]], 10, 1, 1, 0, 2]] * N), [[]] * N)
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
macro-play scenario 0[[]][[]]Passed
macro-play scenario 1[[]][[]]Passed
macro-play scenario 2[[['down', 'A', 15], ['up', 'A', 16]]][[['down', 'A', 10], ['up', 'A', 11], ['down', 'A', 15], ['up', 'A', 16]]]Failed
macro-play scenario 3[[]][[['up', 'A', 10]]]Failed
macro-play scenario 4[[['down', 'A', 13], ['down', 'B', 14], ['up', 'A', 14], ['up', 'B', 14]]][[['down', 'A', 10], ['down', 'B', 11], ['up', 'A', 11], ['up', 'B', 11], ['down', 'A', 13], ['down', 'B', 14], ['up', 'A', 14], ['up', 'B', 14]]]Failed
macro-play scenario 5[[]][[['down', 'A', 10], ['down', 'A', 11], ['up', 'A', 11]]]Failed
macro-play scenario 6[[]][[['down', 'A', 10], ['down', 'B', 11], ['up', 'A', 12], ['up', 'B', 12]]]Failed
macro-play scenario 7[[['down', 'A', 15], ['up', 'A', 18]]][[['down', 'A', 10], ['up', 'A', 13], ['down', 'A', 15], ['up', 'A', 18]]]Failed
macro-play scenario 8[[]][[]]Passed

SHA-256 / 9601c1758d9e0aec66ae8861527cf078919164e10f87d15d75f1dc02bf764323

HELD IN THE MEMBER ARCHIVE

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

This mechanism has 9 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

Offline stipulated event model, not a browser implementation or web standard 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:42:04.013632+00:00.

Case digest / a1625284f4ab79cc6b06f71be19923b8df4688a51fc1c62f75bfd64e3e80ef23