{w      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkl m n o p q r s t u v w x y z { | } ~                                    ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S TUVWXYZ[\]^_`abcdefghijklmnopqrstuv(c) Galois, Inc. 2010BSD3jhendrix@galois.com experimental(not portable (c2hs, language extensions)None +36< 4:the zero-based number of PO, for which verification failed5Fthe zero-based number of the time-frame, for which verificaiton failed6$the number of registers in the miter7)the number of primary inputs in the miter8Uthe number of words of bit data used (ezyang: where by words they actually mean bits)9&The cex bit data (the number of bits: nRegs + (iFrame+1) * nPis%) The format of the data is as such:+First, the initial values for all registers Then, the iFrame+1 sets of inputs, which represent what we inputted into the network at each timestep. For a combinational network, this means there is only 1 set.:outer length: iFrame+1; inner length: nPisw chunksOf n l partitions l into length n1 chunks. The last chunk may contain fewer than n elements.;#Peek into the value of a Abc_Cex_t. 123456789:xw; 123456789:; 23456789:1;123456789:xw;Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimentalportable Safe-Inferred 36<yzyzyzGalois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 36<>enables fraiging?enables rewriting@0enables BDD construction when other methods failAprints verbose statsBthe number of iterationsCstarting mitering limitDBmultiplicative coefficient to increase the limit in each iterationE"the number of rewriting iterationsFBmultiplicative coefficient to increase the limit in each iterationG"starting backtrack(conflict) limitHBmultiplicative coefficient to increase the limit in each iterationI4the number of BDD nodes when construction is abortedJ'enables dynamic BDD variable reorderingKfinal mitering limitL(global limit on the number of backtracksM-global limit on the number of clause inspectsN#the total number of backtracks madeO!the total number of inspects made<=>?@ABCDEFGHIJKLMNO{|}P~<=>?@ABCDEFGHIJKLMNOP<=>?@ABCDEFGHIJKLMNOP<=>?@ABCDEFGHIJKLMNO{|}P~Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimentalportableNone 36<QAn isomorphism view.XCreate an isomorphism QRSTUVWXQRSTUVWXRSTUVWQXQRSTUVWXGalois, Inc. 2010BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 36<b#Get entry in vector at given index.c%Write entry in vector at given index. YZ[\]^_`abcd YZ[\]^_`abcd ZY_[\]^`abcd YZ[\]^_`abcdGalois, Inc. 2010BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 36<efghijkefghijkfeghikjefghijk Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 2346<Bn&Literals store complement information.q1Also known as the node's id. No complement info.tPA pointer to a GIA object. GIA objects are pointers to structs in ABC, and represent literals in the AIG. The low-order bit of the pointer is set to 1 if the literal has been complemented, and so care must be taken to only dereference positive pointers. The object is also a bitfield, so care must be taken when accessing fields.EPointers to GIA objects may be invalidated when adding a new object.|Remove negation.}yReturns iDiff0 field of object Note: iDiff0 is a bitfield, so this may be more likely to break on unexpected compilers.~+Get the complement attribute of first faninGet first user defined markyReturns iDiff1 field of object Note: iDiff1 is a bitfield, so this may be more likely to break on unexpected compilers.Get second user defined markIReturns true if this is a combinational output (latch or primary output).+Returns positive literal associated to var.IThis directly appends the literal to the GIA bypassing any hash-consing.&Return object associated with gia var.4Get var index of combinational input at given index.'Get combinational input at given index.(Get combinational output at given index.(Get combinational output at given index.6Returns the variable index associated with the object.giaManDupDfsLazyLit pNew p l copies a lit l in p to pNew and returns the lit in pNew.klmnopqrstuvwxyz{|}~Nlmnopqrstuvwxyz{|}~Nlmtqrsnop}~|{zyxwvuglmnopqrstuvwxyz{|}~ Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 36<conflict limit at a node+the runtime limit in seconds (added prefix n)use smart CNF computationenables AIG rewritingvery verbose stats verbose statsthe number of failed output* Galois, Inc. 2010BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 36<(00  Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 36<Create a new CNF manager.:Use results on cnfDerive in a comptuation, then free them.  Galois, Inc. 2010BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 36<-Create a new map for storing all nodes in GIA Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 36<Default foreign pointer constructor that just calls free() on the pointer when it is no longer being used. XXX move this somewhere common/Network name manager.0Return array of all objects.1Return primary inputs.2Return primary outputs.3*Return combinational inputs (PIs, latches)45Return combinational outputs (POs, asserts, latches).5)The functionality manager varies between  AbcNtkFunc. In the case of &, this pointer is guaranteed to be an .60Return pointer to model associated with network.7The EXDC network.Object network>Object identifier.? Object type.3Indicates if first fanin of object is complemented.4Indicates if second fanin of object is complemented.@Get object fanins.A Return true if this an and gate. Return fanin obj at given index.D&Return true if object is complemented.EReturn normalized object.FNegate object.McDuplicate a network, allocating memory for the new network. This procedure does not preserve the Id of objects.\ pointer that can have it's lower bit complemented, and thus needs to be converted into an  before you can dereference it.x      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSP      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSP#"!      ./0124385679:;<=-F%$+,DE>?@ABC*)(G'HIJKLMN&OPQRSZ      #"! $%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSGalois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 36<TUTUTUTUGalois, Inc. 2010BSD3jhendrix@galois.com experimental"non-portable (language extensions)None 36<VWVWWVVWGalois, Inc. 2010BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions) Safe-Inferred 36<XYXYXYXYGalois, Inc. 2010-2014BSD3jhendrix@galois.comstable"non-portable (language extensions)None  $2346<=BHKM \Proxy for building AIG networks]Build a new, empty AIG graphDelete all primary outputs.PCheck that a file can be read. N.B. We should eventually modify abc to be safe.^$Read an AIGER file as an AIG networka,Returns true is the literal is satisfiabile.VRun a computation using a handle to a new AIG Manager, and then free the AIG manager.biWrite a CNF file to the given path. Returns vector mapping combinational inputs to CNF Variable numbers.cConvert the network referred to by an AIG manager into CNF format and write to a file, returning a mapping from ABC object IDs to CNF variable numbers.Return the array mapping AIG network objects (indices) to CNF variable numbers (entries) for a CNF data object derived from the given AIG manager."Z[\]^_`abc2  !"#$%&'()*+,-./Z[\]^_`abc2[]^\Z_`bca%$#"!  +()*/,-.'&Z[\]^_`abcGalois, Inc. 2010-2014BSD3jhendrix@galois.com experimental"non-portable (language extensions)None  $2346<=BHKMdRepresent a literal.e*An and-invertor graph network in GIA form.gBuild a new empty GIA graphh#Read an AIGER file into a GIA graphiConstant true node.jConstant false nodek Write an AIGER file with the given number of latches. If the number of latches is denoted by "n", then the last n inputs and last n outputs are treated as the latch input and outputs respectively. The other inputs and outputs represent primary inputs and outputs.$Evaluate a literal on an assignment. >Run computation with a Gia_Man_t containing the given network. =Run a computation with an AIG man created from a GIA netowrk.l3Return a representation of how lit was constructed. +Allocate a vec int array from Boolean list. +Allocate a vec int array from Boolean list.mkWrite a CNF file to the given path. Returns vector mapping combinational inputs to CNF Variable numbers.n(Check a formula of the form Ex.Ay p(x,y)(. This function takes a network where input variables are used to represent both the existentially and the universally quantified variables. The existentially quantified variables must precede the universally quantified variables, and the number of extential variables is defined by an extra Int@ paramter.  defghijkNumber of latches.  l  mn(The GIA network used to store the terms.$The number of existential variables.The proposition to verify.gInitial value to use in search for universal variables. (should equal number of universal variables.).#Number of iterations to try solver.:  !"#$%&'()*+,-./defghijklmn:egdijflhkmn '& #"!  %$+()*/,-. defghijk  l  mn(c) Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimentalportableNone  236<=KqProxy for AIG interface.rProxy for GIA interface.sInitializes the ABC engine. This function may be safely called multiple times. Higher-level functions will automatically call this function, so it is only needed if using the FFI interfaces directly.tDeinitializes the ABC engine. ABC operations may not be run after this function is called. Use with care; this may cause ABC datatypes to stop working.u%Read an AIGER file as an AIG network.v$Read an AIGER file as a GIA network.opqrstuv !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{| }  !"#$%&'()*+,-./[]egopqrstuv st[pq]ueorgvopqrstuv~ !"#$%&'()*+,-./01234567899::;<=>?@ABCDEFGGHIJKLMNOPPQRSTUVWXYZ[\]^_`abcdeefghijklmnopqrstuvwxyz{|} ~                                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` abcdefghijklmnopqhrjslmntuvwxyz{|}~d                                                                                              hiu     r   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyzz {abcBridge-0.12 Data.ABC.AIG Data.ABC.GIAData.ABC.Internal.AIGData.ABC.Internal.ABCGlobalData.ABC.Internal.FRAIGData.ABC.Internal.FieldData.ABC.Internal.VecIntData.ABC.Internal.VecPtrData.ABC.Internal.GIAData.ABC.Internal.CECData.ABC.Internal.CNFData.ABC.Internal.GiaAigData.ABC.Internal.ABCData.ABC.Internal.IOData.ABC.Internal.OrphanData.ABC.Internal.MainData.ABC Data.ABC.Util aig-0.2.1Data.AIG.InterfacenetworkInputCountAndNotAndInputNotInputTrueLitFalseLitLitView===notIsLitProxyabstractEvaluateAIGevaluate evaluatorceccheckSat writeAigergetInput inputCountmuxxorimplieseqorandsandnewInput asConstantconstantfalseLittrueLit aigerNetworknewGraph withNewGraphIsAIGNetwork SomeGraphUnsatSat SatUnknown SatResultValidInvalid VerifyUnknown VerifyResultbaseForeign.C.TypesCInt Abc_Cex_t Abc_Cex_t_ iPo'Abc_CexiFrame'Abc_Cex nRegs'Abc_Cex nPis'Abc_Cex nBits'Abc_CexpData'regs'Abc_CexpData'inputs'Abc_Cex peekAbcCexProve_Params_t_fUseFraiging'Prove_ParamsfUseRewriting'Prove_ParamsfUseBdds'Prove_ParamsfVerbose'Prove_ParamsnItersMax'Prove_Params nMiteringLimitStart'Prove_Params nMiteringLimitMulti'Prove_Params!nRewritingLimitStart'Prove_Params!nRewritingLimitMulti'Prove_Params nFraigingLimitStart'Prove_Params nFraigingLimitMulti'Prove_ParamsnBddSizeLimit'Prove_ParamsfBddReorder'Prove_ParamsnMiteringLimitLast'Prove_Params!nTotalBacktrackLimit'Prove_ParamsnTotalInspectLimit'Prove_Params!nTotalBacktracksMade'Prove_ParamsnTotalInspectsMade'Prove_ParamsproveParamsDefaultIsoFieldreadAtwriteAtfieldFromOffsetisoFieldTargetiso Vec_Int_t Vec_Int_t_ vecIntSize setVecIntSize vecIntCap setVecIntCap clearVecInt vecIntArraysetVecIntArray vecIntEntryvecIntWriteEntry withVecInt Vec_Ptr_t Vec_Ptr_t_clearVec vecPtrSize vecPtrArray clearVecPtr vecPtrEntry Gia_Man_t Gia_Man_t_GiaLitunGiaLitGiaVarunGiaVar Gia_Obj_t clearGiaObj p_giaManStop giaManStopgiaManHashStopgiaManHashStartgiaManHashAllocgiaManDupNormalize giaRegular giaObjDiff0 giaObjFaninC0 giaObjMark0 giaObjIsTerm giaObjDiff1 giaObjFaninC1 giaObjMark1getGiaObjValuesetGiaObjValuegia_nonegiaObjIsAndOrConst0giaIsComplement giaObjIsCo giaObjChild0 giaObjChild1giaObjFaninId0giaObjFaninId1giaManConst0LitgiaManConst1Lit giaLitIsCompl giaLitVar giaVarLit giaLitNot giaLitNotCond giaManCexComb giaManNObjs giaManConst0 giaManCis giaManCos giaManFanData giaManObjNum giaManCiNum giaManCoNumgetGiaManRegNumsetGiaManRegNum giaManPiNum giaManPoNum giaManAndNumgiaManForEachObj1_giaManForEachCogiaManAppendCigiaManAppendAndgiaManAppendCo giaManObj giaManCiVargiaManCi giaManCoVargiaManCogiaObjId giaObjToLit giaObjFromLit giaAigerRead giaAigerWrite giaManMiter giaDupLit giaManHashAnd giaManHashXor giaManHashMux giaManStart giaManCleanupgiaManFillValue Cec_ParCec_t_nBTLimit'Cec_ParCecnTimeLimit'Cec_ParCecfUseSmartCnf'Cec_ParCecfRewriting'Cec_ParCecfVeryVerbose'Cec_ParCecfVerbose'Cec_ParCeciOutFail'Cec_ParCec Cec_ParSat_t_nBTLimit'Cec_ParSatnSatVarMax'Cec_ParSatnCallsRecycle'Cec_ParSatfNonChrono'Cec_ParSatfPolarFlip'Cec_ParSatfCheckMiter'Cec_ParSatfLearnCls'Cec_ParSatfVerbose'Cec_ParSat Cec_ManPat_t Cec_ManPat_t_cecManSatDefaultParamscecManCecDefaultParamscecManPatStart cecManPatStopcecManPatPrintStatscecManPatPatCountcecManSatSolvececManSatSolving cecManVerify Aig_Obj_t Aig_Man_t Aig_Obj_t_ Aig_Man_t_ Aig_Type_t AigObjVoid AigObjExor AigObjAnd AigObjBufAigObjCoAigObjCi AigObjConst1 AigObjNone aigManStop p_aigManStop aigRegularaigNot aigNotCondaigIsComplement aigManCiNum aigManCoNumaigManObjNumMax aigManConst0 aigManConst1aigManCiaigManCoaigObjId aigManStartaigObjCreateCiaigObjCreateCo Cnf_Dat_t Cnf_Man_t Cnf_Man_t_ cnfManStart cnfVarNums withCnfDerivecnfDeriveWithMancnfDataWriteIntoFilecnfDataWriteIntoFileWithHeader cnfDataFree Gia_AigMap_t giaManToAig withGiaAigMap aigDupGiaLit Abc_Obj_t Abc_Ntk_t Abc_Obj_t_ Abc_Ntk_t_ Abc_ObjType_t AbcObjNumberAbcObjBlackboxAbcObjWhitebox AbcObjLatch AbcObjNode AbcObjNetAbcObjBoAbcObjBiAbcObjPoAbcObjPi AbcObjConst1 AbcObjNone Abc_NtkFunc_t AbcFuncOtherAbcFuncBlackbox AbcFuncBlifmv AbcFuncMap AbcFuncAig AbcFuncBdd AbcFuncSop AbcFuncNone Abc_NtkType_t AbcNtkOther AbcNtkStrash AbcNtkLogic AbcNtkNetlist AbcNtkNoneNm_Man_t Nm_Man_t_p_abcNtkDelete abcAigCleanup abcAigMux abcAigXor abcAigAnd nmManCreate nmManFreeabcNtkCreateObj abcNtkFunc abcNtkManName abcNtkObjs abcNtkPis abcNtkPos abcNtkCis abcNtkCos abcNtkManFunc abcNtkModel abcNtkExdc abcNtkObj abcNtkPiNum abcNtkPoNum abcNtkCiNum abcNtkCoNumabcNtkLatchNumabcObjId abcObjType abcObjFanins abcObjIsAnd abcObjLit0 abcObjLit1abcObjIsComplement abcObjRegular abcObjNot abcAigConst1abcObjAddFanin abcNtkMiterabcNtkMiterIsConstantabcNtkShortNames abcNtkAlloc abcNtkDup abcNtkDeleteabcNtkDeleteObjabcNtkDeleteObjPoabcNtkIvyProveabcNtkVerifySimulatePattern abcNtkQbf ioReadAiger ioWriteAiger abcNtkToDarabcNtkFromAigPhaseabcStartabcStopLitAIGproxynewAIG readAigertruefalse checkSat' writeToCNFwriteAIGManToCNFWithMappingGIAnewGIAwriteAigerWithLatcheslitViewwriteCNFcheck_exists_forallGIALitAIGLit aigNetwork giaNetwork initialize unsafeCleanupreadAigerAsAIGreadAigerAsGIAchunksOfdivUpforN_forNProve_Params_tproveParamsSetDefault'_proveParamsSetDefault$fStorableProve_Params_t_vecIntSizeField vecSizeField Gia_Obj_t_giaManFillValue'_giaManCleanup'_ giaManStart'_giaManHashMux'_giaManHashXor'_giaManHashAnd'_ giaManMiter'_giaAigerWrite'_giaAigerRead'_giaObjFromLit'_ giaObjToLit'_ giaDupLit'giaManAppendCo_giaManAppendAnd_giaManAppendCi_ enumRangelazyAnd asWordPtr sizeOfGiaObjgiaObjDiff0AssignedgiaNot giaNotCond incObjPtr decObjPtrobjDiff giaObjFanin0 giaObjFanin1 giaManObjs Cec_ParCec_t Cec_ParSat_tcecManSatSolve'_cecManPatPrintStats'_cecManPatStop'_cecManPatStart'_ cecManVerify'cecManSatSolving'cecManCecSetDefaultParamscecManSatSetDefaultParams$fStorableCec_ParCec_t_$fStorableCec_ParSat_t_aigObjCreateCo'_aigObjCreateCi'_ aigManStart'_ aigObjId'_ aigManCo'_ aigManCi'_ aigManNObj'_ aigObjWordPtrtypeCInt aigManNObj Cnf_Dat_t_ cnfDataFree'_ cnfDataWriteIntoFileWithHeader'_cnfDataWriteIntoFile'_cnfDeriveWithMan'_ cnfDerive'_ cnfManStart'_ p_cnfManStop newCnfMan cnfDerive newGiaAigMap giaManToAig'_ aigDupGiaLit'newDefaultForeignPtr Abc_Aig_t abcObjNtk abcObjCompl0 abcObjCompl1 abcFaninObj$fEnumAbc_InitType_t Abc_Aig_t_Abc_InitType_t AbcInitOther AbcInitDc AbcInitOne AbcInitZero AbcInitNone abcNtkQbf'_abcNtkVerifySimulatePattern'_abcNtkIvyProve'_abcNtkDeleteObjPo'_abcNtkDeleteObj'_abcNtkDelete'_ abcNtkDup'_ abcNtkAlloc'_abcNtkShortNames'_abcNtkMiterIsConstant'_ abcNtkMiter'_abcObjAddFanin'_abcAigConst1'_ nmManFree'_ nmManCreate'_abcNtkCreateObj' p_abcPrimFreecintEnumenumCIntabcNtkObjCountsabcNtkObjCountabcObjFaninIdx abcObjNotIf$fEnumAbc_ObjType_t$fEnumAbc_NtkFunc_t$fEnumAbc_NtkType_tioWriteAiger'_ ioReadAiger'_abcNtkFromAigPhase'_ abcNtkToDar' abcStop'_ abcStart'_ deletePos checkReadablewithAbcNtkToDar getCNFMappingunLit_ntkPtr foreachPo foreachPo_ withAIGPtr memoFoldAIGforI_pureEvaluateFn evaluateFn outputCountwithNetworkPtraddPocheckIsConstant $fIsAIGLitAIG$fTraceableLit $fIsLitLitgiaNetworkAsAIGManwithBoolAsVecIntgetVecIntAsBoolPartialSatResultL_unLit_giaPtr withGIAPtr_withNetworkPtr_CopywithNetworkPtr_Munge giaVarIndex fanin0Lit fanin1Lit litEvaluator $fIsAIGLitGIAData.AIG.Operationspmodpmulrorrolushrsshrshl muxInteger signIntCoerce zeroIntCoercetrunczextsextslesltuleultnonZeroisZerobvEqbvSameuremuquotsabssremsquotsmulFullmulFullmulsubConstaddConstsubCsubaddCaddneglXorlXor'lAnd'lAndlEq'lEqlOr'lOrlNot'lNotiteMitelsbmsbasSigned asUnsigned bvFromIntegerbvShow! bvFromListbvToListzipWithMzipWithsliceRevslicedroptakeconcat++at singleton replicateM replicategenerateM_msb0 generate_msb0generateM_lsb0 generate_lsb0lengthemptyBV randomNetwork buildNetwork getMaxInput genLitTree genLitView toSatResulttoVerifyResultnetworkOutputCountlazyMux fromLitForest toLitForest fromLitTree toLitTree unfoldAIGs unfoldAIGfoldAIGsfoldAIG unLitTreeLitTree