Skip to content

Commit

Permalink
update
Browse files Browse the repository at this point in the history
  • Loading branch information
gipsyh committed Dec 7, 2024
1 parent 95ef301 commit 2fda544
Show file tree
Hide file tree
Showing 8 changed files with 21 additions and 21 deletions.
24 changes: 12 additions & 12 deletions Cargo.lock

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion Cargo.toml
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ repository = "https://github.com/gipsyh/rIC3"
[dependencies]
aig = { path = "./deps/aig-rs", version = "0.2.1" }
satif-minisat = { path = "./deps/minisat-rs", version = "0.2.1" }
cadical = { path = "./deps/cadical-rs", version = "0.1.0" }
satif-cadical = { path = "./deps/cadical-rs", version = "0.1.0" }
satif-kissat = { path = "./deps/kissat-rs", version = "0.4.0" }
logic-form = { path = "./deps/logic-form", version = "0.2.0" }
clap = { version = "4.5.16", features = ["derive"] }
Expand Down
4 changes: 2 additions & 2 deletions src/bmc.rs
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,7 @@ impl BMC {
let mut solver: Box<dyn Satif> = if options.bmc.bmc_kissat {
Box::new(satif_kissat::Solver::new())
} else {
Box::new(cadical::Solver::new())
Box::new(satif_cadical::Solver::new())
};
ts.load_init(solver.as_mut());
Self {
Expand All @@ -35,7 +35,7 @@ impl BMC {
self.solver = if self.options.bmc.bmc_kissat {
Box::new(satif_kissat::Solver::new())
} else {
Box::new(cadical::Solver::new())
Box::new(satif_cadical::Solver::new())
};
self.uts.ts.load_init(self.solver.as_mut());
}
Expand Down
4 changes: 2 additions & 2 deletions src/kind.rs
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@ impl Kind {
let solver: Box<dyn Satif> = if options.kind.kind_kissat {
Box::new(satif_kissat::Solver::new())
} else {
Box::new(cadical::Solver::new())
Box::new(satif_cadical::Solver::new())
};
Self {
uts,
Expand Down Expand Up @@ -56,7 +56,7 @@ impl Kind {
self.solver = if self.options.kind.kind_kissat {
Box::new(satif_kissat::Solver::new())
} else {
Box::new(cadical::Solver::new())
Box::new(satif_cadical::Solver::new())
};
}
}
Expand Down
2 changes: 1 addition & 1 deletion src/transys/sec.rs
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ impl Transys {
avoid: &mut HashSet<Var>,
eqs: &mut Vec<(Lit, Lit)>,
) {
let mut solver = cadical::Solver::new();
let mut solver = satif_cadical::Solver::new();
for k in 0..=uts.num_unroll {
uts.load_trans(&mut solver, k, true);
for (x, y) in eqs.iter() {
Expand Down
2 changes: 1 addition & 1 deletion src/transys/simplify.rs
Original file line number Diff line number Diff line change
Expand Up @@ -51,7 +51,7 @@ impl Transys {
let mut simp_solver: Box<dyn Satif> = if keep_dep {
Box::new(SimpSolver::new())
} else {
Box::new(cadical::Solver::new())
Box::new(satif_cadical::Solver::new())
};
let false_lit: Lit = simp_solver.new_var().into();
simp_solver.add_clause(&[!false_lit]);
Expand Down
2 changes: 1 addition & 1 deletion src/transys/simulate.rs
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
use crate::{transys::unroll::TransysUnroll, Transys};
use cadical::Solver;
use logic_form::{Cube, Var};
use satif::Satif;
use satif_cadical::Solver;
use std::collections::HashMap;

impl Transys {
Expand Down
2 changes: 1 addition & 1 deletion src/verify.rs
Original file line number Diff line number Diff line change
Expand Up @@ -103,7 +103,7 @@ impl IC3 {
pub fn check_witness_by_bmc(&mut self, b: ProofObligation) -> Option<Cube> {
let mut uts = TransysUnroll::new(&self.ts);
uts.unroll_to(b.depth);
let mut solver: Box<dyn satif::Satif> = Box::new(cadical::Solver::new());
let mut solver: Box<dyn satif::Satif> = Box::new(satif_cadical::Solver::new());
for k in 0..=b.depth {
uts.load_trans(solver.as_mut(), k, false);
}
Expand Down

0 comments on commit 2fda544

Please sign in to comment.