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
f29fe2d0
Commit
f29fe2d0
authored
Nov 05, 2013
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Specialized inductive check.
parent
78a0660e
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
3 additions
and
6 deletions
+3
-6
src/sat/bmc/bmcICheck.c
+3
-6
No files found.
src/sat/bmc/bmcICheck.c
View file @
f29fe2d0
...
@@ -228,10 +228,10 @@ void Bmc_PerformICheck( Gia_Man_t * p, int nFramesMax, int nTimeOut, int fEmpty,
...
@@ -228,10 +228,10 @@ void Bmc_PerformICheck( Gia_Man_t * p, int nFramesMax, int nTimeOut, int fEmpty,
// collect positive literals
// collect positive literals
vLits
=
Vec_IntAlloc
(
Gia_ManCoNum
(
p
)
);
vLits
=
Vec_IntAlloc
(
Gia_ManCoNum
(
p
)
);
for
(
i
=
0
;
i
<
Gia_ManRegNum
(
p
);
i
++
)
for
(
i
=
0
;
i
<
Gia_ManRegNum
(
p
);
i
++
)
Vec_IntPush
(
vLits
,
Abc_Var2Lit
(
i
,
0
)
);
Vec_IntPush
(
vLits
,
Abc_Var2Lit
(
i
,
fEmpty
)
);
// iteratively compute a minimal M-inductive set of next-state functions
// iteratively compute a minimal M-inductive set of next-state functions
nLitsUsed
=
Vec_IntSize
(
vLits
);
nLitsUsed
=
fEmpty
?
0
:
Vec_IntSize
(
vLits
);
vUsed
=
Vec_IntAlloc
(
Vec_IntSize
(
vLits
)
);
vUsed
=
Vec_IntAlloc
(
Vec_IntSize
(
vLits
)
);
while
(
1
)
while
(
1
)
{
{
...
@@ -239,10 +239,7 @@ void Bmc_PerformICheck( Gia_Man_t * p, int nFramesMax, int nTimeOut, int fEmpty,
...
@@ -239,10 +239,7 @@ void Bmc_PerformICheck( Gia_Man_t * p, int nFramesMax, int nTimeOut, int fEmpty,
// derive SAT solver
// derive SAT solver
pSat
=
Bmc_DeriveSolver
(
p
,
pMiter
,
pCnf
,
nFramesMax
,
nTimeOut
,
fVerbose
);
pSat
=
Bmc_DeriveSolver
(
p
,
pMiter
,
pCnf
,
nFramesMax
,
nTimeOut
,
fVerbose
);
// sat_solver_bookmark( pSat );
// sat_solver_bookmark( pSat );
if
(
fEmpty
)
status
=
sat_solver_solve
(
pSat
,
Vec_IntArray
(
vLits
),
Vec_IntArray
(
vLits
)
+
Vec_IntSize
(
vLits
),
(
ABC_INT64_T
)
0
,
(
ABC_INT64_T
)
0
,
(
ABC_INT64_T
)
0
,
(
ABC_INT64_T
)
0
);
status
=
sat_solver_solve
(
pSat
,
NULL
,
NULL
,
(
ABC_INT64_T
)
0
,
(
ABC_INT64_T
)
0
,
(
ABC_INT64_T
)
0
,
(
ABC_INT64_T
)
0
);
else
status
=
sat_solver_solve
(
pSat
,
Vec_IntArray
(
vLits
),
Vec_IntArray
(
vLits
)
+
Vec_IntSize
(
vLits
),
(
ABC_INT64_T
)
0
,
(
ABC_INT64_T
)
0
,
(
ABC_INT64_T
)
0
,
(
ABC_INT64_T
)
0
);
if
(
status
==
l_Undef
)
if
(
status
==
l_Undef
)
{
{
printf
(
"Timeout reached after %d seconds.
\n
"
,
nTimeOut
);
printf
(
"Timeout reached after %d seconds.
\n
"
,
nTimeOut
);
...
...
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