agentdebugx 0.2.7__tar.gz → 0.2.9__tar.gz

{agentdebugx-0.2.7 → agentdebugx-0.2.9}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: agentdebugx
-Version: 0.2.7
+Version: 0.2.9
 Summary: Portable error analysis, tracing, and recovery framework for agentic AI systems. Import as `agentdebug`.
 License: MIT
 License-File: LICENSE

{agentdebugx-0.2.7 → agentdebugx-0.2.9}/docs/22_industry_track_paper_eval_plan.md

@@ -37,14 +37,14 @@ Examples worth emulating:
 
 For AgentDebugX, the paper should therefore be framed as:
 
-> A deployment-oriented debugging layer for agentic NLP systems, evaluated on
+> A deployment-oriented debugging framework for agentic NLP systems, evaluated on
 > whether it makes failures observable, attributable, shareable, and easier for
 > humans to fix.
 
 The central claim should not be "we beat every attributor." A stronger claim
 for the Industry Track is:
 
-> AgentDebugX provides the missing operating layer between raw agent traces and
+> AgentDebugX provides the missing operational bridge between raw agent traces and
 > actionable debugging workflows: aligned native/error traces, taxonomy-backed
 > reports, Error Hub bundles, and cost-aware analysis profiles.
 

{agentdebugx-0.2.7 → agentdebugx-0.2.9}/docs/23_status_v0_2.md

@@ -22,8 +22,11 @@ the forward-looking plan; this doc is the rear-view mirror.
 | Attribution | `agentdebug.attribution.StepByStepAttributor` | ✅ **new 0.2.2** | scripted-LLM + fallback |
 | Attribution | `agentdebug.attribution.BinarySearchAttributor` | ✅ **new 0.2.3** | oracle-LLM logarithmic convergence + fallback + render elision |
 | Attribution | `agentdebug.attribution.CounterfactualAttributor` | ✅ **new 0.2.7** | scripted-rescue-prob ranking + candidate selection priority (findings → errors → tail) + dual fallback (no candidates / silent LLM) |
+| Attribution | `agentdebug.attribution.SBFLAttributor` (Tarantula / Ochiai / DStar) | ✅ **new 0.2.8** | signature design + ranking on synthetic corpus + 3 formulas + dual fallback + edge cases. Model-free: zero LLM cost at inference. |
 | Recovery | `agentdebug.recovery.ReflexionSuggestion` | ✅ stable | per-finding + empty |
 | Recovery | `agentdebug.recovery.CriticRecoverer` + `VerifierSpec` registry | ✅ **new 0.2.3** | 5 family-matched verifier templates; dedup + custom-override |
+| Recovery | `agentdebug.recovery.SelfRefineLoop` | ✅ **new 0.2.9** | scripted-LLM happy + silent-LLM safe + multi-iter; per-finding generator→critic→refiner |
+| Recovery | `agentdebug.recovery.AutoManualRules` (+ `apply()`) | ✅ **new 0.2.9** | no-LLM fallback + LLM rule-distill + idempotent apply + multi-rule append |
 | DeepDebug | `agentdebug.deep.DeepDebugAnalyzer` | ✅ stable | full loop + silent LLM |
 | Cascade view | `agentdebug.traceback.format_traceback` | ✅ stable | cascade + step-order + ANSI + empty |
 | Detectors | `agentdebug.detectors.RepeatedToolCall / RepeatedState / StepCountLimit` | ✅ **new 0.2.2** | threshold + window + budget |
@@ -49,11 +52,9 @@ across 32 source files.
 | [06_detectors.md](./06_detectors.md) | `topic_drift` (embedding cosine) | needs embedding client; consider reusing `OpenAICompatClient` `/embeddings` | v0.3 |
 | [06_detectors.md](./06_detectors.md) | LTL spec monitors | requires user-supplied spec or LLM-synthesized monitors; gated on RV research | v1.2 |
 | [07_attribution.md](./07_attribution.md) | `CounterfactualAttributor` — *real* replay variant | true re-rollout requires framework-specific replay surface; the v0.2.7 LLM-simulated variant ships now, the real-replay variant is gated on adapter support (LangGraph checkpointer / OpenHands rewind) | v0.4 |
-| [07_attribution.md](./07_attribution.md) | `SBFLAttributor` (Tarantula/Ochiai) | needs corpus of passing + failing traces of same task; gated on Hub adoption | v0.4 |
+| [07_attribution.md](./07_attribution.md) | `SBFLAttributor` — *corpus* | shipped in 0.2.8 (`tarantula`/`ochiai`/`dstar`); awaiting paired-trace adoption to gather a useful corpus in production | corpus tooling deferred to v0.4 |
 | [07_attribution.md](./07_attribution.md) | `DeltaDebugAttributor` (Zeller) | same replay constraint | v0.3 |
 | [07_attribution.md](./07_attribution.md) | `EnsembleAttributor` | trivial once Counterfactual lands; awaits Counterfactual | v0.3 |
-| [08_recovery.md](./08_recovery.md) | `SelfRefineLoop` | small but needs a generator-critic-refiner orchestration | v0.3 |
-| [08_recovery.md](./08_recovery.md) | `AutoManualRules` | needs persistent project manual + injection into next-run prompts | v0.3 |
 | [08_recovery.md](./08_recovery.md) | `LangGraphRewind` | depends on LangGraph checkpointer; ships when we have a real LangGraph user | v0.3 |
 | [08_recovery.md](./08_recovery.md) | `SagaRollback` | needs compensation registry on tool definitions; new schema | v0.3 |
 | [08_recovery.md](./08_recovery.md) | `MCTSBranchExploration` (LATS) | heavy; v2 feature | v2.0 |

{agentdebugx-0.2.7 → agentdebugx-0.2.9}/pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "agentdebugx"
-version = "0.2.7"
+version = "0.2.9"
 description = "Portable error analysis, tracing, and recovery framework for agentic AI systems. Import as `agentdebug`."
 authors = ["ULab @ UIUC <ulab@illinois.edu>"]
 license = "MIT"

{agentdebugx-0.2.7 → agentdebugx-0.2.9}/src/agentdebug/__init__.py

@@ -17,6 +17,7 @@ from agentdebug.attribution import (
     Blame,
     CounterfactualAttributor,
     HeuristicAttributor,
+    SBFLAttributor,
     StepByStepAttributor,
 )
 from agentdebug.detectors import (
@@ -42,10 +43,12 @@ from agentdebug.models import (
 from agentdebug.recorder import AgentDebug, TraceSession
 from agentdebug.recovery import (
     DEFAULT_VERIFIERS,
+    AutoManualRules,
     CriticRecoverer,
     FixProposal,
     Recoverer,
     ReflexionSuggestion,
+    SelfRefineLoop,
     VerifierSpec,
 )
 from agentdebug.traceback import CascadeFrame, build_cascade, format_traceback
@@ -62,6 +65,7 @@ __all__ = [
     'Attributor',
     'Blame',
     'BusEvent',
+    'AutoManualRules',
     'BinarySearchAttributor',
     'CascadeFrame',
     'CounterfactualAttributor',
@@ -71,6 +75,8 @@ __all__ = [
     'DetectorConfig',
     'RepeatedStateDetector',
     'RepeatedToolCallDetector',
+    'SBFLAttributor',
+    'SelfRefineLoop',
     'StepByStepAttributor',
     'StepCountLimitDetector',
     'VerifierSpec',
@@ -98,4 +104,4 @@ __all__ = [
     'get_failure_mode',
 ]
 
-__version__ = '0.2.7'
+__version__ = '0.2.9'

{agentdebugx-0.2.7 → agentdebugx-0.2.9}/src/agentdebug/attribution.py

@@ -751,8 +751,193 @@ class CounterfactualAttributor:
             return default
 
 
+class SBFLAttributor:
+    """Spectrum-based fault localization (Tarantula / Ochiai / DStar).
+
+    Model-free. Costs ZERO LLM calls at inference time. The price: it needs
+    a corpus of *other* traces of the same task (a mix of passing and
+    failing). For each step in the failing trace under attribution, compute
+    suspiciousness from how often that step's signature appears in failing
+    vs passing traces of the same task.
+
+    Signature design — the cross-trace identity of a "step":
+
+      (agent_name, event_type, module, normalized_io_hash)
+
+    The normalized I/O hash collapses whitespace + truncates to 120 chars
+    so semantically-equivalent step executions match across runs (a
+    `search` call with the same query produces the same signature even if
+    the wrapping prompt differs trace-to-trace).
+
+    Suspiciousness formulas:
+
+      Tarantula = (ef / nf) / (ef / nf + ep / np)
+      Ochiai    = ef / sqrt((ef + ep) * (nf))
+      DStar*    = ef^* / (ep + (nf - ef))     [* = exponent, default 2]
+
+    where for the candidate step:
+      ef = # failing corpus traces containing this signature
+      ep = # passing corpus traces containing this signature
+      nf = total failing traces in the corpus
+      np = total passing traces in the corpus
+
+    Reference: Jones & Harrold (Tarantula, ICSE 2002); Abreu et al.
+    (Ochiai, TR 2007); Wong et al. (DStar, IEEE TR 2014).
+    """
+
+    id = 'sbfl'
+
+    def __init__(
+        self,
+        *,
+        passing_corpus: List[AgentTrajectory],
+        failing_corpus: List[AgentTrajectory],
+        formula: str = 'ochiai',
+        dstar_exponent: float = 2.0,
+        top_k: int = 5,
+        fallback: Optional[Attributor] = None,
+    ) -> None:
+        if formula not in {'tarantula', 'ochiai', 'dstar'}:
+            raise ValueError(
+                f"Unknown SBFL formula {formula!r}; "
+                "use 'tarantula', 'ochiai', or 'dstar'"
+            )
+        self.passing_corpus = list(passing_corpus)
+        self.failing_corpus = list(failing_corpus)
+        self.formula = formula
+        self.dstar_exponent = dstar_exponent
+        self.top_k = top_k
+        self.fallback: Attributor = fallback or HeuristicAttributor()
+        # Precompute signature presence per trace so attribution is O(N) over
+        # the candidate's events × O(corpus_size).
+        self._sigs_in_failing: List[set[str]] = [
+            _signatures_for(t) for t in self.failing_corpus
+        ]
+        self._sigs_in_passing: List[set[str]] = [
+            _signatures_for(t) for t in self.passing_corpus
+        ]
+
+    def attribute(
+        self,
+        trajectory: AgentTrajectory,
+        findings: List[FailureFinding],
+    ) -> AttributionResult:
+        nf = len(self._sigs_in_failing)
+        np = len(self._sigs_in_passing)
+        if nf == 0 and np == 0:
+            return self.fallback.attribute(trajectory, findings)
+
+        scored: List[tuple[AgentEvent, float, int, int]] = []
+        for evt in trajectory.events:
+            sig = _signature_for(evt)
+            if not sig:
+                continue
+            ef = sum(1 for s in self._sigs_in_failing if sig in s)
+            ep = sum(1 for s in self._sigs_in_passing if sig in s)
+            score = _suspiciousness(
+                ef=ef, ep=ep, nf=max(nf, 1), np=max(np, 1),
+                formula=self.formula, dstar_exponent=self.dstar_exponent,
+            )
+            scored.append((evt, score, ef, ep))
+
+        if not scored:
+            return self.fallback.attribute(trajectory, findings)
+
+        # Sort by suspiciousness desc, tie-break by step index asc (earlier wins).
+        scored.sort(key=lambda r: (-r[1], r[0].step_index or 10**9))
+        hypotheses: List[Blame] = []
+        for evt, score, ef, ep in scored[: self.top_k]:
+            if score <= 0.0:
+                continue  # nothing suspicious about this step
+            hypotheses.append(Blame(
+                span_id=evt.event_id,
+                step_index=evt.step_index,
+                agent_name=evt.agent_name,
+                confidence=min(1.0, max(0.0, score)),
+                rationale=(
+                    f'{self.formula} suspiciousness={score:.3f} '
+                    f'(ef={ef}/{nf}, ep={ep}/{np})'
+                ),
+                evidence=[
+                    f'signature occurs in {ef}/{nf} failing and {ep}/{np} '
+                    f'passing corpus traces',
+                ],
+                sources=[self.id],
+            ))
+        if not hypotheses:
+            return self.fallback.attribute(trajectory, findings)
+        return AttributionResult(
+            method=self.id,
+            hypotheses=hypotheses,
+            raw={
+                'formula': self.formula,
+                'corpus_size': {'failing': nf, 'passing': np},
+                'scored_events': len(scored),
+            },
+        )
+
+
+def _signature_for(event: AgentEvent) -> Optional[str]:
+    """Cross-trace identity of a step. Returns None for events that should
+    not contribute to suspiciousness:
+
+      * ``run.start`` / ``run.end`` — trajectory lifecycle markers.
+      * ``error`` events emitted by ``agent_name='system'`` — these are the
+        synthetic markers from ``AgentDebug.finish_trace(success=False)`` and
+        are present in every failed trace; they would saturate suspiciousness
+        without revealing anything about the cause.
+    """
+    et = getattr(event.event_type, 'value', event.event_type)
+    if et in {'run.start', 'run.end'}:
+        return None
+    if et == 'error' and (event.agent_name or '') == 'system':
+        return None
+    payload = ' '.join(str(event.output or event.input or '').split())[:120]
+    return '|'.join([
+        str(et),
+        str(event.agent_name or ''),
+        str(event.module or ''),
+        payload,
+    ])
+
+
+def _signatures_for(trajectory: AgentTrajectory) -> set[str]:
+    out: set[str] = set()
+    for evt in trajectory.events:
+        sig = _signature_for(evt)
+        if sig:
+            out.add(sig)
+    return out
+
+
+def _suspiciousness(
+    *, ef: int, ep: int, nf: int, np: int,
+    formula: str, dstar_exponent: float,
+) -> float:
+    import math
+    if formula == 'tarantula':
+        # Defined as 0 when the step never appears in failing traces.
+        if ef == 0:
+            return 0.0
+        # Defensive: nf>=1 by caller.
+        f_rate = ef / nf
+        p_rate = (ep / np) if np > 0 else 0.0
+        denom = f_rate + p_rate
+        return f_rate / denom if denom > 0 else 0.0
+    if formula == 'ochiai':
+        denom = math.sqrt((ef + ep) * nf)
+        return (ef / denom) if denom > 0 else 0.0
+    # dstar
+    if ep == 0 and (nf - ef) == 0:
+        return float('inf') if ef > 0 else 0.0
+    denom = ep + (nf - ef)
+    if denom == 0:
+        return 0.0
+    return float((ef ** dstar_exponent) / denom)
+
+
 __all__ = [
     'Attributor', 'Blame', 'AttributionResult',
     'HeuristicAttributor', 'AllAtOnceAttributor', 'StepByStepAttributor',
-    'BinarySearchAttributor', 'CounterfactualAttributor',
+    'BinarySearchAttributor', 'CounterfactualAttributor', 'SBFLAttributor',
 ]

{agentdebugx-0.2.7 → agentdebugx-0.2.9}/src/agentdebug/recovery.py

@@ -304,11 +304,292 @@ class CriticRecoverer:
         )
 
 
+_SELF_REFINE_CRITIC_PROMPT = """You are AgentDebugX-SelfRefine acting as the
+CRITIC. You will be shown the goal of a failed agent run and a single
+failure finding (mode + step + evidence).
+
+Your job: in 2-4 short sentences, explain WHAT went wrong at that step and
+WHY it caused the failure. Do not propose a fix yet — that's the next round.
+Be concrete; reference the evidence.
+
+Output plain text. No JSON, no markdown."""
+
+
+_SELF_REFINE_REFINER_PROMPT = """You are AgentDebugX-SelfRefine acting as the
+REFINER. You will be shown the goal of a failed agent run, a single failure
+finding, AND the CRITIC's analysis of what went wrong.
+
+Your job: produce a single concrete REFINED ACTION the agent should take
+NEXT TIME at that step. 2-4 short sentences. Plain text. Be operational —
+the agent will read this verbatim as guidance.
+
+If the failure is in tool args, give the exact corrected arg shape. If the
+failure is in planning, give the next plan step. If the failure is in
+reflection, give the next verification check.
+
+Output plain text. No JSON, no markdown."""
+
+
+class SelfRefineLoop:
+    """Self-Refine (Madaan et al., NeurIPS 2023, arXiv:2303.17651) recovery.
+
+    Suggest-only — we do NOT re-execute the agent. For each finding, run a
+    bounded generator-critic-refiner cycle: CRITIC explains what went
+    wrong, REFINER proposes a concrete next-attempt action. The cycle can
+    iterate ``max_iters`` times; each iteration costs 2 LLM calls.
+
+    Output is a :class:`FixProposal` whose ``suggestion_text`` contains
+    both the critic analysis and the refiner's concrete action. Pair with
+    :class:`ReflexionSuggestion` for short verbal hints and
+    :class:`CriticRecoverer` for verifier-template recommendations.
+    """
+
+    id = 'self_refine'
+
+    def __init__(
+        self,
+        llm: object,
+        *,
+        max_iters: int = 1,
+        max_tokens: int = 512,
+    ) -> None:
+        # llm is duck-typed to LLMClient (avoid circular import); it must have
+        # a `.complete(messages=..., max_tokens=...)` returning .text.
+        self.llm = llm
+        self.max_iters = max(1, max_iters)
+        self.max_tokens = max_tokens
+
+    def suggest(
+        self,
+        trajectory: AgentTrajectory,
+        report: DiagnosticReport,
+    ) -> List[FixProposal]:
+        if not report.findings:
+            return []
+        proposals: List[FixProposal] = []
+        for finding in report.findings:
+            proposal = self._refine_one(trajectory, finding)
+            if proposal is not None:
+                proposals.append(proposal)
+        return proposals
+
+    def _refine_one(
+        self,
+        trajectory: AgentTrajectory,
+        finding: FailureFinding,
+    ) -> Optional[FixProposal]:
+        evidence_block = '\n'.join(f'  - {e}' for e in finding.evidence) or '  (none)'
+        finding_block = (
+            f'GOAL: {trajectory.goal!r}\n'
+            f'FAILURE MODE: {finding.failure_mode.mode_id} '
+            f'({finding.failure_mode.name})\n'
+            f'AT: agent={finding.agent_name}, step={finding.step_index}\n'
+            f'EVIDENCE:\n{evidence_block}'
+        )
+        last_critic = ''
+        last_refined = ''
+        try:
+            for _ in range(self.max_iters):
+                critic_text = self._call(
+                    system=_SELF_REFINE_CRITIC_PROMPT,
+                    user=finding_block + (
+                        f'\n\nPRIOR REFINED ACTION (improve on this if needed):\n'
+                        f'{last_refined}' if last_refined else ''
+                    ),
+                )
+                if not critic_text:
+                    break
+                last_critic = critic_text
+                refined_text = self._call(
+                    system=_SELF_REFINE_REFINER_PROMPT,
+                    user=finding_block + f'\n\nCRITIC ANALYSIS:\n{critic_text}',
+                )
+                if not refined_text:
+                    break
+                last_refined = refined_text
+        except Exception:
+            # Defensive: never break the host pipeline on LLM hiccup.
+            pass
+        if not last_critic and not last_refined:
+            return None
+        suggestion_text = (
+            f'Self-Refine output (after {self.max_iters} iter(s)) for '
+            f'{finding.failure_mode.mode_id} at step {finding.step_index}:\n\n'
+            f'CRITIC:\n{last_critic or "(no critic output)"}\n\n'
+            f'REFINED ACTION:\n{last_refined or "(no refined action)"}'
+        )
+        return FixProposal(
+            proposal_id=new_id('fix'),
+            recoverer_id=self.id,
+            target_event_id=finding.event_id,
+            summary=(
+                f'Self-Refine action for {finding.failure_mode.mode_id} '
+                f'at step {finding.step_index}'
+            ),
+            rationale=(
+                'Self-Refine (Madaan et al., NeurIPS 2023): one LM acts as '
+                'critic, then refiner; output is a concrete next-attempt '
+                'action the agent reads verbatim.'
+            ),
+            confidence=max(0.3, min(0.9, finding.confidence)),
+            suggestion_text=suggestion_text,
+            side_effects=[],
+            requires_human_approval=False,
+        )
+
+    def _call(self, *, system: str, user: str) -> str:
+        messages = [
+            {'role': 'system', 'content': system},
+            {'role': 'user', 'content': user},
+        ]
+        # Direct attribute access — llm is duck-typed (see __init__ note).
+        result = self.llm.complete(  # type: ignore[attr-defined]
+            messages=messages, max_tokens=self.max_tokens
+        )
+        text = getattr(result, 'text', '') or ''
+        return str(text).strip()
+
+
+class AutoManualRules:
+    """AutoManual-style learned rule extraction (Chen et al., NeurIPS 2024,
+    arXiv:2405.16247).
+
+    Distills each failure finding into a one-line rule. ``suggest()`` returns
+    one :class:`FixProposal` per finding whose ``suggestion_text`` holds the
+    rule. ``apply()`` appends accepted rules to a per-project Markdown manual
+    (``~/.agentdebug/manuals/<project>.md`` by default) which downstream
+    runs can prepend to their agent's system prompt to avoid re-hitting the
+    same failure.
+
+    Unlike :class:`ReflexionSuggestion` (short verbal hint per attempt) and
+    :class:`SelfRefineLoop` (heavy generator-critic-refiner per finding),
+    this is the LONG-TERM memory: small, append-only, surviving across runs.
+    Apply is opt-in because it writes to the filesystem.
+    """
+
+    id = 'auto_manual'
+
+    DEFAULT_MANUAL_DIR = '~/.agentdebug/manuals'
+
+    def __init__(
+        self,
+        *,
+        llm: Optional[object] = None,
+        manual_dir: Optional[str] = None,
+        project: str = 'default',
+        max_tokens: int = 256,
+    ) -> None:
+        # llm is optional — if absent, we synthesize a rule from the finding's
+        # suggestion template rather than calling out.
+        self.llm = llm
+        self.manual_dir = manual_dir or self.DEFAULT_MANUAL_DIR
+        self.project = project
+        self.max_tokens = max_tokens
+
+    def suggest(
+        self,
+        trajectory: AgentTrajectory,
+        report: DiagnosticReport,
+    ) -> List[FixProposal]:
+        if not report.findings:
+            return []
+        proposals: List[FixProposal] = []
+        for finding in report.findings:
+            rule = self._rule_for(trajectory, finding)
+            if not rule:
+                continue
+            proposals.append(FixProposal(
+                proposal_id=new_id('fix'),
+                recoverer_id=self.id,
+                target_event_id=finding.event_id,
+                summary=(
+                    f'Add rule to {self.project} manual: '
+                    f'"{rule[:80]}{"…" if len(rule) > 80 else ""}"'
+                ),
+                rationale=(
+                    'AutoManual (Chen et al., NeurIPS 2024): distill the '
+                    'failure into a one-line rule the next run reads via its '
+                    'system prompt. Long-term memory complements per-attempt '
+                    'Reflexion and per-finding Self-Refine.'
+                ),
+                confidence=max(0.4, min(0.9, finding.confidence)),
+                suggestion_text=rule,
+                side_effects=['manual.write'],
+                requires_human_approval=False,
+            ))
+        return proposals
+
+    def apply(self, proposal: FixProposal) -> str:
+        """Append the proposal's rule to the project manual; return the path."""
+        from pathlib import Path
+
+        target = Path(self.manual_dir).expanduser() / f'{self.project}.md'
+        target.parent.mkdir(parents=True, exist_ok=True)
+        existing = target.read_text(encoding='utf-8') if target.exists() else ''
+        if not existing:
+            header = f'# AgentDebugX learned manual — {self.project}\n\n'
+            existing = header + '<!-- auto-generated; safe to edit. -->\n\n'
+        # Idempotent: skip if the rule is already present (case-insensitive).
+        rule = proposal.suggestion_text.strip()
+        if rule.lower() in existing.lower():
+            return str(target)
+        target.write_text(
+            existing + f'- {rule}\n',
+            encoding='utf-8',
+        )
+        return str(target)
+
+    def _rule_for(
+        self,
+        trajectory: AgentTrajectory,
+        finding: FailureFinding,
+    ) -> Optional[str]:
+        # If no LLM, fall back to the finding's suggestion template.
+        if self.llm is None:
+            if finding.suggestion:
+                return str(finding.suggestion)
+            if finding.failure_mode.suggestion_templates:
+                return str(finding.failure_mode.suggestion_templates[0])
+            return None
+        prompt_system = (
+            'You distill failure findings into ONE-LINE actionable rules for '
+            'an agent to follow next time. Output plain text — a single '
+            'sentence under 200 characters. No JSON, no markdown, no '
+            'preamble. Start with an imperative verb ("Validate ...", '
+            '"Always ...", "Before ..."). Be specific to the failure.'
+        )
+        evidence = '; '.join(finding.evidence) or '(no evidence)'
+        prompt_user = (
+            f'Goal: {trajectory.goal!r}\n'
+            f'Failure mode: {finding.failure_mode.mode_id} '
+            f'({finding.failure_mode.name})\n'
+            f'Agent: {finding.agent_name} at step {finding.step_index}\n'
+            f'Evidence: {evidence}'
+        )
+        try:
+            result = self.llm.complete(  # type: ignore[attr-defined]
+                messages=[
+                    {'role': 'system', 'content': prompt_system},
+                    {'role': 'user', 'content': prompt_user},
+                ],
+                max_tokens=self.max_tokens,
+            )
+        except Exception:
+            return str(finding.suggestion) if finding.suggestion else None
+        text = getattr(result, 'text', '') or ''
+        rule = str(text).strip().splitlines()[0] if text.strip() else ''
+        if not rule:
+            return str(finding.suggestion) if finding.suggestion else None
+        return rule
+
+
 __all__ = [
+    'AutoManualRules',
     'CriticRecoverer',
     'DEFAULT_VERIFIERS',
     'FixProposal',
     'Recoverer',
     'ReflexionSuggestion',
+    'SelfRefineLoop',
     'VerifierSpec',
 ]