Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
A
abc
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
abc
Commits
ab8f784b
Commit
ab8f784b
authored
Aug 13, 2017
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Experiments with BMC.
parent
b39b55e8
Expand all
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
17 additions
and
2 deletions
+17
-2
src/base/abci/abc.c
+16
-2
src/sat/bmc/bmc.h
+1
-0
src/sat/bmc/bmcBmcS.c
+0
-0
No files found.
src/base/abci/abc.c
View file @
ab8f784b
...
@@ -39850,6 +39850,7 @@ int Abc_CommandAbc9Bmc( Abc_Frame_t * pAbc, int argc, char ** argv )
...
@@ -39850,6 +39850,7 @@ int Abc_CommandAbc9Bmc( Abc_Frame_t * pAbc, int argc, char ** argv )
pPars
->
nConfLimit
=
0
;
// maximum number of conflicts at a node
pPars
->
nConfLimit
=
0
;
// maximum number of conflicts at a node
pPars
->
nTimeOut
=
0
;
// timeout in seconds
pPars
->
nTimeOut
=
0
;
// timeout in seconds
pPars
->
nLutSize
=
6
;
// max LUT size for CNF computation
pPars
->
nLutSize
=
6
;
// max LUT size for CNF computation
pPars
->
nProcs
=
1
;
// the number of parallel solvers
pPars
->
fLoadCnf
=
0
;
// dynamic CNF loading
pPars
->
fLoadCnf
=
0
;
// dynamic CNF loading
pPars
->
fDumpFrames
=
0
;
// dump unrolled timeframes
pPars
->
fDumpFrames
=
0
;
// dump unrolled timeframes
pPars
->
fUseSynth
=
0
;
// use synthesis
pPars
->
fUseSynth
=
0
;
// use synthesis
...
@@ -39990,6 +39991,7 @@ int Abc_CommandAbc9SBmc( Abc_Frame_t * pAbc, int argc, char ** argv )
...
@@ -39990,6 +39991,7 @@ int Abc_CommandAbc9SBmc( Abc_Frame_t * pAbc, int argc, char ** argv )
pPars
->
nConfLimit
=
0
;
// maximum number of conflicts at a node
pPars
->
nConfLimit
=
0
;
// maximum number of conflicts at a node
pPars
->
nTimeOut
=
0
;
// timeout in seconds
pPars
->
nTimeOut
=
0
;
// timeout in seconds
pPars
->
nLutSize
=
0
;
// max LUT size for CNF computation
pPars
->
nLutSize
=
0
;
// max LUT size for CNF computation
pPars
->
nProcs
=
1
;
// the number of parallel solvers
pPars
->
fLoadCnf
=
0
;
// dynamic CNF loading
pPars
->
fLoadCnf
=
0
;
// dynamic CNF loading
pPars
->
fDumpFrames
=
0
;
// dump unrolled timeframes
pPars
->
fDumpFrames
=
0
;
// dump unrolled timeframes
pPars
->
fUseSynth
=
0
;
// use synthesis
pPars
->
fUseSynth
=
0
;
// use synthesis
...
@@ -40003,10 +40005,21 @@ int Abc_CommandAbc9SBmc( Abc_Frame_t * pAbc, int argc, char ** argv )
...
@@ -40003,10 +40005,21 @@ int Abc_CommandAbc9SBmc( Abc_Frame_t * pAbc, int argc, char ** argv )
pPars
->
pFuncOnFrameDone
=
pAbc
->
pFuncOnFrameDone
;
// frame done callback
pPars
->
pFuncOnFrameDone
=
pAbc
->
pFuncOnFrameDone
;
// frame done callback
Extra_UtilGetoptReset
();
Extra_UtilGetoptReset
();
while
(
(
c
=
Extra_UtilGetopt
(
argc
,
argv
,
"CFTvwh"
)
)
!=
EOF
)
while
(
(
c
=
Extra_UtilGetopt
(
argc
,
argv
,
"
P
CFTvwh"
)
)
!=
EOF
)
{
{
switch
(
c
)
switch
(
c
)
{
{
case
'P'
:
if
(
globalUtilOptind
>=
argc
)
{
Abc_Print
(
-
1
,
"Command line switch
\"
-P
\"
should be followed by an integer.
\n
"
);
goto
usage
;
}
pPars
->
nProcs
=
atoi
(
argv
[
globalUtilOptind
]);
globalUtilOptind
++
;
if
(
pPars
->
nProcs
<
0
)
goto
usage
;
break
;
case
'C'
:
case
'C'
:
if
(
globalUtilOptind
>=
argc
)
if
(
globalUtilOptind
>=
argc
)
{
{
...
@@ -40063,8 +40076,9 @@ int Abc_CommandAbc9SBmc( Abc_Frame_t * pAbc, int argc, char ** argv )
...
@@ -40063,8 +40076,9 @@ int Abc_CommandAbc9SBmc( Abc_Frame_t * pAbc, int argc, char ** argv )
return
0
;
return
0
;
usage:
usage:
Abc_Print
(
-
2
,
"usage: &bmcs [-CFT num] [-vwh]
\n
"
);
Abc_Print
(
-
2
,
"usage: &bmcs [-
P
CFT num] [-vwh]
\n
"
);
Abc_Print
(
-
2
,
"
\t
performs bounded model checking
\n
"
);
Abc_Print
(
-
2
,
"
\t
performs bounded model checking
\n
"
);
Abc_Print
(
-
2
,
"
\t
-P num : the number of parallel solvers [default = %d]
\n
"
,
pPars
->
nProcs
);
Abc_Print
(
-
2
,
"
\t
-C num : the SAT solver conflict limit [default = %d]
\n
"
,
pPars
->
nConfLimit
);
Abc_Print
(
-
2
,
"
\t
-C num : the SAT solver conflict limit [default = %d]
\n
"
,
pPars
->
nConfLimit
);
Abc_Print
(
-
2
,
"
\t
-F num : the maximum number of timeframes [default = %d]
\n
"
,
pPars
->
nFramesMax
);
Abc_Print
(
-
2
,
"
\t
-F num : the maximum number of timeframes [default = %d]
\n
"
,
pPars
->
nFramesMax
);
Abc_Print
(
-
2
,
"
\t
-T num : approximate timeout in seconds [default = %d]
\n
"
,
pPars
->
nTimeOut
);
Abc_Print
(
-
2
,
"
\t
-T num : approximate timeout in seconds [default = %d]
\n
"
,
pPars
->
nTimeOut
);
src/sat/bmc/bmc.h
View file @
ab8f784b
...
@@ -87,6 +87,7 @@ struct Bmc_AndPar_t_
...
@@ -87,6 +87,7 @@ struct Bmc_AndPar_t_
int
nConfLimit
;
// maximum number of conflicts at a node
int
nConfLimit
;
// maximum number of conflicts at a node
int
nTimeOut
;
// timeout in seconds
int
nTimeOut
;
// timeout in seconds
int
nLutSize
;
// LUT size for cut computation
int
nLutSize
;
// LUT size for cut computation
int
nProcs
;
// the number of parallel solvers
int
fLoadCnf
;
// dynamic CNF loading
int
fLoadCnf
;
// dynamic CNF loading
int
fDumpFrames
;
// dump unrolled timeframes
int
fDumpFrames
;
// dump unrolled timeframes
int
fUseSynth
;
// use synthesis
int
fUseSynth
;
// use synthesis
...
...
src/sat/bmc/bmcBmcS.c
View file @
ab8f784b
This diff is collapsed.
Click to expand it.
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment