solve_branch_reachability
Computes exact concrete inputs that reach a target branch in a binary using Z3 and angr, while pruning specified failure paths.
Instructions
Uses Z3 SMT Theorem Prover and angr to solve for exact concrete inputs reaching target branches while pruning failure paths.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"binary_path": "<binary_path>",
"target_address": "<target_address>"
},
"name": "solve_branch_reachability"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| binary_path | Yes | Path to binary | |
| input_length | No | Symbolic input length | |
| target_address | Yes | Hex address of target block | |
| avoid_addresses | No | Pruned addresses |