/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/pthread-ext/41_FreeBSD_abd_kbd_sliced.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 22:18:09,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 22:18:09,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 22:18:09,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 22:18:09,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 22:18:09,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 22:18:09,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 22:18:09,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 22:18:09,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 22:18:09,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 22:18:09,180 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 22:18:09,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 22:18:09,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 22:18:09,181 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 22:18:09,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 22:18:09,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 22:18:09,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 22:18:09,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 22:18:09,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 22:18:09,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 22:18:09,182 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 22:18:09,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 22:18:09,183 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 22:18:09,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 22:18:09,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 22:18:09,184 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 22:18:09,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 22:18:09,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 22:18:09,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 22:18:09,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 22:18:09,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 22:18:09,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 22:18:09,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 22:18:09,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 22:18:09,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 22:18:09,185 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 22:18:09,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 22:18:09,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 22:18:09,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 22:18:09,459 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 22:18:09,459 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 22:18:09,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/41_FreeBSD_abd_kbd_sliced.i [2023-08-25 22:18:10,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 22:18:10,641 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 22:18:10,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/41_FreeBSD_abd_kbd_sliced.i [2023-08-25 22:18:10,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a978f14f7/f9f201c172a14843905ec37e42016cfe/FLAG032a6d081 [2023-08-25 22:18:10,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a978f14f7/f9f201c172a14843905ec37e42016cfe [2023-08-25 22:18:10,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 22:18:10,660 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 22:18:10,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 22:18:10,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 22:18:10,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 22:18:10,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 10:18:10" (1/1) ... [2023-08-25 22:18:10,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca2de28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:10, skipping insertion in model container [2023-08-25 22:18:10,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 10:18:10" (1/1) ... [2023-08-25 22:18:10,691 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 22:18:10,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 22:18:10,937 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 22:18:10,961 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-25 22:18:10,962 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-25 22:18:10,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 22:18:11,039 INFO L206 MainTranslator]: Completed translation [2023-08-25 22:18:11,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11 WrapperNode [2023-08-25 22:18:11,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 22:18:11,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 22:18:11,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 22:18:11,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 22:18:11,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,083 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 27, calls inlined = 38, statements flattened = 320 [2023-08-25 22:18:11,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 22:18:11,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 22:18:11,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 22:18:11,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 22:18:11,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 22:18:11,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 22:18:11,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 22:18:11,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 22:18:11,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (1/1) ... [2023-08-25 22:18:11,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 22:18:11,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:18:11,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 22:18:11,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 22:18:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-25 22:18:11,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-25 22:18:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 22:18:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 22:18:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 22:18:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 22:18:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 22:18:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 22:18:11,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 22:18:11,185 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 22:18:11,306 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 22:18:11,314 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 22:18:11,681 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 22:18:11,802 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 22:18:11,802 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-25 22:18:11,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 10:18:11 BoogieIcfgContainer [2023-08-25 22:18:11,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 22:18:11,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 22:18:11,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 22:18:11,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 22:18:11,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 10:18:10" (1/3) ... [2023-08-25 22:18:11,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e0298d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 10:18:11, skipping insertion in model container [2023-08-25 22:18:11,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:18:11" (2/3) ... [2023-08-25 22:18:11,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e0298d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 10:18:11, skipping insertion in model container [2023-08-25 22:18:11,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 10:18:11" (3/3) ... [2023-08-25 22:18:11,809 INFO L112 eAbstractionObserver]: Analyzing ICFG 41_FreeBSD_abd_kbd_sliced.i [2023-08-25 22:18:11,819 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 22:18:11,819 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2023-08-25 22:18:11,819 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 22:18:11,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 22:18:11,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:11,936 INFO L124 PetriNetUnfolderBase]: 25/231 cut-off events. [2023-08-25 22:18:11,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:18:11,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 231 events. 25/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 789 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 206. Up to 7 conditions per place. [2023-08-25 22:18:11,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:11,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:11,953 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:18:11,962 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:11,968 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:11,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:12,009 INFO L124 PetriNetUnfolderBase]: 25/231 cut-off events. [2023-08-25 22:18:12,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:18:12,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 231 events. 25/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 789 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 206. Up to 7 conditions per place. [2023-08-25 22:18:12,012 INFO L119 LiptonReduction]: Number of co-enabled transitions 5044 [2023-08-25 22:18:17,163 INFO L134 LiptonReduction]: Checked pairs total: 5417 [2023-08-25 22:18:17,163 INFO L136 LiptonReduction]: Total number of compositions: 348 [2023-08-25 22:18:17,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 22:18:17,176 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a99d1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:18:17,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2023-08-25 22:18:17,179 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:18:17,179 INFO L124 PetriNetUnfolderBase]: 1/8 cut-off events. [2023-08-25 22:18:17,179 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:18:17,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:17,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-25 22:18:17,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONASSERT, thr1Err34ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2023-08-25 22:18:17,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:17,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1455348081, now seen corresponding path program 1 times [2023-08-25 22:18:17,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:17,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814999707] [2023-08-25 22:18:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:17,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:17,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:17,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814999707] [2023-08-25 22:18:17,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814999707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:17,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:17,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 22:18:17,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113651518] [2023-08-25 22:18:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:17,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 22:18:17,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:17,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 22:18:17,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 22:18:17,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 569 [2023-08-25 22:18:17,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 129 flow. Second operand has 2 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:17,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:17,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 569 [2023-08-25 22:18:17,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:17,360 INFO L124 PetriNetUnfolderBase]: 18/36 cut-off events. [2023-08-25 22:18:17,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:18:17,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 36 events. 18/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 72 event pairs, 5 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 58. Up to 32 conditions per place. [2023-08-25 22:18:17,363 INFO L140 encePairwiseOnDemand]: 521/569 looper letters, 7 selfloop transitions, 0 changer transitions 2/12 dead transitions. [2023-08-25 22:18:17,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 12 transitions, 47 flow [2023-08-25 22:18:17,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 22:18:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 22:18:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 375 transitions. [2023-08-25 22:18:17,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3295254833040422 [2023-08-25 22:18:17,379 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 375 transitions. [2023-08-25 22:18:17,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 375 transitions. [2023-08-25 22:18:17,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:17,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 375 transitions. [2023-08-25 22:18:17,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 187.5) internal successors, (375), 2 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:17,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:17,391 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:17,393 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 129 flow. Second operand 2 states and 375 transitions. [2023-08-25 22:18:17,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 12 transitions, 47 flow [2023-08-25 22:18:17,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 12 transitions, 47 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:18:17,397 INFO L231 Difference]: Finished difference. Result has 13 places, 10 transitions, 25 flow [2023-08-25 22:18:17,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=569, PETRI_DIFFERENCE_MINUEND_FLOW=29, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=25, PETRI_PLACES=13, PETRI_TRANSITIONS=10} [2023-08-25 22:18:17,402 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -46 predicate places. [2023-08-25 22:18:17,402 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 10 transitions, 25 flow [2023-08-25 22:18:17,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:17,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:17,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 22:18:17,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 22:18:17,404 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err17ASSERT_VIOLATIONDATA_RACE === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONASSERT, thr1Err34ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2023-08-25 22:18:17,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2128846228, now seen corresponding path program 1 times [2023-08-25 22:18:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738249610] [2023-08-25 22:18:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:17,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:17,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738249610] [2023-08-25 22:18:17,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738249610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:17,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:17,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:17,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857827118] [2023-08-25 22:18:17,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:17,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:17,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:17,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:17,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:17,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 569 [2023-08-25 22:18:17,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 10 transitions, 25 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:17,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:17,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 569 [2023-08-25 22:18:17,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:17,520 INFO L124 PetriNetUnfolderBase]: 16/31 cut-off events. [2023-08-25 22:18:17,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:18:17,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 31 events. 16/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 43 event pairs, 1 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 63. Up to 15 conditions per place. [2023-08-25 22:18:17,521 INFO L140 encePairwiseOnDemand]: 566/569 looper letters, 0 selfloop transitions, 0 changer transitions 13/13 dead transitions. [2023-08-25 22:18:17,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 13 transitions, 53 flow [2023-08-25 22:18:17,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-08-25 22:18:17,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2601054481546573 [2023-08-25 22:18:17,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-08-25 22:18:17,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-08-25 22:18:17,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:17,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-08-25 22:18:17,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:17,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 569.0) internal successors, (2276), 4 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:17,529 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 569.0) internal successors, (2276), 4 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:17,529 INFO L175 Difference]: Start difference. First operand has 13 places, 10 transitions, 25 flow. Second operand 3 states and 444 transitions. [2023-08-25 22:18:17,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 13 transitions, 53 flow [2023-08-25 22:18:17,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 13 transitions, 53 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:18:17,530 INFO L231 Difference]: Finished difference. Result has 13 places, 0 transitions, 0 flow [2023-08-25 22:18:17,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=569, PETRI_DIFFERENCE_MINUEND_FLOW=23, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=13, PETRI_TRANSITIONS=0} [2023-08-25 22:18:17,531 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -46 predicate places. [2023-08-25 22:18:17,531 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 0 transitions, 0 flow [2023-08-25 22:18:17,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:17,533 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (89 of 90 remaining) [2023-08-25 22:18:17,534 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (88 of 90 remaining) [2023-08-25 22:18:17,534 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONASSERT (87 of 90 remaining) [2023-08-25 22:18:17,535 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err34ASSERT_VIOLATIONDATA_RACE (86 of 90 remaining) [2023-08-25 22:18:17,535 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err25ASSERT_VIOLATIONDATA_RACE (85 of 90 remaining) [2023-08-25 22:18:17,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (84 of 90 remaining) [2023-08-25 22:18:17,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONDATA_RACE (83 of 90 remaining) [2023-08-25 22:18:17,538 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err44ASSERT_VIOLATIONDATA_RACE (82 of 90 remaining) [2023-08-25 22:18:17,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err30ASSERT_VIOLATIONDATA_RACE (81 of 90 remaining) [2023-08-25 22:18:17,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err39ASSERT_VIOLATIONDATA_RACE (80 of 90 remaining) [2023-08-25 22:18:17,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err20ASSERT_VIOLATIONDATA_RACE (79 of 90 remaining) [2023-08-25 22:18:17,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (78 of 90 remaining) [2023-08-25 22:18:17,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (77 of 90 remaining) [2023-08-25 22:18:17,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err30ASSERT_VIOLATIONDATA_RACE (76 of 90 remaining) [2023-08-25 22:18:17,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (75 of 90 remaining) [2023-08-25 22:18:17,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err38ASSERT_VIOLATIONDATA_RACE (74 of 90 remaining) [2023-08-25 22:18:17,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONASSERT (73 of 90 remaining) [2023-08-25 22:18:17,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err37ASSERT_VIOLATIONDATA_RACE (72 of 90 remaining) [2023-08-25 22:18:17,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err27ASSERT_VIOLATIONDATA_RACE (71 of 90 remaining) [2023-08-25 22:18:17,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err16ASSERT_VIOLATIONASSERT (70 of 90 remaining) [2023-08-25 22:18:17,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err35ASSERT_VIOLATIONDATA_RACE (69 of 90 remaining) [2023-08-25 22:18:17,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (68 of 90 remaining) [2023-08-25 22:18:17,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONASSERT (67 of 90 remaining) [2023-08-25 22:18:17,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err33ASSERT_VIOLATIONASSERT (66 of 90 remaining) [2023-08-25 22:18:17,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err17ASSERT_VIOLATIONDATA_RACE (65 of 90 remaining) [2023-08-25 22:18:17,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err32ASSERT_VIOLATIONDATA_RACE (64 of 90 remaining) [2023-08-25 22:18:17,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (63 of 90 remaining) [2023-08-25 22:18:17,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err32ASSERT_VIOLATIONDATA_RACE (62 of 90 remaining) [2023-08-25 22:18:17,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (61 of 90 remaining) [2023-08-25 22:18:17,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (60 of 90 remaining) [2023-08-25 22:18:17,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err16ASSERT_VIOLATIONASSERT (59 of 90 remaining) [2023-08-25 22:18:17,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err42ASSERT_VIOLATIONDATA_RACE (58 of 90 remaining) [2023-08-25 22:18:17,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err44ASSERT_VIOLATIONDATA_RACE (57 of 90 remaining) [2023-08-25 22:18:17,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err24ASSERT_VIOLATIONDATA_RACE (56 of 90 remaining) [2023-08-25 22:18:17,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONDATA_RACE (55 of 90 remaining) [2023-08-25 22:18:17,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err36ASSERT_VIOLATIONDATA_RACE (54 of 90 remaining) [2023-08-25 22:18:17,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err36ASSERT_VIOLATIONDATA_RACE (53 of 90 remaining) [2023-08-25 22:18:17,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err37ASSERT_VIOLATIONDATA_RACE (52 of 90 remaining) [2023-08-25 22:18:17,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err19ASSERT_VIOLATIONDATA_RACE (51 of 90 remaining) [2023-08-25 22:18:17,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err34ASSERT_VIOLATIONDATA_RACE (50 of 90 remaining) [2023-08-25 22:18:17,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err31ASSERT_VIOLATIONDATA_RACE (49 of 90 remaining) [2023-08-25 22:18:17,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err42ASSERT_VIOLATIONDATA_RACE (48 of 90 remaining) [2023-08-25 22:18:17,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err41ASSERT_VIOLATIONDATA_RACE (47 of 90 remaining) [2023-08-25 22:18:17,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err23ASSERT_VIOLATIONDATA_RACE (46 of 90 remaining) [2023-08-25 22:18:17,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err18ASSERT_VIOLATIONDATA_RACE (45 of 90 remaining) [2023-08-25 22:18:17,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err33ASSERT_VIOLATIONASSERT (44 of 90 remaining) [2023-08-25 22:18:17,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err28ASSERT_VIOLATIONDATA_RACE (43 of 90 remaining) [2023-08-25 22:18:17,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err31ASSERT_VIOLATIONDATA_RACE (42 of 90 remaining) [2023-08-25 22:18:17,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err28ASSERT_VIOLATIONDATA_RACE (41 of 90 remaining) [2023-08-25 22:18:17,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err22ASSERT_VIOLATIONDATA_RACE (40 of 90 remaining) [2023-08-25 22:18:17,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err25ASSERT_VIOLATIONDATA_RACE (39 of 90 remaining) [2023-08-25 22:18:17,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err22ASSERT_VIOLATIONDATA_RACE (38 of 90 remaining) [2023-08-25 22:18:17,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err17ASSERT_VIOLATIONDATA_RACE (37 of 90 remaining) [2023-08-25 22:18:17,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err41ASSERT_VIOLATIONDATA_RACE (36 of 90 remaining) [2023-08-25 22:18:17,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 90 remaining) [2023-08-25 22:18:17,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (34 of 90 remaining) [2023-08-25 22:18:17,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (33 of 90 remaining) [2023-08-25 22:18:17,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (32 of 90 remaining) [2023-08-25 22:18:17,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err38ASSERT_VIOLATIONDATA_RACE (31 of 90 remaining) [2023-08-25 22:18:17,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (30 of 90 remaining) [2023-08-25 22:18:17,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err26ASSERT_VIOLATIONDATA_RACE (29 of 90 remaining) [2023-08-25 22:18:17,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err20ASSERT_VIOLATIONDATA_RACE (28 of 90 remaining) [2023-08-25 22:18:17,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err24ASSERT_VIOLATIONDATA_RACE (27 of 90 remaining) [2023-08-25 22:18:17,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err21ASSERT_VIOLATIONDATA_RACE (26 of 90 remaining) [2023-08-25 22:18:17,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (25 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (24 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err27ASSERT_VIOLATIONDATA_RACE (23 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (22 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err29ASSERT_VIOLATIONDATA_RACE (21 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err29ASSERT_VIOLATIONDATA_RACE (20 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err40ASSERT_VIOLATIONASSERT (19 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (18 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err43ASSERT_VIOLATIONDATA_RACE (17 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err26ASSERT_VIOLATIONDATA_RACE (15 of 90 remaining) [2023-08-25 22:18:17,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err43ASSERT_VIOLATIONDATA_RACE (14 of 90 remaining) [2023-08-25 22:18:17,549 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err21ASSERT_VIOLATIONDATA_RACE (13 of 90 remaining) [2023-08-25 22:18:17,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err23ASSERT_VIOLATIONDATA_RACE (12 of 90 remaining) [2023-08-25 22:18:17,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err19ASSERT_VIOLATIONDATA_RACE (11 of 90 remaining) [2023-08-25 22:18:17,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err39ASSERT_VIOLATIONDATA_RACE (10 of 90 remaining) [2023-08-25 22:18:17,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (9 of 90 remaining) [2023-08-25 22:18:17,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err40ASSERT_VIOLATIONASSERT (8 of 90 remaining) [2023-08-25 22:18:17,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 90 remaining) [2023-08-25 22:18:17,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 90 remaining) [2023-08-25 22:18:17,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 90 remaining) [2023-08-25 22:18:17,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 90 remaining) [2023-08-25 22:18:17,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err18ASSERT_VIOLATIONDATA_RACE (3 of 90 remaining) [2023-08-25 22:18:17,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONASSERT (2 of 90 remaining) [2023-08-25 22:18:17,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err35ASSERT_VIOLATIONDATA_RACE (1 of 90 remaining) [2023-08-25 22:18:17,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 90 remaining) [2023-08-25 22:18:17,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 22:18:17,552 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-25 22:18:17,557 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-25 22:18:17,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:17,583 INFO L124 PetriNetUnfolderBase]: 25/231 cut-off events. [2023-08-25 22:18:17,583 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:18:17,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 231 events. 25/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 789 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 206. Up to 7 conditions per place. [2023-08-25 22:18:17,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:17,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:17,588 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:18:17,588 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:17,588 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:17,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 221 transitions, 447 flow [2023-08-25 22:18:17,607 INFO L124 PetriNetUnfolderBase]: 25/231 cut-off events. [2023-08-25 22:18:17,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:18:17,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 231 events. 25/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 789 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 206. Up to 7 conditions per place. [2023-08-25 22:18:17,610 INFO L119 LiptonReduction]: Number of co-enabled transitions 5044 [2023-08-25 22:18:22,245 INFO L134 LiptonReduction]: Checked pairs total: 5293 [2023-08-25 22:18:22,245 INFO L136 LiptonReduction]: Total number of compositions: 329 [2023-08-25 22:18:22,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-25 22:18:22,247 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a99d1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:18:22,247 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-25 22:18:22,250 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:18:22,250 INFO L124 PetriNetUnfolderBase]: 6/63 cut-off events. [2023-08-25 22:18:22,250 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:18:22,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:22,250 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-25 22:18:22,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-25 22:18:22,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash -785712015, now seen corresponding path program 1 times [2023-08-25 22:18:22,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:22,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965147187] [2023-08-25 22:18:22,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:22,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 22:18:22,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 22:18:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 22:18:22,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 22:18:22,298 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 22:18:22,298 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-25 22:18:22,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 22:18:22,298 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-25 22:18:22,298 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-25 22:18:22,299 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-25 22:18:22,299 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-25 22:18:22,327 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 22:18:22,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 374 places, 416 transitions, 844 flow [2023-08-25 22:18:22,412 INFO L124 PetriNetUnfolderBase]: 49/438 cut-off events. [2023-08-25 22:18:22,412 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 22:18:22,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 438 events. 49/438 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2152 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 400. Up to 7 conditions per place. [2023-08-25 22:18:22,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 374 places, 416 transitions, 844 flow [2023-08-25 22:18:22,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 374 places, 416 transitions, 844 flow [2023-08-25 22:18:22,421 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:18:22,421 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 374 places, 416 transitions, 844 flow [2023-08-25 22:18:22,421 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 374 places, 416 transitions, 844 flow [2023-08-25 22:18:22,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 374 places, 416 transitions, 844 flow [2023-08-25 22:18:22,459 INFO L124 PetriNetUnfolderBase]: 49/438 cut-off events. [2023-08-25 22:18:22,459 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 22:18:22,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 438 events. 49/438 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2152 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 400. Up to 7 conditions per place. [2023-08-25 22:18:22,482 INFO L119 LiptonReduction]: Number of co-enabled transitions 85748 [2023-08-25 22:18:26,563 INFO L134 LiptonReduction]: Checked pairs total: 370792 [2023-08-25 22:18:26,563 INFO L136 LiptonReduction]: Total number of compositions: 350 [2023-08-25 22:18:26,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 22:18:26,568 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a99d1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:18:26,568 INFO L358 AbstractCegarLoop]: Starting to check reachability of 135 error locations. [2023-08-25 22:18:26,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:18:26,578 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2023-08-25 22:18:26,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:18:26,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:26,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-25 22:18:26,578 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:26,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1587327732, now seen corresponding path program 1 times [2023-08-25 22:18:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:26,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722498358] [2023-08-25 22:18:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:26,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:26,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:26,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722498358] [2023-08-25 22:18:26,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722498358] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:26,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:26,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 22:18:26,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248025549] [2023-08-25 22:18:26,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:26,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 22:18:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 22:18:26,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 22:18:26,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 766 [2023-08-25 22:18:26,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 247 transitions, 506 flow. Second operand has 2 states, 2 states have (on average 296.0) internal successors, (592), 2 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:26,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:26,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 766 [2023-08-25 22:18:26,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:27,081 INFO L124 PetriNetUnfolderBase]: 3692/8205 cut-off events. [2023-08-25 22:18:27,081 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2023-08-25 22:18:27,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13534 conditions, 8205 events. 3692/8205 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 75531 event pairs, 2168 based on Foata normal form. 723/6389 useless extension candidates. Maximal degree in co-relation 2270. Up to 5200 conditions per place. [2023-08-25 22:18:27,121 INFO L140 encePairwiseOnDemand]: 694/766 looper letters, 71 selfloop transitions, 0 changer transitions 0/171 dead transitions. [2023-08-25 22:18:27,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 171 transitions, 496 flow [2023-08-25 22:18:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 22:18:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 22:18:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 731 transitions. [2023-08-25 22:18:27,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47715404699738906 [2023-08-25 22:18:27,123 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 731 transitions. [2023-08-25 22:18:27,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 731 transitions. [2023-08-25 22:18:27,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:27,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 731 transitions. [2023-08-25 22:18:27,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 365.5) internal successors, (731), 2 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:27,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 766.0) internal successors, (2298), 3 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:27,127 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 766.0) internal successors, (2298), 3 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:27,127 INFO L175 Difference]: Start difference. First operand has 217 places, 247 transitions, 506 flow. Second operand 2 states and 731 transitions. [2023-08-25 22:18:27,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 171 transitions, 496 flow [2023-08-25 22:18:27,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 171 transitions, 494 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-25 22:18:27,134 INFO L231 Difference]: Finished difference. Result has 159 places, 171 transitions, 352 flow [2023-08-25 22:18:27,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=352, PETRI_PLACES=159, PETRI_TRANSITIONS=171} [2023-08-25 22:18:27,135 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -58 predicate places. [2023-08-25 22:18:27,135 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 171 transitions, 352 flow [2023-08-25 22:18:27,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 296.0) internal successors, (592), 2 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:27,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:27,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:27,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 22:18:27,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:27,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash -708483277, now seen corresponding path program 1 times [2023-08-25 22:18:27,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:27,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293083876] [2023-08-25 22:18:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:27,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:27,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293083876] [2023-08-25 22:18:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293083876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:27,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:27,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020531406] [2023-08-25 22:18:27,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:27,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:27,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:27,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:27,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 766 [2023-08-25 22:18:27,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 171 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:27,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:27,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 766 [2023-08-25 22:18:27,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:28,212 INFO L124 PetriNetUnfolderBase]: 9959/19894 cut-off events. [2023-08-25 22:18:28,212 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-08-25 22:18:28,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35015 conditions, 19894 events. 9959/19894 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 190380 event pairs, 2366 based on Foata normal form. 0/14788 useless extension candidates. Maximal degree in co-relation 35010. Up to 7689 conditions per place. [2023-08-25 22:18:28,299 INFO L140 encePairwiseOnDemand]: 710/766 looper letters, 144 selfloop transitions, 46 changer transitions 0/260 dead transitions. [2023-08-25 22:18:28,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 260 transitions, 915 flow [2023-08-25 22:18:28,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 992 transitions. [2023-08-25 22:18:28,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4316797214969539 [2023-08-25 22:18:28,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 992 transitions. [2023-08-25 22:18:28,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 992 transitions. [2023-08-25 22:18:28,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:28,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 992 transitions. [2023-08-25 22:18:28,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:28,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:28,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:28,308 INFO L175 Difference]: Start difference. First operand has 159 places, 171 transitions, 352 flow. Second operand 3 states and 992 transitions. [2023-08-25 22:18:28,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 260 transitions, 915 flow [2023-08-25 22:18:28,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 260 transitions, 915 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:18:28,313 INFO L231 Difference]: Finished difference. Result has 163 places, 217 transitions, 740 flow [2023-08-25 22:18:28,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=163, PETRI_TRANSITIONS=217} [2023-08-25 22:18:28,316 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -54 predicate places. [2023-08-25 22:18:28,316 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 217 transitions, 740 flow [2023-08-25 22:18:28,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:28,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:28,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:28,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 22:18:28,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONASSERT === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:28,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash -488142354, now seen corresponding path program 1 times [2023-08-25 22:18:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:28,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638394152] [2023-08-25 22:18:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:28,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638394152] [2023-08-25 22:18:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638394152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:28,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:28,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111064027] [2023-08-25 22:18:28,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:28,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:28,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:28,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 766 [2023-08-25 22:18:28,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 217 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:28,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:28,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 766 [2023-08-25 22:18:28,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:28,652 INFO L124 PetriNetUnfolderBase]: 1288/3190 cut-off events. [2023-08-25 22:18:28,653 INFO L125 PetriNetUnfolderBase]: For 1389/1391 co-relation queries the response was YES. [2023-08-25 22:18:28,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6397 conditions, 3190 events. 1288/3190 cut-off events. For 1389/1391 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 24729 event pairs, 132 based on Foata normal form. 443/2985 useless extension candidates. Maximal degree in co-relation 6390. Up to 1418 conditions per place. [2023-08-25 22:18:28,663 INFO L140 encePairwiseOnDemand]: 726/766 looper letters, 50 selfloop transitions, 30 changer transitions 0/163 dead transitions. [2023-08-25 22:18:28,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 163 transitions, 649 flow [2023-08-25 22:18:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2023-08-25 22:18:28,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4007832898172324 [2023-08-25 22:18:28,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 921 transitions. [2023-08-25 22:18:28,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 921 transitions. [2023-08-25 22:18:28,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:28,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 921 transitions. [2023-08-25 22:18:28,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:28,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:28,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:28,671 INFO L175 Difference]: Start difference. First operand has 163 places, 217 transitions, 740 flow. Second operand 3 states and 921 transitions. [2023-08-25 22:18:28,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 163 transitions, 649 flow [2023-08-25 22:18:28,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 163 transitions, 581 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:28,680 INFO L231 Difference]: Finished difference. Result has 141 places, 151 transitions, 452 flow [2023-08-25 22:18:28,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=141, PETRI_TRANSITIONS=151} [2023-08-25 22:18:28,681 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -76 predicate places. [2023-08-25 22:18:28,681 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 151 transitions, 452 flow [2023-08-25 22:18:28,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:28,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:28,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:28,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 22:18:28,682 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err17ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:28,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:28,682 INFO L85 PathProgramCache]: Analyzing trace with hash 226838285, now seen corresponding path program 1 times [2023-08-25 22:18:28,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:28,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505742840] [2023-08-25 22:18:28,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:28,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:28,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505742840] [2023-08-25 22:18:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505742840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:28,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:28,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123942842] [2023-08-25 22:18:28,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:28,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:28,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:28,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:28,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:28,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 766 [2023-08-25 22:18:28,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 151 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:28,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:28,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 766 [2023-08-25 22:18:28,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:28,990 INFO L124 PetriNetUnfolderBase]: 2325/4955 cut-off events. [2023-08-25 22:18:28,990 INFO L125 PetriNetUnfolderBase]: For 1074/1074 co-relation queries the response was YES. [2023-08-25 22:18:28,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10548 conditions, 4955 events. 2325/4955 cut-off events. For 1074/1074 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 38659 event pairs, 560 based on Foata normal form. 0/4011 useless extension candidates. Maximal degree in co-relation 10541. Up to 2079 conditions per place. [2023-08-25 22:18:29,009 INFO L140 encePairwiseOnDemand]: 750/766 looper letters, 112 selfloop transitions, 10 changer transitions 0/188 dead transitions. [2023-08-25 22:18:29,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 188 transitions, 839 flow [2023-08-25 22:18:29,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2023-08-25 22:18:29,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39860748476936464 [2023-08-25 22:18:29,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 916 transitions. [2023-08-25 22:18:29,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 916 transitions. [2023-08-25 22:18:29,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:29,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 916 transitions. [2023-08-25 22:18:29,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,088 INFO L175 Difference]: Start difference. First operand has 141 places, 151 transitions, 452 flow. Second operand 3 states and 916 transitions. [2023-08-25 22:18:29,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 188 transitions, 839 flow [2023-08-25 22:18:29,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 188 transitions, 745 flow, removed 24 selfloop flow, removed 1 redundant places. [2023-08-25 22:18:29,096 INFO L231 Difference]: Finished difference. Result has 138 places, 153 transitions, 458 flow [2023-08-25 22:18:29,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=138, PETRI_TRANSITIONS=153} [2023-08-25 22:18:29,097 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -79 predicate places. [2023-08-25 22:18:29,097 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 153 transitions, 458 flow [2023-08-25 22:18:29,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:29,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:29,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 22:18:29,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err34ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:29,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1180223911, now seen corresponding path program 1 times [2023-08-25 22:18:29,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:29,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346184525] [2023-08-25 22:18:29,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:29,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346184525] [2023-08-25 22:18:29,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346184525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:29,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:29,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:29,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120773805] [2023-08-25 22:18:29,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:29,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:29,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:29,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:29,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:29,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 766 [2023-08-25 22:18:29,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 153 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:29,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 766 [2023-08-25 22:18:29,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:29,400 INFO L124 PetriNetUnfolderBase]: 2301/4932 cut-off events. [2023-08-25 22:18:29,401 INFO L125 PetriNetUnfolderBase]: For 903/903 co-relation queries the response was YES. [2023-08-25 22:18:29,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9879 conditions, 4932 events. 2301/4932 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 38466 event pairs, 1207 based on Foata normal form. 0/3992 useless extension candidates. Maximal degree in co-relation 9870. Up to 3427 conditions per place. [2023-08-25 22:18:29,424 INFO L140 encePairwiseOnDemand]: 763/766 looper letters, 90 selfloop transitions, 3 changer transitions 0/159 dead transitions. [2023-08-25 22:18:29,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 159 transitions, 661 flow [2023-08-25 22:18:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2023-08-25 22:18:29,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.376414273281114 [2023-08-25 22:18:29,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 865 transitions. [2023-08-25 22:18:29,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 865 transitions. [2023-08-25 22:18:29,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:29,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 865 transitions. [2023-08-25 22:18:29,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,448 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,448 INFO L175 Difference]: Start difference. First operand has 138 places, 153 transitions, 458 flow. Second operand 3 states and 865 transitions. [2023-08-25 22:18:29,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 159 transitions, 661 flow [2023-08-25 22:18:29,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 159 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:29,454 INFO L231 Difference]: Finished difference. Result has 137 places, 152 transitions, 442 flow [2023-08-25 22:18:29,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=137, PETRI_TRANSITIONS=152} [2023-08-25 22:18:29,455 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -80 predicate places. [2023-08-25 22:18:29,455 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 152 transitions, 442 flow [2023-08-25 22:18:29,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:29,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:29,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 22:18:29,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:29,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1221630101, now seen corresponding path program 1 times [2023-08-25 22:18:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:29,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553197347] [2023-08-25 22:18:29,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:29,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:29,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:29,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553197347] [2023-08-25 22:18:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553197347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:29,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:29,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:29,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017947933] [2023-08-25 22:18:29,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:29,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:29,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:29,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 766 [2023-08-25 22:18:29,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 152 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:29,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 766 [2023-08-25 22:18:29,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:29,884 INFO L124 PetriNetUnfolderBase]: 3765/6965 cut-off events. [2023-08-25 22:18:29,884 INFO L125 PetriNetUnfolderBase]: For 950/950 co-relation queries the response was YES. [2023-08-25 22:18:29,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14467 conditions, 6965 events. 3765/6965 cut-off events. For 950/950 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 50805 event pairs, 2136 based on Foata normal form. 0/5246 useless extension candidates. Maximal degree in co-relation 14458. Up to 5366 conditions per place. [2023-08-25 22:18:29,915 INFO L140 encePairwiseOnDemand]: 759/766 looper letters, 119 selfloop transitions, 6 changer transitions 0/194 dead transitions. [2023-08-25 22:18:29,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 194 transitions, 818 flow [2023-08-25 22:18:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2023-08-25 22:18:29,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39947780678851175 [2023-08-25 22:18:29,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 918 transitions. [2023-08-25 22:18:29,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 918 transitions. [2023-08-25 22:18:29,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:29,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 918 transitions. [2023-08-25 22:18:29,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,923 INFO L175 Difference]: Start difference. First operand has 137 places, 152 transitions, 442 flow. Second operand 3 states and 918 transitions. [2023-08-25 22:18:29,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 194 transitions, 818 flow [2023-08-25 22:18:29,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 194 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:29,929 INFO L231 Difference]: Finished difference. Result has 138 places, 157 transitions, 476 flow [2023-08-25 22:18:29,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=138, PETRI_TRANSITIONS=157} [2023-08-25 22:18:29,931 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -79 predicate places. [2023-08-25 22:18:29,931 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 157 transitions, 476 flow [2023-08-25 22:18:29,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:29,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:29,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 22:18:29,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err18ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:29,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1329183605, now seen corresponding path program 1 times [2023-08-25 22:18:29,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:29,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627801459] [2023-08-25 22:18:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:29,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:29,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:29,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627801459] [2023-08-25 22:18:29,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627801459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:29,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:29,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278586985] [2023-08-25 22:18:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:29,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:29,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:29,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:29,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:29,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 766 [2023-08-25 22:18:29,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 157 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:29,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:29,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 766 [2023-08-25 22:18:29,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:30,409 INFO L124 PetriNetUnfolderBase]: 3776/7000 cut-off events. [2023-08-25 22:18:30,409 INFO L125 PetriNetUnfolderBase]: For 1359/1359 co-relation queries the response was YES. [2023-08-25 22:18:30,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15282 conditions, 7000 events. 3776/7000 cut-off events. For 1359/1359 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 51107 event pairs, 2255 based on Foata normal form. 0/5270 useless extension candidates. Maximal degree in co-relation 15272. Up to 5638 conditions per place. [2023-08-25 22:18:30,444 INFO L140 encePairwiseOnDemand]: 761/766 looper letters, 96 selfloop transitions, 4 changer transitions 0/169 dead transitions. [2023-08-25 22:18:30,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 169 transitions, 709 flow [2023-08-25 22:18:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2023-08-25 22:18:30,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3877284595300261 [2023-08-25 22:18:30,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 891 transitions. [2023-08-25 22:18:30,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 891 transitions. [2023-08-25 22:18:30,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:30,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 891 transitions. [2023-08-25 22:18:30,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,451 INFO L175 Difference]: Start difference. First operand has 138 places, 157 transitions, 476 flow. Second operand 3 states and 891 transitions. [2023-08-25 22:18:30,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 169 transitions, 709 flow [2023-08-25 22:18:30,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 169 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 22:18:30,461 INFO L231 Difference]: Finished difference. Result has 140 places, 160 transitions, 500 flow [2023-08-25 22:18:30,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=140, PETRI_TRANSITIONS=160} [2023-08-25 22:18:30,462 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -77 predicate places. [2023-08-25 22:18:30,462 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 160 transitions, 500 flow [2023-08-25 22:18:30,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:30,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:30,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 22:18:30,463 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err42ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:30,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2117273893, now seen corresponding path program 1 times [2023-08-25 22:18:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178563266] [2023-08-25 22:18:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:30,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:30,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178563266] [2023-08-25 22:18:30,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178563266] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:30,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:30,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650196571] [2023-08-25 22:18:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:30,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:30,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:30,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 766 [2023-08-25 22:18:30,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 160 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:30,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 766 [2023-08-25 22:18:30,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:30,810 INFO L124 PetriNetUnfolderBase]: 2586/5476 cut-off events. [2023-08-25 22:18:30,810 INFO L125 PetriNetUnfolderBase]: For 1189/1328 co-relation queries the response was YES. [2023-08-25 22:18:30,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11494 conditions, 5476 events. 2586/5476 cut-off events. For 1189/1328 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 42478 event pairs, 1262 based on Foata normal form. 49/4534 useless extension candidates. Maximal degree in co-relation 11483. Up to 3830 conditions per place. [2023-08-25 22:18:30,828 INFO L140 encePairwiseOnDemand]: 763/766 looper letters, 94 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2023-08-25 22:18:30,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 166 transitions, 713 flow [2023-08-25 22:18:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2023-08-25 22:18:30,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3772845953002611 [2023-08-25 22:18:30,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 867 transitions. [2023-08-25 22:18:30,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 867 transitions. [2023-08-25 22:18:30,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:30,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 867 transitions. [2023-08-25 22:18:30,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,835 INFO L175 Difference]: Start difference. First operand has 140 places, 160 transitions, 500 flow. Second operand 3 states and 867 transitions. [2023-08-25 22:18:30,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 166 transitions, 713 flow [2023-08-25 22:18:30,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 166 transitions, 705 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-25 22:18:30,841 INFO L231 Difference]: Finished difference. Result has 140 places, 159 transitions, 494 flow [2023-08-25 22:18:30,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=140, PETRI_TRANSITIONS=159} [2023-08-25 22:18:30,841 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -77 predicate places. [2023-08-25 22:18:30,841 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 159 transitions, 494 flow [2023-08-25 22:18:30,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:30,842 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:30,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 22:18:30,842 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err34ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:30,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1144446108, now seen corresponding path program 1 times [2023-08-25 22:18:30,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:30,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009333381] [2023-08-25 22:18:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:30,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:18:30,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:30,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009333381] [2023-08-25 22:18:30,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009333381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:30,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:30,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:30,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594364941] [2023-08-25 22:18:30,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:30,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:30,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:30,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:30,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 766 [2023-08-25 22:18:30,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 159 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:30,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 766 [2023-08-25 22:18:30,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:31,162 INFO L124 PetriNetUnfolderBase]: 2562/5436 cut-off events. [2023-08-25 22:18:31,162 INFO L125 PetriNetUnfolderBase]: For 1198/1333 co-relation queries the response was YES. [2023-08-25 22:18:31,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11420 conditions, 5436 events. 2562/5436 cut-off events. For 1198/1333 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 42224 event pairs, 1248 based on Foata normal form. 47/4512 useless extension candidates. Maximal degree in co-relation 11409. Up to 3778 conditions per place. [2023-08-25 22:18:31,185 INFO L140 encePairwiseOnDemand]: 763/766 looper letters, 92 selfloop transitions, 3 changer transitions 0/165 dead transitions. [2023-08-25 22:18:31,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 165 transitions, 700 flow [2023-08-25 22:18:31,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2023-08-25 22:18:31,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3751087902523934 [2023-08-25 22:18:31,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 862 transitions. [2023-08-25 22:18:31,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 862 transitions. [2023-08-25 22:18:31,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:31,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 862 transitions. [2023-08-25 22:18:31,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:31,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:31,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:31,192 INFO L175 Difference]: Start difference. First operand has 140 places, 159 transitions, 494 flow. Second operand 3 states and 862 transitions. [2023-08-25 22:18:31,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 165 transitions, 700 flow [2023-08-25 22:18:31,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 165 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:31,198 INFO L231 Difference]: Finished difference. Result has 139 places, 158 transitions, 494 flow [2023-08-25 22:18:31,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=139, PETRI_TRANSITIONS=158} [2023-08-25 22:18:31,199 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -78 predicate places. [2023-08-25 22:18:31,199 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 158 transitions, 494 flow [2023-08-25 22:18:31,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:31,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:31,200 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:31,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 22:18:31,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:31,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:31,200 INFO L85 PathProgramCache]: Analyzing trace with hash 288324130, now seen corresponding path program 1 times [2023-08-25 22:18:31,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:31,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862582558] [2023-08-25 22:18:31,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:31,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:18:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862582558] [2023-08-25 22:18:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862582558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:31,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:31,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455267461] [2023-08-25 22:18:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:31,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:31,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:31,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 766 [2023-08-25 22:18:31,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 158 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:31,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:31,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 766 [2023-08-25 22:18:31,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:31,652 INFO L124 PetriNetUnfolderBase]: 3892/7246 cut-off events. [2023-08-25 22:18:31,652 INFO L125 PetriNetUnfolderBase]: For 1698/1698 co-relation queries the response was YES. [2023-08-25 22:18:31,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16008 conditions, 7246 events. 3892/7246 cut-off events. For 1698/1698 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 53159 event pairs, 2100 based on Foata normal form. 0/5545 useless extension candidates. Maximal degree in co-relation 15997. Up to 5574 conditions per place. [2023-08-25 22:18:31,680 INFO L140 encePairwiseOnDemand]: 759/766 looper letters, 125 selfloop transitions, 8 changer transitions 0/200 dead transitions. [2023-08-25 22:18:31,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 200 transitions, 895 flow [2023-08-25 22:18:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2023-08-25 22:18:31,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39947780678851175 [2023-08-25 22:18:31,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 918 transitions. [2023-08-25 22:18:31,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 918 transitions. [2023-08-25 22:18:31,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:31,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 918 transitions. [2023-08-25 22:18:31,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:31,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:31,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:31,687 INFO L175 Difference]: Start difference. First operand has 139 places, 158 transitions, 494 flow. Second operand 3 states and 918 transitions. [2023-08-25 22:18:31,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 200 transitions, 895 flow [2023-08-25 22:18:31,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 200 transitions, 889 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:31,693 INFO L231 Difference]: Finished difference. Result has 140 places, 163 transitions, 538 flow [2023-08-25 22:18:31,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=140, PETRI_TRANSITIONS=163} [2023-08-25 22:18:31,693 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -77 predicate places. [2023-08-25 22:18:31,694 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 163 transitions, 538 flow [2023-08-25 22:18:31,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:31,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:31,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:31,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 22:18:31,694 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err21ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:31,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:31,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1893457105, now seen corresponding path program 1 times [2023-08-25 22:18:31,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:31,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367511914] [2023-08-25 22:18:31,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:31,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:31,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:31,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367511914] [2023-08-25 22:18:31,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367511914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:31,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:31,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:31,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016666094] [2023-08-25 22:18:31,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:31,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:31,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:31,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:31,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:31,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 766 [2023-08-25 22:18:31,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 163 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:31,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:31,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 766 [2023-08-25 22:18:31,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:32,461 INFO L124 PetriNetUnfolderBase]: 6471/13179 cut-off events. [2023-08-25 22:18:32,461 INFO L125 PetriNetUnfolderBase]: For 4675/4675 co-relation queries the response was YES. [2023-08-25 22:18:32,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29475 conditions, 13179 events. 6471/13179 cut-off events. For 4675/4675 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 111293 event pairs, 1666 based on Foata normal form. 0/10638 useless extension candidates. Maximal degree in co-relation 29463. Up to 5087 conditions per place. [2023-08-25 22:18:32,514 INFO L140 encePairwiseOnDemand]: 750/766 looper letters, 161 selfloop transitions, 21 changer transitions 0/249 dead transitions. [2023-08-25 22:18:32,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 249 transitions, 1223 flow [2023-08-25 22:18:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2023-08-25 22:18:32,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186248912097476 [2023-08-25 22:18:32,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 962 transitions. [2023-08-25 22:18:32,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 962 transitions. [2023-08-25 22:18:32,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:32,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 962 transitions. [2023-08-25 22:18:32,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:32,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:32,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:32,552 INFO L175 Difference]: Start difference. First operand has 140 places, 163 transitions, 538 flow. Second operand 3 states and 962 transitions. [2023-08-25 22:18:32,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 249 transitions, 1223 flow [2023-08-25 22:18:32,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 249 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 22:18:32,576 INFO L231 Difference]: Finished difference. Result has 143 places, 181 transitions, 738 flow [2023-08-25 22:18:32,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=143, PETRI_TRANSITIONS=181} [2023-08-25 22:18:32,577 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -74 predicate places. [2023-08-25 22:18:32,578 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 181 transitions, 738 flow [2023-08-25 22:18:32,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:32,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:32,578 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:32,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 22:18:32,578 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err42ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:32,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash 544354496, now seen corresponding path program 1 times [2023-08-25 22:18:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:32,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593851030] [2023-08-25 22:18:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:32,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:18:32,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:32,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593851030] [2023-08-25 22:18:32,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593851030] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:32,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:32,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:32,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103971547] [2023-08-25 22:18:32,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:32,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:32,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:32,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:32,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:32,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 766 [2023-08-25 22:18:32,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 181 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:32,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:32,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 766 [2023-08-25 22:18:32,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:33,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [72#L712true, Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 390#true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,276 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-25 22:18:33,276 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-25 22:18:33,276 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 22:18:33,276 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 22:18:33,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 390#true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 249#L712-1true, 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,292 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-25 22:18:33,292 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 22:18:33,292 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 22:18:33,292 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-25 22:18:33,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, 398#(= |thr1Thread1of2ForFork0_akbd_clear_state_#t~nondet7#1| |#race~buf~0|), thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,293 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-25 22:18:33,293 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 22:18:33,293 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 22:18:33,293 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-25 22:18:33,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 9#L734true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 390#true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,294 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-25 22:18:33,294 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 22:18:33,294 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 22:18:33,294 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-25 22:18:33,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 136#L713-10true, 337#L722true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,306 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-25 22:18:33,306 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-25 22:18:33,306 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-25 22:18:33,306 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 22:18:33,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 390#true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 244#L734-1true, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,307 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-25 22:18:33,307 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 22:18:33,307 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-25 22:18:33,307 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-25 22:18:33,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [72#L712true, Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 390#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,314 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-25 22:18:33,314 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-25 22:18:33,315 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-25 22:18:33,315 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-25 22:18:33,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2450] L713-2-->L713-3: Formula: (= |v_thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1_5| |v_#race~COND~0_4|) InVars {thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1=|v_thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1_5|} OutVars{thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1=|v_thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1_5|, #race~COND~0=|v_#race~COND~0_4|} AuxVars[] AssignedVars[#race~COND~0][163], [Black: 380#true, 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 16#L713-3true, 302#L713-8true, Black: 390#true, Black: 425#(= |#race~COND~0| 0), Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 423#true, 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,320 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-25 22:18:33,320 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-25 22:18:33,320 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-25 22:18:33,320 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-25 22:18:33,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), 233#L713-2true, Black: 390#true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,320 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-25 22:18:33,320 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-25 22:18:33,320 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-25 22:18:33,320 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-25 22:18:33,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [326#L715true, Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 390#true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,320 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-25 22:18:33,321 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-25 22:18:33,321 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-25 22:18:33,321 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-25 22:18:33,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), 386#true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 82#L724-2true, 429#true]) [2023-08-25 22:18:33,322 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-25 22:18:33,322 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-25 22:18:33,322 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-25 22:18:33,322 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-25 22:18:33,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 390#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 249#L712-1true, 377#true, 429#true]) [2023-08-25 22:18:33,327 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:33,327 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,327 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-25 22:18:33,327 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 22:18:33,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, 398#(= |thr1Thread1of2ForFork0_akbd_clear_state_#t~nondet7#1| |#race~buf~0|), thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,328 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:33,328 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,328 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 22:18:33,328 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-25 22:18:33,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 9#L734true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 390#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,329 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:33,329 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,329 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-25 22:18:33,329 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 22:18:33,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), 118#L703-1true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,331 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:33,331 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,331 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,331 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 22:18:33,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), 205#L711-1true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,332 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:33,332 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 22:18:33,332 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,332 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 390#true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 301#L715-1true, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,333 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:33,333 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 22:18:33,360 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-25 22:18:33,361 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true, 144#L708-1true]) [2023-08-25 22:18:33,361 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:33,361 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,361 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 22:18:33,361 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 12#L720-1true, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,362 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:33,362 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,362 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,362 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 22:18:33,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), 386#true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 245#L735-1true, 429#true, 230#L743-5true]) [2023-08-25 22:18:33,363 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:33,363 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,363 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 22:18:33,363 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 58#L734-4true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,363 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:33,363 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,363 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 22:18:33,363 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-25 22:18:33,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 343#L743-4true, 136#L713-10true, 337#L722true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,370 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:33,370 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-25 22:18:33,370 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 22:18:33,370 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-25 22:18:33,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 390#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 244#L734-1true, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,370 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:33,370 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-25 22:18:33,370 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 22:18:33,370 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-25 22:18:33,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, 143#L733-1true, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,373 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:33,373 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 22:18:33,373 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-25 22:18:33,373 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 22:18:33,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), 254#L735true, Black: 392#(= |#race~buf~0| 0), Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,374 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:33,374 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-25 22:18:33,374 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 22:18:33,374 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2450] L713-2-->L713-3: Formula: (= |v_thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1_5| |v_#race~COND~0_4|) InVars {thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1=|v_thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1_5|} OutVars{thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1=|v_thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1_5|, #race~COND~0=|v_#race~COND~0_4|} AuxVars[] AssignedVars[#race~COND~0][163], [Black: 380#true, 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 16#L713-3true, 302#L713-8true, Black: 390#true, Black: 425#(= |#race~COND~0| 0), 343#L743-4true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 423#true, 377#true, 429#true]) [2023-08-25 22:18:33,378 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 233#L713-2true, Black: 390#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,378 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [326#L715true, Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 390#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,378 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-25 22:18:33,378 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-25 22:18:33,379 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-25 22:18:33,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), 386#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true, 82#L724-2true]) [2023-08-25 22:18:33,380 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:33,380 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-25 22:18:33,380 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-25 22:18:33,380 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-25 22:18:33,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 118#L703-1true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,400 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:33,400 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,400 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,400 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 22:18:33,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), 205#L711-1true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,401 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:33,401 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,401 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 22:18:33,401 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 390#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 301#L715-1true, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,401 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:33,401 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,401 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 22:18:33,401 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-25 22:18:33,402 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true, 144#L708-1true]) [2023-08-25 22:18:33,402 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:33,402 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 22:18:33,402 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,402 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,402 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 12#L720-1true, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,402 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:33,402 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,403 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 22:18:33,403 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), 386#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 245#L735-1true, 377#true, 429#true]) [2023-08-25 22:18:33,403 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:33,403 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 22:18:33,403 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,403 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 58#L734-4true, 429#true]) [2023-08-25 22:18:33,404 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:33,404 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,404 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-25 22:18:33,404 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 22:18:33,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), 79#L703-6true, Black: 392#(= |#race~buf~0| 0), Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,406 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:33,406 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 22:18:33,406 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,406 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 22:18:33,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, 143#L733-1true, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,410 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:33,410 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 22:18:33,410 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 22:18:33,410 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 22:18:33,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), Black: 392#(= |#race~buf~0| 0), 254#L735true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,411 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:33,411 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 22:18:33,411 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-25 22:18:33,411 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 22:18:33,413 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), 131#L704true, Black: 392#(= |#race~buf~0| 0), 386#true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,413 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:33,413 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 22:18:33,413 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 22:18:33,413 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 22:18:33,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), 386#true, 117#L705-1true, Black: 423#true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 230#L743-5true, 429#true]) [2023-08-25 22:18:33,417 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:33,417 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 22:18:33,417 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-25 22:18:33,417 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 22:18:33,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2373] L705-1-->L705-2: Formula: (= |v_#race~COND~0_1| |v_thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1_5|) InVars {thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1=|v_thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1_5|} OutVars{thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1=|v_thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1_5|, #race~COND~0=|v_#race~COND~0_1|} AuxVars[] AssignedVars[#race~COND~0][156], [Black: 382#(= |#race~MTX~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 302#L713-8true, Black: 392#(= |#race~buf~0| 0), 386#true, Black: 425#(= |#race~COND~0| 0), 124#L705-2true, thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 423#true, 377#true, 230#L743-5true, 429#true, 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|)]) [2023-08-25 22:18:33,417 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:33,417 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 22:18:33,417 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-25 22:18:33,417 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 22:18:33,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 380#true, 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 79#L703-6true, Black: 392#(= |#race~buf~0| 0), Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,419 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-25 22:18:33,419 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-25 22:18:33,419 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-25 22:18:33,419 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-25 22:18:33,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 131#L704true, Black: 392#(= |#race~buf~0| 0), 386#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,421 INFO L294 olderBase$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-25 22:18:33,421 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-25 22:18:33,421 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-25 22:18:33,422 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-25 22:18:33,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2760] L713-8-->L713-10: Formula: (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133| 0)) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123| (mod v_~COND~0_221 256))) InVars {~COND~0=v_~COND~0_221} OutVars{thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_123|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_133|, ~COND~0=v_~COND~0_221} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][127], [Black: 382#(= |#race~MTX~0| 0), 425#(= |#race~COND~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 117#L705-1true, Black: 392#(= |#race~buf~0| 0), 386#true, Black: 423#true, 343#L743-4true, 136#L713-10true, Black: 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 377#true, 429#true]) [2023-08-25 22:18:33,424 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-25 22:18:33,424 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,424 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-25 22:18:33,425 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-25 22:18:33,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2373] L705-1-->L705-2: Formula: (= |v_#race~COND~0_1| |v_thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1_5|) InVars {thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1=|v_thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1_5|} OutVars{thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1=|v_thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1_5|, #race~COND~0=|v_#race~COND~0_1|} AuxVars[] AssignedVars[#race~COND~0][156], [Black: 382#(= |#race~MTX~0| 0), Black: 420#(= |#race~COND~0| |thr1Thread2of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1|), 302#L713-8true, 386#true, Black: 425#(= |#race~COND~0| 0), Black: 392#(= |#race~buf~0| 0), 343#L743-4true, 124#L705-2true, thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 407#(= |#race~COND~0| |thr1Thread1of2ForFork0_akbd_read_char_#t~nondet6#1|), 423#true, 377#true, 429#true, 402#(= |thr1Thread1of2ForFork0_adb_kbd_receive_packet_#t~nondet5#1| |#race~COND~0|)]) [2023-08-25 22:18:33,425 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-25 22:18:33,425 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-25 22:18:33,425 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-25 22:18:33,425 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-25 22:18:33,426 INFO L124 PetriNetUnfolderBase]: 5955/12334 cut-off events. [2023-08-25 22:18:33,427 INFO L125 PetriNetUnfolderBase]: For 6672/7079 co-relation queries the response was YES. [2023-08-25 22:18:33,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28132 conditions, 12334 events. 5955/12334 cut-off events. For 6672/7079 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 104539 event pairs, 2560 based on Foata normal form. 43/10463 useless extension candidates. Maximal degree in co-relation 28119. Up to 8586 conditions per place. [2023-08-25 22:18:33,480 INFO L140 encePairwiseOnDemand]: 763/766 looper letters, 94 selfloop transitions, 2 changer transitions 1/187 dead transitions. [2023-08-25 22:18:33,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 187 transitions, 948 flow [2023-08-25 22:18:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2023-08-25 22:18:33,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37597911227154046 [2023-08-25 22:18:33,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 864 transitions. [2023-08-25 22:18:33,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 864 transitions. [2023-08-25 22:18:33,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:33,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 864 transitions. [2023-08-25 22:18:33,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:33,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:33,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:33,487 INFO L175 Difference]: Start difference. First operand has 143 places, 181 transitions, 738 flow. Second operand 3 states and 864 transitions. [2023-08-25 22:18:33,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 187 transitions, 948 flow [2023-08-25 22:18:33,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 187 transitions, 906 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:33,500 INFO L231 Difference]: Finished difference. Result has 142 places, 180 transitions, 698 flow [2023-08-25 22:18:33,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=142, PETRI_TRANSITIONS=180} [2023-08-25 22:18:33,501 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -75 predicate places. [2023-08-25 22:18:33,501 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 180 transitions, 698 flow [2023-08-25 22:18:33,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:33,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:33,502 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:33,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-25 22:18:33,502 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err18ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:33,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:33,502 INFO L85 PathProgramCache]: Analyzing trace with hash -821710130, now seen corresponding path program 1 times [2023-08-25 22:18:33,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:33,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416441637] [2023-08-25 22:18:33,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:18:33,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416441637] [2023-08-25 22:18:33,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416441637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:33,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:33,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:33,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636136255] [2023-08-25 22:18:33,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:33,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:33,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:33,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:33,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 766 [2023-08-25 22:18:33,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 180 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:33,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:33,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 766 [2023-08-25 22:18:33,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:34,253 INFO L124 PetriNetUnfolderBase]: 6455/13093 cut-off events. [2023-08-25 22:18:34,253 INFO L125 PetriNetUnfolderBase]: For 6040/6040 co-relation queries the response was YES. [2023-08-25 22:18:34,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30673 conditions, 13093 events. 6455/13093 cut-off events. For 6040/6040 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 110520 event pairs, 3209 based on Foata normal form. 0/10572 useless extension candidates. Maximal degree in co-relation 30660. Up to 9505 conditions per place. [2023-08-25 22:18:34,301 INFO L140 encePairwiseOnDemand]: 760/766 looper letters, 121 selfloop transitions, 8 changer transitions 0/195 dead transitions. [2023-08-25 22:18:34,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 195 transitions, 1011 flow [2023-08-25 22:18:34,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2023-08-25 22:18:34,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38816362053959963 [2023-08-25 22:18:34,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 892 transitions. [2023-08-25 22:18:34,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 892 transitions. [2023-08-25 22:18:34,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:34,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 892 transitions. [2023-08-25 22:18:34,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:34,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:34,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:34,307 INFO L175 Difference]: Start difference. First operand has 142 places, 180 transitions, 698 flow. Second operand 3 states and 892 transitions. [2023-08-25 22:18:34,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 195 transitions, 1011 flow [2023-08-25 22:18:34,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 195 transitions, 1007 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:34,318 INFO L231 Difference]: Finished difference. Result has 144 places, 184 transitions, 757 flow [2023-08-25 22:18:34,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=757, PETRI_PLACES=144, PETRI_TRANSITIONS=184} [2023-08-25 22:18:34,318 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -73 predicate places. [2023-08-25 22:18:34,318 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 184 transitions, 757 flow [2023-08-25 22:18:34,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:34,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:34,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:34,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 22:18:34,319 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err16ASSERT_VIOLATIONASSERT === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:34,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1170706262, now seen corresponding path program 1 times [2023-08-25 22:18:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:34,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767323214] [2023-08-25 22:18:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:34,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:34,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767323214] [2023-08-25 22:18:34,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767323214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:34,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:34,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 22:18:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967805445] [2023-08-25 22:18:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:34,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:34,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:34,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:34,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 766 [2023-08-25 22:18:34,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 184 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:34,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:34,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 766 [2023-08-25 22:18:34,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:35,182 INFO L124 PetriNetUnfolderBase]: 6741/14602 cut-off events. [2023-08-25 22:18:35,182 INFO L125 PetriNetUnfolderBase]: For 5265/5705 co-relation queries the response was YES. [2023-08-25 22:18:35,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32108 conditions, 14602 events. 6741/14602 cut-off events. For 5265/5705 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 131170 event pairs, 704 based on Foata normal form. 100/12325 useless extension candidates. Maximal degree in co-relation 32094. Up to 7370 conditions per place. [2023-08-25 22:18:35,237 INFO L140 encePairwiseOnDemand]: 756/766 looper letters, 130 selfloop transitions, 8 changer transitions 0/248 dead transitions. [2023-08-25 22:18:35,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 248 transitions, 1271 flow [2023-08-25 22:18:35,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2023-08-25 22:18:35,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4208006962576153 [2023-08-25 22:18:35,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 967 transitions. [2023-08-25 22:18:35,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 967 transitions. [2023-08-25 22:18:35,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:35,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 967 transitions. [2023-08-25 22:18:35,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:35,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:35,243 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:35,243 INFO L175 Difference]: Start difference. First operand has 144 places, 184 transitions, 757 flow. Second operand 3 states and 967 transitions. [2023-08-25 22:18:35,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 248 transitions, 1271 flow [2023-08-25 22:18:35,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 248 transitions, 1249 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:35,257 INFO L231 Difference]: Finished difference. Result has 146 places, 192 transitions, 805 flow [2023-08-25 22:18:35,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=766, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=146, PETRI_TRANSITIONS=192} [2023-08-25 22:18:35,257 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -71 predicate places. [2023-08-25 22:18:35,257 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 192 transitions, 805 flow [2023-08-25 22:18:35,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:35,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:35,258 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:35,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-25 22:18:35,258 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err36ASSERT_VIOLATIONDATA_RACE, thr1Err29ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2023-08-25 22:18:35,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:35,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1204067207, now seen corresponding path program 1 times [2023-08-25 22:18:35,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007765444] [2023-08-25 22:18:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:35,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 22:18:35,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 22:18:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 22:18:35,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 22:18:35,276 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 22:18:35,276 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (134 of 135 remaining) [2023-08-25 22:18:35,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36ASSERT_VIOLATIONDATA_RACE (133 of 135 remaining) [2023-08-25 22:18:35,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29ASSERT_VIOLATIONDATA_RACE (132 of 135 remaining) [2023-08-25 22:18:35,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (131 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (130 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err42ASSERT_VIOLATIONDATA_RACE (129 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (128 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONASSERT (127 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31ASSERT_VIOLATIONDATA_RACE (126 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (125 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (124 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONASSERT (123 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (122 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (121 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28ASSERT_VIOLATIONDATA_RACE (120 of 135 remaining) [2023-08-25 22:18:35,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (119 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (118 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err41ASSERT_VIOLATIONDATA_RACE (117 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (116 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27ASSERT_VIOLATIONDATA_RACE (115 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONASSERT (114 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (113 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (112 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32ASSERT_VIOLATIONDATA_RACE (111 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (110 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36ASSERT_VIOLATIONDATA_RACE (109 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err39ASSERT_VIOLATIONDATA_RACE (108 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (107 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (106 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37ASSERT_VIOLATIONDATA_RACE (105 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32ASSERT_VIOLATIONDATA_RACE (104 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37ASSERT_VIOLATIONDATA_RACE (103 of 135 remaining) [2023-08-25 22:18:35,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (102 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38ASSERT_VIOLATIONDATA_RACE (101 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (100 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31ASSERT_VIOLATIONDATA_RACE (99 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (98 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (97 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (96 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33ASSERT_VIOLATIONASSERT (95 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (94 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err40ASSERT_VIOLATIONASSERT (93 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err40ASSERT_VIOLATIONASSERT (92 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37ASSERT_VIOLATIONDATA_RACE (91 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28ASSERT_VIOLATIONDATA_RACE (90 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (89 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err41ASSERT_VIOLATIONDATA_RACE (88 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err43ASSERT_VIOLATIONDATA_RACE (87 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (86 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (85 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err42ASSERT_VIOLATIONDATA_RACE (84 of 135 remaining) [2023-08-25 22:18:35,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (83 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29ASSERT_VIOLATIONDATA_RACE (82 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (81 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (80 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38ASSERT_VIOLATIONDATA_RACE (79 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29ASSERT_VIOLATIONDATA_RACE (78 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34ASSERT_VIOLATIONDATA_RACE (77 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26ASSERT_VIOLATIONDATA_RACE (76 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (75 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err43ASSERT_VIOLATIONDATA_RACE (74 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (73 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (72 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32ASSERT_VIOLATIONDATA_RACE (71 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (70 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (69 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (68 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (67 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (66 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err41ASSERT_VIOLATIONDATA_RACE (65 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35ASSERT_VIOLATIONDATA_RACE (64 of 135 remaining) [2023-08-25 22:18:35,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (63 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (62 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (61 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34ASSERT_VIOLATIONDATA_RACE (60 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26ASSERT_VIOLATIONDATA_RACE (59 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (58 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30ASSERT_VIOLATIONDATA_RACE (57 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err44ASSERT_VIOLATIONDATA_RACE (56 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err39ASSERT_VIOLATIONDATA_RACE (55 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27ASSERT_VIOLATIONDATA_RACE (54 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (53 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (52 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (51 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONASSERT (50 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err39ASSERT_VIOLATIONDATA_RACE (49 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35ASSERT_VIOLATIONDATA_RACE (48 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (47 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (46 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (45 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (44 of 135 remaining) [2023-08-25 22:18:35,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (43 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err44ASSERT_VIOLATIONDATA_RACE (42 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (41 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36ASSERT_VIOLATIONDATA_RACE (40 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35ASSERT_VIOLATIONDATA_RACE (39 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (38 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONASSERT (37 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30ASSERT_VIOLATIONDATA_RACE (36 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err42ASSERT_VIOLATIONDATA_RACE (35 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30ASSERT_VIOLATIONDATA_RACE (34 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (33 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34ASSERT_VIOLATIONDATA_RACE (32 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28ASSERT_VIOLATIONDATA_RACE (31 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33ASSERT_VIOLATIONASSERT (29 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27ASSERT_VIOLATIONDATA_RACE (28 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (27 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (26 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (25 of 135 remaining) [2023-08-25 22:18:35,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38ASSERT_VIOLATIONDATA_RACE (24 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (23 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26ASSERT_VIOLATIONDATA_RACE (20 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (17 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (16 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err43ASSERT_VIOLATIONDATA_RACE (15 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (13 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (12 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (11 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (10 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33ASSERT_VIOLATIONASSERT (9 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err44ASSERT_VIOLATIONDATA_RACE (8 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (7 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err40ASSERT_VIOLATIONASSERT (6 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (5 of 135 remaining) [2023-08-25 22:18:35,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONASSERT (4 of 135 remaining) [2023-08-25 22:18:35,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (3 of 135 remaining) [2023-08-25 22:18:35,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 135 remaining) [2023-08-25 22:18:35,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31ASSERT_VIOLATIONDATA_RACE (1 of 135 remaining) [2023-08-25 22:18:35,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (0 of 135 remaining) [2023-08-25 22:18:35,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-25 22:18:35,284 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:35,284 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-25 22:18:35,286 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-25 22:18:35,286 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 22:18:35,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 10:18:35 BasicIcfg [2023-08-25 22:18:35,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 22:18:35,325 INFO L158 Benchmark]: Toolchain (without parser) took 24664.93ms. Allocated memory was 354.4MB in the beginning and 1.3GB in the end (delta: 926.9MB). Free memory was 329.5MB in the beginning and 854.8MB in the end (delta: -525.3MB). Peak memory consumption was 402.2MB. Max. memory is 16.0GB. [2023-08-25 22:18:35,325 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 354.4MB. Free memory is still 331.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 22:18:35,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.06ms. Allocated memory is still 354.4MB. Free memory was 329.5MB in the beginning and 309.5MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-25 22:18:35,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.82ms. Allocated memory is still 354.4MB. Free memory was 309.1MB in the beginning and 306.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 22:18:35,326 INFO L158 Benchmark]: Boogie Preprocessor took 33.79ms. Allocated memory is still 354.4MB. Free memory was 306.4MB in the beginning and 304.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 22:18:35,326 INFO L158 Benchmark]: RCFGBuilder took 686.20ms. Allocated memory is still 354.4MB. Free memory was 303.8MB in the beginning and 301.8MB in the end (delta: 2.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-25 22:18:35,326 INFO L158 Benchmark]: TraceAbstraction took 23519.06ms. Allocated memory was 354.4MB in the beginning and 1.3GB in the end (delta: 926.9MB). Free memory was 301.8MB in the beginning and 854.8MB in the end (delta: -553.0MB). Peak memory consumption was 372.8MB. Max. memory is 16.0GB. [2023-08-25 22:18:35,327 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 354.4MB. Free memory is still 331.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 379.06ms. Allocated memory is still 354.4MB. Free memory was 329.5MB in the beginning and 309.5MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.82ms. Allocated memory is still 354.4MB. Free memory was 309.1MB in the beginning and 306.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.79ms. Allocated memory is still 354.4MB. Free memory was 306.4MB in the beginning and 304.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 686.20ms. Allocated memory is still 354.4MB. Free memory was 303.8MB in the beginning and 301.8MB in the end (delta: 2.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 23519.06ms. Allocated memory was 354.4MB in the beginning and 1.3GB in the end (delta: 926.9MB). Free memory was 301.8MB in the beginning and 854.8MB in the end (delta: -553.0MB). Peak memory consumption was 372.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 254]: Unsoundness Warning unspecified type, defaulting to int C: short [254] - GenericResultAtLocation [Line: 254]: Unsoundness Warning unspecified type, defaulting to int C: short [254] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 200 PlacesBefore, 59 PlacesAfterwards, 221 TransitionsBefore, 62 TransitionsAfterwards, 5044 CoEnabledTransitionPairs, 9 FixpointIterations, 12 TrivialSequentialCompositions, 287 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 18 ChoiceCompositions, 348 TotalNumberOfCompositions, 5417 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5417, independent: 5417, independent conditional: 0, independent unconditional: 5417, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2573, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5417, independent: 2844, independent conditional: 0, independent unconditional: 2844, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2573, unknown conditional: 0, unknown unconditional: 2573] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 200 PlacesBefore, 59 PlacesAfterwards, 221 TransitionsBefore, 62 TransitionsAfterwards, 5044 CoEnabledTransitionPairs, 9 FixpointIterations, 12 TrivialSequentialCompositions, 268 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 18 ChoiceCompositions, 329 TotalNumberOfCompositions, 5293 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5293, independent: 5293, independent conditional: 0, independent unconditional: 5293, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2537, independent: 2537, independent conditional: 0, independent unconditional: 2537, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5293, independent: 2756, independent conditional: 0, independent unconditional: 2756, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2537, unknown conditional: 0, unknown unconditional: 2537] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 374 PlacesBefore, 217 PlacesAfterwards, 416 TransitionsBefore, 247 TransitionsAfterwards, 85748 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 260 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 66 ConcurrentYvCompositions, 12 ChoiceCompositions, 350 TotalNumberOfCompositions, 370792 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 107546, independent: 105405, independent conditional: 0, independent unconditional: 105405, dependent: 2141, dependent conditional: 0, dependent unconditional: 2141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43604, independent: 43154, independent conditional: 0, independent unconditional: 43154, dependent: 450, dependent conditional: 0, dependent unconditional: 450, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 107546, independent: 62251, independent conditional: 0, independent unconditional: 62251, dependent: 1691, dependent conditional: 0, dependent unconditional: 1691, unknown: 43604, unknown conditional: 0, unknown unconditional: 43604] , Statistics on independence cache: Total cache size (in pairs): 5245, Positive cache size: 5025, Positive conditional cache size: 0, Positive unconditional cache size: 5025, Negative cache size: 220, Negative conditional cache size: 0, Negative unconditional cache size: 220, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - DataRaceFoundResult [Line: 705]: Data race detected Data race detected The following path leads to a data race: [L689] 0 volatile _Bool MTX = !1; [L690] 0 _Bool COND = 0; [L691] 0 _Bool buf = 0; [L742] 0 pthread_t t; VAL [COND=0, MTX=0, buf=0, t={3:0}] [L743] COND TRUE 0 1 [L743] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=0, buf=0, pthread_create(&t, 0, thr1, 0)=-1, t={3:0}] [L743] COND TRUE 0 1 [L724] COND TRUE 1 1 [L728] 1 case 0: [L728] CALL 1 adb_kbd_receive_packet() [L703] CALL 1 __VERIFIER_atomic_acquire() [L694] EXPR 1 MTX==0 [L694] CALL 1 assume_abort_if_not(MTX==0) [L4] COND FALSE 1 !(!cond) [L694] RET 1 assume_abort_if_not(MTX==0) [L695] 1 MTX = 1 [L703] RET 1 __VERIFIER_atomic_acquire() [L703] EXPR 1 MTX==1 VAL [COND=0, MTX=1, buf=0] [L703] COND FALSE 1 !(!(MTX==1)) VAL [COND=0, MTX=1, buf=0] [L743] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, buf=0, pthread_create(&t, 0, thr1, 0)=0, t={3:0}] [L704] CALL 1 __VERIFIER_atomic_release() [L699] EXPR 1 MTX==1 [L699] CALL 1 assume_abort_if_not(MTX==1) [L4] COND FALSE 1 !(!cond) [L699] RET 1 assume_abort_if_not(MTX==1) [L700] 1 MTX = 0 [L704] RET 1 __VERIFIER_atomic_release() [L724] COND TRUE 2 1 [L728] 2 case 0: [L728] CALL 2 adb_kbd_receive_packet() [L703] CALL 2 __VERIFIER_atomic_acquire() [L694] EXPR 2 MTX==0 [L694] CALL 2 assume_abort_if_not(MTX==0) [L4] COND FALSE 2 !(!cond) [L694] RET 2 assume_abort_if_not(MTX==0) [L695] 2 MTX = 1 [L703] RET 2 __VERIFIER_atomic_acquire() [L703] EXPR 2 MTX==1 VAL [COND=0, MTX=1, buf=0] [L703] COND FALSE 2 !(!(MTX==1)) VAL [COND=0, MTX=1, buf=0] [L704] CALL 2 __VERIFIER_atomic_release() [L699] EXPR 2 MTX==1 [L699] CALL 2 assume_abort_if_not(MTX==1) [L4] COND FALSE 2 !(!cond) [L699] RET 2 assume_abort_if_not(MTX==1) [L700] 2 MTX = 0 [L704] RET 2 __VERIFIER_atomic_release() [L705] 1 COND = 1 VAL [COND = 1=51, COND=1, MTX=0, buf=0] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 370 locations, 91 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 542 locations, 136 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.0s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 366 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2043 IncrementalHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 217 mSDtfsCounter, 2043 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=805occurred in iteration=14, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 370 locations, 91 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.7s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-25 22:18:35,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...