{
  "model": "Mathematical integers, pure total acyclic structured program; finite input solver domain [-2,2]^2 only.",
  "pdg": {
    "postdominators": {
      "0": [
        0,
        1,
        2,
        3,
        4,
        8,
        9,
        10
      ],
      "1": [
        1,
        2,
        3,
        4,
        8,
        9,
        10
      ],
      "2": [
        2,
        3,
        4,
        8,
        9,
        10
      ],
      "3": [
        3,
        4,
        8,
        9,
        10
      ],
      "4": [
        4,
        8,
        9,
        10
      ],
      "5": [
        5,
        8,
        9,
        10
      ],
      "6": [
        6,
        8,
        9,
        10
      ],
      "7": [
        7,
        8,
        9,
        10
      ],
      "8": [
        8,
        9,
        10
      ],
      "9": [
        9,
        10
      ],
      "10": [
        10
      ]
    },
    "data_edges": [
      [
        0,
        1,
        "x"
      ],
      [
        0,
        2,
        "y"
      ],
      [
        0,
        4,
        "x"
      ],
      [
        0,
        5,
        "y"
      ],
      [
        1,
        5,
        "a"
      ],
      [
        2,
        8,
        "junk"
      ],
      [
        3,
        9,
        "r"
      ],
      [
        6,
        9,
        "r"
      ],
      [
        7,
        9,
        "r"
      ]
    ],
    "control_edges": [
      [
        4,
        5,
        true
      ],
      [
        5,
        6,
        true
      ],
      [
        5,
        7,
        false
      ]
    ]
  },
  "slice": {
    "kept": [
      0,
      1,
      3,
      4,
      5,
      6,
      7,
      9
    ],
    "removed": [
      2,
      8
    ],
    "checked_inputs": 25
  },
  "symbolic_paths": [
    {
      "path": [
        [
          4,
          true
        ],
        [
          5,
          true
        ]
      ],
      "inputs": 1,
      "return": 1
    },
    {
      "path": [
        [
          4,
          true
        ],
        [
          5,
          false
        ]
      ],
      "inputs": 9,
      "return": 2
    },
    {
      "path": [
        [
          4,
          false
        ]
      ],
      "inputs": 15,
      "return": 0
    }
  ],
  "assert_r_not_1_counterexamples": [
    [
      1,
      2
    ]
  ],
  "concolic_runs": [
    {
      "input": [
        0,
        0
      ],
      "path": [
        [
          4,
          false
        ]
      ],
      "return": 0
    },
    {
      "input": [
        1,
        -2
      ],
      "path": [
        [
          4,
          true
        ],
        [
          5,
          false
        ]
      ],
      "return": 2
    },
    {
      "input": [
        1,
        2
      ],
      "path": [
        [
          4,
          true
        ],
        [
          5,
          true
        ]
      ],
      "return": 1
    }
  ],
  "houdini": {
    "rounds": [
      {
        "active": [
          "p0",
          "p1",
          "p2",
          "p3",
          "p4"
        ],
        "removed": {
          "p0": {
            "initial": 0
          }
        }
      },
      {
        "active": [
          "p1",
          "p2",
          "p3",
          "p4"
        ],
        "removed": {
          "p1": {
            "step": [
              0,
              1
            ]
          }
        }
      },
      {
        "active": [
          "p2",
          "p3",
          "p4"
        ],
        "removed": {
          "p2": {
            "step": [
              1,
              2
            ]
          }
        }
      },
      {
        "active": [
          "p3",
          "p4"
        ],
        "removed": {}
      }
    ],
    "survivors": [
      "p3",
      "p4"
    ],
    "certificate_states": [
      0,
      1,
      2
    ],
    "candidate_subsets_checked": 32
  },
  "kinduction": {
    "depth1": {
      "k": 1,
      "base_counterexample": null,
      "step_counterexample": [
        2,
        3
      ],
      "proved": false
    },
    "depth2": {
      "k": 2,
      "base_counterexample": null,
      "step_counterexample": null,
      "proved": true
    },
    "cycle_depths_checked": 8,
    "cycle_counterexample_pattern": "2 repeated k times, then 3; unreachable from initial 0",
    "strengthened": {
      "k": 1,
      "base_counterexample": null,
      "step_counterexample": null,
      "proved": true
    }
  },
  "transfer_checks": {
    "changed_slice": [
      0,
      2,
      8,
      9
    ],
    "restricted_domain_paths": 2,
    "repair_checked_inputs": 25,
    "added_edge_houdini_survivors": [],
    "new_initial_k2": {
      "k": 2,
      "base_counterexample": [
        2,
        3
      ],
      "step_counterexample": null,
      "proved": false
    }
  },
  "regressions": [
    "dead-end bad initial state",
    "base omitted would be unsound",
    "mutually supporting candidates",
    "python -O retains explicit checks"
  ]
}