FAILURE MAP
← Case archive

FA-81716 / MIDI event timing / Open access

Active sensing timeout detection: exact 300 ms gap reported as timeout · case 01

A gap of exactly 300 ms triggers a timeout although only gaps longer than 300 ms should.

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

ROOT CAUSE

The gap comparison is inclusive of the timeout window.

VERIFIED REPAIR

Restore the timeout threshold step so that it reads `armed and t - last > 300`.

Unsuccessful approach: Adding a 30 ms grace period misses gaps between 301 and 330 ms.

Case contract

Input [messages, end_time] where messages are time-ordered [ms, kind]. Monitoring is armed by a "sense" message. While armed, if more than 300 ms pass between any two consecutive messages (of any kind), a timeout is reported at previous message time + 300 and monitoring disarms until the next sense message. At end_time the same check applies to the last message. Return the list of timeout times.

Why this case matters

MIDI sequencers, file readers and synth drivers depend on exact event ordering and tick/time arithmetic.

1 / The failure

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

N = 1
observations = []
def solve(x):
    if not isinstance(x, list) or len(x) != 2:
        return None
    msgs, end = x
    armed = False
    last = None
    out = []
    for t, m in msgs:
        if armed and t - last >= 300:
            out.append(last + 300)
            armed = False
        if m == 'sense':
            armed = True
        last = t
    if armed and end - last > 300:
        out.append(last + 300)
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = [[([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [301, 'note']], 301], [300]), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'note'], [1000, 'note']], 2000], []), ([[[0, 'sense'], [250, 'clock'], [500, 'clock'], [750, 'sense']], 800], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [800, 'note'], [900, 'note'], [1300, 'sense']], 1400], [300]), ([[[0, 'sense']], 301], [300])], [([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [800, 'note'], [900, 'note'], [1300, 'sense']], 1400], [300]), ([[[0, 'sense']], 301], [300]), ([[[0, 'sense']], 300], []), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[], 100], []), ([[[0, 'sense'], [200, 'clock'], [600, 'note']], 600], [500])], [([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [301, 'note']], 301], [300]), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'sense']], 300], []), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[], 100], []), ([[[0, 'sense'], [200, 'clock'], [600, 'note']], 600], [500]), ([[[100, 'sense'], [420, 'clock']], 430], [400])], [([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [301, 'note']], 301], [300]), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'note'], [1000, 'note']], 2000], []), ([[[0, 'sense'], [250, 'clock'], [500, 'clock'], [750, 'sense']], 800], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[[100, 'sense'], [420, 'clock']], 430], [400])], [([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'note'], [1000, 'note']], 2000], []), ([[[0, 'sense'], [250, 'clock'], [500, 'clock'], [750, 'sense']], 800], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [800, 'note'], [900, 'note'], [1300, 'sense']], 1400], [300]), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[[100, 'sense'], [420, 'clock']], 430], [400])]]
for i, (args, expected) in enumerate(fixtures[N-1]):
    check("oracle %d" % i, solve(args), expected)
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
oracle 0[][]Passed
oracle 1[300][300]Passed
oracle 2[300][]Failed
oracle 3[][]Passed
oracle 4[][]Passed
oracle 5[800][800]Passed
oracle 6[300][300]Passed
oracle 7[300][300]Passed

SHA-256 / 910da68ed849e8a57fdbc7f61de8103b931fc95430376c9a970b253c54871cb8

2 / The unsuccessful fix

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

N = 1
observations = []
def solve(x):
    if not isinstance(x, list) or len(x) != 2:
        return None
    msgs, end = x
    armed = False
    last = None
    out = []
    for t, m in msgs:
        if armed and t - last > 330:
            out.append(last + 300)
            armed = False
        if m == 'sense':
            armed = True
        last = t
    if armed and end - last > 300:
        out.append(last + 300)
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = [[([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [301, 'note']], 301], [300]), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'note'], [1000, 'note']], 2000], []), ([[[0, 'sense'], [250, 'clock'], [500, 'clock'], [750, 'sense']], 800], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [800, 'note'], [900, 'note'], [1300, 'sense']], 1400], [300]), ([[[0, 'sense']], 301], [300])], [([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [800, 'note'], [900, 'note'], [1300, 'sense']], 1400], [300]), ([[[0, 'sense']], 301], [300]), ([[[0, 'sense']], 300], []), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[], 100], []), ([[[0, 'sense'], [200, 'clock'], [600, 'note']], 600], [500])], [([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [301, 'note']], 301], [300]), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'sense']], 300], []), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[], 100], []), ([[[0, 'sense'], [200, 'clock'], [600, 'note']], 600], [500]), ([[[100, 'sense'], [420, 'clock']], 430], [400])], [([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [301, 'note']], 301], [300]), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'note'], [1000, 'note']], 2000], []), ([[[0, 'sense'], [250, 'clock'], [500, 'clock'], [750, 'sense']], 800], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[[100, 'sense'], [420, 'clock']], 430], [400])], [([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'note'], [1000, 'note']], 2000], []), ([[[0, 'sense'], [250, 'clock'], [500, 'clock'], [750, 'sense']], 800], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [800, 'note'], [900, 'note'], [1300, 'sense']], 1400], [300]), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[[100, 'sense'], [420, 'clock']], 430], [400])]]
for i, (args, expected) in enumerate(fixtures[N-1]):
    check("oracle %d" % i, solve(args), expected)
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
oracle 0[][]Passed
oracle 1[][300]Failed
oracle 2[][]Passed
oracle 3[][]Passed
oracle 4[][]Passed
oracle 5[800][800]Passed
oracle 6[300][300]Passed
oracle 7[300][300]Passed

SHA-256 / 88325c5aacfbf2ae8a6f955f8ac4b3521c7d7d4a6ec4578b311573878dcd103a

3 / The verified repair

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

N = 1
observations = []
def solve(x):
    if not isinstance(x, list) or len(x) != 2:
        return None
    msgs, end = x
    armed = False
    last = None
    out = []
    for t, m in msgs:
        if armed and t - last > 300:
            out.append(last + 300)
            armed = False
        if m == 'sense':
            armed = True
        last = t
    if armed and end - last > 300:
        out.append(last + 300)
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = [[([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [301, 'note']], 301], [300]), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'note'], [1000, 'note']], 2000], []), ([[[0, 'sense'], [250, 'clock'], [500, 'clock'], [750, 'sense']], 800], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [800, 'note'], [900, 'note'], [1300, 'sense']], 1400], [300]), ([[[0, 'sense']], 301], [300])], [([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [800, 'note'], [900, 'note'], [1300, 'sense']], 1400], [300]), ([[[0, 'sense']], 301], [300]), ([[[0, 'sense']], 300], []), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[], 100], []), ([[[0, 'sense'], [200, 'clock'], [600, 'note']], 600], [500])], [([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [301, 'note']], 301], [300]), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'sense']], 300], []), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[], 100], []), ([[[0, 'sense'], [200, 'clock'], [600, 'note']], 600], [500]), ([[[100, 'sense'], [420, 'clock']], 430], [400])], [([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [301, 'note']], 301], [300]), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'note'], [1000, 'note']], 2000], []), ([[[0, 'sense'], [250, 'clock'], [500, 'clock'], [750, 'sense']], 800], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[[100, 'sense'], [420, 'clock']], 430], [400])], [([[[0, 'sense'], [200, 'sense'], [400, 'sense']], 500], []), ([[[0, 'sense'], [300, 'note']], 300], []), ([[[0, 'note'], [1000, 'note']], 2000], []), ([[[0, 'sense'], [250, 'clock'], [500, 'clock'], [750, 'sense']], 800], []), ([[[0, 'sense'], [250, 'note'], [500, 'note']], 1000], [800]), ([[[0, 'sense'], [800, 'note'], [900, 'note'], [1300, 'sense']], 1400], [300]), ([[[0, 'sense'], [320, 'note'], [650, 'note']], 660], [300]), ([[[100, 'sense'], [420, 'clock']], 430], [400])]]
for i, (args, expected) in enumerate(fixtures[N-1]):
    check("oracle %d" % i, solve(args), expected)
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
oracle 0[][]Passed
oracle 1[300][300]Passed
oracle 2[][]Passed
oracle 3[][]Passed
oracle 4[][]Passed
oracle 5[800][800]Passed
oracle 6[300][300]Passed
oracle 7[300][300]Passed

SHA-256 / 394f118ad90d4c106d194d0f93d4be101accb4f5e54895737aa7f4c56ded4a02

Verification & scope

A deterministic bounded teaching model with a stipulated toy contract; it is not a complete Standard MIDI File or MIDI 1.0/2.0 implementation. 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:50:05.671738+00:00.

Case digest / 010c68896971233b7fc806108e03becc6f6b237a1cc6cd987c63df321eb11796