[
  {
    "family": "ollvm16-sub-O0",
    "operation": "xor",
    "site_index": 1,
    "pe_sha256": "1219EFD932F81930556039CC0221AB757D8F9BA28A5036E5551D2C83BD69A65E",
    "previous_classification": "NO SIMPLIFICATION",
    "input": "ExprOp('|', ExprOp('&', ExprId('x', 32), ExprInt(0xEDCBA987, 32)), ExprOp('&', ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x12345678, 32)))",
    "expected": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "id": "ollvm16-sub-O0__xor_1",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\ollvm16-sub-O0__xor_1",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 9,
    "simplified_expression": "(x ^ 0x12345678)",
    "simplified_expression_repr": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.3333333333333333,
    "reduction_percentage": 66.66666666666667,
    "elapsed_seconds": 0.1470268000048236,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.0007859999968786724,
      "reason_unknown": null,
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.00029150000045774505,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "EXACT RECOVERY",
    "recovered": true,
    "nontrivial_recovery": true,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x ^ 0x12345678",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "ollvm16-sub-O0",
    "operation": "xor",
    "site_index": 2,
    "pe_sha256": "1219EFD932F81930556039CC0221AB757D8F9BA28A5036E5551D2C83BD69A65E",
    "previous_classification": "NO SIMPLIFICATION",
    "input": "ExprOp('|', ExprOp('&', ExprId('x', 32), ExprInt(0xEDCBA987, 32)), ExprOp('&', ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x12345678, 32)))",
    "expected": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "id": "ollvm16-sub-O0__xor_2",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\ollvm16-sub-O0__xor_2",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 9,
    "simplified_expression": "(x ^ 0x12345678)",
    "simplified_expression_repr": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.3333333333333333,
    "reduction_percentage": 66.66666666666667,
    "elapsed_seconds": 0.14847179999924265,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.000970599998254329,
      "reason_unknown": null,
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.00031159999343799427,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "EXACT RECOVERY",
    "recovered": true,
    "nontrivial_recovery": true,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x ^ 0x12345678",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "tigress-encode_arithmetic-O0",
    "operation": "xor",
    "site_index": 1,
    "pe_sha256": "DBC1B4078560F18E682BD2C7E0763BA067202B69C23CA321056D234703BF4E2D",
    "previous_classification": "NO SIMPLIFICATION",
    "input": "ExprOp('+', ExprId('x', 32), ExprOp('-', ExprOp('<<', ExprOp('|', ExprId('x', 32), ExprInt(0xEDCBA987, 32)), ExprInt(0x1, 32))), ExprInt(0xEDCBA986, 32))",
    "expected": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "id": "tigress-encode_arithmetic-O0__xor_1",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\tigress-encode_arithmetic-O0__xor_1",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 9,
    "simplified_expression": "(x ^ 0x12345678)",
    "simplified_expression_repr": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.3333333333333333,
    "reduction_percentage": 66.66666666666667,
    "elapsed_seconds": 0.15053200000693323,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.009702700001071207,
      "reason_unknown": null,
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.0005510999981197529,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "EXACT RECOVERY",
    "recovered": true,
    "nontrivial_recovery": true,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x ^ 0x12345678",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "tigress-encode_arithmetic-O0",
    "operation": "xor",
    "site_index": 2,
    "pe_sha256": "DBC1B4078560F18E682BD2C7E0763BA067202B69C23CA321056D234703BF4E2D",
    "previous_classification": "NO SIMPLIFICATION",
    "input": "ExprOp('+', ExprId('x', 32), ExprOp('*', ExprOp('|', ExprId('x', 32), ExprInt(0xEDCBA987, 32)), ExprInt(0xFFFFFFFE, 32)), ExprInt(0xEDCBA986, 32))",
    "expected": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "id": "tigress-encode_arithmetic-O0__xor_2",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\tigress-encode_arithmetic-O0__xor_2",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 8,
    "simplified_expression": "(x ^ 0x12345678)",
    "simplified_expression_repr": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.375,
    "reduction_percentage": 62.5,
    "elapsed_seconds": 0.14051430000108667,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.009544699998514261,
      "reason_unknown": null,
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.0005231000031926669,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "EXACT RECOVERY",
    "recovered": true,
    "nontrivial_recovery": true,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x ^ 0x12345678",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "tigress-encode_arithmetic-O0",
    "operation": "add",
    "site_index": 1,
    "pe_sha256": "DBC1B4078560F18E682BD2C7E0763BA067202B69C23CA321056D234703BF4E2D",
    "previous_classification": "NO SIMPLIFICATION",
    "input": "ExprSlice(ExprOp('+', ExprOp('*', ExprCompose(ExprOp('|', ExprId('x', 32), ExprInt(0x1337, 32)), ExprInt(0x0, 32)), ExprInt(0x2, 64)), ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFECC8, 32)), ExprInt(0x0, 32)), ExprInt(0x1, 64)), 0, 32)",
    "expected": "ExprOp('+', ExprId('x', 32), ExprInt(0x1337, 32))",
    "id": "tigress-encode_arithmetic-O0__add_1",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\tigress-encode_arithmetic-O0__add_1",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 15,
    "simplified_expression": "(x + 0x1337)",
    "simplified_expression_repr": "ExprOp('+', ExprId('x', 32), ExprInt(0x1337, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.2,
    "reduction_percentage": 80.0,
    "elapsed_seconds": 0.08439630000066245,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.011089300001913216,
      "reason_unknown": null,
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.00047479999921051785,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "EXACT RECOVERY",
    "recovered": true,
    "nontrivial_recovery": true,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x + 0x1337",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "tigress-encode_arithmetic-O0",
    "operation": "add",
    "site_index": 2,
    "pe_sha256": "DBC1B4078560F18E682BD2C7E0763BA067202B69C23CA321056D234703BF4E2D",
    "previous_classification": "NO SIMPLIFICATION",
    "input": "ExprSlice(ExprOp('+', ExprOp('*', ExprCompose(ExprOp('&', ExprId('x', 32), ExprInt(0x1337, 32)), ExprInt(0x0, 32)), ExprInt(0x2, 64)), ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0x1337, 32)), ExprInt(0x0, 32))), 0, 32)",
    "expected": "ExprOp('+', ExprId('x', 32), ExprInt(0x1337, 32))",
    "id": "tigress-encode_arithmetic-O0__add_2",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\tigress-encode_arithmetic-O0__add_2",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 14,
    "simplified_expression": "(x + 0x1337)",
    "simplified_expression_repr": "ExprOp('+', ExprId('x', 32), ExprInt(0x1337, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.21428571428571427,
    "reduction_percentage": 78.57142857142857,
    "elapsed_seconds": 0.0824575000006007,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.010960899999190588,
      "reason_unknown": null,
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.0005740999986301176,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "EXACT RECOVERY",
    "recovered": true,
    "nontrivial_recovery": true,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x + 0x1337",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "polaris-mba-O0",
    "operation": "xor",
    "site_index": 1,
    "pe_sha256": "48A7750AAAD7E6CC7E0F9638D9278CF7864882D4BA95D0C3222596BC6879AEF5",
    "previous_classification": "PARTIAL SIMPLIFICATION",
    "input": "ExprOp('+', ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFFE5, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFFE5, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x12345678, 32)), ExprInt(0xFFFFFFFF, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x12345678, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x1C, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x12345678, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x0, 32)), ExprInt(0x1C, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprOp('|', ExprId('x', 32), ExprInt(0x12345678, 32)), ExprInt(0xFFFFFFFF, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprOp('|', ExprId('x', 32), ExprInt(0x12345678, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFFE4, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprOp('|', ExprId('x', 32), ExprInt(0x12345678, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFFE4, 64))), 0, 32))",
    "expected": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "id": "polaris-mba-O0__xor_1",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\polaris-mba-O0__xor_1",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 73,
    "simplified_expression": "(x ^ 0x12345678)",
    "simplified_expression_repr": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.0410958904109589,
    "reduction_percentage": 95.89041095890411,
    "elapsed_seconds": 0.1684769999992568,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.15844880000076955,
      "reason_unknown": null,
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.0006522000039694831,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "EXACT RECOVERY",
    "recovered": true,
    "nontrivial_recovery": true,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x ^ 0x12345678",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "polaris-mba-O0",
    "operation": "xor",
    "site_index": 2,
    "pe_sha256": "48A7750AAAD7E6CC7E0F9638D9278CF7864882D4BA95D0C3222596BC6879AEF5",
    "previous_classification": "NO SIMPLIFICATION",
    "input": "ExprOp('+', ExprOp('*', ExprOp('&', ExprId('x', 32), ExprInt(0x12345678, 32)), ExprInt(0xFFFFFF40, 32)), ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32)), ExprSlice(ExprCond(ExprSlice(ExprId('x', 32), 31, 32), ExprOp('*', ExprCompose(ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xC0, 64)), ExprOp('*', ExprCompose(ExprId('x', 32), ExprInt(0x0, 32)), ExprInt(0xC0, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('&', ExprId('x', 32), ExprInt(0xEDCBA987, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('&', ExprId('x', 32), ExprInt(0xEDCBA987, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFF3B, 64)), ExprOp('*', ExprCompose(ExprOp('&', ExprId('x', 32), ExprInt(0xEDCBA987, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFF3B, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('|', ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x12345678, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('|', ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x12345678, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFFFB, 64)), ExprOp('*', ExprCompose(ExprOp('|', ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x12345678, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFFFB, 64))), 0, 32), ExprInt(0xFFFFFFFB, 32))",
    "expected": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "id": "polaris-mba-O0__xor_2",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\polaris-mba-O0__xor_2",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 70,
    "simplified_expression": "(x ^ 0x12345678)",
    "simplified_expression_repr": "ExprOp('^', ExprId('x', 32), ExprInt(0x12345678, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.04285714285714286,
    "reduction_percentage": 95.71428571428571,
    "elapsed_seconds": 0.1693974999943748,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.8920789000039804,
      "reason_unknown": null,
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.0006766000005882233,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "EXACT RECOVERY",
    "recovered": true,
    "nontrivial_recovery": true,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x ^ 0x12345678",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "polaris-mba-O0",
    "operation": "add",
    "site_index": 0,
    "pe_sha256": "48A7750AAAD7E6CC7E0F9638D9278CF7864882D4BA95D0C3222596BC6879AEF5",
    "previous_classification": "UNSOUND / VERIFICATION FAILURE",
    "input": "ExprOp('+', ExprSlice(ExprCond(ExprSlice(ExprId('x', 32), 31, 32), ExprOp('*', ExprCompose(ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x22, 64)), ExprOp('*', ExprCompose(ExprId('x', 32), ExprInt(0x0, 32)), ExprInt(0x22, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('&', ExprId('x', 32), ExprInt(0xFFFFECC8, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('&', ExprId('x', 32), ExprInt(0xFFFFECC8, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFEA8, 64)), ExprOp('*', ExprCompose(ExprOp('&', ExprId('x', 32), ExprInt(0xFFFFECC8, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFEA8, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprId('x', 32), ExprInt(0x1337, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0x1337, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xAC, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0x1337, 32)), ExprInt(0x0, 32)), ExprInt(0xAC, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFF75, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFF75, 64))), 0, 32), ExprInt(0xFFF329B8, 32))",
    "expected": "ExprOp('+', ExprId('x', 32), ExprInt(0x1337, 32))",
    "id": "polaris-mba-O0__add_0",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\polaris-mba-O0__add_0",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 76,
    "simplified_expression": "(x + 0x1337)",
    "simplified_expression_repr": "ExprOp('+', ExprId('x', 32), ExprInt(0x1337, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.039473684210526314,
    "reduction_percentage": 96.05263157894737,
    "elapsed_seconds": 0.10267040000326233,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unknown",
      "bit_width": 32,
      "elapsed_seconds": 10.01568430000043,
      "reason_unknown": "timeout",
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.0008883999980753288,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "SMT UNKNOWN",
    "recovered": false,
    "nontrivial_recovery": false,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x + 0x1337",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "polaris-mba-O0",
    "operation": "add",
    "site_index": 1,
    "pe_sha256": "48A7750AAAD7E6CC7E0F9638D9278CF7864882D4BA95D0C3222596BC6879AEF5",
    "previous_classification": "PARTIAL SIMPLIFICATION",
    "input": "ExprOp('+', ExprSlice(ExprCond(ExprSlice(ExprId('x', 32), 31, 32), ExprOp('*', ExprCompose(ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFE, 64)), ExprOp('*', ExprCompose(ExprId('x', 32), ExprInt(0x0, 32)), ExprInt(0xFE, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprId('x', 32), ExprInt(0x1337, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0x1337, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFF03, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0x1337, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFF03, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x1337, 32)), ExprInt(0xFFFFFFFF, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x1337, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x8C, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x1337, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x0, 32)), ExprInt(0x8C, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('|', ExprId('x', 32), ExprInt(0xFFFFECC8, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('|', ExprId('x', 32), ExprInt(0xFFFFECC8, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFE92, 64)), ExprOp('*', ExprCompose(ExprOp('|', ExprId('x', 32), ExprInt(0xFFFFECC8, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFE92, 64))), 0, 32), ExprInt(0xFFF7970E, 32))",
    "expected": "ExprOp('+', ExprId('x', 32), ExprInt(0x1337, 32))",
    "id": "polaris-mba-O0__add_1",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\polaris-mba-O0__add_1",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 82,
    "simplified_expression": "(x + 0x1337)",
    "simplified_expression_repr": "ExprOp('+', ExprId('x', 32), ExprInt(0x1337, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.036585365853658534,
    "reduction_percentage": 96.34146341463415,
    "elapsed_seconds": 0.10118929999589454,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.027887999996892177,
      "reason_unknown": null,
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.000577899998461362,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "EXACT RECOVERY",
    "recovered": true,
    "nontrivial_recovery": true,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x + 0x1337",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "polaris-mba-O0",
    "operation": "sub",
    "site_index": 0,
    "pe_sha256": "48A7750AAAD7E6CC7E0F9638D9278CF7864882D4BA95D0C3222596BC6879AEF5",
    "previous_classification": "PARTIAL SIMPLIFICATION",
    "input": "ExprOp('+', ExprOp('*', ExprOp('&', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0x12C, 32)), ExprSlice(ExprCond(ExprSlice(ExprId('x', 32), 31, 32), ExprOp('*', ExprCompose(ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFF86, 64)), ExprOp('*', ExprCompose(ExprId('x', 32), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFF86, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFEEEE, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFEEEE, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFF85, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0xFFFFEEEE, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFF85, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0xFFFFFFFF, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x36, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x0, 32)), ExprInt(0x36, 64))), 0, 32), ExprInt(0xFFF7BB7F, 32))",
    "expected": "ExprOp('+', ExprId('x', 32), ExprInt(0xFFFFEEEF, 32))",
    "id": "polaris-mba-O0__sub_0",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\polaris-mba-O0__sub_0",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 67,
    "simplified_expression": "(x + 0xFFFFEEEF)",
    "simplified_expression_repr": "ExprOp('+', ExprId('x', 32), ExprInt(0xFFFFEEEF, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.04477611940298507,
    "reduction_percentage": 95.5223880597015,
    "elapsed_seconds": 0.09598349999578204,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.016699500003596768,
      "reason_unknown": null,
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.0006236000044737011,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "EXACT RECOVERY",
    "recovered": true,
    "nontrivial_recovery": true,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x + 0xFFFFEEEF",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  },
  {
    "family": "polaris-mba-O0",
    "operation": "sub",
    "site_index": 1,
    "pe_sha256": "48A7750AAAD7E6CC7E0F9638D9278CF7864882D4BA95D0C3222596BC6879AEF5",
    "previous_classification": "UNSOUND / VERIFICATION FAILURE",
    "input": "ExprOp('+', ExprSlice(ExprCond(ExprSlice(ExprId('x', 32), 31, 32), ExprOp('*', ExprCompose(ExprId('x', 32), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFF40, 64)), ExprOp('*', ExprCompose(ExprId('x', 32), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFF40, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprId('x', 32), ExprInt(0x1111, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFF99, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFF99, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0xFFFFFFFF, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0xFFFFFFFFFFFFFFA6, 64)), ExprOp('*', ExprCompose(ExprOp('^', ExprOp('&', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x0, 32)), ExprInt(0xFFFFFFFFFFFFFFA6, 64))), 0, 32), ExprSlice(ExprCond(ExprSlice(ExprOp('|', ExprId('x', 32), ExprInt(0x1111, 32)), 31, 32), ExprOp('*', ExprCompose(ExprOp('|', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0xFFFFFFFF, 32)), ExprInt(0x128, 64)), ExprOp('*', ExprCompose(ExprOp('|', ExprId('x', 32), ExprInt(0x1111, 32)), ExprInt(0x0, 32)), ExprInt(0x128, 64))), 0, 32), ExprInt(0xFFF310C4, 32))",
    "expected": "ExprOp('+', ExprId('x', 32), ExprInt(0xFFFFEEEF, 32))",
    "id": "polaris-mba-O0__sub_1",
    "directory": "E:\\Workspace\\seeing_through_obfuscation\\results\\deobfuscation\\complex_arithmetic_v1\\synthesis_expansion\\polaris-mba-O0__sub_1",
    "mode": "synthesis",
    "extracted": true,
    "method": "Synthesizer_SMIR",
    "input_ast_nodes": 82,
    "simplified_expression": "(x + 0xFFFFEEEF)",
    "simplified_expression_repr": "ExprOp('+', ExprId('x', 32), ExprInt(0xFFFFEEEF, 32))",
    "simplified_ast_nodes": 3,
    "expected_ast_nodes": 3,
    "simplification_ratio": 0.036585365853658534,
    "reduction_percentage": 96.34146341463415,
    "elapsed_seconds": 0.1029497999988962,
    "score": 0.0,
    "search_budget_exhausted": false,
    "candidate_claimed_by_tool": true,
    "oracle_accepted_replacements": 0,
    "internal_smt_results": {},
    "already_canonical_before_msynth": false,
    "settings": "Preregistered: seed 0, 50 synthesis samples, SMIR on, 10s search; AST/SiMBA internal SMT 2s; independent SMT 10s/query.",
    "input_to_candidate": {
      "result": "unknown",
      "bit_width": 32,
      "elapsed_seconds": 10.013782499998342,
      "reason_unknown": "timeout",
      "counterexample": null
    },
    "candidate_to_expected": {
      "result": "unsat",
      "bit_width": 32,
      "elapsed_seconds": 0.0007946999976411462,
      "reason_unknown": null,
      "counterexample": null
    },
    "classification": "SMT UNKNOWN",
    "recovered": false,
    "nontrivial_recovery": false,
    "note": "Full 32-bit symbolic-input proof required. Nonzero-score synthesis best candidates are failures, not claimed sound rewrites; their SAT counterexamples are retained. No obfuscator/source-target hint is passed to the algorithm.",
    "upstream_miasm_pretty_expression": "x + 0xFFFFEEEF",
    "display_note": "Faithful AST renderer; upstream Miasm pretty text retained separately because binary subtraction may be printed as unary negation. No algorithm or proof was rerun."
  }
]