1 /*******************************************************************************
2 * SAT4J: a SATisfiability library for Java Copyright (C) 2004, 2012 Artois University and CNRS
3 *
4 * All rights reserved. This program and the accompanying materials
5 * are made available under the terms of the Eclipse Public License v1.0
6 * which accompanies this distribution, and is available at
7 * http://www.eclipse.org/legal/epl-v10.html
8 *
9 * Alternatively, the contents of this file may be used under the terms of
10 * either the GNU Lesser General Public License Version 2.1 or later (the
11 * "LGPL"), in which case the provisions of the LGPL are applicable instead
12 * of those above. If you wish to allow use of your version of this file only
13 * under the terms of the LGPL, and not to allow others to use your version of
14 * this file under the terms of the EPL, indicate your decision by deleting
15 * the provisions above and replace them with the notice and other provisions
16 * required by the LGPL. If you do not delete the provisions above, a recipient
17 * may use your version of this file under the terms of the EPL or the LGPL.
18 *
19 * Based on the original MiniSat specification from:
20 *
21 * An extensible SAT solver. Niklas Een and Niklas Sorensson. Proceedings of the
22 * Sixth International Conference on Theory and Applications of Satisfiability
23 * Testing, LNCS 2919, pp 502-518, 2003.
24 *
25 * See www.minisat.se for the original solver in C++.
26 *
27 * Contributors:
28 * CRIL - initial API and implementation
29 *******************************************************************************/
30 package org.sat4j.tools;
31
32 import org.sat4j.specs.IConstr;
33 import org.sat4j.specs.ISolverService;
34 import org.sat4j.specs.Lbool;
35
36 /**
37 * @since 2.2
38 */
39 public class ConflictLevelTracing extends SearchListenerAdapter<ISolverService> {
40
41 /**
42 *
43 */
44 private int counter;
45 // private int maxDlevel;
46
47 private static final long serialVersionUID = 1L;
48
49 // private final String filename;
50 private int nVar;
51 private int maxDLevel;
52
53 private final IVisualizationTool visuTool;
54 private final IVisualizationTool restartVisuTool;
55 private final IVisualizationTool cleanTool;
56
57 public ConflictLevelTracing(IVisualizationTool visuTool,
58 IVisualizationTool restartVisuTool, IVisualizationTool cleanTool) {
59 this.visuTool = visuTool;
60 this.restartVisuTool = restartVisuTool;
61 this.cleanTool = cleanTool;
62
63 this.counter = 1;
64 this.maxDLevel = 0;
65 }
66
67 @Override
68 public void conflictFound(IConstr confl, int dlevel, int trailLevel) {
69 if (dlevel > this.maxDLevel) {
70 this.maxDLevel = dlevel;
71 }
72 this.visuTool.addPoint(this.counter, dlevel);
73 this.restartVisuTool.addInvisiblePoint(this.counter, this.maxDLevel);
74 this.cleanTool.addInvisiblePoint(this.counter, this.maxDLevel);
75 this.counter++;
76 }
77
78 @Override
79 public void restarting() {
80 this.restartVisuTool.addPoint(this.counter, this.maxDLevel);
81 this.cleanTool.addPoint(this.counter, 0);
82 this.visuTool.addInvisiblePoint(this.counter, this.nVar);
83 }
84
85 @Override
86 public void end(Lbool result) {
87 this.visuTool.end();
88 this.cleanTool.end();
89 this.restartVisuTool.end();
90 }
91
92 @Override
93 public void start() {
94 this.visuTool.init();
95 this.restartVisuTool.init();
96 this.cleanTool.init();
97 this.counter = 1;
98 this.maxDLevel = 0;
99 }
100
101 @Override
102 public void init(ISolverService solverService) {
103 this.nVar = solverService.nVars();
104 }
105
106 @Override
107 public void cleaning() {
108 this.restartVisuTool.addPoint(this.counter, 0);
109 this.cleanTool.addPoint(this.counter, this.maxDLevel);
110 this.visuTool.addInvisiblePoint(this.counter, this.nVar);
111 }
112 }