./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 551b0097 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-?-551b009-m [2025-01-09 21:07:00,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:07:00,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:07:00,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:07:00,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:07:00,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:07:00,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:07:00,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:07:00,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:07:00,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:07:00,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:07:00,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:07:00,411 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:07:00,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:07:00,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:07:00,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:07:00,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:07:00,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:07:00,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:07:00,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:07:00,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:07:00,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:07:00,412 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:07:00,412 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:07:00,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:07:00,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:07:00,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:07:00,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:07:00,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:07:00,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:07:00,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:07:00,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:07:00,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:07:00,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:07:00,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:07:00,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:07:00,414 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-01-09 21:07:00,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:07:00,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:07:00,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:07:00,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:07:00,651 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:07:00,656 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-01-09 21:07:01,790 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a428f19f8/5d609bbc19934fce8eb4812a3ed3fe7a/FLAG629dbd999 [2025-01-09 21:07:02,074 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:07:02,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2025-01-09 21:07:02,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a428f19f8/5d609bbc19934fce8eb4812a3ed3fe7a/FLAG629dbd999 [2025-01-09 21:07:02,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a428f19f8/5d609bbc19934fce8eb4812a3ed3fe7a [2025-01-09 21:07:02,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:07:02,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:07:02,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:07:02,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:07:02,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:07:02,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1152c614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02, skipping insertion in model container [2025-01-09 21:07:02,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:07:02,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:07:02,335 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:07:02,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:07:02,407 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:07:02,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02 WrapperNode [2025-01-09 21:07:02,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:07:02,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:07:02,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:07:02,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:07:02,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,444 INFO L138 Inliner]: procedures = 164, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 188 [2025-01-09 21:07:02,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:07:02,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:07:02,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:07:02,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:07:02,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:07:02,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:07:02,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:07:02,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:07:02,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (1/1) ... [2025-01-09 21:07:02,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:07:02,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:07:02,516 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-01-09 21:07:02,518 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-01-09 21:07:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:07:02,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:07:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:07:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:07:02,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:07:02,534 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:07:02,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:07:02,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:07:02,534 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:07:02,647 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:07:02,648 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:07:02,862 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:07:02,862 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:07:02,885 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:07:02,886 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:07:02,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:02 BoogieIcfgContainer [2025-01-09 21:07:02,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:07:02,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:07:02,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:07:02,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:07:02,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:07:02" (1/3) ... [2025-01-09 21:07:02,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24792551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:07:02, skipping insertion in model container [2025-01-09 21:07:02,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:02" (2/3) ... [2025-01-09 21:07:02,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24792551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:07:02, skipping insertion in model container [2025-01-09 21:07:02,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:02" (3/3) ... [2025-01-09 21:07:02,897 INFO L128 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2025-01-09 21:07:02,908 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:07:02,910 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-01-09 21:07:02,910 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:07:02,954 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:07:02,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 199 transitions, 402 flow [2025-01-09 21:07:03,042 INFO L124 PetriNetUnfolderBase]: 5/206 cut-off events. [2025-01-09 21:07:03,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:07:03,050 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 107 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-01-09 21:07:03,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 199 transitions, 402 flow [2025-01-09 21:07:03,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 199 transitions, 402 flow [2025-01-09 21:07:03,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:07:03,074 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;@5ab9c82d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:07:03,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 21:07:03,099 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:07:03,100 INFO L124 PetriNetUnfolderBase]: 0/157 cut-off events. [2025-01-09 21:07:03,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:07:03,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:03,100 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-01-09 21:07:03,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:07:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 603060562, now seen corresponding path program 1 times [2025-01-09 21:07:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:03,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144886861] [2025-01-09 21:07:03,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:03,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 21:07:03,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 21:07:03,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:03,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:07:03,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:03,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144886861] [2025-01-09 21:07:03,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144886861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:03,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:03,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:03,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102225087] [2025-01-09 21:07:03,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:03,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:03,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:03,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:03,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:03,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 199 [2025-01-09 21:07:03,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 199 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-01-09 21:07:03,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:03,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 199 [2025-01-09 21:07:03,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:03,572 INFO L124 PetriNetUnfolderBase]: 1/193 cut-off events. [2025-01-09 21:07:03,572 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:07:03,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 193 events. 1/193 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 19/206 useless extension candidates. Maximal degree in co-relation 63. Up to 7 conditions per place. [2025-01-09 21:07:03,574 INFO L140 encePairwiseOnDemand]: 188/199 looper letters, 8 selfloop transitions, 4 changer transitions 0/186 dead transitions. [2025-01-09 21:07:03,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 186 transitions, 400 flow [2025-01-09 21:07:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2025-01-09 21:07:03,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430485762144054 [2025-01-09 21:07:03,589 INFO L175 Difference]: Start difference. First operand has 197 places, 199 transitions, 402 flow. Second operand 3 states and 563 transitions. [2025-01-09 21:07:03,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 186 transitions, 400 flow [2025-01-09 21:07:03,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 186 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:03,597 INFO L231 Difference]: Finished difference. Result has 188 places, 185 transitions, 382 flow [2025-01-09 21:07:03,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=188, PETRI_TRANSITIONS=185} [2025-01-09 21:07:03,602 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-01-09 21:07:03,603 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 185 transitions, 382 flow [2025-01-09 21:07:03,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-01-09 21:07:03,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:03,604 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-01-09 21:07:03,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:07:03,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:07:03,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash 456694051, now seen corresponding path program 1 times [2025-01-09 21:07:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:03,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495465106] [2025-01-09 21:07:03,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:03,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 21:07:03,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 21:07:03,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:03,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:03,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:07:03,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 21:07:03,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 21:07:03,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:03,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:03,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:07:03,731 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:07:03,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-09 21:07:03,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-01-09 21:07:03,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-01-09 21:07:03,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-01-09 21:07:03,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-01-09 21:07:03,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-01-09 21:07:03,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-01-09 21:07:03,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-01-09 21:07:03,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-01-09 21:07:03,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-01-09 21:07:03,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-01-09 21:07:03,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-01-09 21:07:03,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-01-09 21:07:03,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:07:03,734 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 21:07:03,736 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:07:03,736 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:07:03,759 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:07:03,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 252 transitions, 514 flow [2025-01-09 21:07:03,826 INFO L124 PetriNetUnfolderBase]: 10/268 cut-off events. [2025-01-09 21:07:03,826 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:07:03,828 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 356 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-01-09 21:07:03,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 252 transitions, 514 flow [2025-01-09 21:07:03,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 252 transitions, 514 flow [2025-01-09 21:07:03,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:07:03,833 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;@5ab9c82d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:07:03,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-09 21:07:03,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:07:03,845 INFO L124 PetriNetUnfolderBase]: 0/159 cut-off events. [2025-01-09 21:07:03,845 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:07:03,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:03,845 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-01-09 21:07:03,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:07:03,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1150242426, now seen corresponding path program 1 times [2025-01-09 21:07:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:03,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181730692] [2025-01-09 21:07:03,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:03,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 21:07:03,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 21:07:03,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:03,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:07:03,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:03,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181730692] [2025-01-09 21:07:03,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181730692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:03,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:03,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402005161] [2025-01-09 21:07:03,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:03,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:03,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:03,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:03,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:04,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 252 [2025-01-09 21:07:04,017 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-01-09 21:07:04,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:04,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 252 [2025-01-09 21:07:04,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:04,210 INFO L124 PetriNetUnfolderBase]: 193/1214 cut-off events. [2025-01-09 21:07:04,210 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 21:07:04,215 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 7806 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-01-09 21:07:04,219 INFO L140 encePairwiseOnDemand]: 227/252 looper letters, 35 selfloop transitions, 12 changer transitions 0/253 dead transitions. [2025-01-09 21:07:04,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 253 transitions, 615 flow [2025-01-09 21:07:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-01-09 21:07:04,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-01-09 21:07:04,222 INFO L175 Difference]: Start difference. First operand has 247 places, 252 transitions, 514 flow. Second operand 3 states and 714 transitions. [2025-01-09 21:07:04,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 253 transitions, 615 flow [2025-01-09 21:07:04,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 253 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:04,230 INFO L231 Difference]: Finished difference. Result has 237 places, 244 transitions, 578 flow [2025-01-09 21:07:04,231 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-01-09 21:07:04,232 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -10 predicate places. [2025-01-09 21:07:04,232 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 244 transitions, 578 flow [2025-01-09 21:07:04,233 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-01-09 21:07:04,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:04,233 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-01-09 21:07:04,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:07:04,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:07:04,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:04,234 INFO L85 PathProgramCache]: Analyzing trace with hash 90988106, now seen corresponding path program 1 times [2025-01-09 21:07:04,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:04,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130708571] [2025-01-09 21:07:04,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:04,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:04,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 21:07:04,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:07:04,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:04,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:07:04,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:04,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130708571] [2025-01-09 21:07:04,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130708571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:04,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:04,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:04,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108109634] [2025-01-09 21:07:04,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:04,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:04,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:04,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:04,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:04,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 252 [2025-01-09 21:07:04,387 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-01-09 21:07:04,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:04,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 252 [2025-01-09 21:07:04,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:04,595 INFO L124 PetriNetUnfolderBase]: 279/1507 cut-off events. [2025-01-09 21:07:04,596 INFO L125 PetriNetUnfolderBase]: For 382/397 co-relation queries the response was YES. [2025-01-09 21:07:04,602 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 10555 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-01-09 21:07:04,609 INFO L140 encePairwiseOnDemand]: 244/252 looper letters, 35 selfloop transitions, 10 changer transitions 0/257 dead transitions. [2025-01-09 21:07:04,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 257 transitions, 719 flow [2025-01-09 21:07:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 687 transitions. [2025-01-09 21:07:04,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087301587301587 [2025-01-09 21:07:04,613 INFO L175 Difference]: Start difference. First operand has 237 places, 244 transitions, 578 flow. Second operand 3 states and 687 transitions. [2025-01-09 21:07:04,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 257 transitions, 719 flow [2025-01-09 21:07:04,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 257 transitions, 687 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:07:04,623 INFO L231 Difference]: Finished difference. Result has 239 places, 252 transitions, 640 flow [2025-01-09 21:07:04,624 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-01-09 21:07:04,624 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-01-09 21:07:04,625 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 252 transitions, 640 flow [2025-01-09 21:07:04,625 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-01-09 21:07:04,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:04,626 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-01-09 21:07:04,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:07:04,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:07:04,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash -525045803, now seen corresponding path program 1 times [2025-01-09 21:07:04,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:04,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952430654] [2025-01-09 21:07:04,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:04,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 21:07:04,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:07:04,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:04,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:04,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:07:04,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 21:07:04,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:07:04,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:04,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:04,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:07:04,712 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:07:04,712 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-01-09 21:07:04,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-01-09 21:07:04,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-01-09 21:07:04,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-01-09 21:07:04,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-01-09 21:07:04,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2025-01-09 21:07:04,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2025-01-09 21:07:04,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2025-01-09 21:07:04,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2025-01-09 21:07:04,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-01-09 21:07:04,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-01-09 21:07:04,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2025-01-09 21:07:04,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-01-09 21:07:04,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-01-09 21:07:04,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-01-09 21:07:04,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-01-09 21:07:04,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-01-09 21:07:04,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-01-09 21:07:04,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-01-09 21:07:04,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:07:04,714 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 21:07:04,715 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:07:04,715 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:07:04,756 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:07:04,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 628 flow [2025-01-09 21:07:04,797 INFO L124 PetriNetUnfolderBase]: 15/330 cut-off events. [2025-01-09 21:07:04,798 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:07:04,801 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 660 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-01-09 21:07:04,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 305 transitions, 628 flow [2025-01-09 21:07:04,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 297 places, 305 transitions, 628 flow [2025-01-09 21:07:04,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:07:04,809 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;@5ab9c82d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:07:04,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-01-09 21:07:04,822 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:07:04,822 INFO L124 PetriNetUnfolderBase]: 0/159 cut-off events. [2025-01-09 21:07:04,822 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:07:04,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:04,823 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-01-09 21:07:04,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:07:04,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1129413082, now seen corresponding path program 1 times [2025-01-09 21:07:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:04,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721968624] [2025-01-09 21:07:04,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:04,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:04,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 21:07:04,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 21:07:04,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:04,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:07:04,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:04,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721968624] [2025-01-09 21:07:04,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721968624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:04,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:04,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:04,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453482336] [2025-01-09 21:07:04,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:04,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:04,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:04,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:04,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:04,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 305 [2025-01-09 21:07:04,938 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-01-09 21:07:04,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:04,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 305 [2025-01-09 21:07:04,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:06,777 INFO L124 PetriNetUnfolderBase]: 6063/19711 cut-off events. [2025-01-09 21:07:06,777 INFO L125 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2025-01-09 21:07:06,817 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 613. Compared 229822 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-01-09 21:07:06,908 INFO L140 encePairwiseOnDemand]: 268/305 looper letters, 53 selfloop transitions, 18 changer transitions 0/309 dead transitions. [2025-01-09 21:07:06,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 309 transitions, 790 flow [2025-01-09 21:07:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-01-09 21:07:06,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9322404371584699 [2025-01-09 21:07:06,913 INFO L175 Difference]: Start difference. First operand has 297 places, 305 transitions, 628 flow. Second operand 3 states and 853 transitions. [2025-01-09 21:07:06,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 309 transitions, 790 flow [2025-01-09 21:07:06,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 309 transitions, 786 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:06,923 INFO L231 Difference]: Finished difference. Result has 282 places, 295 transitions, 726 flow [2025-01-09 21:07:06,923 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-01-09 21:07:06,925 INFO L279 CegarLoopForPetriNet]: 297 programPoint places, -15 predicate places. [2025-01-09 21:07:06,925 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 295 transitions, 726 flow [2025-01-09 21:07:06,926 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-01-09 21:07:06,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:06,926 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-01-09 21:07:06,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:07:06,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:07:06,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:06,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1400434535, now seen corresponding path program 1 times [2025-01-09 21:07:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:06,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165590193] [2025-01-09 21:07:06,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:06,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:06,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 21:07:06,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:07:06,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:06,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:07:06,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:06,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165590193] [2025-01-09 21:07:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165590193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:06,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:06,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:06,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872953313] [2025-01-09 21:07:06,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:06,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:06,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:06,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:06,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:07,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 305 [2025-01-09 21:07:07,049 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-01-09 21:07:07,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:07,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 305 [2025-01-09 21:07:07,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:08,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1125] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 294#true, 100#L693-7true, 50#L693-1true, 296#true, 153#L701-2true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:08,283 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-01-09 21:07:08,283 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:08,283 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:07:08,283 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:08,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1125] L699-5-->L701-2: 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, 60#L709-4true, 298#true, 15#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 302#(= |#race~count~0| 0), 294#true, 50#L693-1true, 296#true, 153#L701-2true, 305#true]) [2025-01-09 21:07:08,292 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-01-09 21:07:08,292 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:08,292 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-01-09 21:07:08,292 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:08,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 14#L693-1true, 294#true, 276#L701-2true, 100#L693-7true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:08,301 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-01-09 21:07:08,301 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:07:08,301 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:08,301 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:08,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 15#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 298#true, 14#L693-1true, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:08,302 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-01-09 21:07:08,302 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:08,302 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-01-09 21:07:08,302 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:08,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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, 60#L709-4true, 298#true, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 100#L693-7true, 187#L694-1true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:08,917 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-01-09 21:07:08,918 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:07:08,918 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:07:08,918 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:07:08,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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, 60#L709-4true, 15#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 298#true, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 187#L694-1true, 296#true, 305#true]) [2025-01-09 21:07:08,924 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-01-09 21:07:08,924 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:08,924 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:07:08,924 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:07:09,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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, 60#L709-4true, 298#true, 302#(= |#race~count~0| 0), 294#true, 192#L693-5true, 276#L701-2true, 148#L700-2true, 296#true, 305#true]) [2025-01-09 21:07:09,253 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-01-09 21:07:09,253 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:07:09,253 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:07:09,254 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:07:09,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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, 60#L709-4true, 298#true, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 192#L693-5true, 296#true, 153#L701-2true, 305#true]) [2025-01-09 21:07:09,254 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-01-09 21:07:09,254 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:07:09,254 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:07:09,254 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:07:09,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L699-3-->L700-2: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_5| 0) (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#MTX~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#MTX~0.base_13|) |v_~#MTX~0.offset_13| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_5|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][301], [60#L709-4true, Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 294#true, 100#L693-7true, 148#L700-2true, 296#true, 218#L700-2true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:09,311 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:09,311 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,311 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,311 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L699-3-->L700-2: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_5| 0) (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#MTX~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#MTX~0.base_13|) |v_~#MTX~0.offset_13| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_5|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][301], [60#L709-4true, Black: 300#true, 298#true, 247#L700-5true, 302#(= |#race~count~0| 0), 294#true, 148#L700-2true, 100#L693-7true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:09,311 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-01-09 21:07:09,311 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:09,311 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:09,311 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:09,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L699-3-->L700-2: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_5| 0) (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#MTX~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#MTX~0.base_13|) |v_~#MTX~0.offset_13| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_5|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][301], [60#L709-4true, Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 148#L700-2true, 100#L693-7true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:09,311 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:09,311 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,312 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,312 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1125] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 294#true, 100#L693-7true, 296#true, 153#L701-2true, 218#L700-2true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:09,312 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:09,312 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,312 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,312 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1125] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 298#true, 247#L700-5true, 302#(= |#race~count~0| 0), 294#true, 100#L693-7true, 296#true, 153#L701-2true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:09,312 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-01-09 21:07:09,312 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:09,313 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:09,313 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:09,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1125] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 100#L693-7true, 296#true, 153#L701-2true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:09,313 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:09,313 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,313 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,313 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 100#L693-7true, 148#L700-2true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:09,314 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:09,314 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,314 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,314 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:09,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 298#true, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 100#L693-7true, 296#true, 153#L701-2true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:09,315 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:09,315 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,315 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:09,315 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 298#true, 15#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 148#L700-2true, 296#true, 305#true]) [2025-01-09 21:07:09,318 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:09,318 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,318 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,318 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:09,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 298#true, 15#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 296#true, 153#L701-2true, 305#true]) [2025-01-09 21:07:09,319 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:09,319 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,319 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:09,319 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:09,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 281#L700-5true, 298#true, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 100#L693-7true, 296#true, 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|)]) [2025-01-09 21:07:09,342 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-01-09 21:07:09,342 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:09,342 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:09,342 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-01-09 21:07:09,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L699-3-->L700-2: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_5| 0) (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#MTX~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#MTX~0.base_13|) |v_~#MTX~0.offset_13| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_5|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1][288], [60#L709-4true, Black: 300#true, 281#L700-5true, 298#true, 61#L694true, 302#(= |#race~count~0| 0), 294#true, 296#true, 218#L700-2true, 305#true]) [2025-01-09 21:07:09,388 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-01-09 21:07:09,388 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:07:09,388 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:07:09,388 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:07:09,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 281#L700-5true, 298#true, 61#L694true, 302#(= |#race~count~0| 0), 294#true, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:09,389 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-01-09 21:07:09,389 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:07:09,389 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:07:09,389 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:07:09,532 INFO L124 PetriNetUnfolderBase]: 8308/27248 cut-off events. [2025-01-09 21:07:09,532 INFO L125 PetriNetUnfolderBase]: For 8745/9497 co-relation queries the response was YES. [2025-01-09 21:07:09,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47971 conditions, 27248 events. 8308/27248 cut-off events. For 8745/9497 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 338813 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-01-09 21:07:09,696 INFO L140 encePairwiseOnDemand]: 293/305 looper letters, 53 selfloop transitions, 20 changer transitions 0/323 dead transitions. [2025-01-09 21:07:09,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 323 transitions, 986 flow [2025-01-09 21:07:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2025-01-09 21:07:09,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.898360655737705 [2025-01-09 21:07:09,699 INFO L175 Difference]: Start difference. First operand has 282 places, 295 transitions, 726 flow. Second operand 3 states and 822 transitions. [2025-01-09 21:07:09,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 323 transitions, 986 flow [2025-01-09 21:07:09,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 323 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:07:09,713 INFO L231 Difference]: Finished difference. Result has 284 places, 313 transitions, 876 flow [2025-01-09 21:07:09,714 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-01-09 21:07:09,714 INFO L279 CegarLoopForPetriNet]: 297 programPoint places, -13 predicate places. [2025-01-09 21:07:09,714 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 313 transitions, 876 flow [2025-01-09 21:07:09,715 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-01-09 21:07:09,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:09,715 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-01-09 21:07:09,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:07:09,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:07:09,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:09,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1110883459, now seen corresponding path program 1 times [2025-01-09 21:07:09,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:09,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503635232] [2025-01-09 21:07:09,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:09,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:09,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:07:09,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:07:09,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:09,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:07:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503635232] [2025-01-09 21:07:09,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503635232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:09,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:09,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:09,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114389224] [2025-01-09 21:07:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:09,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:09,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:09,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:09,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 305 [2025-01-09 21:07:09,824 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-01-09 21:07:09,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:09,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 305 [2025-01-09 21:07:09,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:10,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 171#L693-1true, 310#true, 298#true, 156#L693-5true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:10,901 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-01-09 21:07:10,901 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:07:10,901 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-01-09 21:07:10,901 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-01-09 21:07:10,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1073] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 205#L693-7true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 291#L701-2true, 294#true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 50#L693-1true, 296#true, 305#true]) [2025-01-09 21:07:10,975 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-01-09 21:07:10,975 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:07:10,975 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:10,975 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:11,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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, 60#L709-4true, 171#L693-1true, 205#L693-7true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:11,032 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-01-09 21:07:11,032 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:11,033 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:11,033 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-01-09 21:07:11,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 171#L693-1true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 67#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:11,034 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-01-09 21:07:11,034 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:11,034 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:07:11,034 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-01-09 21:07:11,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1073] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 310#true, 189#L694true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 291#L701-2true, 294#true, 50#L693-1true, 296#true, 305#true]) [2025-01-09 21:07:11,103 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-01-09 21:07:11,103 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:07:11,103 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-01-09 21:07:11,103 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-01-09 21:07:11,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, 38#L694-1true, Black: 300#true, 310#true, 156#L693-5true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:11,586 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2025-01-09 21:07:11,586 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-01-09 21:07:11,586 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:07:11,586 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-01-09 21:07:11,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 38#L694-1true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 67#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:11,746 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-01-09 21:07:11,746 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:07:11,746 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:07:11,746 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:07:11,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 38#L694-1true, 205#L693-7true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 276#L701-2true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 296#true, 305#true]) [2025-01-09 21:07:11,747 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-01-09 21:07:11,747 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:07:11,747 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:07:11,747 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:07:12,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 310#true, 156#L693-5true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 291#L701-2true, 294#true, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:12,003 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,003 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:07:12,003 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,003 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:07:12,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 30#L700-2true, 310#true, 298#true, 156#L693-5true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:12,005 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-01-09 21:07:12,005 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,005 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:07:12,005 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:07:12,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L699-3-->L700-2: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_5| 0) (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#MTX~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#MTX~0.base_13|) |v_~#MTX~0.offset_13| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_5|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1][298], [60#L709-4true, Black: 300#true, 310#true, 156#L693-5true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 291#L701-2true, 294#true, 296#true, 218#L700-2true, 305#true]) [2025-01-09 21:07:12,006 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-01-09 21:07:12,006 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,006 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:07:12,006 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:07:12,007 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 310#true, 156#L693-5true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 291#L701-2true, 294#true, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:12,007 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-01-09 21:07:12,007 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:07:12,007 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,007 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,007 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:07:12,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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, 60#L709-4true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 291#L701-2true, 294#true, 67#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:12,123 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-01-09 21:07:12,123 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:12,123 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,123 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 30#L700-2true, 205#L693-7true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 294#true, 276#L701-2true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 296#true, 305#true]) [2025-01-09 21:07:12,127 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,127 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:12,127 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,127 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 205#L693-7true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 291#L701-2true, 294#true, 276#L701-2true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 296#true, 305#true]) [2025-01-09 21:07:12,127 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,127 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,128 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,128 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:12,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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, 60#L709-4true, 30#L700-2true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 67#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:12,129 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,129 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:12,129 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,130 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L699-3-->L700-2: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_5| 0) (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#MTX~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#MTX~0.base_13|) |v_~#MTX~0.offset_13| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_5|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1][298], [Black: 300#true, 60#L709-4true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 291#L701-2true, 67#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 296#true, 218#L700-2true, 305#true]) [2025-01-09 21:07:12,130 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,130 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:12,130 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,130 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,130 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1021] L699-5-->L701-2: 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, 60#L709-4true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 291#L701-2true, 67#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 276#L701-2true, 296#true, 305#true]) [2025-01-09 21:07:12,131 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:07:12,131 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:12,131 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:07:12,131 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,131 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:07:12,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 205#L693-7true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 236#L700-5true, 294#true, 276#L701-2true, 312#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 296#true, 305#true]) [2025-01-09 21:07:12,176 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-01-09 21:07:12,176 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:12,176 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-01-09 21:07:12,176 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-01-09 21:07:12,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1125] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 30#L700-2true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 294#true, 276#L701-2true, 296#true, 153#L701-2true, 305#true]) [2025-01-09 21:07:12,428 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-01-09 21:07:12,428 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-01-09 21:07:12,428 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-01-09 21:07:12,428 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-01-09 21:07:12,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1125] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 310#true, 298#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 236#L700-5true, 294#true, 276#L701-2true, 296#true, 153#L701-2true, 305#true]) [2025-01-09 21:07:12,444 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2025-01-09 21:07:12,444 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-01-09 21:07:12,444 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-01-09 21:07:12,444 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-01-09 21:07:12,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1135] L699-3-->L700-2: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_5| 0) (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#MTX~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#MTX~0.base_13|) |v_~#MTX~0.offset_13| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#MTX~0.offset=|v_~#MTX~0.offset_13|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_5|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][255], [60#L709-4true, Black: 300#true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 236#L700-5true, 294#true, 276#L701-2true, 148#L700-2true, 296#true, 305#true]) [2025-01-09 21:07:12,447 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-01-09 21:07:12,447 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-01-09 21:07:12,447 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-01-09 21:07:12,447 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-01-09 21:07:12,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1125] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 236#L700-5true, 294#true, 296#true, 218#L700-2true, 153#L701-2true, 305#true]) [2025-01-09 21:07:12,448 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-01-09 21:07:12,448 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-01-09 21:07:12,448 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-01-09 21:07:12,448 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-01-09 21:07:12,448 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1125] L699-5-->L701-2: 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], [60#L709-4true, Black: 300#true, 310#true, Black: 307#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 298#true, 236#L700-5true, 294#true, 276#L701-2true, 296#true, 153#L701-2true, 305#true]) [2025-01-09 21:07:12,448 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-01-09 21:07:12,448 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-01-09 21:07:12,448 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2025-01-09 21:07:12,448 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-01-09 21:07:12,448 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-01-09 21:07:12,518 INFO L124 PetriNetUnfolderBase]: 10262/31939 cut-off events. [2025-01-09 21:07:12,518 INFO L125 PetriNetUnfolderBase]: For 15112/16454 co-relation queries the response was YES. [2025-01-09 21:07:12,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59889 conditions, 31939 events. 10262/31939 cut-off events. For 15112/16454 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 400034 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-01-09 21:07:12,808 INFO L140 encePairwiseOnDemand]: 293/305 looper letters, 66 selfloop transitions, 28 changer transitions 0/346 dead transitions. [2025-01-09 21:07:12,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 346 transitions, 1227 flow [2025-01-09 21:07:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2025-01-09 21:07:12,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972677595628415 [2025-01-09 21:07:12,810 INFO L175 Difference]: Start difference. First operand has 284 places, 313 transitions, 876 flow. Second operand 3 states and 821 transitions. [2025-01-09 21:07:12,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 346 transitions, 1227 flow [2025-01-09 21:07:12,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 346 transitions, 1171 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:07:12,841 INFO L231 Difference]: Finished difference. Result has 286 places, 337 transitions, 1122 flow [2025-01-09 21:07:12,841 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-01-09 21:07:12,842 INFO L279 CegarLoopForPetriNet]: 297 programPoint places, -11 predicate places. [2025-01-09 21:07:12,842 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 337 transitions, 1122 flow [2025-01-09 21:07:12,842 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-01-09 21:07:12,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:12,842 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-01-09 21:07:12,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:07:12,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:07:12,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1745924112, now seen corresponding path program 1 times [2025-01-09 21:07:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:12,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118958107] [2025-01-09 21:07:12,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:12,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 21:07:12,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 21:07:12,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:12,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:12,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:07:12,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 21:07:12,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 21:07:12,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:12,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:12,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:07:12,913 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:07:12,913 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-01-09 21:07:12,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-01-09 21:07:12,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-01-09 21:07:12,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:07:12,916 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:07:12,916 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:07:12,916 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:07:12,945 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:07:12,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 347 places, 358 transitions, 744 flow [2025-01-09 21:07:13,144 INFO L124 PetriNetUnfolderBase]: 20/392 cut-off events. [2025-01-09 21:07:13,144 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:07:13,146 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 961 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-01-09 21:07:13,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 347 places, 358 transitions, 744 flow [2025-01-09 21:07:13,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 347 places, 358 transitions, 744 flow [2025-01-09 21:07:13,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:07:13,149 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;@5ab9c82d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:07:13,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-01-09 21:07:13,154 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:07:13,155 INFO L124 PetriNetUnfolderBase]: 0/159 cut-off events. [2025-01-09 21:07:13,155 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:07:13,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:13,155 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-01-09 21:07:13,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:07:13,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1928771918, now seen corresponding path program 1 times [2025-01-09 21:07:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864211935] [2025-01-09 21:07:13,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:13,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 21:07:13,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 21:07:13,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:13,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:07:13,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864211935] [2025-01-09 21:07:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864211935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:13,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:13,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439659406] [2025-01-09 21:07:13,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:13,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:13,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:13,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:13,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 358 [2025-01-09 21:07:13,248 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-01-09 21:07:13,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:13,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 358 [2025-01-09 21:07:13,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand