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
ae521b66
Commit
ae521b66
authored
Feb 11, 2017
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Adding PDR with abstraction.
parent
2a5fa67d
Show whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
11 additions
and
41 deletions
+11
-41
src/proof/pdr/pdrCore.c
+7
-4
src/proof/pdr/pdrInv.c
+2
-2
src/proof/pdr/pdrTsim.c
+2
-35
No files found.
src/proof/pdr/pdrCore.c
View file @
ae521b66
...
@@ -706,7 +706,7 @@ int Pdr_ManBlockCube( Pdr_Man_t * p, Pdr_Set_t * pCube )
...
@@ -706,7 +706,7 @@ int Pdr_ManBlockCube( Pdr_Man_t * p, Pdr_Set_t * pCube )
{
{
Counter
++
;
Counter
++
;
pThis
=
Pdr_QueueHead
(
p
);
pThis
=
Pdr_QueueHead
(
p
);
if
(
pThis
->
iFrame
==
0
)
if
(
pThis
->
iFrame
==
0
||
(
p
->
pPars
->
fUseAbs
&&
Pdr_SetIsInit
(
pThis
->
pState
,
-
1
))
)
return
0
;
// SAT
return
0
;
// SAT
if
(
pThis
->
iFrame
>
kMax
)
// finished this level
if
(
pThis
->
iFrame
>
kMax
)
// finished this level
return
1
;
return
1
;
...
@@ -862,7 +862,7 @@ int Pdr_ManSolveInt( Pdr_Man_t * p )
...
@@ -862,7 +862,7 @@ int Pdr_ManSolveInt( Pdr_Man_t * p )
while
(
1
)
while
(
1
)
{
{
int
fRefined
=
0
;
int
fRefined
=
0
;
if
(
p
->
pPars
->
fUseAbs
&&
iFrame
==
3
)
if
(
p
->
pPars
->
fUseAbs
&&
p
->
vAbsFlops
==
NULL
&&
iFrame
==
2
)
{
{
int
i
,
Prio
;
int
i
,
Prio
;
assert
(
p
->
vAbsFlops
==
NULL
);
assert
(
p
->
vAbsFlops
==
NULL
);
...
@@ -995,7 +995,7 @@ int Pdr_ManSolveInt( Pdr_Man_t * p )
...
@@ -995,7 +995,7 @@ int Pdr_ManSolveInt( Pdr_Man_t * p )
Abc_Print
(
1
,
"*** Clauses after frame %d:
\n
"
,
iFrame
);
Abc_Print
(
1
,
"*** Clauses after frame %d:
\n
"
,
iFrame
);
Pdr_ManPrintClauses
(
p
,
0
);
Pdr_ManPrintClauses
(
p
,
0
);
}
}
if
(
p
->
pPars
->
fVerbose
)
if
(
p
->
pPars
->
fVerbose
&&
!
p
->
pPars
->
fUseAbs
)
Pdr_ManPrintProgress
(
p
,
!
p
->
pPars
->
fSolveAll
,
Abc_Clock
()
-
clkStart
);
Pdr_ManPrintProgress
(
p
,
!
p
->
pPars
->
fSolveAll
,
Abc_Clock
()
-
clkStart
);
p
->
pPars
->
iFrame
=
iFrame
;
p
->
pPars
->
iFrame
=
iFrame
;
if
(
!
p
->
pPars
->
fSolveAll
)
if
(
!
p
->
pPars
->
fSolveAll
)
...
@@ -1043,6 +1043,8 @@ int Pdr_ManSolveInt( Pdr_Man_t * p )
...
@@ -1043,6 +1043,8 @@ int Pdr_ManSolveInt( Pdr_Man_t * p )
Pdr_ManPrintProgress
(
p
,
0
,
Abc_Clock
()
-
clkStart
);
Pdr_ManPrintProgress
(
p
,
0
,
Abc_Clock
()
-
clkStart
);
}
}
}
}
if
(
fRefined
)
break
;
if
(
p
->
pTime4Outs
)
if
(
p
->
pTime4Outs
)
{
{
abctime
timeSince
=
Abc_Clock
()
-
clkOne
;
abctime
timeSince
=
Abc_Clock
()
-
clkOne
;
...
@@ -1059,9 +1061,10 @@ int Pdr_ManSolveInt( Pdr_Man_t * p )
...
@@ -1059,9 +1061,10 @@ int Pdr_ManSolveInt( Pdr_Man_t * p )
p
->
timeToStopOne
=
0
;
p
->
timeToStopOne
=
0
;
}
}
}
}
if
(
p
->
pPars
->
fVerbose
)
if
(
p
->
pPars
->
fVerbose
)
Pdr_ManPrintProgress
(
p
,
!
fRefined
,
Abc_Clock
()
-
clkStart
);
Pdr_ManPrintProgress
(
p
,
!
fRefined
,
Abc_Clock
()
-
clkStart
);
if
(
fRefined
)
continue
;
// open a new timeframe
// open a new timeframe
p
->
nQueLim
=
p
->
pPars
->
nRestLimit
;
p
->
nQueLim
=
p
->
pPars
->
nRestLimit
;
assert
(
pCube
==
NULL
);
assert
(
pCube
==
NULL
);
...
...
src/proof/pdr/pdrInv.c
View file @
ae521b66
...
@@ -470,8 +470,8 @@ void Pdr_ManReportInvariant( Pdr_Man_t * p )
...
@@ -470,8 +470,8 @@ void Pdr_ManReportInvariant( Pdr_Man_t * p )
Vec_Ptr_t
*
vCubes
;
Vec_Ptr_t
*
vCubes
;
int
kStart
=
Pdr_ManFindInvariantStart
(
p
);
int
kStart
=
Pdr_ManFindInvariantStart
(
p
);
vCubes
=
Pdr_ManCollectCubes
(
p
,
kStart
);
vCubes
=
Pdr_ManCollectCubes
(
p
,
kStart
);
Abc_Print
(
1
,
"Invariant F[%d] : %d clauses with %d flops (out of %d) (%.2f)
\n
"
,
Abc_Print
(
1
,
"Invariant F[%d] : %d clauses with %d flops (out of %d) (
cex = %d, ave =
%.2f)
\n
"
,
kStart
,
Vec_PtrSize
(
vCubes
),
Pdr_ManCountVariables
(
p
,
kStart
),
Aig_ManRegNum
(
p
->
pAig
),
1
.
0
*
p
->
nXsimLits
/
p
->
nXsimRuns
);
kStart
,
Vec_PtrSize
(
vCubes
),
Pdr_ManCountVariables
(
p
,
kStart
),
Aig_ManRegNum
(
p
->
pAig
),
p
->
nCexesTotal
,
1
.
0
*
p
->
nXsimLits
/
p
->
nXsimRuns
);
// Abc_Print( 1, "Invariant F[%d] : %d clauses with %d flops (out of %d)\n",
// Abc_Print( 1, "Invariant F[%d] : %d clauses with %d flops (out of %d)\n",
// kStart, Vec_PtrSize(vCubes), Pdr_ManCountVariables(p, kStart), Aig_ManRegNum(p->pAig) );
// kStart, Vec_PtrSize(vCubes), Pdr_ManCountVariables(p, kStart), Aig_ManRegNum(p->pAig) );
Vec_PtrFree
(
vCubes
);
Vec_PtrFree
(
vCubes
);
...
...
src/proof/pdr/pdrTsim.c
View file @
ae521b66
...
@@ -473,54 +473,21 @@ Pdr_ManPrintCex( p->pAig, vCiObjs, vCiVals, vCi2Rem );
...
@@ -473,54 +473,21 @@ Pdr_ManPrintCex( p->pAig, vCiObjs, vCiVals, vCi2Rem );
Pdr_ManDeriveResult
(
p
->
pAig
,
vCiObjs
,
vCiVals
,
vCi2Rem
,
vRes
,
vPiLits
);
Pdr_ManDeriveResult
(
p
->
pAig
,
vCiObjs
,
vCiVals
,
vCi2Rem
,
vRes
,
vPiLits
);
assert
(
Vec_IntSize
(
vRes
)
>
0
);
assert
(
Vec_IntSize
(
vRes
)
>
0
);
//p->tTsim += Abc_Clock() - clk;
//p->tTsim += Abc_Clock() - clk;
// move abstracted literals from flops to inputs
// move abstracted literals from flops to inputs
if
(
p
->
pPars
->
fUseAbs
&&
p
->
vAbsFlops
)
if
(
p
->
pPars
->
fUseAbs
&&
p
->
vAbsFlops
)
{
{
int
i
,
iLit
,
Used
,
k
=
0
,
fAllNegs
=
1
;
int
i
,
iLit
,
k
=
0
;
Vec_IntForEachEntry
(
vRes
,
iLit
,
i
)
Vec_IntForEachEntry
(
vRes
,
iLit
,
i
)
{
{
if
(
Vec_IntEntry
(
p
->
vAbsFlops
,
Abc_Lit2Var
(
iLit
))
)
// used flop
if
(
Vec_IntEntry
(
p
->
vAbsFlops
,
Abc_Lit2Var
(
iLit
))
)
// used flop
{
Vec_IntWriteEntry
(
vRes
,
k
++
,
iLit
);
Vec_IntWriteEntry
(
vRes
,
k
++
,
iLit
);
fAllNegs
&=
Abc_LitIsCompl
(
iLit
);
}
else
else
Vec_IntPush
(
vPiLits
,
2
*
Saig_ManPiNum
(
p
->
pAig
)
+
iLit
);
Vec_IntPush
(
vPiLits
,
2
*
Saig_ManPiNum
(
p
->
pAig
)
+
iLit
);
}
}
Vec_IntShrink
(
vRes
,
k
);
Vec_IntShrink
(
vRes
,
k
);
if
(
fAllNegs
)
// insert any positive literal
{
Aig_ManForEachObjVec
(
vCiObjs
,
p
->
pAig
,
pObj
,
i
)
{
if
(
!
Saig_ObjIsLo
(
p
->
pAig
,
pObj
)
)
continue
;
if
(
Vec_IntEntry
(
vCiVals
,
i
)
)
{
Entry
=
Aig_ObjCioId
(
pObj
)
-
Saig_ManPiNum
(
p
->
pAig
);
Vec_IntPush
(
vRes
,
Abc_Var2Lit
(
Entry
,
0
)
);
break
;
}
}
// add any flop that is not in the cone
if
(
i
==
Vec_IntSize
(
vCiObjs
)
)
{
Vec_IntForEachEntry
(
p
->
vAbsFlops
,
Used
,
i
)
{
if
(
!
Used
)
continue
;
if
(
Vec_IntFind
(
vRes
,
Abc_Var2Lit
(
i
,
1
)
)
>=
0
)
continue
;
Vec_IntPush
(
vRes
,
Abc_Var2Lit
(
i
,
0
)
);
//Vec_IntPrint( vRes );
break
;
}
assert
(
i
<
Vec_IntSize
(
p
->
vAbsFlops
)
);
}
}
}
}
pRes
=
Pdr_SetCreate
(
vRes
,
vPiLits
);
pRes
=
Pdr_SetCreate
(
vRes
,
vPiLits
);
assert
(
k
==
0
||
!
Pdr_SetIsInit
(
pRes
,
-
1
)
);
//ZH: Disabled assertion because this invariant doesn't hold with down
//ZH: Disabled assertion because this invariant doesn't hold with down
//because of the join operation which can bring in initial states
//because of the join operation which can bring in initial states
//assert( k == 0 || !Pdr_SetIsInit(pRes, -1) );
//assert( k == 0 || !Pdr_SetIsInit(pRes, -1) );
...
...
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