./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/40_barrier_vf.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-48c9605-m [2025-02-08 05:12:39,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:12:39,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:12:39,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:12:39,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:12:39,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:12:39,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:12:39,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:12:39,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:12:39,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:12:39,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:12:39,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:12:39,507 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:12:39,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:12:39,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:12:39,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:12:39,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:12:39,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:12:39,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:12:39,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:12:39,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:12:39,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:12:39,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:12:39,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:12:39,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:12:39,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:12:39,509 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-jdk21/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-02-08 05:12:39,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:12:39,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:12:39,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:12:39,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:12:39,757 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:12:39,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2025-02-08 05:12:41,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f856f4794/cb6918e25a464b118eda9596d7621136/FLAGc9b653a3e [2025-02-08 05:12:41,324 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:12:41,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2025-02-08 05:12:41,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f856f4794/cb6918e25a464b118eda9596d7621136/FLAGc9b653a3e [2025-02-08 05:12:41,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f856f4794/cb6918e25a464b118eda9596d7621136 [2025-02-08 05:12:41,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:12:41,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:12:41,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:12:41,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:12:41,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:12:41,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da76ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41, skipping insertion in model container [2025-02-08 05:12:41,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:12:41,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:12:41,675 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:12:41,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:12:41,746 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:12:41,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41 WrapperNode [2025-02-08 05:12:41,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:12:41,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:12:41,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:12:41,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:12:41,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,779 INFO L138 Inliner]: procedures = 164, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 188 [2025-02-08 05:12:41,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:12:41,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:12:41,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:12:41,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:12:41,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,795 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:12:41,802 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:12:41,802 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:12:41,802 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:12:41,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (1/1) ... [2025-02-08 05:12:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:12:41,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:12:41,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:12:41,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:12:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:12:41,858 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:12:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:12:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:12:41,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:12:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:12:41,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:12:41,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:12:41,861 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:12:41,953 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:12:41,955 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:12:42,169 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:12:42,169 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:12:42,189 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:12:42,189 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:12:42,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:12:42 BoogieIcfgContainer [2025-02-08 05:12:42,190 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:12:42,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:12:42,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:12:42,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:12:42,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:12:41" (1/3) ... [2025-02-08 05:12:42,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cc7297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:12:42, skipping insertion in model container [2025-02-08 05:12:42,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:41" (2/3) ... [2025-02-08 05:12:42,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cc7297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:12:42, skipping insertion in model container [2025-02-08 05:12:42,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:12:42" (3/3) ... [2025-02-08 05:12:42,196 INFO L128 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2025-02-08 05:12:42,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:12:42,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 40_barrier_vf.i that has 2 procedures, 194 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-02-08 05:12:42,208 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:12:42,262 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:42,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 199 transitions, 402 flow [2025-02-08 05:12:42,369 INFO L124 PetriNetUnfolderBase]: 5/206 cut-off events. [2025-02-08 05:12:42,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:12:42,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 206 events. 5/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 61. Up to 3 conditions per place. [2025-02-08 05:12:42,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 199 transitions, 402 flow [2025-02-08 05:12:42,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 199 transitions, 402 flow [2025-02-08 05:12:42,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:42,400 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;@d6af9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:42,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 05:12:42,437 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:42,438 INFO L124 PetriNetUnfolderBase]: 0/157 cut-off events. [2025-02-08 05:12:42,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:12:42,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:42,439 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-02-08 05:12:42,439 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-02-08 05:12:42,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash 412786682, now seen corresponding path program 1 times [2025-02-08 05:12:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662088377] [2025-02-08 05:12:42,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:42,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:42,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 05:12:42,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 05:12:42,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:42,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:42,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:42,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 05:12:42,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 05:12:42,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:42,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:42,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:42,661 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:42,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 05:12:42,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-02-08 05:12:42,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-02-08 05:12:42,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-02-08 05:12:42,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-02-08 05:12:42,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-02-08 05:12:42,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-02-08 05:12:42,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-02-08 05:12:42,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-02-08 05:12:42,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-02-08 05:12:42,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-02-08 05:12:42,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-02-08 05:12:42,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-02-08 05:12:42,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:12:42,664 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 05:12:42,666 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:42,667 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:12:42,694 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:42,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 252 transitions, 514 flow [2025-02-08 05:12:42,750 INFO L124 PetriNetUnfolderBase]: 10/268 cut-off events. [2025-02-08 05:12:42,751 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:12:42,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 268 events. 10/268 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 358 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 207. Up to 3 conditions per place. [2025-02-08 05:12:42,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 252 transitions, 514 flow [2025-02-08 05:12:42,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 252 transitions, 514 flow [2025-02-08 05:12:42,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:42,759 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;@d6af9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:42,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 05:12:42,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:42,784 INFO L124 PetriNetUnfolderBase]: 0/160 cut-off events. [2025-02-08 05:12:42,784 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:12:42,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:42,785 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-02-08 05:12:42,785 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-02-08 05:12:42,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash -110377456, now seen corresponding path program 1 times [2025-02-08 05:12:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:42,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871561421] [2025-02-08 05:12:42,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:42,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 05:12:42,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 05:12:42,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:42,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:43,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:43,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871561421] [2025-02-08 05:12:43,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871561421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:43,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:43,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:12:43,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694516115] [2025-02-08 05:12:43,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:43,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:12:43,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:43,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:12:43,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:12:43,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 252 [2025-02-08 05:12:43,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 252 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-02-08 05:12:43,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:43,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 252 [2025-02-08 05:12:43,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:43,353 INFO L124 PetriNetUnfolderBase]: 193/1214 cut-off events. [2025-02-08 05:12:43,353 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:12:43,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 1214 events. 193/1214 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7828 event pairs, 50 based on Foata normal form. 371/1411 useless extension candidates. Maximal degree in co-relation 1369. Up to 237 conditions per place. [2025-02-08 05:12:43,365 INFO L140 encePairwiseOnDemand]: 227/252 looper letters, 35 selfloop transitions, 12 changer transitions 0/253 dead transitions. [2025-02-08 05:12:43,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 253 transitions, 615 flow [2025-02-08 05:12:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:12:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:12:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-02-08 05:12:43,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-02-08 05:12:43,381 INFO L175 Difference]: Start difference. First operand has 247 places, 252 transitions, 514 flow. Second operand 3 states and 714 transitions. [2025-02-08 05:12:43,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 253 transitions, 615 flow [2025-02-08 05:12:43,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 253 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:43,391 INFO L231 Difference]: Finished difference. Result has 237 places, 244 transitions, 578 flow [2025-02-08 05:12:43,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=237, PETRI_TRANSITIONS=244} [2025-02-08 05:12:43,395 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -10 predicate places. [2025-02-08 05:12:43,396 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 244 transitions, 578 flow [2025-02-08 05:12:43,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-02-08 05:12:43,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:43,396 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-02-08 05:12:43,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:12:43,397 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-02-08 05:12:43,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1404642727, now seen corresponding path program 1 times [2025-02-08 05:12:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:43,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981080209] [2025-02-08 05:12:43,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:43,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:43,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 05:12:43,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:12:43,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:43,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981080209] [2025-02-08 05:12:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981080209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:43,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:43,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:12:43,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295978408] [2025-02-08 05:12:43,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:43,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:12:43,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:43,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:12:43,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:12:43,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 252 [2025-02-08 05:12:43,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 244 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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-02-08 05:12:43,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:43,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 252 [2025-02-08 05:12:43,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:43,751 INFO L124 PetriNetUnfolderBase]: 279/1507 cut-off events. [2025-02-08 05:12:43,751 INFO L125 PetriNetUnfolderBase]: For 382/397 co-relation queries the response was YES. [2025-02-08 05:12:43,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 1507 events. 279/1507 cut-off events. For 382/397 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 10566 event pairs, 99 based on Foata normal form. 3/1288 useless extension candidates. Maximal degree in co-relation 2118. Up to 446 conditions per place. [2025-02-08 05:12:43,759 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 35 selfloop transitions, 10 changer transitions 0/257 dead transitions. [2025-02-08 05:12:43,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 257 transitions, 719 flow [2025-02-08 05:12:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:12:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:12:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 687 transitions. [2025-02-08 05:12:43,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087301587301587 [2025-02-08 05:12:43,761 INFO L175 Difference]: Start difference. First operand has 237 places, 244 transitions, 578 flow. Second operand 3 states and 687 transitions. [2025-02-08 05:12:43,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 257 transitions, 719 flow [2025-02-08 05:12:43,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 257 transitions, 687 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:12:43,766 INFO L231 Difference]: Finished difference. Result has 239 places, 252 transitions, 640 flow [2025-02-08 05:12:43,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=239, PETRI_TRANSITIONS=252} [2025-02-08 05:12:43,767 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-02-08 05:12:43,767 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 252 transitions, 640 flow [2025-02-08 05:12:43,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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-02-08 05:12:43,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:43,768 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-02-08 05:12:43,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:12:43,768 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-02-08 05:12:43,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:43,769 INFO L85 PathProgramCache]: Analyzing trace with hash 761086266, now seen corresponding path program 1 times [2025-02-08 05:12:43,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:43,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159337697] [2025-02-08 05:12:43,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:43,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:43,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:12:43,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:12:43,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:43,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:43,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:43,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:12:43,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:12:43,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:43,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:43,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:43,863 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:43,863 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-02-08 05:12:43,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-02-08 05:12:43,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-02-08 05:12:43,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-02-08 05:12:43,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-02-08 05:12:43,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2025-02-08 05:12:43,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2025-02-08 05:12:43,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2025-02-08 05:12:43,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2025-02-08 05:12:43,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-02-08 05:12:43,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-02-08 05:12:43,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2025-02-08 05:12:43,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-02-08 05:12:43,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-02-08 05:12:43,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-02-08 05:12:43,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-02-08 05:12:43,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-02-08 05:12:43,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-02-08 05:12:43,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-02-08 05:12:43,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:12:43,866 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:12:43,866 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:43,866 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:12:43,904 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:43,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 628 flow [2025-02-08 05:12:43,938 INFO L124 PetriNetUnfolderBase]: 15/330 cut-off events. [2025-02-08 05:12:43,938 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:12:43,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 330 events. 15/330 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 661 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 272. Up to 4 conditions per place. [2025-02-08 05:12:43,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 305 transitions, 628 flow [2025-02-08 05:12:43,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 297 places, 305 transitions, 628 flow [2025-02-08 05:12:43,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:43,943 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;@d6af9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:43,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-08 05:12:43,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:43,954 INFO L124 PetriNetUnfolderBase]: 0/160 cut-off events. [2025-02-08 05:12:43,954 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:12:43,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:43,954 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-02-08 05:12:43,954 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-02-08 05:12:43,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2125689244, now seen corresponding path program 1 times [2025-02-08 05:12:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:43,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305941818] [2025-02-08 05:12:43,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:43,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 05:12:43,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 05:12:43,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:43,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:44,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:44,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305941818] [2025-02-08 05:12:44,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305941818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:44,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:12:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18989616] [2025-02-08 05:12:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:44,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:12:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:44,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:12:44,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:12:44,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 305 [2025-02-08 05:12:44,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 305 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 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-02-08 05:12:44,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:44,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 305 [2025-02-08 05:12:44,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:45,975 INFO L124 PetriNetUnfolderBase]: 6063/19711 cut-off events. [2025-02-08 05:12:45,976 INFO L125 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2025-02-08 05:12:46,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29447 conditions, 19711 events. 6063/19711 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 229818 event pairs, 1840 based on Foata normal form. 6611/22953 useless extension candidates. Maximal degree in co-relation 26749. Up to 5368 conditions per place. [2025-02-08 05:12:46,150 INFO L140 encePairwiseOnDemand]: 268/305 looper letters, 53 selfloop transitions, 18 changer transitions 0/309 dead transitions. [2025-02-08 05:12:46,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 309 transitions, 790 flow [2025-02-08 05:12:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:12:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:12:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-02-08 05:12:46,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9322404371584699 [2025-02-08 05:12:46,159 INFO L175 Difference]: Start difference. First operand has 297 places, 305 transitions, 628 flow. Second operand 3 states and 853 transitions. [2025-02-08 05:12:46,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 309 transitions, 790 flow [2025-02-08 05:12:46,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 309 transitions, 786 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:46,166 INFO L231 Difference]: Finished difference. Result has 282 places, 295 transitions, 726 flow [2025-02-08 05:12:46,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=282, PETRI_TRANSITIONS=295} [2025-02-08 05:12:46,169 INFO L279 CegarLoopForPetriNet]: 297 programPoint places, -15 predicate places. [2025-02-08 05:12:46,171 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 295 transitions, 726 flow [2025-02-08 05:12:46,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 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-02-08 05:12:46,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:46,171 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-02-08 05:12:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:12:46,172 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-02-08 05:12:46,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1580878140, now seen corresponding path program 1 times [2025-02-08 05:12:46,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:46,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18682223] [2025-02-08 05:12:46,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:46,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 05:12:46,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:12:46,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:46,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:46,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:46,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18682223] [2025-02-08 05:12:46,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18682223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:46,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:46,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:12:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540131692] [2025-02-08 05:12:46,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:46,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:12:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:46,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:12:46,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:12:46,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 305 [2025-02-08 05:12:46,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 295 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 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-02-08 05:12:46,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:46,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 305 [2025-02-08 05:12:46,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:47,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] 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][302], [Black: 300#true, 225#L693-2true, 112#L701true, 298#true, 288#L693-6true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:47,525 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-02-08 05:12:47,525 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:47,525 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-02-08 05:12:47,525 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:47,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] 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][251], [Black: 300#true, 112#L701true, 288#L693-6true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 22#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 296#true, 305#true]) [2025-02-08 05:12:47,528 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-02-08 05:12:47,528 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-08 05:12:47,528 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:47,528 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:47,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][318], [Black: 300#true, 225#L693-2true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 50#L701true, 296#true, 142#L693-6true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:47,532 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-02-08 05:12:47,532 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-02-08 05:12:47,532 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:47,532 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:47,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][289], [Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 22#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 50#L701true, 296#true, 142#L693-6true, 305#true]) [2025-02-08 05:12:47,532 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-02-08 05:12:47,532 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:47,532 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-08 05:12:47,532 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:48,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][318], [Black: 300#true, 225#L693-2true, 185#L694-1true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 50#L701true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:48,049 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-02-08 05:12:48,049 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:12:48,049 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:12:48,049 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-02-08 05:12:48,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][289], [Black: 300#true, 298#true, 185#L694-1true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 22#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 50#L701true, 296#true, 305#true]) [2025-02-08 05:12:48,053 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-02-08 05:12:48,053 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:48,053 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:12:48,053 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:12:48,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][289], [Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 186#L693-3true, 50#L701true, 296#true, 144#L700-2true, 305#true]) [2025-02-08 05:12:48,290 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-02-08 05:12:48,291 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-02-08 05:12:48,291 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:12:48,291 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:12:48,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][289], [Black: 300#true, 112#L701true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 50#L701true, 186#L693-3true, 296#true, 305#true]) [2025-02-08 05:12:48,292 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-02-08 05:12:48,292 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:12:48,292 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-02-08 05:12:48,292 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:12:48,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1106] 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][301], [Black: 300#true, 225#L693-2true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 296#true, 215#L700-2true, 144#L700-2true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:48,352 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:48,352 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,352 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,352 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1106] 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][301], [Black: 300#true, 225#L693-2true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 296#true, 144#L700-2true, 223#L699true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:48,352 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-02-08 05:12:48,352 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:48,352 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:48,352 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:48,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1106] 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][301], [Black: 300#true, 225#L693-2true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 50#L701true, 296#true, 144#L700-2true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:48,353 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:48,353 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,353 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,353 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] 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][302], [Black: 300#true, 225#L693-2true, 112#L701true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 296#true, 215#L700-2true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:48,353 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:48,353 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,353 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,353 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] 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][302], [Black: 300#true, 225#L693-2true, 112#L701true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 296#true, 223#L699true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:48,354 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-02-08 05:12:48,354 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:48,354 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:48,354 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:48,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] 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][302], [Black: 300#true, 225#L693-2true, 112#L701true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 50#L701true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:48,354 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:48,354 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,354 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,354 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][318], [Black: 300#true, 225#L693-2true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 50#L701true, 296#true, 144#L700-2true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:48,355 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:48,355 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,355 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,355 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:48,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][318], [Black: 300#true, 225#L693-2true, 112#L701true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 50#L701true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:48,356 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:48,356 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:48,356 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,356 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][289], [Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 22#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 50#L701true, 296#true, 144#L700-2true, 305#true]) [2025-02-08 05:12:48,361 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:48,361 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,361 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:48,361 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][289], [Black: 300#true, 112#L701true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 50#L701true, 22#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 296#true, 305#true]) [2025-02-08 05:12:48,363 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:48,363 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,363 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:48,363 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:48,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][318], [Black: 300#true, 225#L693-2true, 170#L699true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 50#L701true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-02-08 05:12:48,389 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-02-08 05:12:48,389 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:48,389 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-02-08 05:12:48,389 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:48,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] 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][288], [Black: 300#true, 170#L699true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 296#true, 215#L700-2true, 219#L694-2true, 305#true]) [2025-02-08 05:12:48,441 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-02-08 05:12:48,442 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:12:48,442 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:12:48,442 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:12:48,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][289], [Black: 300#true, 170#L699true, 298#true, 302#(= |#race~count~0| 0), 294#true, 6#L709-2true, 50#L701true, 296#true, 219#L694-2true, 305#true]) [2025-02-08 05:12:48,443 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-02-08 05:12:48,443 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:12:48,443 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:12:48,443 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:12:48,688 INFO L124 PetriNetUnfolderBase]: 8308/27248 cut-off events. [2025-02-08 05:12:48,688 INFO L125 PetriNetUnfolderBase]: For 8740/9492 co-relation queries the response was YES. [2025-02-08 05:12:48,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47971 conditions, 27248 events. 8308/27248 cut-off events. For 8740/9492 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 338842 event pairs, 3131 based on Foata normal form. 50/22514 useless extension candidates. Maximal degree in co-relation 47670. Up to 10180 conditions per place. [2025-02-08 05:12:48,876 INFO L140 encePairwiseOnDemand]: 293/305 looper letters, 53 selfloop transitions, 20 changer transitions 0/323 dead transitions. [2025-02-08 05:12:48,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 323 transitions, 986 flow [2025-02-08 05:12:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:12:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:12:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2025-02-08 05:12:48,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.898360655737705 [2025-02-08 05:12:48,879 INFO L175 Difference]: Start difference. First operand has 282 places, 295 transitions, 726 flow. Second operand 3 states and 822 transitions. [2025-02-08 05:12:48,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 323 transitions, 986 flow [2025-02-08 05:12:48,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 323 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:12:48,895 INFO L231 Difference]: Finished difference. Result has 284 places, 313 transitions, 876 flow [2025-02-08 05:12:48,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=284, PETRI_TRANSITIONS=313} [2025-02-08 05:12:48,896 INFO L279 CegarLoopForPetriNet]: 297 programPoint places, -13 predicate places. [2025-02-08 05:12:48,896 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 313 transitions, 876 flow [2025-02-08 05:12:48,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 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-02-08 05:12:48,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:48,897 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-02-08 05:12:48,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:12:48,897 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-02-08 05:12:48,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash -36853492, now seen corresponding path program 1 times [2025-02-08 05:12:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:48,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303699264] [2025-02-08 05:12:48,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:48,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:12:48,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:12:48,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:48,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:48,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:48,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303699264] [2025-02-08 05:12:48,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303699264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:48,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:48,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:12:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50301179] [2025-02-08 05:12:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:48,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:12:48,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:48,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:12:48,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:12:49,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 305 [2025-02-08 05:12:49,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 313 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 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-02-08 05:12:49,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:49,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 305 [2025-02-08 05:12:49,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:50,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][299], [Black: 300#true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 6#L709-2true, 50#L701true, 296#true, 222#L693-6true, 89#L693-3true, 305#true]) [2025-02-08 05:12:50,335 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-02-08 05:12:50,335 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-02-08 05:12:50,335 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-08 05:12:50,335 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-08 05:12:50,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] 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][313], [Black: 300#true, 298#true, 288#L693-6true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 6#L709-2true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 296#true, 254#L701true, 153#L693-2true, 305#true]) [2025-02-08 05:12:50,450 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-02-08 05:12:50,450 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-02-08 05:12:50,450 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:50,450 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:50,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][335], [Black: 300#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 6#L709-2true, 50#L701true, 296#true, 153#L693-2true, 222#L693-6true, 305#true]) [2025-02-08 05:12:50,706 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-02-08 05:12:50,706 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:50,706 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-08 05:12:50,706 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:50,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][299], [Black: 300#true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 6#L709-2true, 50#L701true, 296#true, 222#L693-6true, 155#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 305#true]) [2025-02-08 05:12:50,706 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-02-08 05:12:50,707 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:50,707 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:12:50,707 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-08 05:12:50,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] 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: 300#true, 310#true, 298#true, 288#L693-6true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 78#L694-2true, 294#true, 6#L709-2true, 254#L701true, 296#true, 305#true]) [2025-02-08 05:12:50,783 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-02-08 05:12:50,783 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:12:50,783 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-02-08 05:12:50,783 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-02-08 05:12:51,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][299], [Black: 300#true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 35#L694-1true, 6#L709-2true, 50#L701true, 296#true, 89#L693-3true, 305#true]) [2025-02-08 05:12:51,112 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2025-02-08 05:12:51,112 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-02-08 05:12:51,112 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-08 05:12:51,112 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-08 05:12:51,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][299], [Black: 300#true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 35#L694-1true, 6#L709-2true, 50#L701true, 296#true, 155#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 305#true]) [2025-02-08 05:12:51,231 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-02-08 05:12:51,231 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:12:51,231 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:12:51,231 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-02-08 05:12:51,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][335], [Black: 300#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 35#L694-1true, 6#L709-2true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 50#L701true, 296#true, 153#L693-2true, 305#true]) [2025-02-08 05:12:51,231 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-02-08 05:12:51,231 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-02-08 05:12:51,231 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:12:51,231 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:12:51,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][299], [Black: 300#true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 6#L709-2true, 50#L701true, 296#true, 254#L701true, 89#L693-3true, 305#true]) [2025-02-08 05:12:51,598 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,598 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:12:51,598 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:12:51,598 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][299], [Black: 300#true, 310#true, 27#L700-2true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 6#L709-2true, 50#L701true, 296#true, 89#L693-3true, 305#true]) [2025-02-08 05:12:51,600 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-02-08 05:12:51,600 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,600 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:12:51,600 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:12:51,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] 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][298], [Black: 300#true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 6#L709-2true, 254#L701true, 296#true, 215#L700-2true, 89#L693-3true, 305#true]) [2025-02-08 05:12:51,601 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-02-08 05:12:51,601 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:12:51,601 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,601 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:12:51,601 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([995] 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][299], [Black: 300#true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 6#L709-2true, 50#L701true, 254#L701true, 296#true, 89#L693-3true, 305#true]) [2025-02-08 05:12:51,601 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-02-08 05:12:51,601 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:12:51,601 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,601 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-08 05:12:51,601 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][299], [Black: 300#true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 6#L709-2true, 50#L701true, 254#L701true, 296#true, 155#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 305#true]) [2025-02-08 05:12:51,687 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-02-08 05:12:51,687 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:51,687 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,687 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][335], [Black: 300#true, 27#L700-2true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 6#L709-2true, 50#L701true, 296#true, 153#L693-2true, 305#true]) [2025-02-08 05:12:51,689 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,689 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:51,689 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,690 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][335], [Black: 300#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 6#L709-2true, 50#L701true, 254#L701true, 296#true, 153#L693-2true, 305#true]) [2025-02-08 05:12:51,690 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,690 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,690 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,690 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:51,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][299], [Black: 300#true, 310#true, 27#L700-2true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 6#L709-2true, 50#L701true, 296#true, 155#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 305#true]) [2025-02-08 05:12:51,691 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,691 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,691 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:51,691 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] 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][298], [Black: 300#true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 6#L709-2true, 254#L701true, 296#true, 215#L700-2true, 155#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 305#true]) [2025-02-08 05:12:51,692 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,692 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,692 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:51,692 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,692 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([995] 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][299], [Black: 300#true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 6#L709-2true, 50#L701true, 254#L701true, 296#true, 155#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 305#true]) [2025-02-08 05:12:51,692 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-02-08 05:12:51,692 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:51,692 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:12:51,692 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,692 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-08 05:12:51,724 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] 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][335], [Black: 300#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 180#L699true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 6#L709-2true, 50#L701true, 296#true, 153#L693-2true, 305#true]) [2025-02-08 05:12:51,724 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-02-08 05:12:51,724 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:51,724 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-02-08 05:12:51,724 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:12:51,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] 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][256], [Black: 300#true, 310#true, 27#L700-2true, 112#L701true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 6#L709-2true, 50#L701true, 296#true, 305#true]) [2025-02-08 05:12:51,904 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-02-08 05:12:51,904 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-02-08 05:12:51,904 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-02-08 05:12:51,904 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-02-08 05:12:51,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] 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][256], [Black: 300#true, 310#true, 112#L701true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 180#L699true, 6#L709-2true, 50#L701true, 296#true, 305#true]) [2025-02-08 05:12:51,915 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2025-02-08 05:12:51,915 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-02-08 05:12:51,915 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-02-08 05:12:51,915 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-02-08 05:12:51,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1106] 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][255], [Black: 300#true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 180#L699true, 6#L709-2true, 50#L701true, 296#true, 144#L700-2true, 305#true]) [2025-02-08 05:12:51,917 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-02-08 05:12:51,917 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-02-08 05:12:51,917 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-02-08 05:12:51,918 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-02-08 05:12:51,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] 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][256], [Black: 300#true, 310#true, 112#L701true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 180#L699true, 6#L709-2true, 296#true, 215#L700-2true, 305#true]) [2025-02-08 05:12:51,918 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-02-08 05:12:51,918 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-02-08 05:12:51,918 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-02-08 05:12:51,918 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-02-08 05:12:51,918 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1099] 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][256], [Black: 300#true, 310#true, 112#L701true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 180#L699true, 6#L709-2true, 50#L701true, 296#true, 305#true]) [2025-02-08 05:12:51,918 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-02-08 05:12:51,918 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-02-08 05:12:51,918 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-02-08 05:12:51,918 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-02-08 05:12:51,918 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-02-08 05:12:51,972 INFO L124 PetriNetUnfolderBase]: 10262/31939 cut-off events. [2025-02-08 05:12:51,972 INFO L125 PetriNetUnfolderBase]: For 15163/16505 co-relation queries the response was YES. [2025-02-08 05:12:52,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59889 conditions, 31939 events. 10262/31939 cut-off events. For 15163/16505 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 400134 event pairs, 3502 based on Foata normal form. 56/26061 useless extension candidates. Maximal degree in co-relation 59623. Up to 12403 conditions per place. [2025-02-08 05:12:52,264 INFO L140 encePairwiseOnDemand]: 293/305 looper letters, 66 selfloop transitions, 28 changer transitions 0/346 dead transitions. [2025-02-08 05:12:52,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 346 transitions, 1227 flow [2025-02-08 05:12:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:12:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:12:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2025-02-08 05:12:52,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972677595628415 [2025-02-08 05:12:52,267 INFO L175 Difference]: Start difference. First operand has 284 places, 313 transitions, 876 flow. Second operand 3 states and 821 transitions. [2025-02-08 05:12:52,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 346 transitions, 1227 flow [2025-02-08 05:12:52,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 346 transitions, 1171 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:12:52,294 INFO L231 Difference]: Finished difference. Result has 286 places, 337 transitions, 1122 flow [2025-02-08 05:12:52,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=286, PETRI_TRANSITIONS=337} [2025-02-08 05:12:52,297 INFO L279 CegarLoopForPetriNet]: 297 programPoint places, -11 predicate places. [2025-02-08 05:12:52,297 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 337 transitions, 1122 flow [2025-02-08 05:12:52,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 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-02-08 05:12:52,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:52,298 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-02-08 05:12:52,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:12:52,298 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-02-08 05:12:52,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:52,299 INFO L85 PathProgramCache]: Analyzing trace with hash -101340797, now seen corresponding path program 1 times [2025-02-08 05:12:52,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:52,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285262661] [2025-02-08 05:12:52,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:52,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:52,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 05:12:52,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:12:52,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:52,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:52,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:52,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 05:12:52,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:12:52,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:52,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:52,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:52,391 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:52,391 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-02-08 05:12:52,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-02-08 05:12:52,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-02-08 05:12:52,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-02-08 05:12:52,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:12:52,392 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:12:52,394 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:52,394 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:12:52,419 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:52,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 347 places, 358 transitions, 744 flow [2025-02-08 05:12:52,453 INFO L124 PetriNetUnfolderBase]: 20/392 cut-off events. [2025-02-08 05:12:52,453 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:12:52,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 392 events. 20/392 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 975 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 338. Up to 5 conditions per place. [2025-02-08 05:12:52,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 347 places, 358 transitions, 744 flow [2025-02-08 05:12:52,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 347 places, 358 transitions, 744 flow [2025-02-08 05:12:52,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:52,465 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;@d6af9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:52,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-02-08 05:12:52,471 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:52,471 INFO L124 PetriNetUnfolderBase]: 0/160 cut-off events. [2025-02-08 05:12:52,471 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:12:52,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:52,471 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-02-08 05:12:52,471 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-02-08 05:12:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1326330408, now seen corresponding path program 1 times [2025-02-08 05:12:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457681826] [2025-02-08 05:12:52,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:52,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:52,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 05:12:52,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 05:12:52,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:52,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:52,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457681826] [2025-02-08 05:12:52,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457681826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:52,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:12:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647159618] [2025-02-08 05:12:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:52,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:12:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:52,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:12:52,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:12:52,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 358 [2025-02-08 05:12:52,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 358 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 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-02-08 05:12:52,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:52,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 358 [2025-02-08 05:12:52,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand