diff options
| -rw-r--r-- | src/aig/ivy/ivyFraig.c | 4 | ||||
| -rw-r--r-- | src/proof/cec/cecSolve.c | 2 |
2 files changed, 3 insertions, 3 deletions
diff --git a/src/aig/ivy/ivyFraig.c b/src/aig/ivy/ivyFraig.c index fdf6ea82..2b911861 100644 --- a/src/aig/ivy/ivyFraig.c +++ b/src/aig/ivy/ivyFraig.c @@ -2120,7 +2120,7 @@ int Ivy_FraigNodesAreEquiv( Ivy_FraigMan_t * p, Ivy_Obj_t * pOld, Ivy_Obj_t * pN { p->pSat = sat_solver_new(); sat_solver_setnvars( p->pSat, 1000 ); - p->pSat->factors = ABC_CALLOC( double, 1000 ); + p->pSat->factors = ABC_CALLOC( double, p->pSat->cap ); p->nSatVars = 1; // var 0 is reserved for const1 node - add the clause // pLits[0] = toLit( 0 ); @@ -2272,7 +2272,7 @@ int Ivy_FraigNodeIsConst( Ivy_FraigMan_t * p, Ivy_Obj_t * pNew ) { p->pSat = sat_solver_new(); sat_solver_setnvars( p->pSat, 1000 ); - p->pSat->factors = ABC_CALLOC( double, 1000 ); + p->pSat->factors = ABC_CALLOC( double, p->pSat->cap ); p->nSatVars = 1; // var 0 is reserved for const1 node - add the clause // pLits[0] = toLit( 0 ); diff --git a/src/proof/cec/cecSolve.c b/src/proof/cec/cecSolve.c index 712d5380..e779e68c 100644 --- a/src/proof/cec/cecSolve.c +++ b/src/proof/cec/cecSolve.c @@ -377,7 +377,7 @@ void Cec_ManSatSolverRecycle( Cec_ManSat_t * p ) } p->pSat = sat_solver_new(); sat_solver_setnvars( p->pSat, 1000 ); - p->pSat->factors = ABC_CALLOC( double, 1000 ); + p->pSat->factors = ABC_CALLOC( double, p->pSat->cap ); // var 0 is not used // var 1 is reserved for const0 node - add the clause p->nSatVars = 1; |