./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/40_barrier_vf.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/40_barrier_vf.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e83225601d835c9b02ede9a5751213533e33817a9795ca1ab6ec7c2abd672056 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:27:00,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:27:00,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:27:00,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:27:00,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:27:00,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:27:00,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:27:00,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:27:00,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:27:00,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:27:00,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:27:00,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:27:00,393 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:27:00,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:27:00,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:27:00,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:27:00,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:27:00,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:27:00,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:27:00,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:27:00,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:27:00,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:27:00,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:27:00,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:27:00,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:27:00,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:27:00,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:27:00,395 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e83225601d835c9b02ede9a5751213533e33817a9795ca1ab6ec7c2abd672056 [2025-03-04 06:27:00,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:27:00,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:27:00,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:27:00,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:27:00,630 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:27:00,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2025-03-04 06:27:01,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274be427d/ab0120b2fa9946f9a2639958b29780fd/FLAG5f021c33b [2025-03-04 06:27:02,137 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:27:02,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2025-03-04 06:27:02,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274be427d/ab0120b2fa9946f9a2639958b29780fd/FLAG5f021c33b [2025-03-04 06:27:02,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274be427d/ab0120b2fa9946f9a2639958b29780fd [2025-03-04 06:27:02,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:27:02,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:27:02,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:27:02,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:27:02,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:27:02,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca80b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02, skipping insertion in model container [2025-03-04 06:27:02,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:27:02,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:27:02,482 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:27:02,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:27:02,553 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:27:02,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02 WrapperNode [2025-03-04 06:27:02,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:27:02,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:27:02,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:27:02,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:27:02,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,587 INFO L138 Inliner]: procedures = 164, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 188 [2025-03-04 06:27:02,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:27:02,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:27:02,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:27:02,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:27:02,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:27:02,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:27:02,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:27:02,603 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:27:02,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (1/1) ... [2025-03-04 06:27:02,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:27:02,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:27:02,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:27:02,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:27:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 06:27:02,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 06:27:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:27:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:27:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:27:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:27:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:27:02,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:27:02,647 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:27:02,730 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:27:02,731 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:27:02,949 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:27:02,949 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:27:02,970 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:27:02,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:27:02,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:27:02 BoogieIcfgContainer [2025-03-04 06:27:02,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:27:02,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:27:02,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:27:02,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:27:02,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:27:02" (1/3) ... [2025-03-04 06:27:02,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16651383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:27:02, skipping insertion in model container [2025-03-04 06:27:02,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:02" (2/3) ... [2025-03-04 06:27:02,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16651383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:27:02, skipping insertion in model container [2025-03-04 06:27:02,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:27:02" (3/3) ... [2025-03-04 06:27:02,982 INFO L128 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2025-03-04 06:27:02,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:27:02,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 40_barrier_vf.i that has 2 procedures, 195 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-04 06:27:02,992 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:27:03,052 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:03,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 200 transitions, 404 flow [2025-03-04 06:27:03,167 INFO L124 PetriNetUnfolderBase]: 5/207 cut-off events. [2025-03-04 06:27:03,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:03,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 207 events. 5/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-03-04 06:27:03,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 200 transitions, 404 flow [2025-03-04 06:27:03,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 200 transitions, 404 flow [2025-03-04 06:27:03,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:03,196 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5e9c67fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:03,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 06:27:03,239 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:03,239 INFO L124 PetriNetUnfolderBase]: 0/157 cut-off events. [2025-03-04 06:27:03,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:03,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:03,240 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:03,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:27:03,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:03,250 INFO L85 PathProgramCache]: Analyzing trace with hash -880681432, now seen corresponding path program 1 times [2025-03-04 06:27:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:03,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24497745] [2025-03-04 06:27:03,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:03,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:03,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 06:27:03,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 06:27:03,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:03,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:03,423 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:03,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 06:27:03,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 06:27:03,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:03,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:03,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:03,550 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:03,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-04 06:27:03,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-04 06:27:03,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:27:03,554 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-04 06:27:03,556 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:03,556 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:27:03,578 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:03,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 254 transitions, 518 flow [2025-03-04 06:27:03,617 INFO L124 PetriNetUnfolderBase]: 10/270 cut-off events. [2025-03-04 06:27:03,618 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:27:03,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 270 events. 10/270 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 361 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 208. Up to 3 conditions per place. [2025-03-04 06:27:03,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 254 transitions, 518 flow [2025-03-04 06:27:03,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 254 transitions, 518 flow [2025-03-04 06:27:03,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:03,626 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5e9c67fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:03,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 06:27:03,646 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:03,646 INFO L124 PetriNetUnfolderBase]: 0/160 cut-off events. [2025-03-04 06:27:03,646 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:27:03,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:03,646 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:03,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:27:03,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:03,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2112699651, now seen corresponding path program 1 times [2025-03-04 06:27:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:03,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608392074] [2025-03-04 06:27:03,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:03,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:03,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 06:27:03,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 06:27:03,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:03,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:27:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608392074] [2025-03-04 06:27:03,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608392074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:03,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376768938] [2025-03-04 06:27:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:03,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:03,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:03,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:03,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:03,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 254 [2025-03-04 06:27:03,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 254 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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) [2025-03-04 06:27:03,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:03,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 254 [2025-03-04 06:27:03,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:04,240 INFO L124 PetriNetUnfolderBase]: 193/1251 cut-off events. [2025-03-04 06:27:04,240 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 06:27:04,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 1251 events. 193/1251 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 8215 event pairs, 50 based on Foata normal form. 369/1446 useless extension candidates. Maximal degree in co-relation 1404. Up to 237 conditions per place. [2025-03-04 06:27:04,253 INFO L140 encePairwiseOnDemand]: 229/254 looper letters, 35 selfloop transitions, 12 changer transitions 0/255 dead transitions. [2025-03-04 06:27:04,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 255 transitions, 619 flow [2025-03-04 06:27:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2025-03-04 06:27:04,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9448818897637795 [2025-03-04 06:27:04,269 INFO L175 Difference]: Start difference. First operand has 249 places, 254 transitions, 518 flow. Second operand 3 states and 720 transitions. [2025-03-04 06:27:04,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 255 transitions, 619 flow [2025-03-04 06:27:04,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 255 transitions, 619 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:27:04,280 INFO L231 Difference]: Finished difference. Result has 239 places, 246 transitions, 582 flow [2025-03-04 06:27:04,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=239, PETRI_TRANSITIONS=246} [2025-03-04 06:27:04,285 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, -10 predicate places. [2025-03-04 06:27:04,286 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 246 transitions, 582 flow [2025-03-04 06:27:04,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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) [2025-03-04 06:27:04,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:04,287 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:04,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:27:04,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:27:04,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash -591068257, now seen corresponding path program 1 times [2025-03-04 06:27:04,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:04,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80278684] [2025-03-04 06:27:04,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:04,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:04,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:27:04,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:27:04,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:04,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:27:04,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:04,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80278684] [2025-03-04 06:27:04,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80278684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:04,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:04,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:04,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586634269] [2025-03-04 06:27:04,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:04,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:04,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:04,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:04,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 254 [2025-03-04 06:27:04,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 246 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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) [2025-03-04 06:27:04,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:04,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 254 [2025-03-04 06:27:04,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:04,711 INFO L124 PetriNetUnfolderBase]: 279/1551 cut-off events. [2025-03-04 06:27:04,711 INFO L125 PetriNetUnfolderBase]: For 380/395 co-relation queries the response was YES. [2025-03-04 06:27:04,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2462 conditions, 1551 events. 279/1551 cut-off events. For 380/395 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 11052 event pairs, 99 based on Foata normal form. 3/1332 useless extension candidates. Maximal degree in co-relation 2160. Up to 446 conditions per place. [2025-03-04 06:27:04,724 INFO L140 encePairwiseOnDemand]: 246/254 looper letters, 35 selfloop transitions, 10 changer transitions 0/259 dead transitions. [2025-03-04 06:27:04,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 259 transitions, 723 flow [2025-03-04 06:27:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-03-04 06:27:04,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9094488188976378 [2025-03-04 06:27:04,727 INFO L175 Difference]: Start difference. First operand has 239 places, 246 transitions, 582 flow. Second operand 3 states and 693 transitions. [2025-03-04 06:27:04,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 259 transitions, 723 flow [2025-03-04 06:27:04,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 259 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:27:04,737 INFO L231 Difference]: Finished difference. Result has 241 places, 254 transitions, 644 flow [2025-03-04 06:27:04,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=241, PETRI_TRANSITIONS=254} [2025-03-04 06:27:04,738 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, -8 predicate places. [2025-03-04 06:27:04,738 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 254 transitions, 644 flow [2025-03-04 06:27:04,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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) [2025-03-04 06:27:04,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:04,739 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:04,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:27:04,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:27:04,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash -404332147, now seen corresponding path program 1 times [2025-03-04 06:27:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:04,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197757142] [2025-03-04 06:27:04,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:04,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 06:27:04,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 06:27:04,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:04,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:04,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:04,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 06:27:04,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 06:27:04,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:04,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:04,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:04,824 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:04,824 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-03-04 06:27:04,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-03-04 06:27:04,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-03-04 06:27:04,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-03-04 06:27:04,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-03-04 06:27:04,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2025-03-04 06:27:04,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2025-03-04 06:27:04,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2025-03-04 06:27:04,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2025-03-04 06:27:04,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-03-04 06:27:04,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-03-04 06:27:04,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2025-03-04 06:27:04,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-03-04 06:27:04,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-03-04 06:27:04,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-03-04 06:27:04,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-03-04 06:27:04,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-03-04 06:27:04,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-03-04 06:27:04,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-03-04 06:27:04,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:27:04,826 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 06:27:04,827 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:04,827 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:27:04,870 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:04,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 308 transitions, 634 flow [2025-03-04 06:27:04,917 INFO L124 PetriNetUnfolderBase]: 15/333 cut-off events. [2025-03-04 06:27:04,917 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:27:04,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 333 events. 15/333 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 680 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 274. Up to 4 conditions per place. [2025-03-04 06:27:04,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 300 places, 308 transitions, 634 flow [2025-03-04 06:27:04,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 308 transitions, 634 flow [2025-03-04 06:27:04,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:04,925 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5e9c67fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:04,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 06:27:04,941 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:04,941 INFO L124 PetriNetUnfolderBase]: 0/160 cut-off events. [2025-03-04 06:27:04,941 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:27:04,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:04,941 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:04,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:27:04,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash 721519090, now seen corresponding path program 1 times [2025-03-04 06:27:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:04,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181771960] [2025-03-04 06:27:04,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:04,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:04,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 06:27:04,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 06:27:04,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:04,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:27:05,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:05,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181771960] [2025-03-04 06:27:05,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181771960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:05,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:05,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:05,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868230899] [2025-03-04 06:27:05,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:05,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:05,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:05,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:05,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 308 [2025-03-04 06:27:05,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 308 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 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) [2025-03-04 06:27:05,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:05,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 308 [2025-03-04 06:27:05,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:07,290 INFO L124 PetriNetUnfolderBase]: 6063/20235 cut-off events. [2025-03-04 06:27:07,290 INFO L125 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2025-03-04 06:27:07,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29971 conditions, 20235 events. 6063/20235 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 239231 event pairs, 1840 based on Foata normal form. 6557/23423 useless extension candidates. Maximal degree in co-relation 27236. Up to 5368 conditions per place. [2025-03-04 06:27:07,434 INFO L140 encePairwiseOnDemand]: 271/308 looper letters, 53 selfloop transitions, 18 changer transitions 0/312 dead transitions. [2025-03-04 06:27:07,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 312 transitions, 796 flow [2025-03-04 06:27:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2025-03-04 06:27:07,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9329004329004329 [2025-03-04 06:27:07,438 INFO L175 Difference]: Start difference. First operand has 300 places, 308 transitions, 634 flow. Second operand 3 states and 862 transitions. [2025-03-04 06:27:07,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 312 transitions, 796 flow [2025-03-04 06:27:07,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 312 transitions, 792 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 06:27:07,447 INFO L231 Difference]: Finished difference. Result has 285 places, 298 transitions, 732 flow [2025-03-04 06:27:07,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=285, PETRI_TRANSITIONS=298} [2025-03-04 06:27:07,451 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, -15 predicate places. [2025-03-04 06:27:07,453 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 298 transitions, 732 flow [2025-03-04 06:27:07,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 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) [2025-03-04 06:27:07,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:07,454 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:07,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:27:07,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:27:07,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2064299522, now seen corresponding path program 1 times [2025-03-04 06:27:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978355966] [2025-03-04 06:27:07,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:07,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:27:07,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:27:07,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:07,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:27:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978355966] [2025-03-04 06:27:07,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978355966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:07,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:07,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:07,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963621627] [2025-03-04 06:27:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:07,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:07,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:07,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:07,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:07,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 308 [2025-03-04 06:27:07,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 298 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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) [2025-03-04 06:27:07,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:07,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 308 [2025-03-04 06:27:07,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:08,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][304], [116#L701true, 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 290#L693-6true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:08,912 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-03-04 06:27:08,912 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:08,912 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-04 06:27:08,913 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:08,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][252], [116#L701true, 308#true, Black: 303#true, 297#true, 299#true, 301#true, 6#L709-2true, 290#L693-6true, 305#(= |#race~count~0| 0), 23#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-04 06:27:08,918 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-03-04 06:27:08,918 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:08,918 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:08,918 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-04 06:27:08,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][320], [310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 147#L693-6true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 54#L701true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:08,922 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-03-04 06:27:08,922 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-04 06:27:08,923 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:08,923 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:08,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][292], [308#true, Black: 303#true, 297#true, 147#L693-6true, 299#true, 301#true, 6#L709-2true, 54#L701true, 305#(= |#race~count~0| 0), 23#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-04 06:27:08,926 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-03-04 06:27:08,926 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:08,926 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-04 06:27:08,926 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:09,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][320], [310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 54#L701true, 305#(= |#race~count~0| 0), 188#L694-1true]) [2025-03-04 06:27:09,516 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-04 06:27:09,516 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-04 06:27:09,516 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-04 06:27:09,516 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-04 06:27:09,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][292], [308#true, Black: 303#true, 297#true, 299#true, 301#true, 6#L709-2true, 54#L701true, 188#L694-1true, 305#(= |#race~count~0| 0), 23#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-04 06:27:09,521 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-03-04 06:27:09,521 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-04 06:27:09,521 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-04 06:27:09,521 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:09,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][292], [308#true, Black: 303#true, 189#L693-3true, 297#true, 299#true, 301#true, 6#L709-2true, 149#L700-2true, 54#L701true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,793 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-03-04 06:27:09,793 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:27:09,793 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:27:09,793 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-04 06:27:09,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][292], [116#L701true, Black: 303#true, 308#true, 189#L693-3true, 297#true, 299#true, 301#true, 6#L709-2true, 54#L701true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,793 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-03-04 06:27:09,793 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:27:09,793 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:27:09,793 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-04 06:27:09,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][303], [310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 149#L700-2true, 54#L701true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,857 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:09,857 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,857 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,857 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][303], [225#L699true, 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 149#L700-2true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,858 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-03-04 06:27:09,858 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:09,858 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:09,858 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:09,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][303], [310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 149#L700-2true, 305#(= |#race~count~0| 0), 217#L700-2true]) [2025-03-04 06:27:09,858 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:09,858 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,858 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,858 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][304], [116#L701true, 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 54#L701true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,858 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:09,858 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,858 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,861 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][304], [225#L699true, 116#L701true, 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,862 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-03-04 06:27:09,862 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:09,862 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:09,862 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:09,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][304], [116#L701true, 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 305#(= |#race~count~0| 0), 217#L700-2true]) [2025-03-04 06:27:09,862 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:09,862 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,862 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,862 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][320], [310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 149#L700-2true, 54#L701true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,863 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:09,863 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:09,863 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,863 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][320], [116#L701true, 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 299#true, 301#true, 6#L709-2true, 54#L701true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,863 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:09,863 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:09,863 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,863 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][292], [Black: 303#true, 308#true, 297#true, 299#true, 301#true, 6#L709-2true, 149#L700-2true, 54#L701true, 305#(= |#race~count~0| 0), 23#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-04 06:27:09,867 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:09,867 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:09,867 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,867 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,868 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][292], [116#L701true, Black: 303#true, 308#true, 297#true, 299#true, 301#true, 6#L709-2true, 54#L701true, 305#(= |#race~count~0| 0), 23#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-04 06:27:09,868 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:09,868 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,868 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:09,868 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:09,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][320], [310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 303#true, 297#true, 227#L693-2true, 172#L699true, 299#true, 301#true, 6#L709-2true, 54#L701true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,893 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-03-04 06:27:09,893 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-04 06:27:09,893 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:09,893 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:09,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][292], [Black: 303#true, 308#true, 297#true, 299#true, 172#L699true, 301#true, 221#L694-2true, 6#L709-2true, 54#L701true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,946 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-03-04 06:27:09,946 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:27:09,946 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:27:09,946 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:27:09,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1][293], [Black: 303#true, 308#true, 297#true, 299#true, 172#L699true, 301#true, 221#L694-2true, 6#L709-2true, 217#L700-2true, 305#(= |#race~count~0| 0)]) [2025-03-04 06:27:09,946 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-03-04 06:27:09,946 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:27:09,946 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:27:09,946 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-04 06:27:10,118 INFO L124 PetriNetUnfolderBase]: 8308/27979 cut-off events. [2025-03-04 06:27:10,118 INFO L125 PetriNetUnfolderBase]: For 8632/9371 co-relation queries the response was YES. [2025-03-04 06:27:10,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48702 conditions, 27979 events. 8308/27979 cut-off events. For 8632/9371 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 352479 event pairs, 3131 based on Foata normal form. 50/23245 useless extension candidates. Maximal degree in co-relation 48399. Up to 10180 conditions per place. [2025-03-04 06:27:10,343 INFO L140 encePairwiseOnDemand]: 296/308 looper letters, 53 selfloop transitions, 20 changer transitions 0/326 dead transitions. [2025-03-04 06:27:10,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 326 transitions, 992 flow [2025-03-04 06:27:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2025-03-04 06:27:10,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8993506493506493 [2025-03-04 06:27:10,346 INFO L175 Difference]: Start difference. First operand has 285 places, 298 transitions, 732 flow. Second operand 3 states and 831 transitions. [2025-03-04 06:27:10,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 326 transitions, 992 flow [2025-03-04 06:27:10,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 326 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:27:10,367 INFO L231 Difference]: Finished difference. Result has 287 places, 316 transitions, 882 flow [2025-03-04 06:27:10,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=287, PETRI_TRANSITIONS=316} [2025-03-04 06:27:10,369 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, -13 predicate places. [2025-03-04 06:27:10,369 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 316 transitions, 882 flow [2025-03-04 06:27:10,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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) [2025-03-04 06:27:10,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:10,370 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:10,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:27:10,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:27:10,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:10,371 INFO L85 PathProgramCache]: Analyzing trace with hash -367747613, now seen corresponding path program 1 times [2025-03-04 06:27:10,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:10,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842416901] [2025-03-04 06:27:10,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:10,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 06:27:10,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 06:27:10,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:10,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:27:10,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842416901] [2025-03-04 06:27:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842416901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:10,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:10,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:10,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652510916] [2025-03-04 06:27:10,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:10,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:10,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:10,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:10,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 308 [2025-03-04 06:27:10,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 316 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 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) [2025-03-04 06:27:10,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:10,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 308 [2025-03-04 06:27:10,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:11,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][302], [308#true, Black: 303#true, 297#true, 299#true, 224#L693-6true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 93#L693-3true, 54#L701true, 313#true]) [2025-03-04 06:27:11,847 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-03-04 06:27:11,847 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-03-04 06:27:11,847 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-03-04 06:27:11,847 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-04 06:27:11,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L701-3-->L701: Formula: (and (= |v_thr1Thread1of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread1of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork0_Barrier2_#t~ret8#1][315], [308#true, Black: 303#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 157#L693-2true, 301#true, 315#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 6#L709-2true, 290#L693-6true, 256#L701true]) [2025-03-04 06:27:11,965 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-03-04 06:27:11,965 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:11,965 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-04 06:27:11,965 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:12,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][337], [308#true, Black: 303#true, 297#true, 299#true, 224#L693-6true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 315#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 157#L693-2true, 6#L709-2true, 54#L701true]) [2025-03-04 06:27:12,055 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-03-04 06:27:12,055 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:12,055 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-04 06:27:12,055 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:12,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][302], [308#true, Black: 303#true, 297#true, 299#true, 224#L693-6true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 54#L701true, 313#true, 158#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-04 06:27:12,056 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-03-04 06:27:12,057 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:12,057 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-04 06:27:12,057 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-04 06:27:12,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L701-3-->L701: Formula: (and (= |v_thr1Thread1of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread1of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork0_Barrier2_#t~ret8#1][200], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 290#L693-6true, 82#L694-2true, 313#true, 256#L701true]) [2025-03-04 06:27:12,165 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-03-04 06:27:12,165 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-04 06:27:12,165 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-03-04 06:27:12,165 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-03-04 06:27:12,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][302], [Black: 303#true, 308#true, 297#true, 37#L694-1true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 93#L693-3true, 54#L701true, 313#true]) [2025-03-04 06:27:12,681 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2025-03-04 06:27:12,681 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-04 06:27:12,681 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-04 06:27:12,681 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-04 06:27:12,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][337], [Black: 303#true, 308#true, 297#true, 299#true, 37#L694-1true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 315#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 157#L693-2true, 6#L709-2true, 54#L701true]) [2025-03-04 06:27:12,859 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-04 06:27:12,859 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-04 06:27:12,859 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-04 06:27:12,859 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-04 06:27:12,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][302], [Black: 303#true, 308#true, 297#true, 299#true, 37#L694-1true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 54#L701true, 313#true, 158#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-04 06:27:12,859 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-04 06:27:12,859 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-04 06:27:12,859 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-04 06:27:12,859 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-04 06:27:13,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][302], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 93#L693-3true, 54#L701true, 313#true, 256#L701true]) [2025-03-04 06:27:13,347 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,347 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:27:13,347 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:27:13,347 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][302], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 28#L700-2true, 301#true, 6#L709-2true, 93#L693-3true, 54#L701true, 313#true]) [2025-03-04 06:27:13,349 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-03-04 06:27:13,349 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,349 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:27:13,349 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:27:13,349 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][302], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 93#L693-3true, 54#L701true, 313#true, 256#L701true]) [2025-03-04 06:27:13,349 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-03-04 06:27:13,349 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:27:13,349 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:27:13,349 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,349 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1][303], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 93#L693-3true, 313#true, 217#L700-2true, 256#L701true]) [2025-03-04 06:27:13,350 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-03-04 06:27:13,350 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:27:13,350 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:27:13,350 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][302], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 54#L701true, 313#true, 158#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 256#L701true]) [2025-03-04 06:27:13,434 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-03-04 06:27:13,434 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:13,434 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,434 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][337], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 28#L700-2true, 157#L693-2true, 301#true, 315#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 6#L709-2true, 54#L701true]) [2025-03-04 06:27:13,436 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,436 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,436 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:13,436 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][337], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 315#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 157#L693-2true, 301#true, 6#L709-2true, 54#L701true, 256#L701true]) [2025-03-04 06:27:13,437 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,437 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,437 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:13,437 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][302], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 28#L700-2true, 301#true, 6#L709-2true, 313#true, 54#L701true, 158#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-04 06:27:13,438 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,438 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,438 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,438 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:13,439 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][302], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 54#L701true, 313#true, 256#L701true, 158#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-04 06:27:13,439 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,439 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:13,439 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,439 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,439 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:13,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1][303], [Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 313#true, 217#L700-2true, 256#L701true, 158#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-04 06:27:13,439 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-04 06:27:13,439 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,439 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:27:13,439 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-04 06:27:13,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][337], [182#L699true, Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 157#L693-2true, 315#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 301#true, 6#L709-2true, 54#L701true]) [2025-03-04 06:27:13,475 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-03-04 06:27:13,475 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:13,475 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-04 06:27:13,476 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-04 06:27:13,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][257], [116#L701true, Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 28#L700-2true, 6#L709-2true, 54#L701true, 313#true]) [2025-03-04 06:27:13,675 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-03-04 06:27:13,675 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-04 06:27:13,675 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-04 06:27:13,675 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-04 06:27:13,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][257], [116#L701true, 182#L699true, Black: 303#true, 308#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 54#L701true, 313#true]) [2025-03-04 06:27:13,687 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2025-03-04 06:27:13,687 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-04 06:27:13,687 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-03-04 06:27:13,687 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-04 06:27:13,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][256], [182#L699true, 308#true, Black: 303#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 149#L700-2true, 313#true, 54#L701true]) [2025-03-04 06:27:13,689 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-03-04 06:27:13,689 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-04 06:27:13,689 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-03-04 06:27:13,689 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-04 06:27:13,689 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1108] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][257], [182#L699true, 116#L701true, 308#true, Black: 303#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 313#true, 54#L701true]) [2025-03-04 06:27:13,690 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-03-04 06:27:13,690 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-04 06:27:13,690 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-03-04 06:27:13,690 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-04 06:27:13,690 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-03-04 06:27:13,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][257], [182#L699true, 116#L701true, 308#true, Black: 303#true, 297#true, 299#true, Black: 310#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 301#true, 6#L709-2true, 313#true, 217#L700-2true]) [2025-03-04 06:27:13,690 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-03-04 06:27:13,690 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-04 06:27:13,690 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-03-04 06:27:13,690 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-04 06:27:13,743 INFO L124 PetriNetUnfolderBase]: 10262/32761 cut-off events. [2025-03-04 06:27:13,743 INFO L125 PetriNetUnfolderBase]: For 15357/16820 co-relation queries the response was YES. [2025-03-04 06:27:13,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60711 conditions, 32761 events. 10262/32761 cut-off events. For 15357/16820 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 415651 event pairs, 3502 based on Foata normal form. 56/26883 useless extension candidates. Maximal degree in co-relation 60443. Up to 12403 conditions per place. [2025-03-04 06:27:14,043 INFO L140 encePairwiseOnDemand]: 296/308 looper letters, 66 selfloop transitions, 28 changer transitions 0/349 dead transitions. [2025-03-04 06:27:14,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 349 transitions, 1233 flow [2025-03-04 06:27:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 830 transitions. [2025-03-04 06:27:14,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982683982683982 [2025-03-04 06:27:14,046 INFO L175 Difference]: Start difference. First operand has 287 places, 316 transitions, 882 flow. Second operand 3 states and 830 transitions. [2025-03-04 06:27:14,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 349 transitions, 1233 flow [2025-03-04 06:27:14,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 349 transitions, 1177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:27:14,079 INFO L231 Difference]: Finished difference. Result has 289 places, 340 transitions, 1128 flow [2025-03-04 06:27:14,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=289, PETRI_TRANSITIONS=340} [2025-03-04 06:27:14,080 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, -11 predicate places. [2025-03-04 06:27:14,082 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 340 transitions, 1128 flow [2025-03-04 06:27:14,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 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) [2025-03-04 06:27:14,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:14,083 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:14,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:27:14,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:27:14,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:14,084 INFO L85 PathProgramCache]: Analyzing trace with hash 702398813, now seen corresponding path program 1 times [2025-03-04 06:27:14,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:14,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562365631] [2025-03-04 06:27:14,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:14,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 06:27:14,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 06:27:14,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:14,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:14,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:14,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 06:27:14,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 06:27:14,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:14,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:14,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:14,156 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:14,156 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2025-03-04 06:27:14,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-03-04 06:27:14,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-03-04 06:27:14,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:27:14,158 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 06:27:14,159 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:14,159 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 06:27:14,190 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:14,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 351 places, 362 transitions, 752 flow [2025-03-04 06:27:14,224 INFO L124 PetriNetUnfolderBase]: 20/396 cut-off events. [2025-03-04 06:27:14,224 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:27:14,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 396 events. 20/396 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 994 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 341. Up to 5 conditions per place. [2025-03-04 06:27:14,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 351 places, 362 transitions, 752 flow [2025-03-04 06:27:14,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 351 places, 362 transitions, 752 flow [2025-03-04 06:27:14,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:14,229 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5e9c67fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:14,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-04 06:27:14,235 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:14,236 INFO L124 PetriNetUnfolderBase]: 0/160 cut-off events. [2025-03-04 06:27:14,236 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:27:14,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:14,236 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:14,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:27:14,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:14,237 INFO L85 PathProgramCache]: Analyzing trace with hash -869267065, now seen corresponding path program 1 times [2025-03-04 06:27:14,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795927918] [2025-03-04 06:27:14,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:14,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:14,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 06:27:14,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 06:27:14,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:14,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:27:14,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:14,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795927918] [2025-03-04 06:27:14,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795927918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:14,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:14,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:14,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101148998] [2025-03-04 06:27:14,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:14,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:14,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:14,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:14,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:14,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 362 [2025-03-04 06:27:14,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 362 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 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) [2025-03-04 06:27:14,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:14,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 362 [2025-03-04 06:27:14,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand