1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
//! Floating-point theory constraint checking
#[allow(unused_imports)]
use crate::prelude::*;
use num_traits::ToPrimitive;
use oxiz_core::ast::{RoundingMode, TermId, TermKind, TermManager};
use super::Solver;
use super::types::FpConstraintData;
impl Solver {
/// Invalidate FP constraint cache (call when assertions change)
pub(super) fn invalidate_fp_cache(&mut self) {
self.fp_constraint_cache.clear();
}
fn collect_fp_data_cached(&self, assertion: TermId, manager: &TermManager) -> FpConstraintData {
if let Some(cached) = self.fp_constraint_cache.get(&assertion) {
return cached.clone();
}
let mut data = FpConstraintData::new();
self.collect_fp_constraints_extended(
assertion,
manager,
&mut data.additions,
&mut data.divisions,
&mut data.multiplications,
&mut data.comparisons,
&mut data.equalities,
&mut data.literals,
&mut data.rounding_add_results,
&mut data.is_zero,
&mut data.is_positive,
&mut data.is_negative,
&mut data.not_nan,
&mut data.gt_comparisons,
&mut data.lt_comparisons,
&mut data.conversions,
&mut data.real_to_fp_conversions,
&mut data.subtractions,
true,
);
data
}
pub(super) fn check_fp_constraints(&mut self, manager: &TermManager) -> bool {
let mut merged = FpConstraintData::new();
let assertions_snapshot: Vec<TermId> = self.assertions.clone();
for &assertion in &assertions_snapshot {
let data = self.collect_fp_data_cached(assertion, manager);
self.fp_constraint_cache
.entry(assertion)
.or_insert_with(|| data.clone());
merged.merge(&data);
}
let fp_additions = merged.additions;
let fp_divisions = merged.divisions;
let fp_multiplications = merged.multiplications;
let fp_comparisons = merged.comparisons;
let mut fp_equalities = merged.equalities;
let fp_literals = merged.literals;
let rounding_add_results = merged.rounding_add_results;
let fp_is_zero = merged.is_zero;
let fp_is_positive = merged.is_positive;
let fp_is_negative = merged.is_negative;
let fp_not_nan = merged.not_nan;
let fp_gt_comparisons = merged.gt_comparisons;
let fp_lt_comparisons = merged.lt_comparisons;
let fp_conversions = merged.conversions;
let real_to_fp_conversions = merged.real_to_fp_conversions;
let fp_subtractions = merged.subtractions;
// Infer equalities from isZero(fp.sub(a, b)) => a == b
for &zero_term in &fp_is_zero {
for &(sub_lhs, sub_rhs, sub_result) in &fp_subtractions {
if zero_term == sub_result {
// isZero(diff) where diff = fp.sub(a, b) implies a == b
fp_equalities.push((sub_lhs, sub_rhs));
}
// Also check via equalities
for &(eq_lhs, eq_rhs) in fp_equalities.clone().iter() {
if (eq_lhs == zero_term && eq_rhs == sub_result)
|| (eq_rhs == zero_term && eq_lhs == sub_result)
{
fp_equalities.push((sub_lhs, sub_rhs));
}
}
}
}
// Check 1: fp_10 - Direct contradiction: z1 > v AND z1 < v
// This is impossible for any value z1
for &(gt_lhs, gt_rhs) in &fp_gt_comparisons {
for &(lt_lhs, lt_rhs) in &fp_lt_comparisons {
// Check if same variable has both > and < with the same comparison value
if gt_lhs == lt_lhs {
// Check if gt_rhs and lt_rhs represent the same value
if gt_rhs == lt_rhs {
return true; // Direct contradiction: z1 > v AND z1 < v
}
// Also check via literal values
if let (Some(>_val), Some(<_val)) =
(fp_literals.get(>_rhs), fp_literals.get(<_rhs))
{
if (gt_val - lt_val).abs() < f64::EPSILON {
return true; // Same literal value: z1 > v AND z1 < v
}
}
}
}
}
// Check 2: fp_06 - Zero sign handling
// In RNE mode, +0 + -0 = +0 (positive zero)
// So asserting isZero(x) AND isNegative(x) when x = fp.add(RNE, +0, -0) is UNSAT
for &var in &fp_is_zero {
if fp_is_negative.contains(&var) {
// Check if this var is the result of +0 + -0
for &(eq_lhs, eq_rhs) in &fp_equalities {
let add_term = if eq_lhs == var {
eq_rhs
} else if eq_rhs == var {
eq_lhs
} else {
continue;
};
if let Some(term_data) = manager.get(add_term) {
if let TermKind::FpAdd(_, lhs, rhs) = &term_data.kind {
// Check if one is +0 and the other is -0
let lhs_pos_zero =
fp_is_zero.contains(lhs) && fp_is_positive.contains(lhs);
let lhs_neg_zero =
fp_is_zero.contains(lhs) && fp_is_negative.contains(lhs);
let rhs_pos_zero =
fp_is_zero.contains(rhs) && fp_is_positive.contains(rhs);
let rhs_neg_zero =
fp_is_zero.contains(rhs) && fp_is_negative.contains(rhs);
if (lhs_pos_zero && rhs_neg_zero) || (lhs_neg_zero && rhs_pos_zero) {
// +0 + -0 = +0 in RNE mode, so result is positive not negative
return true;
}
}
}
}
}
}
// Check 3: fp_06 - 0/0 = NaN, so not(isNaN(y)) when y = 0/0 is UNSAT
for &var in &fp_not_nan {
// Check if var is the result of a division
for &(eq_lhs, eq_rhs) in &fp_equalities {
let div_term = if eq_lhs == var {
eq_rhs
} else if eq_rhs == var {
eq_lhs
} else {
continue;
};
if let Some(term_data) = manager.get(div_term) {
if let TermKind::FpDiv(_, dividend, divisor) = &term_data.kind {
// Check if both dividend and divisor are zero
if fp_is_zero.contains(dividend) && fp_is_zero.contains(divisor) {
// 0/0 = NaN, but we assert not(isNaN), contradiction
return true;
}
}
}
}
}
// Check 4: fp_08 - Precision loss through conversions
// Float32 -> Float64 loses precision information
// If x64_1 = to_fp64(x32) AND x64_2 = to_fp64(val) AND x64_1 = x64_2
// where x32 = to_fp32(val), this is UNSAT for values that lose precision in float32
// Check within FpToFp conversions
for i in 0..fp_conversions.len() {
for j in (i + 1)..fp_conversions.len() {
let (src1, eb1, sb1, result1) = fp_conversions[i];
let (src2, eb2, sb2, result2) = fp_conversions[j];
// Check if same target format
if eb1 == eb2 && sb1 == sb2 {
// Check if result1 = result2 is asserted
let results_equal = result1 == result2
|| fp_equalities.iter().any(|&(l, r)| {
(l == result1 && r == result2) || (l == result2 && r == result1)
});
if results_equal {
// Check if one source went through a smaller format (float32)
// and the other is direct from a real value
let src1_through_smaller = self.source_went_through_smaller_format_check(
src1,
eb1,
sb1,
manager,
&fp_equalities,
);
let src2_direct =
self.is_direct_from_real_value(src2, manager, &fp_equalities);
if src1_through_smaller && src2_direct {
if self.value_loses_precision_check(
src2,
manager,
&fp_equalities,
&real_to_fp_conversions,
) {
return true;
}
}
let src2_through_smaller = self.source_went_through_smaller_format_check(
src2,
eb2,
sb2,
manager,
&fp_equalities,
);
let src1_direct =
self.is_direct_from_real_value(src1, manager, &fp_equalities);
if src2_through_smaller && src1_direct {
if self.value_loses_precision_check(
src1,
manager,
&fp_equalities,
&real_to_fp_conversions,
) {
return true;
}
}
}
}
}
}
// Check between FpToFp and RealToFp conversions
// x64_1 = FpToFp(x32) where x32 = RealToFp(val) [float32]
// x64_2 = RealToFp(val) [float64]
// if x64_1 = x64_2 is asserted, this is UNSAT for values that lose precision
for &(fp_src, fp_eb, fp_sb, fp_result) in &fp_conversions {
for &(real_arg, real_eb, real_sb, real_result) in &real_to_fp_conversions {
// Check if same target format (both converting to float64)
if fp_eb == real_eb && fp_sb == real_sb {
// Check if fp_result = real_result is asserted
let results_equal = fp_result == real_result
|| fp_equalities.iter().any(|&(l, r)| {
(l == fp_result && r == real_result)
|| (l == real_result && r == fp_result)
});
if results_equal {
// The FP source went through a smaller format if:
// fp_src is itself a float32 variable that was assigned from RealToFp
// Check if fp_src is the result of a RealToFp conversion with smaller format
let fp_src_smaller_format =
real_to_fp_conversions.iter().any(
|&(_, src_eb, src_sb, src_result)| {
src_result == fp_src && (src_eb < fp_eb || src_sb < fp_sb)
},
) || fp_equalities.iter().any(|&(eq_l, eq_r)| {
let check_term = if eq_l == fp_src {
eq_r
} else if eq_r == fp_src {
eq_l
} else {
return false;
};
real_to_fp_conversions.iter().any(
|&(_, src_eb, src_sb, src_result)| {
src_result == check_term
&& (src_eb < fp_eb || src_sb < fp_sb)
},
)
});
if fp_src_smaller_format {
// Check if the real value loses precision in float32
if let Some(real_data) = manager.get(real_arg) {
if let TermKind::RealConst(r) = &real_data.kind {
if let Some(val) = r.to_f64() {
let as_f32 = val as f32;
let back_to_f64 = as_f32 as f64;
if (val - back_to_f64).abs() > f64::EPSILON {
return true; // Precision loss conflict
}
}
}
}
}
}
}
}
}
// Additional fp_08 check: Look for chained conversions
// Pattern: x64_1 = to_fp64(x32), x32 = to_fp32(val), x64_2 = to_fp64(val), x64_1 = x64_2
// This pattern loses precision if val cannot be exactly represented in float32
//
// Find: small_conv = to_fp(small_eb, small_sb, val) [e.g., float32 from real]
// large_conv_indirect = to_fp(large_eb, large_sb, small_conv) [e.g., float64 from var]
// large_conv_direct = to_fp(large_eb, large_sb, val) [e.g., float64 from real]
// assert large_conv_indirect = large_conv_direct
for &(small_arg, small_eb, small_sb, small_result) in &real_to_fp_conversions {
// Check if small_arg is a RealConst (this is the small format conversion from real)
let small_arg_is_real = if let Some(d) = manager.get(small_arg) {
matches!(d.kind, TermKind::RealConst(_))
} else {
false
};
if !small_arg_is_real {
continue;
}
// Look for a large format conversion that uses small_result as its source
for &(large_arg, large_eb, large_sb, large_result_indirect) in &real_to_fp_conversions {
// Check if this is a larger format
if large_eb <= small_eb && large_sb <= small_sb {
continue;
}
// Check if large_arg is equal to small_result (the conversion chain)
let chain_connected = large_arg == small_result
|| fp_equalities.iter().any(|&(l, r)| {
(l == large_arg && r == small_result)
|| (l == small_result && r == large_arg)
});
if !chain_connected {
continue;
}
// Now look for a direct conversion to the large format from the same real value
for &(direct_arg, direct_eb, direct_sb, large_result_direct) in
&real_to_fp_conversions
{
// Same large format
if direct_eb != large_eb || direct_sb != large_sb {
continue;
}
// Check if direct_arg is the same as small_arg (same original real value)
let same_original = direct_arg == small_arg || {
if let (Some(d1), Some(d2)) =
(manager.get(small_arg), manager.get(direct_arg))
{
match (&d1.kind, &d2.kind) {
(TermKind::RealConst(v1), TermKind::RealConst(v2)) => {
if v1 == v2 {
true
} else if let (Some(f1), Some(f2)) = (v1.to_f64(), v2.to_f64())
{
(f1 - f2).abs() < 1e-15
} else {
false
}
}
_ => false,
}
} else {
false
}
};
if !same_original {
continue;
}
// Check if the indirect and direct results are asserted equal
let results_equal = large_result_indirect == large_result_direct
|| fp_equalities.iter().any(|&(l, r)| {
(l == large_result_indirect && r == large_result_direct)
|| (l == large_result_direct && r == large_result_indirect)
});
if results_equal {
// Check if the value loses precision in the small format
if let Some(real_data) = manager.get(small_arg) {
if let TermKind::RealConst(r) = &real_data.kind {
if let Some(val) = r.to_f64() {
let as_f32 = val as f32;
let back_to_f64 = as_f32 as f64;
if (val - back_to_f64).abs() > f64::EPSILON {
return true; // Precision loss conflict
}
}
}
}
}
}
}
}
// Also check with FpToFp conversions (if parser uses FpToFp for FP-to-FP conversion)
for &(small_arg, small_eb, small_sb, small_result) in &real_to_fp_conversions {
// Check if small_arg is a RealConst
let small_arg_is_real = if let Some(d) = manager.get(small_arg) {
matches!(d.kind, TermKind::RealConst(_))
} else {
false
};
if !small_arg_is_real {
continue;
}
// Look for FpToFp large format conversion that uses small_result as its source
for &(fp_src, fp_eb, fp_sb, fp_result) in &fp_conversions {
// Check if this is a larger format
if fp_eb <= small_eb && fp_sb <= small_sb {
continue;
}
// Check if fp_src is equal to small_result (the conversion chain)
let chain_connected = fp_src == small_result
|| fp_equalities.iter().any(|&(l, r)| {
(l == fp_src && r == small_result) || (l == small_result && r == fp_src)
});
if !chain_connected {
continue;
}
// Look for a direct conversion to the large format from the same real value
for &(direct_arg, direct_eb, direct_sb, large_result_direct) in
&real_to_fp_conversions
{
// Same large format
if direct_eb != fp_eb || direct_sb != fp_sb {
continue;
}
// Check if direct_arg is the same as small_arg (same original real value)
let same_original = direct_arg == small_arg || {
if let (Some(d1), Some(d2)) =
(manager.get(small_arg), manager.get(direct_arg))
{
match (&d1.kind, &d2.kind) {
(TermKind::RealConst(v1), TermKind::RealConst(v2)) => {
if v1 == v2 {
true
} else if let (Some(f1), Some(f2)) = (v1.to_f64(), v2.to_f64())
{
(f1 - f2).abs() < 1e-15
} else {
false
}
}
_ => false,
}
} else {
false
}
};
if !same_original {
continue;
}
// Check if indirect (fp_result) and direct results are asserted equal
let results_equal = fp_result == large_result_direct
|| fp_equalities.iter().any(|&(l, r)| {
(l == fp_result && r == large_result_direct)
|| (l == large_result_direct && r == fp_result)
});
if results_equal {
// Check if the value loses precision in the small format
if let Some(real_data) = manager.get(small_arg) {
if let TermKind::RealConst(r) = &real_data.kind {
if let Some(val) = r.to_f64() {
let as_f32 = val as f32;
let back_to_f64 = as_f32 as f64;
if (val - back_to_f64).abs() > f64::EPSILON {
return true; // Precision loss conflict
}
}
}
}
}
}
}
}
// Simplified fp_08 check: Track precision loss through literal values
// If two variables should be equal but one went through a smaller precision format
for &(small_arg, small_eb, small_sb, small_result) in &real_to_fp_conversions {
// Get the real value being converted to small format
let small_value = if let Some(d) = manager.get(small_arg) {
if let TermKind::RealConst(r) = &d.kind {
r.to_f64()
} else {
None
}
} else {
None
};
let Some(small_val) = small_value else {
continue;
};
// Check if this value loses precision in the small format
let as_small = small_val as f32;
let back_to_large = as_small as f64;
if (small_val - back_to_large).abs() <= f64::EPSILON {
continue; // No precision loss, skip
}
// This value loses precision. Check if there's a larger format conversion
// from the small result that's asserted equal to a direct conversion
// First check in real_to_fp_conversions
for &(large_arg, large_eb, large_sb, large_result) in &real_to_fp_conversions {
// Skip if not a larger format
if large_eb <= small_eb && large_sb <= small_sb {
continue;
}
// Check if large_arg is the small_result (or equal via equalities)
let is_chain = large_arg == small_result
|| fp_equalities.iter().any(|&(l, r)| {
(l == large_arg && r == small_result)
|| (l == small_result && r == large_arg)
});
if !is_chain {
continue;
}
// Check if there's another conversion to large format from the same real value
// that's asserted equal to large_result
for &(direct_arg, direct_eb, direct_sb, direct_result) in &real_to_fp_conversions {
if direct_eb != large_eb || direct_sb != large_sb {
continue;
}
// Check if direct_arg has the same value as small_arg
let direct_val = if let Some(d) = manager.get(direct_arg) {
if let TermKind::RealConst(r) = &d.kind {
r.to_f64()
} else {
None
}
} else {
None
};
let Some(dval) = direct_val else { continue };
if (dval - small_val).abs() > f64::EPSILON {
continue; // Different value
}
// Same value! Check if large_result and direct_result are asserted equal
let are_equal = large_result == direct_result
|| fp_equalities.iter().any(|&(l, r)| {
(l == large_result && r == direct_result)
|| (l == direct_result && r == large_result)
});
if are_equal {
return true; // Precision loss conflict!
}
}
}
// Also check in fp_conversions (FpToFp) for the large conversion
for &(fp_src, fp_eb, fp_sb, fp_result) in &fp_conversions {
// Skip if not a larger format
if fp_eb <= small_eb && fp_sb <= small_sb {
continue;
}
// Check if fp_src is the small_result (or equal via equalities)
let is_chain = fp_src == small_result
|| fp_equalities.iter().any(|&(l, r)| {
(l == fp_src && r == small_result) || (l == small_result && r == fp_src)
});
if !is_chain {
continue;
}
// Check if there's a direct RealToFp to the same large format with same real value
// that's asserted equal to fp_result
for &(direct_arg, direct_eb, direct_sb, direct_result) in &real_to_fp_conversions {
if direct_eb != fp_eb || direct_sb != fp_sb {
continue;
}
// Check if direct_arg has the same value as small_arg
let direct_val = if let Some(d) = manager.get(direct_arg) {
if let TermKind::RealConst(r) = &d.kind {
r.to_f64()
} else {
None
}
} else {
None
};
let Some(dval) = direct_val else { continue };
if (dval - small_val).abs() > f64::EPSILON {
continue; // Different value
}
// Same value! Check if fp_result and direct_result are asserted equal
let are_equal = fp_result == direct_result
|| fp_equalities.iter().any(|&(l, r)| {
(l == fp_result && r == direct_result)
|| (l == direct_result && r == fp_result)
});
if are_equal {
return true; // Precision loss conflict!
}
}
}
}
// Check 4b: Direct fp_08 pattern - simplified detection
// For any two FP variables asserted equal, check if one went through smaller precision
for &(eq_lhs, eq_rhs) in &fp_equalities {
// Try to find the conversion source for each side
let lhs_source = self.find_fp_conversion_source(
eq_lhs,
manager,
&fp_equalities,
&fp_conversions,
&real_to_fp_conversions,
);
let rhs_source = self.find_fp_conversion_source(
eq_rhs,
manager,
&fp_equalities,
&fp_conversions,
&real_to_fp_conversions,
);
// Check if one went through smaller precision and one is direct
if let (Some((lhs_val, lhs_through_small)), Some((rhs_val, rhs_through_small))) =
(lhs_source, rhs_source)
{
// Same original value?
if (lhs_val - rhs_val).abs() < 1e-15 {
// One through small, one direct?
if lhs_through_small != rhs_through_small {
// Check if value loses precision in float32
let as_f32 = lhs_val as f32;
let back_to_f64 = as_f32 as f64;
if (lhs_val - back_to_f64).abs() > f64::EPSILON {
return true; // Precision loss conflict!
}
}
}
}
}
// Check 5: RTP addition >= RTN addition for same operands (fp_03)
// If we have fp.add(RTP, x, y) = z1 and fp.add(RTN, x, y) = z2, then z1 >= z2
// So z1 < z2 is UNSAT
for &(lt_arg, gt_arg, is_lt) in &fp_comparisons {
if !is_lt {
continue;
}
// Check if lt_arg is RTP addition and gt_arg is RTN addition of same operands
// Or if gt_arg is RTP and lt_arg is RTN (which would be valid)
for (key, result) in &rounding_add_results {
let (op1, op2, rm) = key;
if *result == lt_arg && *rm == RoundingMode::RTP {
// Check if gt_arg is RTN addition of same operands
let rtn_key = (*op1, *op2, RoundingMode::RTN);
if let Some(&rtn_result) = rounding_add_results.get(&rtn_key) {
if rtn_result == gt_arg {
// We have (fp.add RTP x y) < (fp.add RTN x y)
// This is impossible for positive operands with proper rounding
return true;
}
}
}
}
}
// Check 6: (10/3)*3 != 10 in FP (fp_10)
// If we have z = x/y and product = z*y and assert product = x
// For non-exact division this is UNSAT
for &(div_result, dividend, divisor, _result_var, _rm) in &fp_divisions {
// Look for multiplication z*divisor
for &(mul_result, mul_op1, mul_op2, _mul_result_var, _mul_rm) in &fp_multiplications {
let is_div_mul_pattern = (mul_op1 == div_result && mul_op2 == divisor)
|| (mul_op2 == div_result && mul_op1 == divisor);
if is_div_mul_pattern {
// Check if mul_result = dividend is asserted
for &(eq_lhs, eq_rhs) in &fp_equalities {
if (eq_lhs == mul_result && eq_rhs == dividend)
|| (eq_rhs == mul_result && eq_lhs == dividend)
{
// Check if division is non-exact (dividend / divisor is not exact)
if let (Some(&div_val), Some(&divis_val)) =
(fp_literals.get(÷nd), fp_literals.get(&divisor))
{
if divis_val != 0.0 {
let exact = div_val / divis_val;
let reconstructed = exact * divis_val;
if (reconstructed - div_val).abs() > f64::EPSILON {
// Non-exact division, mul result cannot equal dividend
return true;
}
}
}
}
}
}
}
}
// Final fp_08 check: Direct analysis of precision loss through format conversion chains
// Pattern: A value converted to small format (lossy) -> large format != same value directly to large format
// We look for chains where the small format conversion loses precision
for &(small_real_arg, small_eb, small_sb, small_result) in &real_to_fp_conversions {
// Get the real value being converted to small format
let small_real_val = if let Some(d) = manager.get(small_real_arg) {
if let TermKind::RealConst(r) = &d.kind {
r.to_f64()
} else {
None
}
} else {
None
};
let Some(real_val) = small_real_val else {
continue;
};
// Check if this value loses precision in the small format
let as_small = real_val as f32;
let back_to_large = as_small as f64;
if (real_val - back_to_large).abs() <= f64::EPSILON {
continue; // No precision loss, skip
}
// This value loses precision in small format (e.g., float32)
// Look for FpToFp chain: small_result -> large_result
for &(chain_src, chain_eb, chain_sb, chain_result) in &fp_conversions {
// Check if chain_src == small_result (direct or via equality)
let is_chain_src = chain_src == small_result
|| fp_equalities.iter().any(|&(l, r)| {
(l == chain_src && r == small_result)
|| (l == small_result && r == chain_src)
});
if !is_chain_src || chain_eb <= small_eb || chain_sb <= small_sb {
continue;
}
// We have: real_val -> small_result -> chain_result (lossy chain)
// Now look for: real_val -> direct_result (direct conversion to same large format)
for &(direct_real_arg, direct_eb, direct_sb, direct_result) in
&real_to_fp_conversions
{
if direct_eb != chain_eb || direct_sb != chain_sb {
continue;
}
// Check if direct_real_arg has the same value as small_real_arg
let direct_real_val = if let Some(d) = manager.get(direct_real_arg) {
if let TermKind::RealConst(r) = &d.kind {
r.to_f64()
} else {
None
}
} else {
None
};
let Some(direct_val) = direct_real_val else {
continue;
};
if (real_val - direct_val).abs() > f64::EPSILON {
continue; // Different real value
}
// Same real value! Check if chain_result == direct_result is asserted
// Use BFS to find transitive equality through any number of hops
let are_transitively_equal = Self::are_terms_equal_transitively(
chain_result,
direct_result,
&fp_equalities,
);
if are_transitively_equal {
// chain_result (lossy) == direct_result (lossless) is impossible!
return true;
}
}
}
}
false
}
/// Check if a source term went through a smaller FP format
fn source_went_through_smaller_format_check(
&self,
source: TermId,
target_eb: u32,
target_sb: u32,
manager: &TermManager,
equalities: &[(TermId, TermId)],
) -> bool {
if let Some(term_data) = manager.get(source) {
if let TermKind::FpToFp { eb, sb, .. } = &term_data.kind {
return *eb < target_eb || *sb < target_sb;
}
}
// Check via equality constraints
for &(eq_lhs, eq_rhs) in equalities {
let to_check = if eq_lhs == source {
eq_rhs
} else if eq_rhs == source {
eq_lhs
} else {
continue;
};
if let Some(term_data) = manager.get(to_check) {
if let TermKind::FpToFp { eb, sb, .. } = &term_data.kind {
return *eb < target_eb || *sb < target_sb;
}
}
}
false
}
/// Check if term is directly converted from a real value
fn is_direct_from_real_value(
&self,
term: TermId,
manager: &TermManager,
equalities: &[(TermId, TermId)],
) -> bool {
if let Some(term_data) = manager.get(term) {
if matches!(term_data.kind, TermKind::RealToFp { .. }) {
return true;
}
}
for &(eq_lhs, eq_rhs) in equalities {
let to_check = if eq_lhs == term {
eq_rhs
} else if eq_rhs == term {
eq_lhs
} else {
continue;
};
if let Some(term_data) = manager.get(to_check) {
if matches!(term_data.kind, TermKind::RealToFp { .. }) {
return true;
}
}
}
false
}
/// Check if converting a value would lose precision in float32
fn value_loses_precision_check(
&self,
term: TermId,
manager: &TermManager,
equalities: &[(TermId, TermId)],
real_to_fp: &[(TermId, u32, u32, TermId)],
) -> bool {
// Get the original real value
if let Some(val) =
self.get_original_real_value_from_term(term, manager, equalities, real_to_fp)
{
// Convert to f32 and back to see if precision is lost
let as_f32 = val as f32;
let back_to_f64 = as_f32 as f64;
if (val - back_to_f64).abs() > f64::EPSILON {
return true;
}
}
false
}
/// Get the original real value from a term
fn get_original_real_value_from_term(
&self,
term: TermId,
manager: &TermManager,
equalities: &[(TermId, TermId)],
real_to_fp: &[(TermId, u32, u32, TermId)],
) -> Option<f64> {
// Check direct RealToFp
if let Some(term_data) = manager.get(term) {
if let TermKind::RealToFp { arg, .. } = &term_data.kind {
if let Some(arg_data) = manager.get(*arg) {
if let TermKind::RealConst(r) = &arg_data.kind {
return r.to_f64();
}
}
}
}
// Check via equalities
for &(eq_lhs, eq_rhs) in equalities {
let to_check = if eq_lhs == term {
eq_rhs
} else if eq_rhs == term {
eq_lhs
} else {
continue;
};
if let Some(term_data) = manager.get(to_check) {
if let TermKind::RealToFp { arg, .. } = &term_data.kind {
if let Some(arg_data) = manager.get(*arg) {
if let TermKind::RealConst(r) = &arg_data.kind {
return r.to_f64();
}
}
}
}
}
// Check via real_to_fp tracking
for &(real_arg, _, _, result) in real_to_fp {
if result == term {
if let Some(arg_data) = manager.get(real_arg) {
if let TermKind::RealConst(r) = &arg_data.kind {
return r.to_f64();
}
}
}
}
None
}
/// Find the conversion source for an FP term
/// Returns (original_value, went_through_smaller_precision)
fn find_fp_conversion_source(
&self,
term: TermId,
manager: &TermManager,
equalities: &[(TermId, TermId)],
fp_conversions: &[(TermId, u32, u32, TermId)],
real_to_fp_conversions: &[(TermId, u32, u32, TermId)],
) -> Option<(f64, bool)> {
// Helper to check if two terms match directly or via equalities
let terms_match = |a: TermId, b: TermId| -> bool {
a == b
|| equalities
.iter()
.any(|&(l, r)| (l == a && r == b) || (l == b && r == a))
};
// Helper to get RealConst value from a term
let get_real_value = |t: TermId| -> Option<f64> {
if let Some(data) = manager.get(t) {
if let TermKind::RealConst(r) = &data.kind {
return r.to_f64();
}
}
None
};
// Check if term is in real_to_fp_conversions (eb=11, sb=53 for float64)
for &(real_arg, eb, sb, result) in real_to_fp_conversions {
if terms_match(result, term) && eb == 11 && sb == 53 {
// Check if real_arg is a RealConst (direct conversion from real)
if let Some(val) = get_real_value(real_arg) {
return Some((val, false)); // Direct conversion, no precision loss path
}
// Check if real_arg is a variable that came from a smaller format conversion
// This handles: x64_1 = to_fp(11, 53)(x32) where real_arg = x32
// and x32 = to_fp(8, 24)(real_value)
for &(inner_arg, inner_eb, inner_sb, inner_result) in real_to_fp_conversions {
if terms_match(inner_result, real_arg) && inner_eb < eb && inner_sb < sb {
// real_arg came from a smaller precision conversion
if let Some(val) = get_real_value(inner_arg) {
return Some((val, true)); // Went through smaller precision
}
}
}
}
}
// Check if term is in fp_conversions (FpToFp from a smaller format)
for &(fp_src, eb, sb, result) in fp_conversions {
if terms_match(result, term) && eb == 11 && sb == 53 {
// This is a conversion to float64 from another FP format
// Check if fp_src came from a smaller format RealToFp
for &(real_arg, src_eb, src_sb, src_result) in real_to_fp_conversions {
if terms_match(fp_src, src_result) && src_eb < 11 && src_sb < 53 {
// fp_src came from a smaller precision RealToFp
if let Some(val) = get_real_value(real_arg) {
return Some((val, true)); // Went through smaller precision
}
}
}
}
}
// Also check via equalities - term might be equal to a conversion result
for &(eq_lhs, eq_rhs) in equalities {
let other = if eq_lhs == term {
eq_rhs
} else if eq_rhs == term {
eq_lhs
} else {
continue;
};
// Check if other is in real_to_fp_conversions (float64)
for &(real_arg, eb, sb, result) in real_to_fp_conversions {
if result == other && eb == 11 && sb == 53 {
if let Some(val) = get_real_value(real_arg) {
return Some((val, false));
}
// Check chain through smaller format
for &(inner_arg, inner_eb, inner_sb, inner_result) in real_to_fp_conversions {
if terms_match(inner_result, real_arg) && inner_eb < eb && inner_sb < sb {
if let Some(val) = get_real_value(inner_arg) {
return Some((val, true));
}
}
}
}
}
// Check if other is in fp_conversions (FpToFp to float64)
for &(fp_src, eb, sb, result) in fp_conversions {
if result == other && eb == 11 && sb == 53 {
for &(real_arg, src_eb, src_sb, src_result) in real_to_fp_conversions {
if terms_match(fp_src, src_result) && src_eb < 11 && src_sb < 53 {
if let Some(val) = get_real_value(real_arg) {
return Some((val, true));
}
}
}
}
}
}
None
}
/// Collect FP constraints from a term (extended version with additional tracking)
#[allow(clippy::too_many_arguments)]
fn collect_fp_constraints_extended(
&self,
term: TermId,
manager: &TermManager,
fp_additions: &mut Vec<(TermId, TermId, TermId, TermId, RoundingMode)>,
fp_divisions: &mut Vec<(TermId, TermId, TermId, TermId, RoundingMode)>,
fp_multiplications: &mut Vec<(TermId, TermId, TermId, TermId, RoundingMode)>,
fp_comparisons: &mut Vec<(TermId, TermId, bool)>,
fp_equalities: &mut Vec<(TermId, TermId)>,
fp_literals: &mut FxHashMap<TermId, f64>,
rounding_add_results: &mut FxHashMap<(TermId, TermId, RoundingMode), TermId>,
fp_is_zero: &mut FxHashSet<TermId>,
fp_is_positive: &mut FxHashSet<TermId>,
fp_is_negative: &mut FxHashSet<TermId>,
fp_not_nan: &mut FxHashSet<TermId>,
fp_gt_comparisons: &mut Vec<(TermId, TermId)>,
fp_lt_comparisons: &mut Vec<(TermId, TermId)>,
fp_conversions: &mut Vec<(TermId, u32, u32, TermId)>,
real_to_fp_conversions: &mut Vec<(TermId, u32, u32, TermId)>,
fp_subtractions: &mut Vec<(TermId, TermId, TermId)>,
in_positive_context: bool,
) {
let Some(term_data) = manager.get(term) else {
return;
};
match &term_data.kind {
// FP predicates
TermKind::FpIsZero(arg) => {
if in_positive_context {
fp_is_zero.insert(*arg);
}
self.collect_fp_constraints_extended_recurse(
*arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
TermKind::FpIsPositive(arg) => {
if in_positive_context {
fp_is_positive.insert(*arg);
}
self.collect_fp_constraints_extended_recurse(
*arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
TermKind::FpIsNegative(arg) => {
if in_positive_context {
fp_is_negative.insert(*arg);
}
self.collect_fp_constraints_extended_recurse(
*arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
TermKind::FpIsNaN(arg) => {
// If in negative context (under a Not), this means not(isNaN(arg))
if !in_positive_context {
fp_not_nan.insert(*arg);
}
self.collect_fp_constraints_extended_recurse(
*arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
// FP comparisons
TermKind::FpLt(a, b) => {
if in_positive_context {
fp_comparisons.push((*a, *b, true));
fp_lt_comparisons.push((*a, *b));
}
self.collect_fp_constraints_extended_recurse(
*a,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
self.collect_fp_constraints_extended_recurse(
*b,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
TermKind::FpGt(a, b) => {
if in_positive_context {
fp_comparisons.push((*b, *a, true)); // a > b means b < a
fp_gt_comparisons.push((*a, *b)); // Track original direction: a > b
}
self.collect_fp_constraints_extended_recurse(
*a,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
self.collect_fp_constraints_extended_recurse(
*b,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
// Equality
TermKind::Eq(lhs, rhs) => {
fp_equalities.push((*lhs, *rhs));
// Check for FP literal assignment
if let Some(val) = self.get_fp_literal_value_from_eq(*rhs, manager, fp_equalities) {
fp_literals.insert(*lhs, val);
} else if let Some(val) =
self.get_fp_literal_value_from_eq(*lhs, manager, fp_equalities)
{
fp_literals.insert(*rhs, val);
}
// Check for FP operation results
if let Some(rhs_data) = manager.get(*rhs) {
match &rhs_data.kind {
TermKind::FpAdd(rm, x, y) => {
fp_additions.push((*lhs, *x, *y, *lhs, *rm));
rounding_add_results.insert((*x, *y, *rm), *lhs);
}
TermKind::FpDiv(rm, x, y) => {
fp_divisions.push((*lhs, *x, *y, *lhs, *rm));
}
TermKind::FpMul(rm, x, y) => {
fp_multiplications.push((*lhs, *x, *y, *lhs, *rm));
}
TermKind::FpSub(_, x, y) => {
// Track: (lhs_operand, rhs_operand, result)
fp_subtractions.push((*x, *y, *lhs));
}
TermKind::FpToFp { arg, eb, sb, .. } => {
fp_conversions.push((*arg, *eb, *sb, *lhs));
}
TermKind::RealToFp { arg, eb, sb, .. } => {
real_to_fp_conversions.push((*arg, *eb, *sb, *lhs));
}
_ => {}
}
}
if let Some(lhs_data) = manager.get(*lhs) {
match &lhs_data.kind {
TermKind::FpAdd(rm, x, y) => {
fp_additions.push((*rhs, *x, *y, *rhs, *rm));
rounding_add_results.insert((*x, *y, *rm), *rhs);
}
TermKind::FpDiv(rm, x, y) => {
fp_divisions.push((*rhs, *x, *y, *rhs, *rm));
}
TermKind::FpMul(rm, x, y) => {
fp_multiplications.push((*rhs, *x, *y, *rhs, *rm));
}
TermKind::FpSub(_, x, y) => {
fp_subtractions.push((*x, *y, *rhs));
}
TermKind::FpToFp { arg, eb, sb, .. } => {
fp_conversions.push((*arg, *eb, *sb, *rhs));
}
TermKind::RealToFp { arg, eb, sb, .. } => {
real_to_fp_conversions.push((*arg, *eb, *sb, *rhs));
}
_ => {}
}
}
self.collect_fp_constraints_extended_recurse(
*lhs,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
self.collect_fp_constraints_extended_recurse(
*rhs,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
// FP conversions (standalone, not in equality)
TermKind::FpToFp { arg, eb, sb, .. } => {
fp_conversions.push((*arg, *eb, *sb, term));
self.collect_fp_constraints_extended_recurse(
*arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
TermKind::RealToFp { arg, eb, sb, .. } => {
real_to_fp_conversions.push((*arg, *eb, *sb, term));
// Also extract literal value
if let Some(arg_data) = manager.get(*arg) {
if let TermKind::RealConst(r) = &arg_data.kind {
if let Some(val) = r.to_f64() {
fp_literals.insert(term, val);
}
}
}
}
// Compound terms
TermKind::And(args) => {
for &arg in args {
self.collect_fp_constraints_extended(
arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
}
TermKind::Or(args) => {
// Don't collect predicates from OR branches as they are disjunctions
for &arg in args {
self.collect_fp_constraints_extended_recurse(
arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
}
TermKind::Not(inner) => {
// Flip context when entering Not
self.collect_fp_constraints_extended(
*inner,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
!in_positive_context,
);
}
_ => {}
}
}
/// Helper to recurse without collecting predicates (for subterms)
#[allow(clippy::too_many_arguments)]
fn collect_fp_constraints_extended_recurse(
&self,
term: TermId,
manager: &TermManager,
fp_additions: &mut Vec<(TermId, TermId, TermId, TermId, RoundingMode)>,
fp_divisions: &mut Vec<(TermId, TermId, TermId, TermId, RoundingMode)>,
fp_multiplications: &mut Vec<(TermId, TermId, TermId, TermId, RoundingMode)>,
fp_comparisons: &mut Vec<(TermId, TermId, bool)>,
fp_equalities: &mut Vec<(TermId, TermId)>,
fp_literals: &mut FxHashMap<TermId, f64>,
rounding_add_results: &mut FxHashMap<(TermId, TermId, RoundingMode), TermId>,
fp_is_zero: &mut FxHashSet<TermId>,
fp_is_positive: &mut FxHashSet<TermId>,
fp_is_negative: &mut FxHashSet<TermId>,
fp_not_nan: &mut FxHashSet<TermId>,
fp_gt_comparisons: &mut Vec<(TermId, TermId)>,
fp_lt_comparisons: &mut Vec<(TermId, TermId)>,
fp_conversions: &mut Vec<(TermId, u32, u32, TermId)>,
real_to_fp_conversions: &mut Vec<(TermId, u32, u32, TermId)>,
fp_subtractions: &mut Vec<(TermId, TermId, TermId)>,
in_positive_context: bool,
) {
let Some(term_data) = manager.get(term) else {
return;
};
// Only recurse into compound terms or collect conversion info
match &term_data.kind {
TermKind::FpToFp { arg, eb, sb, .. } => {
fp_conversions.push((*arg, *eb, *sb, term));
self.collect_fp_constraints_extended_recurse(
*arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
TermKind::RealToFp { arg, eb, sb, .. } => {
real_to_fp_conversions.push((*arg, *eb, *sb, term));
if let Some(arg_data) = manager.get(*arg) {
if let TermKind::RealConst(r) = &arg_data.kind {
if let Some(val) = r.to_f64() {
fp_literals.insert(term, val);
}
}
}
}
TermKind::And(args) | TermKind::Or(args) => {
for &arg in args {
self.collect_fp_constraints_extended_recurse(
arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
}
// Handle Apply terms that are to_fp conversions from parser
TermKind::Apply { func, args } => {
let func_name = manager.resolve_str(*func);
// Check for indexed to_fp like "(_ to_fp 8 24)"
if func_name.starts_with("(_ to_fp ") || func_name.starts_with("(_to_fp ") {
// Parse eb and sb from the function name: "(_ to_fp eb sb)"
if let Some((eb, sb)) = Self::parse_to_fp_indices(func_name) {
if args.len() >= 2 {
// Format: ((_ to_fp eb sb) rm arg)
// args[0] is rounding mode, args[1] is the value/term to convert
let arg = args[1];
// Determine if this is RealToFp or FpToFp by checking arg's sort/type
if let Some(arg_data) = manager.get(arg) {
let is_real_arg = matches!(
arg_data.kind,
TermKind::RealConst(_) | TermKind::IntConst(_)
);
if is_real_arg {
// RealToFp conversion
real_to_fp_conversions.push((arg, eb, sb, term));
// Also extract literal value
if let TermKind::RealConst(r) = &arg_data.kind {
if let Some(val) = r.to_f64() {
fp_literals.insert(term, val);
}
} else if let TermKind::IntConst(n) = &arg_data.kind {
if let Some(val) = n.to_i64() {
fp_literals.insert(term, val as f64);
}
}
} else {
// FpToFp conversion (arg is a FP variable/term)
fp_conversions.push((arg, eb, sb, term));
}
}
}
}
}
// Recurse into args
for &arg in args.iter() {
self.collect_fp_constraints_extended_recurse(
arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
fp_is_zero,
fp_is_positive,
fp_is_negative,
fp_not_nan,
fp_gt_comparisons,
fp_lt_comparisons,
fp_conversions,
real_to_fp_conversions,
fp_subtractions,
in_positive_context,
);
}
}
_ => {}
}
}
/// Parse to_fp indices from function name like "(_ to_fp 8 24)" -> (8, 24)
fn parse_to_fp_indices(func_name: &str) -> Option<(u32, u32)> {
// Handle format: "(_ to_fp eb sb)"
let trimmed = func_name
.trim_start_matches("(_ to_fp")
.trim_start_matches("(_to_fp")
.trim();
let trimmed = trimmed.trim_end_matches(')').trim();
let parts: Vec<&str> = trimmed.split_whitespace().collect();
if parts.len() >= 2 {
let eb = parts[0].parse().ok()?;
let sb = parts[1].parse().ok()?;
Some((eb, sb))
} else {
None
}
}
/// Check if two terms are transitively equal through equalities using BFS
fn are_terms_equal_transitively(
term1: TermId,
term2: TermId,
equalities: &[(TermId, TermId)],
) -> bool {
if term1 == term2 {
return true;
}
// BFS to find if term2 is reachable from term1 through equalities
let mut visited = FxHashSet::default();
let mut queue = crate::prelude::VecDeque::new();
queue.push_back(term1);
visited.insert(term1);
while let Some(current) = queue.pop_front() {
if current == term2 {
return true;
}
// Find all terms equal to current
for &(l, r) in equalities {
let neighbor = if l == current && !visited.contains(&r) {
Some(r)
} else if r == current && !visited.contains(&l) {
Some(l)
} else {
None
};
if let Some(n) = neighbor {
if n == term2 {
return true;
}
visited.insert(n);
queue.push_back(n);
}
}
}
false
}
/// Get FP literal value from a term (for use in collect_fp_constraints_extended)
fn get_fp_literal_value_from_eq(
&self,
term: TermId,
manager: &TermManager,
equalities: &[(TermId, TermId)],
) -> Option<f64> {
// Check direct RealToFp
if let Some(term_data) = manager.get(term) {
if let TermKind::RealToFp { arg, .. } = &term_data.kind {
if let Some(arg_data) = manager.get(*arg) {
if let TermKind::RealConst(r) = &arg_data.kind {
return r.to_f64();
}
}
}
if let TermKind::RealConst(r) = &term_data.kind {
return r.to_f64();
}
if let TermKind::IntConst(n) = &term_data.kind {
return n.to_i64().map(|v| v as f64);
}
}
// Check via equalities
for &(eq_lhs, eq_rhs) in equalities {
let to_check = if eq_lhs == term {
eq_rhs
} else if eq_rhs == term {
eq_lhs
} else {
continue;
};
if let Some(term_data) = manager.get(to_check) {
if let TermKind::RealToFp { arg, .. } = &term_data.kind {
if let Some(arg_data) = manager.get(*arg) {
if let TermKind::RealConst(r) = &arg_data.kind {
return r.to_f64();
}
}
}
}
}
None
}
/// Collect FP constraints from a term
#[allow(clippy::too_many_arguments)]
fn collect_fp_constraints(
&self,
term: TermId,
manager: &TermManager,
fp_additions: &mut Vec<(TermId, TermId, TermId, TermId, RoundingMode)>,
fp_divisions: &mut Vec<(TermId, TermId, TermId, TermId, RoundingMode)>,
fp_multiplications: &mut Vec<(TermId, TermId, TermId, TermId, RoundingMode)>,
fp_comparisons: &mut Vec<(TermId, TermId, bool)>,
fp_equalities: &mut Vec<(TermId, TermId)>,
fp_literals: &mut FxHashMap<TermId, f64>,
rounding_add_results: &mut FxHashMap<(TermId, TermId, RoundingMode), TermId>,
) {
let Some(term_data) = manager.get(term) else {
return;
};
match &term_data.kind {
TermKind::Eq(lhs, rhs) => {
fp_equalities.push((*lhs, *rhs));
// Check for FP literal assignment
if let Some(val) = self.get_fp_literal_value(*rhs, manager) {
fp_literals.insert(*lhs, val);
} else if let Some(val) = self.get_fp_literal_value(*lhs, manager) {
fp_literals.insert(*rhs, val);
}
// Check for FP operation results
if let Some(rhs_data) = manager.get(*rhs) {
match &rhs_data.kind {
TermKind::FpAdd(rm, x, y) => {
fp_additions.push((*lhs, *x, *y, *lhs, *rm));
rounding_add_results.insert((*x, *y, *rm), *lhs);
}
TermKind::FpDiv(rm, x, y) => {
fp_divisions.push((*lhs, *x, *y, *lhs, *rm));
}
TermKind::FpMul(rm, x, y) => {
fp_multiplications.push((*lhs, *x, *y, *lhs, *rm));
}
_ => {}
}
}
if let Some(lhs_data) = manager.get(*lhs) {
match &lhs_data.kind {
TermKind::FpAdd(rm, x, y) => {
fp_additions.push((*rhs, *x, *y, *rhs, *rm));
rounding_add_results.insert((*x, *y, *rm), *rhs);
}
TermKind::FpDiv(rm, x, y) => {
fp_divisions.push((*rhs, *x, *y, *rhs, *rm));
}
TermKind::FpMul(rm, x, y) => {
fp_multiplications.push((*rhs, *x, *y, *rhs, *rm));
}
_ => {}
}
}
self.collect_fp_constraints(
*lhs,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
);
self.collect_fp_constraints(
*rhs,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
);
}
TermKind::FpLt(a, b) => {
fp_comparisons.push((*a, *b, true));
}
TermKind::FpGt(a, b) => {
fp_comparisons.push((*b, *a, true)); // a > b means b < a
}
TermKind::And(args) => {
for &arg in args {
self.collect_fp_constraints(
arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
);
}
}
TermKind::Or(args) => {
for &arg in args {
self.collect_fp_constraints(
arg,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
);
}
}
TermKind::Not(inner) => {
self.collect_fp_constraints(
*inner,
manager,
fp_additions,
fp_divisions,
fp_multiplications,
fp_comparisons,
fp_equalities,
fp_literals,
rounding_add_results,
);
}
_ => {}
}
}
}