FAILURE MAP
← Case archive

FA-18171 / Time representation / Open access

Countdown exhaustion produces negative budget or never consumes budget · case 01

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

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

ROOT CAUSE

Countdown exhaustion produces negative budget or never consumes budget.

THE FAILURE

Countdown exhaustion produces negative budget or never consumes budget.

Unsuccessful approach: The partial correction still substitutes r['budget'] at the same fault site.

Case contract

A process exposes wall-independent monotonic ticks excluding system suspend and boot ticks including suspend. Snapshot pairs define awake and sleep elapsed. A timer chooses awake or boot basis, can pause independently, and carries expiration budget. Report elapsed selected, consumed active ticks, signed suspend delta, remaining, deadline in selected domain and validity of paired sample (boot elapsed must cover monotonic elapsed).

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):
    awake = r['mono_now'] - r['mono_start']
    boot = r['boot_now'] - r['boot_start']
    sleep = boot - awake
    valid = awake >= 0 and sleep >= 0
    selected = boot if r['include_suspend'] else awake
    consumed = max(0,selected - r['paused_ticks'])
    remaining = r['budget'] - consumed
    clock_now = r['boot_now'] if r['include_suspend'] else r['mono_now']
    deadline = clock_now + remaining
    expired = valid and consumed >= r['budget']
    return [valid,consumed,sleep,remaining,deadline,expired]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 20}), [True, 20, 10, 0, 50, True])
check('fixture 2', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': False, 'paused_ticks': 0, 'budget': 20}), [True, 10, 10, 10, 30, False])
check('fixture 3', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 40, 'boot_start': 30, 'include_suspend': False, 'paused_ticks': 0, 'budget': 10}), [True, 10, 0, 0, 20, True])
check('fixture 4', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 35, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 0}), [False, 5, -5, 0, 35, False])
check('fixture 5', solve({'mono_now': 5, 'mono_start': 10, 'boot_now': 30, 'boot_start': 30, 'include_suspend': False, 'paused_ticks': 0, 'budget': 0}), [False, 0, 5, 0, 5, False])
check('fixture 6', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 25, 'budget': 10}), [True, 0, 10, 10, 60, False])
check('fixture 7', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': False, 'paused_ticks': 2, 'budget': 5}), [True, 8, 10, 0, 20, True])
check('fixture 8', solve({'mono_now': 10, 'mono_start': 10, 'boot_now': 30, 'boot_start': 30, 'include_suspend': False, 'paused_ticks': 0, 'budget': 0}), [True, 0, 0, 0, 10, True])
check('fixture 9', solve({'mono_now': 30, 'mono_start': 10, 'boot_now': 70, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 5, 'budget': 50}), [True, 35, 20, 15, 85, False])
check('fixture 10', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 40, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 5}), [True, 10, 0, 0, 40, True])
variant = [({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 21}, [True, 20, 10, 1, 51, False]), ({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 22}, [True, 20, 10, 2, 52, False]), ({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 23}, [True, 20, 10, 3, 53, False]), ({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 24}, [True, 20, 10, 4, 54, False]), ({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 25}, [True, 20, 10, 5, 55, False])]
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[True, 20, 10, 0, 50, True][True, 20, 10, 0, 50, True]Passed
fixture 2[True, 10, 10, 10, 30, False][True, 10, 10, 10, 30, False]Passed
fixture 3[True, 10, 0, 0, 20, True][True, 10, 0, 0, 20, True]Passed
fixture 4[False, 5, -5, -5, 30, False][False, 5, -5, 0, 35, False]Failed
fixture 5[False, 0, 5, 0, 5, False][False, 0, 5, 0, 5, False]Passed
fixture 6[True, 0, 10, 10, 60, False][True, 0, 10, 10, 60, False]Passed
fixture 7[True, 8, 10, -3, 17, True][True, 8, 10, 0, 20, True]Failed
fixture 8[True, 0, 0, 0, 10, True][True, 0, 0, 0, 10, True]Passed
fixture 9[True, 35, 20, 15, 85, False][True, 35, 20, 15, 85, False]Passed
fixture 10[True, 10, 0, -5, 35, True][True, 10, 0, 0, 40, True]Failed
variant capture[True, 20, 10, 1, 51, False][True, 20, 10, 1, 51, False]Passed

SHA-256 / e67d8f869d9a3e50feb3ea0f73cf7e1902cf2947812b1e50e886b066c104618b

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):
    awake = r['mono_now'] - r['mono_start']
    boot = r['boot_now'] - r['boot_start']
    sleep = boot - awake
    valid = awake >= 0 and sleep >= 0
    selected = boot if r['include_suspend'] else awake
    consumed = max(0,selected - r['paused_ticks'])
    remaining = r['budget']
    clock_now = r['boot_now'] if r['include_suspend'] else r['mono_now']
    deadline = clock_now + remaining
    expired = valid and consumed >= r['budget']
    return [valid,consumed,sleep,remaining,deadline,expired]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 20}), [True, 20, 10, 0, 50, True])
check('fixture 2', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': False, 'paused_ticks': 0, 'budget': 20}), [True, 10, 10, 10, 30, False])
check('fixture 3', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 40, 'boot_start': 30, 'include_suspend': False, 'paused_ticks': 0, 'budget': 10}), [True, 10, 0, 0, 20, True])
check('fixture 4', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 35, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 0}), [False, 5, -5, 0, 35, False])
check('fixture 5', solve({'mono_now': 5, 'mono_start': 10, 'boot_now': 30, 'boot_start': 30, 'include_suspend': False, 'paused_ticks': 0, 'budget': 0}), [False, 0, 5, 0, 5, False])
check('fixture 6', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 25, 'budget': 10}), [True, 0, 10, 10, 60, False])
check('fixture 7', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': False, 'paused_ticks': 2, 'budget': 5}), [True, 8, 10, 0, 20, True])
check('fixture 8', solve({'mono_now': 10, 'mono_start': 10, 'boot_now': 30, 'boot_start': 30, 'include_suspend': False, 'paused_ticks': 0, 'budget': 0}), [True, 0, 0, 0, 10, True])
check('fixture 9', solve({'mono_now': 30, 'mono_start': 10, 'boot_now': 70, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 5, 'budget': 50}), [True, 35, 20, 15, 85, False])
check('fixture 10', solve({'mono_now': 20, 'mono_start': 10, 'boot_now': 40, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 5}), [True, 10, 0, 0, 40, True])
variant = [({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 21}, [True, 20, 10, 1, 51, False]), ({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 22}, [True, 20, 10, 2, 52, False]), ({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 23}, [True, 20, 10, 3, 53, False]), ({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 24}, [True, 20, 10, 4, 54, False]), ({'mono_now': 20, 'mono_start': 10, 'boot_now': 50, 'boot_start': 30, 'include_suspend': True, 'paused_ticks': 0, 'budget': 25}, [True, 20, 10, 5, 55, False])]
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[True, 20, 10, 20, 70, True][True, 20, 10, 0, 50, True]Failed
fixture 2[True, 10, 10, 20, 40, False][True, 10, 10, 10, 30, False]Failed
fixture 3[True, 10, 0, 10, 30, True][True, 10, 0, 0, 20, True]Failed
fixture 4[False, 5, -5, 0, 35, False][False, 5, -5, 0, 35, False]Passed
fixture 5[False, 0, 5, 0, 5, False][False, 0, 5, 0, 5, False]Passed
fixture 6[True, 0, 10, 10, 60, False][True, 0, 10, 10, 60, False]Passed
fixture 7[True, 8, 10, 5, 25, True][True, 8, 10, 0, 20, True]Failed
fixture 8[True, 0, 0, 0, 10, True][True, 0, 0, 0, 10, True]Passed
fixture 9[True, 35, 20, 50, 120, False][True, 35, 20, 15, 85, False]Failed
fixture 10[True, 10, 0, 5, 45, True][True, 10, 0, 0, 40, True]Failed
variant capture[True, 20, 10, 21, 71, False][True, 20, 10, 1, 51, False]Failed

SHA-256 / c4f0ffc9eb99742f6e9e981f0bc451498befd08064227ed83700bb51e654e627

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:55.026404+00:00.

Case digest / 53b34d04ff14201da023dae3b5c52871d670604034d603c33efc05fcd4441569