summaryrefslogtreecommitdiffstats
path: root/src/proof/cec/cecSatG2.c
diff options
context:
space:
mode:
authorAlan Mishchenko <alanmi@berkeley.edu>2020-11-19 19:22:27 -0800
committerAlan Mishchenko <alanmi@berkeley.edu>2020-11-19 19:22:27 -0800
commit48f71adacd7727280498f414ad992257c23d76d7 (patch)
tree0ea6fdbc44c8a917b1a8f5b0e7df9b6b998bf82f /src/proof/cec/cecSatG2.c
parentc3699a2043e94107dd963d5c49789807c135927c (diff)
downloadabc-48f71adacd7727280498f414ad992257c23d76d7.tar.gz
abc-48f71adacd7727280498f414ad992257c23d76d7.tar.bz2
abc-48f71adacd7727280498f414ad992257c23d76d7.zip
Integration with several commands.
Diffstat (limited to 'src/proof/cec/cecSatG2.c')
-rw-r--r--src/proof/cec/cecSatG2.c44
1 files changed, 44 insertions, 0 deletions
diff --git a/src/proof/cec/cecSatG2.c b/src/proof/cec/cecSatG2.c
index 51654cba..122f33d0 100644
--- a/src/proof/cec/cecSatG2.c
+++ b/src/proof/cec/cecSatG2.c
@@ -145,6 +145,30 @@ static inline void Cec4_ObjCleanSatId( Gia_Man_t * p, Gia_Obj_t * pObj )
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
+/**Function*************************************************************
+
+ Synopsis [Default parameter settings.]
+
+ Description []
+
+ SideEffects []
+
+ SeeAlso []
+
+***********************************************************************/
+void Cec4_ManSetParams( Cec_ParFra_t * pPars )
+{
+ memset( pPars, 0, sizeof(Cec_ParFra_t) );
+ pPars->jType = 2; // solver type
+ pPars->fSatSweeping = 1; // conflict limit at a node
+ pPars->nWords = 4; // simulation words
+ pPars->nRounds = 10; // simulation rounds
+ pPars->nItersMax = 2000; // this is a miter
+ pPars->nBTLimit = 1000000; // use logic cones
+ pPars->nSatVarMax = 1000; // the max number of SAT variables before recycling SAT solver
+ pPars->nCallsRecycle = 500; // calls to perform before recycling SAT solver
+ pPars->nGenIters = 100; // pattern generation iterations
+}
/**Function*************************************************************
@@ -1768,6 +1792,26 @@ Gia_Man_t * Cec4_ManSimulateTest( Gia_Man_t * p, Cec_ParFra_t * pPars )
Cec4_ManPerformSweeping( p, pPars, &pNew );
return pNew;
}
+void Cec4_ManSimulateTest2( Gia_Man_t * p, int fVerbose )
+{
+ abctime clk = Abc_Clock();
+ Cec_ParFra_t ParsFra, * pPars = &ParsFra;
+ Cec4_ManSetParams( pPars );
+ Cec4_ManPerformSweeping( p, pPars, NULL );
+ pPars->fVerbose = fVerbose;
+ //if ( fVerbose )
+ Abc_PrintTime( 1, "New choice computation time", Abc_Clock() - clk );
+}
+Gia_Man_t * Cec4_ManSimulateTest3( Gia_Man_t * p, int fVerbose )
+{
+ abctime clk = Abc_Clock();
+ Gia_Man_t * pNew = NULL;
+ Cec_ParFra_t ParsFra, * pPars = &ParsFra;
+ Cec4_ManSetParams( pPars );
+ pPars->fVerbose = fVerbose;
+ Cec4_ManPerformSweeping( p, pPars, &pNew );
+ return pNew;
+}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///