!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstu 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 T U V W X Y Z [ \ ] ^ _ ` 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 {|}~(c) Galois, Inc. 2010BSD3jhendrix@galois.com experimental(not portable (c2hs, language extensions)Safe 0:<=C 6:the zero-based number of PO, for which verification failed7Fthe zero-based number of the time-frame, for which verificaiton failed8$the number of registers in the miter9)the number of primary inputs in the miter:Uthe number of words of bit data used (ezyang: where by words they actually mean bits);&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: nPis 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. 3456789:;<= 3456789:;<= 456789:;<3=3456789:;<=Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimentalportableSafe :<=CGalois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None :<=CCenables fraigingDenables rewritingE0enables BDD construction when other methods failFprints verbose statsGthe number of iterationsHstarting mitering limitIBmultiplicative coefficient to increase the limit in each iterationJ"the number of rewriting iterationsKBmultiplicative coefficient to increase the limit in each iterationL"starting backtrack(conflict) limitMBmultiplicative coefficient to increase the limit in each iterationN4the number of BDD nodes when construction is abortedO'enables dynamic BDD variable reorderingPfinal mitering limitQ(global limit on the number of backtracksR-global limit on the number of clause inspectsS#the total number of backtracks madeT!the total number of inspects madeABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUVGalois, Inc. 2010-2014BSD3jhendrix@galois.com experimentalportableSafe :<=CZAn isomorphism view.aCreate an isomorphism Z[\]^_`aZ[\]^_`a[\]^_`ZaZ[\]^_`aGalois, Inc. 2010BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)Safe :<=Ck#Get entry in vector at given index.l%Write entry in vector at given index. bcdefghijklm bcdefghijklm cbhdefgijklm bcdefghijklmGalois, Inc. 2010BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)Safe :<=Cnopqrstnopqrstonpqrtsnopqrst Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None 9:;<=CIw&Literals store complement information.z1Also known as the node's id. No complement info.}PA 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.kuvwxyz{|}~Nuvwxyz{|}~Nuv}z{|wxy~guvwxyz{|}~ Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)None :<=Cconflict limit at a node+the runtime limit in seconds (added prefix n)use smart CNF computationenables AIG rewriting perform naive SAT-based checkingvery verbose stats verbose statsthe number of failed output+ Galois, Inc. 2010BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)Safe :<=C(     2          2      Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)Safe :<=CCreate 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 :<=C-Create a new map for storing all nodes in GIA Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)Safe :<=CDefault foreign pointer constructor that just calls free() on the pointer when it is no longer being used. XXX move this somewhere commonJNetwork name manager.KReturn array of all objects.LReturn primary inputs.MReturn primary outputs.N*Return combinational inputs (PIs, latches)O5Return combinational outputs (POs, asserts, latches).P)The functionality manager varies between  AbcNtkFunc. In the case of 4&, this pointer is guaranteed to be an .Q0Return pointer to model associated with network.RThe EXDC network.Object networkYObject identifier.Z Object type.3Indicates if first fanin of object is complemented.4Indicates if second fanin of object is complemented.[Get object fanins.\ Return true if this an and gate. Return fanin obj at given index._&Return true if object is complemented.`Return normalized object.aNegate object.hcDuplicate a network, allocating memory for the new network. This procedure does not preserve the Id of objects.o\ pointer that can have it's lower bit complemented, and thus needs to be converted into an  before you can dereference it.x !"#$%&'()*+,-./0123456789:;<=>?@  ABCDE  FG HIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrP !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnP9:;<=>012345678#$%&'()*+,-./"! IJKLMONSPQRTUVWXHa@?FG_`YZ[\]^EDCbBcdefghiAjklmnZ !"# $%&'()*+,-./0123456789:;<=>?@  ABCDE  FG HIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrGalois, Inc. 2010-2014BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)Safe :<=C{|{|{|{|Galois, Inc. 2010BSD3jhendrix@galois.com experimental"non-portable (language extensions)Safe :<=C}~}~~}}~Galois, Inc. 2010BSD3jhendrix@galois.com experimental(non-portable (c2hs, language extensions)Safe :<=CGalois, Inc. 2010-2014BSD3jhendrix@galois.comstable"non-portable (language extensions)None $(9:;<=CDIORT Proxy for building AIG networksBuild 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 network,Returns true is the literal is satisfiabile.VRun a computation using a handle to a new AIG Manager, and then free the AIG manager.Convert 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.! !"#$%&'()*+,-3  %$#"!  '&)(-,+*10/.3'&%$#"!  -,+*10/.)( !"#$%&'()*+,-Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimental"non-portable (language extensions)None $(9:;<=CDIORTRepresent a literal.*An and-invertor graph network in GIA form.Build a new empty GIA graph#Read an AIGER file into a GIA graphConstant true node.Constant false node 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 an inner computation with two networks, while ensuring that the storage for the two networks is distinct. We do this by copying on of the two networks if they are from the same underlying physical ABC network.0>Run computation with a Gia_Man_t containing the given network.1=Run a computation with an AIG man created from a GIA netowrk.2+Allocate a vec int array from Boolean list.3+Allocate a vec int array from Boolean list.(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. 456789Number of latches../0:;<1=>?@A23(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.:  %$#"!  '&)(-,+*10/.: )( %$#"!  '&-,+*10/.456789./0:;<1=>?@A23(c) Galois, Inc. 2010-2014BSD3jhendrix@galois.com experimentalportableNone  9:<=CDRProxy for AIG interface.Proxy for GIA interface.Initializes 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.Deinitializes 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.%Read an AIGER file as an AIG network.$Read an AIGER file as a GIA network.BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  %$#"!  '&)(-,+*10/.  !"#$%&'()*+,-./0123456789:;;<<=>?@ABCDEFGHIIJKLMNOPQRSTUUVWXYZ[\]^_`abcdefghijklmnnopqrstuvwxyz{|}~                      ! " # $ % & ' ( ) * + , - . / 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 [ \ ] ^ _ ` 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 { | } ~          m                                                                                         !"#$%&'()*+,-(.+/0123456789:;<&=>=?=@=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=[=\=]=^=_=`=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={=|=}=~================= %abcBridge-0.15-EgJLqHvab7DLUg2XBa1GeP 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.4-6WrOEfgoJpvLv7XnMXjFNZData.AIG.InterfacenetworkInputCountFalseLitTrueLitNotInputInputNotAndAndLitView===notIsLitProxyabstractEvaluateAIGlitViewevaluate evaluatorceccheckSatwriteCNF writeAigergetInput inputCountmuxxorimplieseqorandsandnewInput asConstantconstantfalseLittrueLit aigerNetworknewGraph withNewGraphIsAIGNetwork SomeGraph SatUnknownSatUnsat SatResult VerifyUnknownInvalidValid 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 peekAbcCex$fReadAbc_Cex_t_$fShowAbc_Cex_t_$fEqAbc_Cex_t_Prove_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_ParamsproveParamsDefault$fStorableProve_Params_t_$fReadProve_Params_t_$fShowProve_Params_t_$fEqProve_Params_t_IsoFieldreadAtwriteAtfieldFromOffsetisoFieldTargetiso 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 $fEqGiaVar $fOrdGiaVar$fStorableGiaVar $fEqGiaLit $fOrdGiaLit$fStorableGiaLit Cec_ParCec_t_nBTLimit'Cec_ParCecnTimeLimit'Cec_ParCecfUseSmartCnf'Cec_ParCecfRewriting'Cec_ParCecfNaive'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$fStorableCec_ParCec_t_$fStorableCec_ParSat_t_$fShowCec_ParSat_t_$fReadCec_ParSat_t_$fEqCec_ParSat_t_$fShowCec_ParCec_t_$fReadCec_ParCec_t_$fEqCec_ParCec_t_ Aig_Obj_t Aig_Man_t Aig_Obj_t_ Aig_Man_t_ Aig_Type_t AigObjNone AigObjConst1AigObjCiAigObjCo AigObjBuf AigObjAnd AigObjExor AigObjVoid aigManStop p_aigManStop aigRegularaigNot aigNotCondaigIsComplement aigManCiNum aigManCoNumaigManObjNumMax aigManConst0 aigManConst1aigManCiaigManCoaigObjId aigManStartaigObjCreateCiaigObjCreateCo$fEnumAig_Type_t$fShowAig_Type_t$fEqAig_Type_t 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 AbcObjNone AbcObjConst1AbcObjPiAbcObjPoAbcObjBiAbcObjBo AbcObjNet AbcObjNode AbcObjLatchAbcObjWhiteboxAbcObjBlackbox AbcObjNumber Abc_NtkFunc_t AbcFuncNone AbcFuncSop AbcFuncBdd AbcFuncAig AbcFuncMap AbcFuncBlifmvAbcFuncBlackbox AbcFuncOther Abc_NtkType_t AbcNtkNone AbcNtkNetlist AbcNtkLogic AbcNtkStrash AbcNtkOtherNm_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$fEnumAbc_InitType_t$fEnumAbc_ObjType_t$fEnumAbc_NtkFunc_t$fEnumAbc_NtkType_t$fShowAbc_NtkType_t$fEqAbc_NtkType_t$fShowAbc_NtkFunc_t$fEqAbc_NtkFunc_t$fShowAbc_ObjType_t$fEqAbc_ObjType_t$fShowAbc_InitType_t$fEqAbc_InitType_t ioReadAiger ioWriteAiger abcNtkToDarabcNtkFromAigPhaseabcStartabcStopLitAIGproxynewAIG readAigertruefalse checkSat'writeAIGManToCNFWithMapping $fIsAIGLitAIG$fTraceableLit $fIsLitLit$fEqLit $fStorableLit$fOrdLitGIAnewGIAwriteAigerWithLatchescheck_exists_forall $fIsAIGLitGIAGIALitAIGLit aigNetwork giaNetwork initialize unsafeCleanupreadAigerAsAIGreadAigerAsGIAchunksOfdivUpforN_forNProve_Params_tproveParamsSetDefault'_proveParamsSetDefaultvecIntSizeField 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'cecManCecSetDefaultParamscecManSatSetDefaultParamsaigObjCreateCo'_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 Abc_Aig_t_Abc_InitType_t AbcInitNone AbcInitZero AbcInitOne AbcInitDc AbcInitOther abcNtkQbf'_abcNtkVerifySimulatePattern'_abcNtkIvyProve'_abcNtkDeleteObjPo'_abcNtkDeleteObj'_abcNtkDelete'_ abcNtkDup'_ abcNtkAlloc'_abcNtkShortNames'_abcNtkMiterIsConstant'_ abcNtkMiter'_abcObjAddFanin'_abcAigConst1'_ nmManFree'_ nmManCreate'_abcNtkCreateObj' p_abcPrimFreecintEnumenumCIntabcNtkObjCountsabcNtkObjCountabcObjFaninIdx abcObjNotIfioWriteAiger'_ ioReadAiger'_abcNtkFromAigPhase'_ abcNtkToDar' abcStop'_ abcStart'_ deletePos checkReadablewithAbcNtkToDar getCNFMappingunLit_ntkPtr foreachPo foreachPo_ withAIGPtr memoFoldAIG litViewInnerforI_pureEvaluateFn evaluateFn outputCountwithNetworkPtraddPocheckIsConstantwithTwoNetworkPtrsgiaNetworkAsAIGManwithBoolAsVecIntgetVecIntAsBoolL_unLit_giaPtr withGIAPtrwithNetworkPtr_CopywithNetworkPtr_Munge giaRunCEC giaVarIndex fanin0Lit _fanin1Lit litEvaluatorData.AIG.OperationspdivpmodpmulpriorityEncodecountTrailingZeroscountLeadingZeros logBase2_up logBase2_downrorrolushrsshrshl 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 unfoldAIGfoldAIGsfoldAIGLitTree unLitTree