FAILURE MAP
← Case archive

FA-17381 / Time representation / Open access

Restored deadline retains the old clock coordinate · case 01

The decoded time state disagrees with the explicit regression oracle for deadline.

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

ROOT CAUSE

Restored deadline retains the old clock coordinate.

THE FAILURE

Restored deadline retains the old clock coordinate.

Unsuccessful approach: The partial correction still substitutes None if r['paused'] else r['wall_now'] + remaining at the same fault site.

Case contract

A checkpoint stores wall and monotonic coordinates, boot identity, budget and pause state. Same-boot restore uses monotonic elapsed; reboot restore uses nonnegative wall elapsed. Paused timers consume no elapsed ticks. Return remaining budget, expiration flag, overdue ticks, current-domain deadline (None while paused), and reconstructed running base. All units are identical integer ticks.

Why this case matters

Clock transfer and timestamp consumers require preserved coordinate, phase, validity and elapsed-time semantics.

1 / The failure

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    wall_delta = r['wall_now'] - r['wall_saved']
    mono_delta = r['mono_now'] - r['mono_saved']
    reboot = r['boot_now'] != r['boot_saved']
    elapsed = max(0, wall_delta if reboot else mono_delta)
    consumed = 0 if r['paused'] else elapsed
    remaining = max(0, r['budget'] - consumed)
    expired = not r['paused'] and consumed >= r['budget']
    overdue = max(0, consumed - r['budget'])
    deadline = r['mono_saved'] + remaining
    base = r['mono_now'] - consumed
    return [remaining,expired,overdue,deadline,base]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 30}), [0, True, 0, 50, 20])
check('fixture 2', solve({'wall_now': 90, 'wall_saved': 100, 'mono_now': 5, 'mono_saved': 20, 'boot_now': 'b', 'boot_saved': 'a', 'paused': False, 'budget': 10}), [10, False, 0, 15, 5])
check('fixture 3', solve({'wall_now': 150, 'wall_saved': 100, 'mono_now': 5, 'mono_saved': 20, 'boot_now': 'b', 'boot_saved': 'a', 'paused': False, 'budget': 20}), [0, True, 30, 5, -45])
check('fixture 4', solve({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': True, 'budget': 0}), [0, False, 0, None, 50])
check('fixture 5', solve({'wall_now': 140, 'wall_saved': 100, 'mono_now': 60, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 100}), [60, False, 0, 120, 20])
check('fixture 6', solve({'wall_now': 90, 'wall_saved': 100, 'mono_now': -5, 'mono_saved': -20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 20}), [5, False, 0, 0, -20])
check('fixture 7', solve({'wall_now': 101, 'wall_saved': 100, 'mono_now': 0, 'mono_saved': 0, 'boot_now': 'c', 'boot_saved': 'a', 'paused': False, 'budget': 0}), [0, True, 1, 0, -1])
check('fixture 8', solve({'wall_now': 100, 'wall_saved': 100, 'mono_now': 20, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': True, 'budget': 10}), [10, False, 0, None, 20])
check('fixture 9', solve({'wall_now': 105, 'wall_saved': 100, 'mono_now': 24, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 3}), [0, True, 1, 24, 20])
check('fixture 10', solve({'wall_now': 80, 'wall_saved': 100, 'mono_now': -10, 'mono_saved': -20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 0}), [0, True, 10, -10, -20])
variant = [({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 31}, [1, False, 0, 51, 20]), ({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 32}, [2, False, 0, 52, 20]), ({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 33}, [3, False, 0, 53, 20]), ({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 34}, [4, False, 0, 54, 20]), ({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 35}, [5, False, 0, 55, 20])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][1])
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
fixture 1[0, True, 0, 20, 20][0, True, 0, 50, 20]Failed
fixture 2[10, False, 0, 30, 5][10, False, 0, 15, 5]Failed
fixture 3[0, True, 30, 20, -45][0, True, 30, 5, -45]Failed
fixture 4[0, False, 0, 20, 50][0, False, 0, None, 50]Failed
fixture 5[60, False, 0, 80, 20][60, False, 0, 120, 20]Failed
fixture 6[5, False, 0, -15, -20][5, False, 0, 0, -20]Failed
fixture 7[0, True, 1, 0, -1][0, True, 1, 0, -1]Passed
fixture 8[10, False, 0, 30, 20][10, False, 0, None, 20]Failed
fixture 9[0, True, 1, 20, 20][0, True, 1, 24, 20]Failed
fixture 10[0, True, 10, -20, -20][0, True, 10, -10, -20]Failed
variant capture[1, False, 0, 21, 20][1, False, 0, 51, 20]Failed

SHA-256 / 8e3a0d33d4ece9183a61bc4c5fcd379f7e38123c1caeceabe7283e881080289b

2 / The unsuccessful fix

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json
from fractions import Fraction
N = 1
observations = []
def solve(r):
    wall_delta = r['wall_now'] - r['wall_saved']
    mono_delta = r['mono_now'] - r['mono_saved']
    reboot = r['boot_now'] != r['boot_saved']
    elapsed = max(0, wall_delta if reboot else mono_delta)
    consumed = 0 if r['paused'] else elapsed
    remaining = max(0, r['budget'] - consumed)
    expired = not r['paused'] and consumed >= r['budget']
    overdue = max(0, consumed - r['budget'])
    deadline = None if r['paused'] else r['wall_now'] + remaining
    base = r['mono_now'] - consumed
    return [remaining,expired,overdue,deadline,base]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 30}), [0, True, 0, 50, 20])
check('fixture 2', solve({'wall_now': 90, 'wall_saved': 100, 'mono_now': 5, 'mono_saved': 20, 'boot_now': 'b', 'boot_saved': 'a', 'paused': False, 'budget': 10}), [10, False, 0, 15, 5])
check('fixture 3', solve({'wall_now': 150, 'wall_saved': 100, 'mono_now': 5, 'mono_saved': 20, 'boot_now': 'b', 'boot_saved': 'a', 'paused': False, 'budget': 20}), [0, True, 30, 5, -45])
check('fixture 4', solve({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': True, 'budget': 0}), [0, False, 0, None, 50])
check('fixture 5', solve({'wall_now': 140, 'wall_saved': 100, 'mono_now': 60, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 100}), [60, False, 0, 120, 20])
check('fixture 6', solve({'wall_now': 90, 'wall_saved': 100, 'mono_now': -5, 'mono_saved': -20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 20}), [5, False, 0, 0, -20])
check('fixture 7', solve({'wall_now': 101, 'wall_saved': 100, 'mono_now': 0, 'mono_saved': 0, 'boot_now': 'c', 'boot_saved': 'a', 'paused': False, 'budget': 0}), [0, True, 1, 0, -1])
check('fixture 8', solve({'wall_now': 100, 'wall_saved': 100, 'mono_now': 20, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': True, 'budget': 10}), [10, False, 0, None, 20])
check('fixture 9', solve({'wall_now': 105, 'wall_saved': 100, 'mono_now': 24, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 3}), [0, True, 1, 24, 20])
check('fixture 10', solve({'wall_now': 80, 'wall_saved': 100, 'mono_now': -10, 'mono_saved': -20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 0}), [0, True, 10, -10, -20])
variant = [({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 31}, [1, False, 0, 51, 20]), ({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 32}, [2, False, 0, 52, 20]), ({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 33}, [3, False, 0, 53, 20]), ({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 34}, [4, False, 0, 54, 20]), ({'wall_now': 130, 'wall_saved': 100, 'mono_now': 50, 'mono_saved': 20, 'boot_now': 'a', 'boot_saved': 'a', 'paused': False, 'budget': 35}, [5, False, 0, 55, 20])]
check("variant capture", solve(variant[N-1][0]), variant[N-1][1])
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
fixture 1[0, True, 0, 130, 20][0, True, 0, 50, 20]Failed
fixture 2[10, False, 0, 100, 5][10, False, 0, 15, 5]Failed
fixture 3[0, True, 30, 150, -45][0, True, 30, 5, -45]Failed
fixture 4[0, False, 0, None, 50][0, False, 0, None, 50]Passed
fixture 5[60, False, 0, 200, 20][60, False, 0, 120, 20]Failed
fixture 6[5, False, 0, 95, -20][5, False, 0, 0, -20]Failed
fixture 7[0, True, 1, 101, -1][0, True, 1, 0, -1]Failed
fixture 8[10, False, 0, None, 20][10, False, 0, None, 20]Passed
fixture 9[0, True, 1, 105, 20][0, True, 1, 24, 20]Failed
fixture 10[0, True, 10, 80, -20][0, True, 10, -10, -20]Failed
variant capture[1, False, 0, 131, 20][1, False, 0, 51, 20]Failed

SHA-256 / 41b678b65ecd52ef6c9941bd6e513859ebe4cf329854547b6ebbc2365f00116a

HELD IN THE MEMBER ARCHIVE

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

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

Deterministic integer reference model with stipulated units and policies; not a complete clock, wire standard or platform 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:39:45.743478+00:00.

Case digest / 1b36f98ff2560934a9428b884204111d43504f7cd6a1b94a46ffeef43678a87a