FA-29356 / HTTP retries / Open access

Replay source snapshot: Opening a new empty body retains the previous closed state · case 01

Opening a new empty body retains the previous closed state

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

ROOT CAUSE

Opening a new empty body retains the previous closed state

THE FAILURE

Opening a new empty body retains the previous closed state

Unsuccessful approach: The attempted repair changes the faulty site to closed = len(body)==0 but still violates a regression oracle.

Case contract

Events open(list of integer bytes, starting index), mutate(index,byte), read(count), retry, close. Opening freezes bytes and origin. Reads advance within the frozen representation. Retry rewinds to origin. Reads after close return closed; retry after close returns closed. Output read chunks or status markers.

Why this case matters

Offline deterministic model of HTTP request retries.

1 / The failure

Exit 1

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

N = 1
observations = []
def solve(events):
    body = (); live = []; origin = 0; pos = 0; closed = True; out = []
    for e in events:
        if e[0] == 'open':
            live = list(e[1])
            body = tuple(live)
            origin = e[2]
            pos = origin
            closed = True
        elif e[0] == 'mutate':
            live[e[1]] = e[2]
        elif e[0] == 'close':
            closed = True
        elif e[0] == 'read':
            if closed:
                out.append('closed')
                continue
            chunk = list(body[pos:pos+e[1]])
            pos += len(chunk)
            out.append(chunk)
        elif e[0] == 'retry':
            if closed:
                out.append('closed')
                continue
            pos = origin
            out.append('rewound')
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('0', solve([]), [])
check('1', solve([('open',[N,N+1,N+2],1),('read',1),('retry',),('read',2)]), [[N+1],'rewound',[N+1,N+2]])
check('2', solve([('open',[N,N+1,N+2],0),('read',2),('read',1),('read',1)]), [[N,N+1],[N+2],[]])
check('3', solve([('open',[N,N+1],0),('mutate',0,99),('retry',),('read',2)]), ['rewound',[N,N+1]])
check('4', solve([('open',[],0),('read',0),('retry',),('read',1)]), [[],'rewound',[]])
check('5', solve([('open',[N,N+1],0),('close',),('read',1),('retry',)]), ['closed','closed'])
check('6', solve([('open',[N],0),('read',1),('close',),('read',1),('retry',),('open',[N+2],0),('read',1)]), [[N],'closed','closed',[N+2]])
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 fixture	Actual	Expected	Outcome
0	`[]`	`[]`	Passed
1	`['closed', 'closed', 'closed']`	`[[2], 'rewound', [2, 3]]`	Failed
2	`['closed', 'closed', 'closed']`	`[[1, 2], [3], []]`	Failed
3	`['closed', 'closed']`	`['rewound', [1, 2]]`	Failed
4	`['closed', 'closed', 'closed']`	`[[], 'rewound', []]`	Failed
5	`['closed', 'closed']`	`['closed', 'closed']`	Passed
6	`['closed', 'closed', 'closed', 'closed']`	`[[1], 'closed', 'closed', [3]]`	Failed

SHA-256 / 90543e685817841d0917d20936b9dd7ad2c16186f714e6d9ba3d718d2c2a4e41

2 / The unsuccessful fix

Exit 1

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

N = 1
observations = []
def solve(events):
    body = (); live = []; origin = 0; pos = 0; closed = True; out = []
    for e in events:
        if e[0] == 'open':
            live = list(e[1])
            body = tuple(live)
            origin = e[2]
            pos = origin
            closed = len(body)==0
        elif e[0] == 'mutate':
            live[e[1]] = e[2]
        elif e[0] == 'close':
            closed = True
        elif e[0] == 'read':
            if closed:
                out.append('closed')
                continue
            chunk = list(body[pos:pos+e[1]])
            pos += len(chunk)
            out.append(chunk)
        elif e[0] == 'retry':
            if closed:
                out.append('closed')
                continue
            pos = origin
            out.append('rewound')
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('0', solve([]), [])
check('1', solve([('open',[N,N+1,N+2],1),('read',1),('retry',),('read',2)]), [[N+1],'rewound',[N+1,N+2]])
check('2', solve([('open',[N,N+1,N+2],0),('read',2),('read',1),('read',1)]), [[N,N+1],[N+2],[]])
check('3', solve([('open',[N,N+1],0),('mutate',0,99),('retry',),('read',2)]), ['rewound',[N,N+1]])
check('4', solve([('open',[],0),('read',0),('retry',),('read',1)]), [[],'rewound',[]])
check('5', solve([('open',[N,N+1],0),('close',),('read',1),('retry',)]), ['closed','closed'])
check('6', solve([('open',[N],0),('read',1),('close',),('read',1),('retry',),('open',[N+2],0),('read',1)]), [[N],'closed','closed',[N+2]])
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 fixture	Actual	Expected	Outcome
0	`[]`	`[]`	Passed
1	`[[2], 'rewound', [2, 3]]`	`[[2], 'rewound', [2, 3]]`	Passed
2	`[[1, 2], [3], []]`	`[[1, 2], [3], []]`	Passed
3	`['rewound', [1, 2]]`	`['rewound', [1, 2]]`	Passed
4	`['closed', 'closed', 'closed']`	`[[], 'rewound', []]`	Failed
5	`['closed', 'closed']`	`['closed', 'closed']`	Passed
6	`[[1], 'closed', 'closed', [3]]`	`[[1], 'closed', 'closed', [3]]`	Passed

SHA-256 / 00b4cbfceb39c62105ea2f4924ba3ac84e18026824f44bc2e815c6642d05ee17

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.

Verification & scope

Stipulated bounded simulator, not a complete HTTP implementation or a 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:41:42.764608+00:00.

Case digest / 42a13b894073eada79b67341d8e2648787d39e336586ecc389f49260e223a6a3