1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
|
/**CFile****************************************************************
FileName [int2Core.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Interpolation engine.]
Synopsis [Core procedures.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - Dec 1, 2013.]
Revision [$Id: int2Core.c,v 1.00 2013/12/01 00:00:00 alanmi Exp $]
***********************************************************************/
#include "int2Int.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [This procedure sets default values of interpolation parameters.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Int2_ManSetDefaultParams( Int2_ManPars_t * p )
{
memset( p, 0, sizeof(Int2_ManPars_t) );
p->nBTLimit = 0; // limit on the number of conflicts
p->nFramesS = 1; // the starting number timeframes
p->nFramesMax = 0; // the max number timeframes to unroll
p->nSecLimit = 0; // time limit in seconds
p->nFramesK = 1; // the number of timeframes to use in induction
p->fRewrite = 0; // use additional rewriting to simplify timeframes
p->fTransLoop = 0; // add transition into the init state under new PI var
p->fDropInvar = 0; // dump inductive invariant into file
p->fVerbose = 0; // print verbose statistics
p->iFrameMax = -1;
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Gia_Man_t * Int2_ManUnroll( Gia_Man_t * p, int nFrames )
{
Gia_Man_t * pFrames, * pTemp;
Gia_Obj_t * pObj;
int i, f;
assert( Gia_ManRegNum(pAig) > 0 );
pFrames = Gia_ManStart( Gia_ManObjNum(pAig) );
pFrames->pName = Abc_UtilStrsav( pAig->pName );
pFrames->pSpec = Abc_UtilStrsav( pAig->pSpec );
Gia_ManHashAlloc( pFrames );
Gia_ManConst0(pAig)->Value = 0;
for ( f = 0; f < nFrames; f++ )
{
Gia_ManForEachRo( pAig, pObj, i )
pObj->Value = f ? Gia_ObjRoToRi( pAig, pObj )->Value : 0;
Gia_ManForEachPi( pAig, pObj, i )
pObj->Value = Gia_ManAppendCi( pFrames );
Gia_ManForEachAnd( pAig, pObj, i )
pObj->Value = Gia_ManHashAnd( pFrames, Gia_ObjFanin0Copy(pObj), Gia_ObjFanin1Copy(pObj) );
Gia_ManForEachRi( pAig, pObj, i )
pObj->Value = Gia_ObjFanin0Copy(pObj);
}
Gia_ManForEachRi( pAig, pObj, i )
Gia_ManAppendCo( pFrames, pObj->Value );
Gia_ManHashStop( pFrames );
pFrames = Gia_ManCleanup( pTemp = pFrames );
Gia_ManStop( pTemp );
return pFrames;
}
sat_solver * Int2_ManPreparePrefix( Gia_Man_t * p, int f, Vec_Int_t ** pvCiMap )
{
Gia_Man_t * pPref, * pNew;
sat_solver * pSat;
// create subset of the timeframe
pPref = Int2_ManUnroll( p, f );
// create SAT solver
pNew = Jf_ManDeriveCnf( pPref, 0 );
pCnf = (Cnf_Dat_t *)pPref->pData; pPref->pData = NULL;
Gia_ManStop( pPref );
// derive the SAT solver
pSat = (sat_solver *)Cnf_DataWriteIntoSolver( pCnf, 1, 0 );
// collect indexes of CO variables
*pvCiMap = Vec_IntAlloc( 100 );
Gia_ManForEachPo( pNew, pObj, i )
Vec_IntPush( *pvCiMap, pCnf->pVarNums[ Gia_ObjId(pNew, pObj) ] );
// cleanup
Cnf_DataFree( pCnf );
Gia_ManStop( pNew );
return pSat;
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
sat_solver * Int2_ManPrepareSuffix( Gia_Man_t * p, Vec_Int_t * vImageOne, Vec_Int_t * vImagesAll, Vec_Int_t ** pvCoMap, Gia_Man_t ** ppSuff )
{
Gia_Man_t * pSuff, * pNew;
Gia_Obj_t * pObj;
Cnf_Dat_t * pCnf;
sat_solver * pSat;
Vec_Int_t * vLits;
int i, Lit, Limit;
// create subset of the timeframe
pSuff = Int2_ManProbToGia( p, vImageOne );
assert( Gia_ManPiNum(pSuff) == Gia_ManCiNum(p) );
// create SAT solver
pNew = Jf_ManDeriveCnf( pSuff, 0 );
pCnf = (Cnf_Dat_t *)pSuff->pData; pSuff->pData = NULL;
Gia_ManStop( pSuff );
// derive the SAT solver
pSat = (sat_solver *)Cnf_DataWriteIntoSolver( pCnf, 1, 0 );
// create new constraints
vLits = Vec_IntAlloc( 1000 );
Vec_IntForEachEntryStart( vImagesAll, Limit, i, 1 )
{
Vec_IntClear( vLits );
for ( k = 0; k < Limit; k++ )
{
i++;
Lit = Vec_IntEntry( vSop, i + k );
Vec_IntPush( vLits, Abc_LitNot(Lit) );
}
if ( !sat_solver_addclause( pSat, Vec_IntArray(vLits), Vec_IntArray(vLits) + Vec_IntSize(vLits) ) ) // UNSAT
{
Vec_IntFree( vLits );
Cnf_DataFree( pCnf );
Gia_ManStop( pNew );
*pvCoMap = NULL;
return NULL;
}
}
Vec_IntFree( vLits );
// collect indexes of CO variables
*pvCoMap = Vec_IntAlloc( 100 );
Gia_ManForEachRo( p, pObj, i )
{
pObj = Gia_ManPi( pNew, i + Gia_ManPiNum(p) );
Vec_IntPush( *pvCoMap, pCnf->pVarNums[ Gia_ObjId(pNew, pObj) ] );
}
// cleanup
Cnf_DataFree( pCnf );
if ( ppSuff )
*ppSuff = pNew;
else
Gia_ManStop( pNew );
return pSat;
}
/**Function*************************************************************
Synopsis [Returns the cube cover and status.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Vec_Int_t * Int2_ManComputePreimage( Gia_Man_t * pSuff, sat_solver * pSatPref, sat_solver * pSatSuff, Vec_Int_t * vCiMap, Vec_Int_t * vCoMap, Vec_Int_t * vPrio )
{
int i, iVar, status;
Vec_IntClear( p->vImage );
while ( 1 )
{
// run suffix solver
status = sat_solver_solve( p->pSatSuff, NULL, NULL, 0, 0, 0, 0 );
if ( status == l_Undef )
return NULL; // timeout
if ( status == l_False )
return INT2_COMPUTED;
assert( status == l_True );
// collect assignment
Vec_IntClear( p->vAssign );
Vec_IntForEachEntry( p->vCiMap, iVar, i )
Vec_IntPush( p->vAssign, sat_solver_var_value(p->pSatSuff, iVar) );
// derive initial cube
vCube = Int2_ManRefineCube( p->pSuff, p->vAssign, p->vPrio );
// expend the cube using prefix
status = sat_solver_solve( p->pSatPref, Vec_IntArray(vCube), Vec_IntArray(vCube) + Vec_IntSize(vCube), 0, 0, 0, 0 );
if ( status == l_False )
{
int k, nCoreLits, * pCoreLits;
nCoreLits = sat_solver_final( p->pSatPref, &pCoreLits );
// create cube
Vec_IntClear( vCube );
Vec_IntPush( vImage, nCoreLits );
for ( k = 0; k < nCoreLits; k++ )
{
Vec_IntPush( vCube, pCoreLits[k] );
Vec_IntPush( vImage, pCoreLits[k] );
}
// add cube to the solver
if ( !sat_solver_addclause( p->pSatSuff, Vec_IntArray(vCube), Vec_IntArray(vCube) + Vec_IntSize(vCube) ) )
{
Vec_IntFree( vCube );
return INT2_COMPUTED;
}
}
Vec_IntFree( vCube );
if ( status == l_Undef )
return INT2_TIME_OUT;
if ( status == l_True )
return INT2_FALSE_NEG;
assert( status == l_False );
continue;
}
return p->vImage;
}
/**Function*************************************************************
Synopsis [Interpolates while the number of conflicts is not exceeded.]
Description [Returns 1 if proven. 0 if failed. -1 if undecided.]
SideEffects [Does not check the property in 0-th frame.]
SeeAlso []
***********************************************************************/
int Int2_ManPerformInterpolation( Gia_Man_t * pInit, Int2_ManPars_t * pPars )
{
Int2_Man_t * p;
int f, i, RetValue = -1;
abctime clk, clkTotal = Abc_Clock(), timeTemp = 0;
abctime nTimeToStop = pPars->nSecLimit ? pPars->nSecLimit * CLOCKS_PER_SEC + Abc_Clock() : 0;
// sanity checks
assert( Gia_ManPiNum(pInit) > 0 );
assert( Gia_ManPoNum(pInit) > 0 );
assert( Gia_ManRegNum(pInit) > 0 );
// create manager
p = Int2_ManCreate( pInit, pPars );
// create SAT solver
p->pSatPref = sat_solver_new();
sat_solver_setnvars( p->pSatPref, 1000 );
sat_solver_set_runtime_limit( p->pSatPref, nTimeToStop );
// check outputs in the first frame
for ( i = 0; i < Gia_ManPoNum(pInit); i++ )
Vec_IntPush( p->vPrefCos, i );
Int2_ManCreateFrames( p, 0, p->vPrefCos );
RetValue = Int2_ManCheckBmc( p, NULL );
if ( RetValue != 1 )
return RetValue;
// create original image
for ( f = pPars->nFramesS; f < p->nFramesMax; f++ )
{
for ( i = 0; i < p->nFramesMax; i++ )
{
p->pSatSuff = Int2_ManPrepareSuffix( p, vImageOne. vImagesAll, &vCoMap, &pGiaSuff );
sat_solver_set_runtime_limit( p->pSatSuff, nTimeToStop );
Vec_IntFreeP( &vImageOne );
vImageOne = Int2_ManComputePreimage( pGiaSuff, p->pSatPref, p->pSatSuff, vCiMap, vCoMap );
Vec_IntFree( vCoMap );
Gia_ManStop( pGiaSuff );
if ( nTimeToStop && Abc_Clock() > nTimeToStop )
return -1;
if ( vImageOne == NULL )
{
if ( i == 0 )
{
printf( "Satisfiable in frame %d.\n", f );
Vec_IntFree( vCiMap );
sat_solver_delete( p->pSatPref ); p->pSatPref = NULL;
return 0;
}
f += i;
break;
}
Vec_IntAppend( vImagesAll, vImageOne );
sat_solver_delete( p->pSatSuff ); p->pSatSuff = NULL;
}
Vec_IntFree( vCiMap );
sat_solver_delete( p->pSatPref ); p->pSatPref = NULL;
}
Abc_PrintTime( "Time", Abc_Clock() - clk );
p->timeSatPref += Abc_Clock() - clk;
Int2_ManStop( p );
return RetValue;
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
