counterexample
Find a bounded source-to-sink path that bypasses a named validator, proving such flow is possible. A truncated search yields no proof of absence.
Instructions
Find a bounded call path from src to sink that avoids a named validator/guard. This is the inverse reachability move; absence of a path is not proof when the search is truncated.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| src | Yes | ||
| sink | Yes | ||
| depth | No | ||
| limit | No | ||
| format | No | text (compact, default) | json (structured result page) | |
| validator | Yes |