forked from alexander-nadel/intel_sat_solver
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTopiConflictAnalysis.cc
1372 lines (1172 loc) · 45.4 KB
/
TopiConflictAnalysis.cc
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
// Copyright(C) 2021-2022 Intel Corporation
// SPDX - License - Identifier: MIT
#include "Topi.hpp"
#include "SetInScope.h"
#include <fstream>
#include <numeric>
using namespace Topor;
using namespace std;
template <typename TLit, typename TUInd, bool Compress>
TUInd CTopi<TLit, TUInd, Compress>::AddClsToBufferAndWatch(const TSpanTULit cls, bool isLearnt)
{
if (isLearnt && IsCbLearntOrDrat())
{
NewLearntClsApplyCbLearntDrat(cls);
}
TUInd clsStart = BadClsInd;
if (cls.size() == 2)
{
if (m_ParamExistingBinWLStrat == 2 || !WLBinaryWatchExists(cls[0], cls[1]))
{
m_Stat.NewClause(cls.size(), isLearnt);
WLAddBinaryWatch(cls[0], cls[1]);
if (unlikely(IsUnrecoverable())) return clsStart;
WLAddBinaryWatch(cls[1], cls[0]);
if (unlikely(IsUnrecoverable())) return clsStart;
}
else
{
assert(WLBinaryWatchExists(cls[1], cls[0]));
if (m_ParamExistingBinWLStrat == 1)
{
UpdateScoreVar(GetVar(cls[0]), m_ParamBinWLScoreBoostFactor);
UpdateScoreVar(GetVar(cls[1]), m_ParamBinWLScoreBoostFactor);
}
}
}
else if (cls.size() > 2)
{
m_Stat.NewClause(cls.size(), isLearnt);
// Long clause
WLAddLongWatch(cls[0], cls[1]);
if (unlikely(IsUnrecoverable())) return clsStart;
WLAddLongWatch(cls[1], cls[0]);
if (unlikely(IsUnrecoverable())) return clsStart;
auto PointFromWatches = [&](TUInd clsInd)
{
const array<TUInd, 2> clsIndPtrs = { LastWLEntry(cls[0]), LastWLEntry(cls[1]) };
*((TUInd*)(m_W.get_ptr() + clsIndPtrs[0])) = *((TUInd*)(m_W.get_ptr() + clsIndPtrs[1])) = clsInd;
return clsInd;
};
if constexpr (!Compress)
{
const bool isOversized = isLearnt && cls.size() > ClsLearntMaxSizeWithGlue;
const TUInd newBNext = m_BNext + (TUInd)cls.size() + EClsLitsStartOffset(isLearnt, isOversized);
if (unlikely(newBNext < m_BNext))
{
SetStatus(TToporStatus::STATUS_INDEX_TOO_NARROW, "AddClsToBufferAndWatch: too many literals in all the clauses combined");
return clsStart;
}
if (unlikely(newBNext >= m_B.cap()))
{
m_B.reserve_atleast(newBNext);
if (unlikely(m_B.uninitialized_or_erroneous()))
{
SetStatus(TToporStatus::STATUS_ALLOC_FAILED, "AddClsToBufferAndWatch: couldn't reserve the buffer");
return clsStart;
}
}
// The clause will start at m_BNext; point to it correctly from both watches
clsStart = PointFromWatches(m_BNext);
// Order of setting the fields is important, since ClsSetSize depends on ClsSetSize and ClsSetGlue depends on both
EClsSetIsLearnt(m_BNext, isLearnt);
ClsSetSize(m_BNext, (TUV)cls.size());
if (isLearnt)
{
ClsSetGlue(m_BNext, GetGlueAndMarkCurrDecLevels(cls));
if (unlikely(m_BNext < m_FirstLearntClsInd))
{
m_FirstLearntClsInd = m_BNext;
}
if (m_ParamClsDelStrategy > 0)
{
ClsSetActivityAndSkipdelTo0(m_BNext);
}
}
// Copy the clause from the input span
memcpy(m_B.get_ptr(m_BNext + EClsLitsStartOffset(isLearnt, isOversized)), &cls[0], cls.size() * sizeof(cls[0]));
// Update m_BNext
m_BNext = newBNext;
}
else
{
clsStart = PointFromWatches(BCCompress(cls, isLearnt, isLearnt ? GetGlueAndMarkCurrDecLevels(cls) : 0));
}
}
return clsStart;
}
template <typename TLit, typename TUInd, bool Compress>
void CTopi<TLit, TUInd, Compress>::UpdateAllUipInfoAfterRestart()
{
if (m_ParamAllUipMode == 0 || m_Stat.m_Restarts <= m_ParamAllUipFirstRestart || (m_ParamAllUipLastRestart != numeric_limits<uint32_t>::max() && m_Stat.m_Restarts >= m_ParamAllUipLastRestart))
{
return;
}
const bool allUipFailed = m_AllUipAttemptedCurrRestart > 0 && (double)m_AllUipSucceededCurrRestart / (double)m_AllUipAttemptedCurrRestart < m_ParamAllUipFailureThr;
if (allUipFailed)
{
++m_AllUipGap;
}
else
{
m_AllUipGap = m_AllUipGap == 0 ? 0 : m_AllUipGap - 1;
}
m_AllUipSucceededCurrRestart = 0;
m_AllUipAttemptedCurrRestart = 0;
}
template <typename TLit, typename TUInd, bool Compress>
void CTopi<TLit, TUInd, Compress>::MinimizeClauseBin(CVector<TULit>& cls)
{
[[maybe_unused]] const auto clsSizeBefore = cls.size();
assert(NV(2) || P("Minimize-clause-binary start: " + SLits(cls.get_const_span()) + "\n"));
assert(m_RootedVars.empty());
CApplyFuncOnExitFromScope<> onExit([&]()
{
CleanRooted();
});
TWatchInfo& wi = m_Watches[cls[0]];
TSpanTULit binWatches = m_W.get_span_cap(wi.m_WBInd + wi.GetLongEntries(), wi.m_BinaryWatches);
bool someMarked = false;
for (TULit l : binWatches)
{
if (IsSatisfied(l))
{
someMarked = true;
MarkRooted(l);
}
}
if (someMarked)
{
cls.erase_if_may_reorder([&](TULit l)
{
return IsRooted(l);
}, 1);
}
assert(NV(2) || P("Minimize-clause-binary finish; " + (cls.size() == clsSizeBefore ? "couldn't minimize" : "minimized and saved " + to_string(clsSizeBefore - cls.size()) + " literals") + ": " + SLits(cls.get_const_span()) + "\n"));
}
template <typename TLit, typename TUInd, bool Compress>
bool CTopi<TLit, TUInd, Compress>::GenerateAllUipClause(CVector<TULit>& cls)
{
if (m_ParamAllUipMode == 0 || m_Stat.m_Restarts < m_ParamAllUipFirstRestart)
{
return false;
}
assert(m_RootedVars.empty());
const auto initGlue = GetGlueAndMarkCurrDecLevels(cls.get_const_span());
if (cls.size() <= m_AllUipGap + initGlue)
{
assert(NV(2) || P("GenerateAllUipClause early exit: cls.size() <= m_AllUipGap + initGlue (" + to_string(cls.size()) + " " + to_string(m_AllUipGap) + " " + to_string(initGlue) + ")\n"));
return false;
}
assert(NV(2) || P("GenerateAllUipClause attempt #" + to_string(m_Stat.m_AllUipAttempted + 1) + " started with the following clause " + SLits(cls.get_const_span()) + "\n"));
CVector<TULit> res;
bool cancelAllUipClauseGeneration = false;
for (auto l : cls.get_span())
{
MarkRooted(l);
}
CApplyFuncOnExitFromScope<> onExit([&]()
{
++m_Stat.m_AllUipAttempted;
++m_AllUipAttemptedCurrRestart;
if (!cancelAllUipClauseGeneration)
{
m_Stat.m_LitsRemovedByAllUip += cls.size() - res.size();
cls.clear();
cls.append(res.get_span());
++m_Stat.m_AllUipSucceeded;
++m_AllUipSucceededCurrRestart;
assert(NV(2) || P("GenerateAllUipClause succeeded, exiting; the new clause is: " + SLits(cls.get_const_span()) + "\n"));
}
else
{
assert(NV(2) || P("GenerateAllUipClause failed, exiting: " + SLits(cls.get_const_span()) + "\n"));
}
CleanRooted();
});
auto [initMarkedDecLevelsCounter, decLevels] = GetDecLevelsAndMarkInHugeCounter(cls);
if (unlikely(IsUnrecoverable())) return false;
auto UnvisitedNum = [&](TUV decLevel)
{
return m_HugeCounterPerDecLevel[decLevel] <= initMarkedDecLevelsCounter ? 0 : m_HugeCounterPerDecLevel[decLevel] - initMarkedDecLevelsCounter;
};
while (!decLevels.empty())
{
const TUV decLevel = decLevels.top();
decLevels.pop();
assert(UnvisitedNum(decLevel) >= 1);
assert(NV(2) || P("Decision level " + to_string(decLevel) + " : started with " + to_string(UnvisitedNum(decLevel)) + " unvisited variables\n"));
for (TUVar v = m_TrailLastVarPerDecLevel[decLevel]; UnvisitedNum(decLevel) > 0; v = m_VarInfo[v].m_TrailPrev)
{
if (IsRootedVar(v))
{
assert(NV(2) || P("New rooted variable " + SVar(v) + "\n"));
auto IsVPushedToRes = [&]()
{
return res.size() != 0 && GetVar(res.back()) == v;
};
auto PushVToRes = [&]()
{
const TULit l = Negate(GetAssignedLitForVar(v));
assert(NV(2) || P("Pushing the following literal to res " + SLit(l) + "\n"));
assert(find(res.get_span().begin(), res.get_span().end(), l) == res.get_span().end());
res.push_back(l);
};
auto CancelAllUipClauseGenerationIfRequired = [&]()
{
if (res.size() + decLevels.size() >= cls.size())
{
assert(NV(2) || P("Canceled AllUIP clause generation sue to exceeding size\n"));
cancelAllUipClauseGeneration = true;
return true;
}
return false;
};
assert(!IsVPushedToRes());
--m_HugeCounterPerDecLevel[decLevel];
if (decLevel == m_DecLevel || UnvisitedNum(decLevel) == 0)
{
// It's either the latest decision level, or
// We reached the UIP for a certain level (in which case the for loop will exit)
PushVToRes();
if (CancelAllUipClauseGenerationIfRequired())
{
return false;
}
continue;
}
const auto parentSpan = GetAssignedNonDecParentSpanVar(v);
assert(NV(2) || P("\tParent " + SLits((span<TULit>)parentSpan) + "\n"));
for (auto lParent : parentSpan)
{
if (IsRooted(lParent))
{
continue;
}
const TUV lParentDecLevel = GetAssignedDecLevel(lParent);
if (UnvisitedNum(lParentDecLevel) == 0)
{
// The parent contains an unvisited level --> v will be included in the final clause as we don't want to resolve it away
PushVToRes();
if (CancelAllUipClauseGenerationIfRequired())
{
return false;
}
break;
}
}
if (!IsVPushedToRes())
{
// Now we know that v can be resolved away without adding new levels
assert(NV(2) || P("\tNow we know that " + SVar(v) + " can be resolved away without adding new levels\n"));
for (auto lParent : parentSpan)
{
if (IsRooted(lParent))
{
continue;
}
MarkRooted(lParent);
const TUV lParentDecLevel = GetAssignedDecLevel(lParent);
++m_HugeCounterPerDecLevel[lParentDecLevel];
if (m_HugeCounterPerDecLevel[lParentDecLevel] > m_HugeCounterDecLevels)
{
m_HugeCounterDecLevels = m_HugeCounterPerDecLevel[lParentDecLevel];
}
}
}
}
}
}
return true;
}
template <typename TLit, typename TUInd, bool Compress>
void CTopi<TLit, TUInd, Compress>::MinimizeClauseMinisat(CVector<TULit>& cls)
{
[[maybe_unused]] const auto clsSizeBefore = cls.size();
assert(NV(2) || P("Minimize-clause-Minisat start: " + SLits(cls.get_const_span()) + "\n"));
assert(m_RootedVars.empty());
CApplyFuncOnExitFromScope<> onExit([&]()
{
CleanRooted();
});
if (unlikely(IsUnrecoverable())) return;
// After this function, all the decision levels in cls have m_DecLevelsLastAppearenceCounter[decLevel] == m_CurrDecLevelsCounter
GetGlueAndMarkCurrDecLevels(cls.get_const_span());
// All the variables in clause are the root
// The minimization algorithm in a nutshell: for every root literal, if we reach the roots only by parent chain visiting, the literal can be removed
m_RootedVars.reserve_exactly(cls.size());
if (unlikely(IsUnrecoverable())) return;
for (auto l : cls.get_span())
{
MarkRooted(l);
}
CVector<TUVar> toTestForRemoval;
cls.erase_if_may_reorder([&](TULit l)
{
if (unlikely(IsUnrecoverable())) return false;
toTestForRemoval.clear();
bool canBeRemoved = true;
assert(IsAssigned(l) && GetAssignedDecLevel(l) != 0);
if (IsAssignedDec(l))
{
// The current literal is a decision literal, so it must have a marked decision level, and we cannot remove it
canBeRemoved = false;
assert(IsAssignedMarkedDecLevel(l));
}
else
{
auto ProcessParentDecideIfRemovalStillPossible = [&](TUVar currVar, const span<TULit> parent)
{
for (TULit parentLit : parent)
{
if (GetVar(parentLit) == currVar)
{
continue;
}
if (!IsAssignedMarkedDecLevel(parentLit))
{
canBeRemoved = false;
break;
}
if (!IsRooted(parentLit))
{
if (IsAssignedDec(parentLit))
{
canBeRemoved = false;
break;
}
toTestForRemoval.push_back(GetVar(parentLit));
if (unlikely(IsUnrecoverable())) return;
}
}
};
ProcessParentDecideIfRemovalStillPossible(GetVar(l), GetAssignedNonDecParentSpan(l));
if (unlikely(IsUnrecoverable())) return false;
while (canBeRemoved && !toTestForRemoval.empty())
{
const TUVar currTestedVar = toTestForRemoval.back();
assert(!IsAssignedDecVar(currTestedVar));
assert(IsAssignedMarkedDecLevelVar(currTestedVar));
// We never add a rooted var to toTestForRemoval, but a tested variable may be marked as rooted after being successfully tested for removal
if (!IsRootedVar(currTestedVar))
{
size_t toTestBefore = toTestForRemoval.size();
ProcessParentDecideIfRemovalStillPossible(currTestedVar, GetAssignedNonDecParentSpanVar(currTestedVar));
if (unlikely(IsUnrecoverable())) return false;
if (canBeRemoved && toTestForRemoval.size() == toTestBefore)
{
MarkRootedVar(currTestedVar);
// This line is unnecessary for correctness, since the next iteration would've removed currTestedVar from toTestForRemoval anyway,
// since the variable is marked as rooted, but we save an iteration by doing it here
toTestForRemoval.pop_back();
}
}
else
{
toTestForRemoval.pop_back();
}
}
}
return canBeRemoved;
});
assert(NV(2) || P("Minimize-clause-Minisat finish; " + (cls.size() == clsSizeBefore ? "couldn't minimize" : "minimized and saved " + to_string(clsSizeBefore - cls.size()) + " literals") + ": " + SLits(cls.get_const_span()) + "\n"));
}
template <typename TLit, typename TUInd, bool Compress>
size_t CTopi<TLit, TUInd, Compress>::SizeWithoutDecLevel0(const span<TULit> cls) const
{
return accumulate(cls.begin(), cls.end(), (size_t)0, [&](size_t sum, TULit l)
{
return sum + (GetAssignedDecLevel(l) != 0);
});
}
template <typename TLit, typename TUInd, bool Compress>
pair<typename CTopi<TLit, TUInd, Compress>::TSpanTULit, TUInd> CTopi<TLit, TUInd, Compress>::LearnAndUpdateHeuristics(TContradictionInfo& contradictionInfo, CVector<TULit>& clsBeforeAllUipOrEmptyIfAllUipFailed)
{
clsBeforeAllUipOrEmptyIfAllUipFailed.clear();
++m_Stat.m_Conflicts;
++m_ConfsSinceRestart;
++m_ConfsSinceNewInv;
if (m_ParamVerbosity > 0 && m_Stat.m_Conflicts % (decltype(m_Stat.m_Conflicts))m_ParamStatPrintOutConfs == 0)
{
cout << m_Stat.StatStrShort();
}
// Giving an alias to m_VisitedLits to reflect the current usage for readability
CVector<TULit>& visitedNegLitsPrevDecLevels = m_HandyLitsClearBefore[0];
// Clear from any previous usage
visitedNegLitsPrevDecLevels.clear();
CApplyFuncOnExitFromScope<> onExit([&]()
{
CleanVisited();
});
assert(CiIsLegal(contradictionInfo));
auto contradictingCls = CiGetSpan(contradictionInfo);
assert(NV(2) || P("************************ Conflict #" + to_string(m_Stat.m_Conflicts) + "\n" + STrail() + "\n" + "Contradicting clause: " + SLits((span<TULit>)contradictingCls) + "\n"));
// The other case is taken care of by the CDCL-loop in Solve
assert(GetAssignedDecLevel(contradictingCls[0]) == GetAssignedDecLevel(contradictingCls[1]));
// Again, any backtracking is taken care of by the CDCL-loop in Solve
assert(GetAssignedDecLevel(contradictingCls[0]) == m_DecLevel);
TUV varsToVisitCurrDecLevel = 0;
auto VisitLit = [&](TULit l)
{
TUVar v = GetVar(l);
const TUV decLevel = GetAssignedDecLevel(l);
if (!m_AssignmentInfo[v].m_Visit && decLevel != 0)
{
MarkVisitedVar(v);
if (decLevel == m_DecLevel)
{
++varsToVisitCurrDecLevel;
}
else
{
visitedNegLitsPrevDecLevels.push_back(IsSatisfied(l) ? Negate(l) : l);
}
UpdateScoreVar(v, m_ParamVarActivityUseMapleLevelBreaker ? 0.5 : 1.0);
}
};
auto VisitCls = [&](const span<TULit> cls, TUInd longClsInd, bool updateClsCounter)
{
if (updateClsCounter)
{
++m_CurrClsCounter;
if (unlikely(m_CurrClsCounter < 0))
{
m_CurrClsCounters.memset(0);
m_CurrClsCounter = 1;
}
}
for (TULit l : cls)
{
VisitLit(l);
if (updateClsCounter)
{
m_CurrClsCounters[GetVar(l)] = m_CurrClsCounter;
}
}
if (longClsInd != BadClsInd && ClsGetIsLearnt(longClsInd))
{
const TUV newGlue = GetGlueAndMarkCurrDecLevels(cls);
const TUV oldGlue = ClsGetGlue(longClsInd);
if (newGlue < oldGlue)
{
ClsSetGlue(longClsInd, newGlue);
}
ClsDelNewLearntOrGlueUpdate(longClsInd, oldGlue);
}
};
VisitCls(contradictingCls, contradictionInfo.m_IsContradictionInBinaryCls ? BadClsInd : contradictionInfo.m_ParentClsInd, false);
bool contradictingIsLearnt = IsOnTheFlySubsumptionContradictingOn();
// Used to maintain all the heuristics working if the contradicting clause manages to stay the 1UIP
TUVar trailEndBeforeOnTheFlySubsumption = m_TrailEnd;
m_VarsParentSubsumed.clear();
TUVar v = m_TrailEnd;
const TUV vDecLevel = GetAssignedDecLevelVar(v);
const TUVar vDecVar = GetDecVar(vDecLevel);
const bool isAssumpLevel = IsAssumpVar(vDecVar);
for (; varsToVisitCurrDecLevel != 1 || (isAssumpLevel && !(IsSatisfiedAssump(v) && m_AssignmentInfo[v].m_Visit)); v = m_VarInfo[v].m_TrailPrev)
{
auto& ai = m_AssignmentInfo[v];
auto& vi = m_VarInfo[v];
if (ai.m_Visit)
{
--varsToVisitCurrDecLevel;
assert(ai.m_IsAssigned);
if (ai.IsAssignedBinary() || vi.m_ParentClsInd != BadClsInd)
{
auto ContradictingTrinary2BinaryByResolvingCurrVar = [&]()
{
const TULit l1 = contradictingCls[GetVar(contradictingCls[0]) == v ? 1 : 0];
const TULit l2 = contradictingCls[GetVar(contradictingCls[2]) == v ? 1 : 2];
DeleteCls(contradictionInfo.m_ParentClsInd);
contradictionInfo.m_IsContradictionInBinaryCls = true;
contradictionInfo.m_BinClause = { l1, l2 };
AddClsToBufferAndWatch(contradictionInfo.m_BinClause, true);
};
auto Contradicting2BinaryByRemovingLevel0 = [&]()
{
size_t currGoodLitInd = 0;
for (TULit l : contradictingCls)
{
if (GetAssignedDecLevel(l) != 0)
{
contradictionInfo.m_BinClause[currGoodLitInd++] = l;
}
}
assert(currGoodLitInd == 2);
contradictionInfo.m_IsContradictionInBinaryCls = true;
AddClsToBufferAndWatch(contradictionInfo.m_BinClause, true);
};
// If the clause is binary, the parent will contain only the other literal (without l), but we don't need l anyway
// If the clause isn't binary, the parent will be complete, which is fine too
auto parent = GetAssignedNonDecParentSpanVI(ai, vi);
const auto psNo0 = parent.size() == 1 ? 2 : SizeWithoutDecLevel0(parent);
assert(NV(2) || P("Visited var: " + SVar(v) + "; Visited clause: " + SLits((span<TULit>)parent) + "\n"));
const auto visitedBefore = m_VisitedVars.size();
VisitCls(parent, ai.IsAssignedBinary() ? BadClsInd : vi.m_ParentClsInd,
IsOnTheFlySubsumptionParentOn() && psNo0 > 2 && (IsParentLongInitial(ai, vi) || psNo0 < m_ParamOnTheFlySubsumptionParentMinGlueToDisable));
if (contradictingIsLearnt)
{
if (GetVar(m_FlippedLit) == v)
{
assert(NV(2) || P("Visited flipped var while still minimizing the contradicting clause, hence disable flipped recording for this conflict; var = " + SVar(v) + "\n"));
m_FlippedLit = BadULit;
}
const auto csNo0 = SizeWithoutDecLevel0(contradictingCls);
if (m_VisitedVars.size() == visitedBefore &&
((!contradictionInfo.m_IsContradictionInBinaryCls && !ClsGetIsLearnt(contradictionInfo.m_ParentClsInd)) ||
csNo0 < (size_t)m_ParamOnTheFlySubsumptionContradictingMinGlueToDisable))
{
// The contradicting clause can be subsumed!
// Is the parent clause subsumed by the contradicting clause too?
const bool parentSubsumedByContradicting = psNo0 == csNo0;
bool longInitParentSubsumedByLearntContradicting = parentSubsumedByContradicting && psNo0 > 2 &&
!ClsGetIsLearnt(vi.m_ParentClsInd) && ClsGetIsLearnt(contradictionInfo.m_ParentClsInd);
if (contradictingCls.size() == 2)
{
// A binary clause --> it can be deleted
assert(contradictionInfo.m_IsContradictionInBinaryCls);
// We have a new unit clause, which will serve as the learnt clause
assert(varsToVisitCurrDecLevel == 1);
DeleteBinaryCls(contradictingCls);
contradictingCls = span(&contradictionInfo.m_BinClause[v == GetVar(contradictionInfo.m_BinClause[0]) ? 1 : 0], 1);
if (IsCbLearntOrDrat())
{
NewLearntClsApplyCbLearntDrat(contradictingCls);
}
}
else
{
// A trinary clause, which will now convert into a binary one
if (contradictingCls.size() == 3)
{
ContradictingTrinary2BinaryByResolvingCurrVar();
longInitParentSubsumedByLearntContradicting = false;
}
else
{
assert(contradictingCls.size() > 3);
DeleteLitFromCls(contradictionInfo.m_ParentClsInd, Negate(GetAssignedLitForVar(v)));
}
contradictingCls = CiGetSpan(contradictionInfo);
}
m_Stat.m_LitsRemovedByConfSubsumption++;
assert(NV(2) || P("Contradicting clause after reduction: " + SLits((span<TULit>)contradictingCls) + "\n"));
if (parentSubsumedByContradicting)
{
assert(NV(2) || P("Parent clause deleted, since subsumed by contradicting!\n"));
if (parent.size() == 1)
{
assert(ai.m_IsAssignedInBinary);
array<TULit, 2> binCls = { vi.m_BinOtherLit, GetAssignedLitForVar(v) };
DeleteBinaryCls(binCls);
m_Stat.m_LitsRemovedByConfSubsumption += 2;
}
else
{
if (longInitParentSubsumedByLearntContradicting)
{
assert(NV(2) || P("Parent and contradicting swapped, being a long-initial and learnt, respectively!\n"));
m_Stat.m_LitsRemovedByConfSubsumption++;
if (ClsGetSize(vi.m_ParentClsInd) == 3)
{
Contradicting2BinaryByRemovingLevel0();
}
else
{
DeleteLitFromCls(vi.m_ParentClsInd, GetAssignedLitForVar(v));
swap(vi.m_ParentClsInd, contradictionInfo.m_ParentClsInd);
}
contradictingCls = CiGetSpan(contradictionInfo);
}
m_Stat.m_LitsRemovedByConfSubsumption += ClsGetSize(vi.m_ParentClsInd);
DeleteCls(vi.m_ParentClsInd);
}
}
while (m_TrailEnd != v)
{
UnassignVar(m_TrailEnd);
}
UnassignVar(m_TrailEnd);
while (!IsVisitedVar(m_TrailEnd))
{
UnassignVar(m_TrailEnd);
}
if (m_CurrCustomBtStrat > 0)
{
m_BestScorePerDecLevel[GetAssignedDecLevelVar(m_TrailEnd)] = CalcMaxDecLevelScore(GetAssignedDecLevelVar(m_TrailEnd));
}
}
else
{
contradictingIsLearnt = false;
}
}
else if (IsOnTheFlySubsumptionParentOn() && psNo0 > 2 && (IsParentLongInitial(ai, vi) || psNo0 < m_ParamOnTheFlySubsumptionParentMinGlueToDisable))
{
bool parentSubsumedByCurrResolvent = visitedNegLitsPrevDecLevels.size() + varsToVisitCurrDecLevel + 1 <= psNo0;
if (!parentSubsumedByCurrResolvent)
{
continue;
}
const auto visitedNegLitsPrevDecLevelsSpan = visitedNegLitsPrevDecLevels.get_const_span();
for (TULit l : visitedNegLitsPrevDecLevelsSpan)
{
const TUVar vL = GetVar(l);
if (m_CurrClsCounters[vL] != m_CurrClsCounter)
{
parentSubsumedByCurrResolvent = false;
break;
}
}
if (!parentSubsumedByCurrResolvent)
{
continue;
}
TUV varsVisitedNum = 0;
for (TUVar u = m_VarInfo[v].m_TrailPrev; varsVisitedNum < varsToVisitCurrDecLevel; u = m_VarInfo[u].m_TrailPrev)
{
if (IsVisitedVar(u))
{
if (m_CurrClsCounters[u] != m_CurrClsCounter)
{
parentSubsumedByCurrResolvent = false;
break;
}
++varsVisitedNum;
}
}
if (!parentSubsumedByCurrResolvent)
{
continue;
}
if (parentSubsumedByCurrResolvent)
{
m_VarsParentSubsumed.push_back(v);
if (unlikely(IsUnrecoverable())) return make_pair(visitedNegLitsPrevDecLevels.get_span(), BadClsInd);
assert(NV(2) || P("On-the-fly subsumption will remove the pivot " + SVar(v) + " from this parent\n"));
}
}
}
}
}
if (m_ParamMinimizeClausesMinisat && visitedNegLitsPrevDecLevels.size() > 1)
{
MinimizeClauseMinisat(visitedNegLitsPrevDecLevels);
if (unlikely(IsUnrecoverable())) return make_pair(visitedNegLitsPrevDecLevels.get_span(), BadClsInd);
}
// Find the first UIP
while (!m_AssignmentInfo[v].m_Visit)
{
v = m_VarInfo[v].m_TrailPrev;
}
const TULit firstUIPNegated = Negate(GetAssignedLitForVar(v));
if (m_ParamAllUipMode == 1 || m_ParamAllUipMode == 3)
{
clsBeforeAllUipOrEmptyIfAllUipFailed = visitedNegLitsPrevDecLevels;
bool allUipGenerated = GenerateAllUipClause(visitedNegLitsPrevDecLevels);
if (!allUipGenerated)
{
clsBeforeAllUipOrEmptyIfAllUipFailed.clear();
}
else
{
clsBeforeAllUipOrEmptyIfAllUipFailed.push_back(firstUIPNegated);
}
if (clsBeforeAllUipOrEmptyIfAllUipFailed.uninitialized_or_erroneous())
{
SetStatus(TToporStatus::STATUS_ALLOC_FAILED, "clsBeforeAllUipOrEmptyIfAllUipFailed allocation failure");
}
if (unlikely(IsUnrecoverable())) return make_pair(visitedNegLitsPrevDecLevels.get_span(), BadClsInd);
}
// Forming the 1UIP conflict clause, ensuring that literal 0 has the highest decision level, while literal 1 is the second highest
visitedNegLitsPrevDecLevels.push_back(firstUIPNegated);
swap(visitedNegLitsPrevDecLevels[0], visitedNegLitsPrevDecLevels.back());
if (visitedNegLitsPrevDecLevels.size() <= m_ParamMinimizeClausesBinMaxSize && GetGlueAndMarkCurrDecLevels(visitedNegLitsPrevDecLevels.get_const_span()) <= m_ParamMinimizeClausesBinMaxLbd)
{
MinimizeClauseBin(visitedNegLitsPrevDecLevels);
}
if (unlikely(IsUnrecoverable())) return make_pair(visitedNegLitsPrevDecLevels.get_span(), BadClsInd);
if (visitedNegLitsPrevDecLevels.size() > 2)
{
auto highestDecLevelLitIt = GetAssignedLitsHighestDecLevelIt(visitedNegLitsPrevDecLevels.get_span(), 1);
if (*highestDecLevelLitIt != visitedNegLitsPrevDecLevels[1])
{
swap(*highestDecLevelLitIt, visitedNegLitsPrevDecLevels[1]);
}
}
assert(NV(1) || P("New-clause at level " + to_string(m_DecLevel) + " : " + SLits(visitedNegLitsPrevDecLevels.get_const_span()) + "\n"));
bool addInitCls = false;
TUInd clsStart = BadClsInd;
if (contradictingIsLearnt)
{
assert(NV(2) || P("The contradicting clause was reduced all the way to 1UIP\n"));
// The contradicting clause was reduced all the way to 1UIP
// Disabling flipped clause recording
m_FlippedLit = BadULit;
if (!contradictionInfo.m_IsContradictionInBinaryCls)
{
// Is clause initial
addInitCls = !ClsGetIsLearnt(contradictionInfo.m_ParentClsInd);
}
if (contradictingCls.size() > visitedNegLitsPrevDecLevels.size())
{
assert(NV(2) || P("The contradicting clause was reduced further by minimization and/or binary-resolution\n"));
if (contradictionInfo.m_IsContradictionInBinaryCls)
{
m_Stat.m_LitsRemovedByConfSubsumption += 2;
DeleteBinaryCls(contradictingCls);
}
else
{
m_Stat.m_LitsRemovedByConfSubsumption += ClsGetSize(contradictionInfo.m_ParentClsInd);
DeleteCls(contradictionInfo.m_ParentClsInd);
}
contradictingIsLearnt = false;
}
else
{
assert(NV(2) || P("The contradicting clause will serve as the asserting clause, no need to record a new one!\n"));
if (!contradictionInfo.m_IsContradictionInBinaryCls)
{
clsStart = contradictionInfo.m_ParentClsInd;
}
}
}
if (!contradictingIsLearnt)
{
clsStart = AddClsToBufferAndWatch(visitedNegLitsPrevDecLevels, !addInitCls);
}
assert(m_ParamAssertConsistency < 2 || m_Stat.m_Conflicts < (uint64_t)m_ParamAssertConsistencyStartConf || WLAssertConsistency(false));
if (m_ParamVarActivityUseMapleLevelBreaker)
{
const TUV secondHighestDecLevel = visitedNegLitsPrevDecLevels.size() <= 1 ? 0 : min(GetAssignedDecLevel(visitedNegLitsPrevDecLevels[0]), GetAssignedDecLevel(visitedNegLitsPrevDecLevels[1]));
TUV decLevelMinToUpdate = secondHighestDecLevel - m_ParamVarActivityMapleLevelBreakerDecrease;
if (unlikely(decLevelMinToUpdate > secondHighestDecLevel))
{
decLevelMinToUpdate = 0;
}
for (TUVar vv : m_VisitedVars.get_span())
{
if (m_VarInfo[vv].m_DecLevel >= decLevelMinToUpdate)
{
UpdateScoreVar(vv, 1.0);
}
}
}
const bool updateGlue = visitedNegLitsPrevDecLevels.size() > 2 && !addInitCls;
const auto glue = updateGlue ? ClsGetGlue(clsStart) : 0;
assert(IsOnTheFlySubsumptionContradictingOn() || trailEndBeforeOnTheFlySubsumption == m_TrailEnd);
UpdateDecisionStrategyOnNewConflict(glue, GetVar(firstUIPNegated), trailEndBeforeOnTheFlySubsumption);
if (updateGlue)
{
ClsDelNewLearntOrGlueUpdate(clsStart, glue);
}
return make_pair(visitedNegLitsPrevDecLevels.get_span(), clsStart);
}
template <typename TLit, typename TUInd, bool Compress>
pair<typename CTopi<TLit, TUInd, Compress>::TSpanTULit, TUInd> CTopi<TLit, TUInd, Compress>::RecordFlipped(TContradictionInfo& contradictionInfo, typename CTopi<TLit, TUInd, Compress>::TSpanTULit mainClsBeforeAllUip)
{
// Giving an alias to m_VisitedLits to reflect the current usage for readability
CVector<TULit>& visitedNegLitsPrevFlippedLevels = m_HandyLitsClearBefore[1];
// Clear from any previous usage
visitedNegLitsPrevFlippedLevels.clear();
if (m_ParamFlippedRecordingMaxLbdToRecord == 0 || m_FlippedLit == BadULit || GetAssignedDecLevel(m_FlippedLit) != m_DecLevel)
{
visitedNegLitsPrevFlippedLevels.clear();
return make_pair(visitedNegLitsPrevFlippedLevels.get_span(), BadClsInd);
}
const TUVar flippedVar = GetVar(m_FlippedLit);
for (TUVar v = m_TrailEnd; v != flippedVar; v = m_VarInfo[v].m_TrailPrev)
{
assert(v != BadUVar);
MarkRootedVar(v);
}
MarkRootedVar(flippedVar);
CApplyFuncOnExitFromScope<> onExit([&]()
{
CleanVisited();
CleanRooted();
});
assert(NV(2) || contradictionInfo.m_IsContradictionInBinaryCls || P("Contradicting cls: " + SLits(Cls(contradictionInfo.m_ParentClsInd)) + "\n"));
assert(CiIsLegal(contradictionInfo));
auto contradictingCls = CiGetSpan(contradictionInfo);
assert(NV(2) || P("Will try to record a flipped clause\n"));
// The other case is taken care of by the CDCL-loop in Solve
assert(GetAssignedDecLevel(contradictingCls[0]) == GetAssignedDecLevel(contradictingCls[1]));
// Again, any backtracking is taken care of by the CDCL-loop in Solve
assert(GetAssignedDecLevel(contradictingCls[0]) == m_DecLevel);
TUV varsToVisitCurrFlippedLevel = 0;
auto VisitLit = [&](TULit l)
{
TUVar v = GetVar(l);
const TUV decLevel = GetAssignedDecLevel(l);
if (!m_AssignmentInfo[v].m_Visit && decLevel != 0)
{
MarkVisitedVar(v);
if (IsRootedVar(v))
{
++varsToVisitCurrFlippedLevel;
}
else
{
visitedNegLitsPrevFlippedLevels.push_back(IsSatisfied(l) ? Negate(l) : l);
}
}
};
auto VisitCls = [&](const span<TULit> cls, TUInd longClsInd)
{
for (TULit l : cls) VisitLit(l);
};
VisitCls(contradictingCls, contradictionInfo.m_IsContradictionInBinaryCls ? BadClsInd : contradictionInfo.m_ParentClsInd);
if (varsToVisitCurrFlippedLevel == 1)
{
assert(NV(2) || P("Flipped is skipped, since the contradicting clause has only one literal beyond the flipped (which might have happened because of on-the-fly-subsumption)\n"));
visitedNegLitsPrevFlippedLevels.clear();
return make_pair(visitedNegLitsPrevFlippedLevels.get_span(), BadClsInd);
}
TUVar v = m_TrailEnd;
for (; varsToVisitCurrFlippedLevel != 1; v = m_VarInfo[v].m_TrailPrev)
{
auto& ai = m_AssignmentInfo[v];
auto& vi = m_VarInfo[v];
if (ai.m_Visit)
{
--varsToVisitCurrFlippedLevel;
assert(ai.m_IsAssigned);
if (ai.IsAssignedBinary() || vi.m_ParentClsInd != BadClsInd)
{
// If the clause is binary, the parent will contain only the other literal (without l), but we don't need l anyway
// If the clause isn't binary, the parent will be complete, which is fine too
auto parent = GetAssignedNonDecParentSpanVI(ai, vi);
assert(NV(2) || P("Visited var: " + SVar(v) + "; Visited clause: " + SLits((span<TULit>)parent) + "\n"));
VisitCls(parent, ai.IsAssignedBinary() ? BadClsInd : vi.m_ParentClsInd);
}
}
}
// Find the first UIP w.r.t the flipped level
while (!m_AssignmentInfo[v].m_Visit)
{
v = m_VarInfo[v].m_TrailPrev;
}
if (m_ParamFlippedRecordDropIfSubsumed)
{