./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 827df23f2f2d5cc81b0f2d655a6c774471e4114629b1caec5ad3ca146d0279c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:49:46,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:49:46,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:49:46,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:49:46,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:49:46,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:49:46,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:49:46,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:49:46,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:49:46,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:49:46,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:49:46,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:49:46,418 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:49:46,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:49:46,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:49:46,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:49:46,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:49:46,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:49:46,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:49:46,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:49:46,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:49:46,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:49:46,420 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:49:46,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:49:46,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:49:46,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:49:46,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:49:46,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:49:46,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:49:46,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:49:46,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:49:46,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:49:46,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:49:46,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:49:46,421 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:49:46,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:49:46,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:49:46,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:49:46,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:49:46,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:49:46,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:49:46,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:49:46,422 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 827df23f2f2d5cc81b0f2d655a6c774471e4114629b1caec5ad3ca146d0279c2 [2025-03-14 01:49:46,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:49:46,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:49:46,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:49:46,633 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:49:46,633 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:49:46,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-3.i [2025-03-14 01:49:47,797 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e452f4b/23b1e7dd5d7841199ae88b0b6b329e9a/FLAG371cfd9e5 [2025-03-14 01:49:48,112 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:49:48,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-3.i [2025-03-14 01:49:48,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e452f4b/23b1e7dd5d7841199ae88b0b6b329e9a/FLAG371cfd9e5 [2025-03-14 01:49:48,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e452f4b/23b1e7dd5d7841199ae88b0b6b329e9a [2025-03-14 01:49:48,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:49:48,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:49:48,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:49:48,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:49:48,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:49:48,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6059a3b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48, skipping insertion in model container [2025-03-14 01:49:48,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:49:48,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:49:48,783 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:49:48,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:49:48,860 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:49:48,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48 WrapperNode [2025-03-14 01:49:48,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:49:48,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:49:48,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:49:48,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:49:48,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,895 INFO L138 Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-03-14 01:49:48,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:49:48,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:49:48,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:49:48,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:49:48,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:49:48,916 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:49:48,916 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:49:48,916 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:49:48,919 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (1/1) ... [2025-03-14 01:49:48,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:49:48,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:49:48,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:49:48,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:49:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:49:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:49:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:49:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:49:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:49:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:49:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:49:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:49:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-14 01:49:48,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-14 01:49:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:49:48,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:49:48,969 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:49:49,074 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:49:49,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:49:49,265 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:49:49,266 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:49:49,267 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:49:49,281 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:49:49,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:49:49 BoogieIcfgContainer [2025-03-14 01:49:49,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:49:49,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:49:49,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:49:49,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:49:49,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:49:48" (1/3) ... [2025-03-14 01:49:49,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540cd070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:49:49, skipping insertion in model container [2025-03-14 01:49:49,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:49:48" (2/3) ... [2025-03-14 01:49:49,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540cd070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:49:49, skipping insertion in model container [2025-03-14 01:49:49,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:49:49" (3/3) ... [2025-03-14 01:49:49,289 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-3.i [2025-03-14 01:49:49,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:49:49,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-dynamic-race-3.i that has 2 procedures, 101 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2025-03-14 01:49:49,301 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:49:49,356 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:49:49,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 121 transitions, 256 flow [2025-03-14 01:49:49,454 INFO L124 PetriNetUnfolderBase]: 3/228 cut-off events. [2025-03-14 01:49:49,455 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:49:49,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 228 events. 3/228 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 592 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 116. Up to 5 conditions per place. [2025-03-14 01:49:49,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 121 transitions, 256 flow [2025-03-14 01:49:49,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 120 transitions, 253 flow [2025-03-14 01:49:49,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:49:49,478 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;@55618f93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:49:49,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-14 01:49:49,494 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:49:49,494 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-03-14 01:49:49,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:49:49,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:49,495 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] [2025-03-14 01:49:49,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:49,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:49,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1966049506, now seen corresponding path program 1 times [2025-03-14 01:49:49,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:49,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300460307] [2025-03-14 01:49:49,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:49,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:49,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:49:49,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:49:49,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:49,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:50,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:50,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300460307] [2025-03-14 01:49:50,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300460307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:50,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:50,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:49:50,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655904983] [2025-03-14 01:49:50,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:50,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:50,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:50,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:50,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:50,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 121 [2025-03-14 01:49:50,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 120 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:50,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:50,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 121 [2025-03-14 01:49:50,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:50,425 INFO L124 PetriNetUnfolderBase]: 122/715 cut-off events. [2025-03-14 01:49:50,425 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-14 01:49:50,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 715 events. 122/715 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4237 event pairs, 46 based on Foata normal form. 1/635 useless extension candidates. Maximal degree in co-relation 734. Up to 244 conditions per place. [2025-03-14 01:49:50,434 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 32 selfloop transitions, 5 changer transitions 1/126 dead transitions. [2025-03-14 01:49:50,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 126 transitions, 339 flow [2025-03-14 01:49:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 579 transitions. [2025-03-14 01:49:50,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975206611570248 [2025-03-14 01:49:50,447 INFO L175 Difference]: Start difference. First operand has 123 places, 120 transitions, 253 flow. Second operand 6 states and 579 transitions. [2025-03-14 01:49:50,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 126 transitions, 339 flow [2025-03-14 01:49:50,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 126 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:50,454 INFO L231 Difference]: Finished difference. Result has 125 places, 117 transitions, 253 flow [2025-03-14 01:49:50,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=125, PETRI_TRANSITIONS=117} [2025-03-14 01:49:50,458 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 2 predicate places. [2025-03-14 01:49:50,459 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 117 transitions, 253 flow [2025-03-14 01:49:50,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:50,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:50,459 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] [2025-03-14 01:49:50,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:49:50,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:50,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1544575139, now seen corresponding path program 1 times [2025-03-14 01:49:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:50,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471313828] [2025-03-14 01:49:50,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:50,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:49:50,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:49:50,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:50,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:50,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:50,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471313828] [2025-03-14 01:49:50,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471313828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:50,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:50,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:49:50,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465767397] [2025-03-14 01:49:50,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:50,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:50,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:50,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:50,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:50,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 121 [2025-03-14 01:49:50,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:50,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:50,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 121 [2025-03-14 01:49:50,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:50,894 INFO L124 PetriNetUnfolderBase]: 128/772 cut-off events. [2025-03-14 01:49:50,894 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-14 01:49:50,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 772 events. 128/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4658 event pairs, 58 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 828. Up to 234 conditions per place. [2025-03-14 01:49:50,897 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 31 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2025-03-14 01:49:50,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 126 transitions, 343 flow [2025-03-14 01:49:50,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2025-03-14 01:49:50,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8195592286501377 [2025-03-14 01:49:50,901 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 253 flow. Second operand 6 states and 595 transitions. [2025-03-14 01:49:50,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 126 transitions, 343 flow [2025-03-14 01:49:50,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 126 transitions, 333 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:49:50,904 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 251 flow [2025-03-14 01:49:50,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2025-03-14 01:49:50,905 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 0 predicate places. [2025-03-14 01:49:50,905 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 251 flow [2025-03-14 01:49:50,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:50,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:50,905 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] [2025-03-14 01:49:50,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:49:50,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:50,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1408692371, now seen corresponding path program 1 times [2025-03-14 01:49:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:50,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961677016] [2025-03-14 01:49:50,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:50,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:50,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:49:50,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:49:50,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:50,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:50,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:50,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961677016] [2025-03-14 01:49:50,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961677016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:50,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:50,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422097604] [2025-03-14 01:49:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:50,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:50,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:50,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:50,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:50,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 121 [2025-03-14 01:49:50,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:50,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:50,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 121 [2025-03-14 01:49:50,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:51,038 INFO L124 PetriNetUnfolderBase]: 117/684 cut-off events. [2025-03-14 01:49:51,039 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-14 01:49:51,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 684 events. 117/684 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4084 event pairs, 74 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 714. Up to 190 conditions per place. [2025-03-14 01:49:51,043 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 18 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2025-03-14 01:49:51,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 124 transitions, 315 flow [2025-03-14 01:49:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2025-03-14 01:49:51,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9338842975206612 [2025-03-14 01:49:51,045 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 251 flow. Second operand 3 states and 339 transitions. [2025-03-14 01:49:51,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 124 transitions, 315 flow [2025-03-14 01:49:51,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 124 transitions, 305 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:49:51,049 INFO L231 Difference]: Finished difference. Result has 122 places, 120 transitions, 279 flow [2025-03-14 01:49:51,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=122, PETRI_TRANSITIONS=120} [2025-03-14 01:49:51,051 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2025-03-14 01:49:51,051 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 120 transitions, 279 flow [2025-03-14 01:49:51,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:51,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:51,052 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] [2025-03-14 01:49:51,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:49:51,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:51,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:51,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1764502304, now seen corresponding path program 1 times [2025-03-14 01:49:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:51,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874970221] [2025-03-14 01:49:51,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:51,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:51,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:49:51,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:49:51,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:51,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:51,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:51,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874970221] [2025-03-14 01:49:51,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874970221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:51,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:51,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:51,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23577986] [2025-03-14 01:49:51,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:51,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:51,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:51,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:51,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:51,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 121 [2025-03-14 01:49:51,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 120 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:51,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:51,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 121 [2025-03-14 01:49:51,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:51,210 INFO L124 PetriNetUnfolderBase]: 177/994 cut-off events. [2025-03-14 01:49:51,211 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2025-03-14 01:49:51,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 994 events. 177/994 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6706 event pairs, 57 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1310. Up to 180 conditions per place. [2025-03-14 01:49:51,216 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 17 selfloop transitions, 6 changer transitions 0/128 dead transitions. [2025-03-14 01:49:51,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 128 transitions, 351 flow [2025-03-14 01:49:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-14 01:49:51,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9421487603305785 [2025-03-14 01:49:51,219 INFO L175 Difference]: Start difference. First operand has 122 places, 120 transitions, 279 flow. Second operand 3 states and 342 transitions. [2025-03-14 01:49:51,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 128 transitions, 351 flow [2025-03-14 01:49:51,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 128 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:51,223 INFO L231 Difference]: Finished difference. Result has 124 places, 124 transitions, 317 flow [2025-03-14 01:49:51,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=124, PETRI_TRANSITIONS=124} [2025-03-14 01:49:51,224 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 1 predicate places. [2025-03-14 01:49:51,225 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 124 transitions, 317 flow [2025-03-14 01:49:51,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:51,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:51,225 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] [2025-03-14 01:49:51,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:49:51,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:51,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 977594566, now seen corresponding path program 1 times [2025-03-14 01:49:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421719637] [2025-03-14 01:49:51,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:51,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:49:51,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:49:51,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:51,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:51,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:51,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421719637] [2025-03-14 01:49:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421719637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:51,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:51,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642250695] [2025-03-14 01:49:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:51,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:51,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:51,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:51,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:51,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 121 [2025-03-14 01:49:51,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 124 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:51,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:51,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 121 [2025-03-14 01:49:51,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:51,444 INFO L124 PetriNetUnfolderBase]: 237/1385 cut-off events. [2025-03-14 01:49:51,444 INFO L125 PetriNetUnfolderBase]: For 830/845 co-relation queries the response was YES. [2025-03-14 01:49:51,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 1385 events. 237/1385 cut-off events. For 830/845 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10838 event pairs, 95 based on Foata normal form. 0/1269 useless extension candidates. Maximal degree in co-relation 2092. Up to 355 conditions per place. [2025-03-14 01:49:51,453 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 19 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2025-03-14 01:49:51,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 133 transitions, 418 flow [2025-03-14 01:49:51,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-03-14 01:49:51,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931129476584022 [2025-03-14 01:49:51,457 INFO L175 Difference]: Start difference. First operand has 124 places, 124 transitions, 317 flow. Second operand 3 states and 338 transitions. [2025-03-14 01:49:51,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 133 transitions, 418 flow [2025-03-14 01:49:51,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 133 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:51,463 INFO L231 Difference]: Finished difference. Result has 126 places, 130 transitions, 387 flow [2025-03-14 01:49:51,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=126, PETRI_TRANSITIONS=130} [2025-03-14 01:49:51,466 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 3 predicate places. [2025-03-14 01:49:51,466 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 130 transitions, 387 flow [2025-03-14 01:49:51,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:51,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:51,468 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] [2025-03-14 01:49:51,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:49:51,468 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:51,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1206064694, now seen corresponding path program 1 times [2025-03-14 01:49:51,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:51,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118928053] [2025-03-14 01:49:51,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:51,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:49:51,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:49:51,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:51,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:51,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:51,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118928053] [2025-03-14 01:49:51,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118928053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:51,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:51,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:49:51,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070588966] [2025-03-14 01:49:51,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:51,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:49:51,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:51,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:49:51,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:49:51,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 121 [2025-03-14 01:49:51,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 130 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:51,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:51,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 121 [2025-03-14 01:49:51,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:51,857 INFO L124 PetriNetUnfolderBase]: 307/1790 cut-off events. [2025-03-14 01:49:51,858 INFO L125 PetriNetUnfolderBase]: For 827/933 co-relation queries the response was YES. [2025-03-14 01:49:51,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 1790 events. 307/1790 cut-off events. For 827/933 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 14651 event pairs, 136 based on Foata normal form. 5/1665 useless extension candidates. Maximal degree in co-relation 2659. Up to 383 conditions per place. [2025-03-14 01:49:51,865 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 23 selfloop transitions, 7 changer transitions 1/142 dead transitions. [2025-03-14 01:49:51,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 142 transitions, 474 flow [2025-03-14 01:49:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2025-03-14 01:49:51,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8787878787878788 [2025-03-14 01:49:51,868 INFO L175 Difference]: Start difference. First operand has 126 places, 130 transitions, 387 flow. Second operand 6 states and 638 transitions. [2025-03-14 01:49:51,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 142 transitions, 474 flow [2025-03-14 01:49:51,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 142 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:51,873 INFO L231 Difference]: Finished difference. Result has 133 places, 135 transitions, 414 flow [2025-03-14 01:49:51,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=133, PETRI_TRANSITIONS=135} [2025-03-14 01:49:51,874 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 10 predicate places. [2025-03-14 01:49:51,874 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 135 transitions, 414 flow [2025-03-14 01:49:51,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:51,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:51,875 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-03-14 01:49:51,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:49:51,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:49:51,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -886731348, now seen corresponding path program 1 times [2025-03-14 01:49:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:51,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91152083] [2025-03-14 01:49:51,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:51,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:49:51,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:49:51,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:51,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:49:51,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:49:51,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:49:51,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:49:51,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:51,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:49:51,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:49:51,926 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:49:51,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-14 01:49:51,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-14 01:49:51,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-14 01:49:51,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-14 01:49:51,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-14 01:49:51,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-03-14 01:49:51,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-14 01:49:51,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-14 01:49:51,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-14 01:49:51,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:49:51,931 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:49:51,935 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:49:51,936 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:49:51,955 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:49:51,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 157 transitions, 346 flow [2025-03-14 01:49:51,978 INFO L124 PetriNetUnfolderBase]: 8/391 cut-off events. [2025-03-14 01:49:51,978 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:49:51,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 391 events. 8/391 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1309 event pairs, 1 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 414. Up to 12 conditions per place. [2025-03-14 01:49:51,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 157 transitions, 346 flow [2025-03-14 01:49:51,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 138 transitions, 298 flow [2025-03-14 01:49:51,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:49:51,981 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;@55618f93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:49:51,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-14 01:49:51,984 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:49:51,984 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-03-14 01:49:51,984 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:49:51,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:51,984 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] [2025-03-14 01:49:51,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:51,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash -790010910, now seen corresponding path program 1 times [2025-03-14 01:49:51,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:51,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753564870] [2025-03-14 01:49:51,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:51,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:51,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:49:51,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:49:51,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:51,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:52,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:52,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753564870] [2025-03-14 01:49:52,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753564870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:52,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:52,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:49:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497671909] [2025-03-14 01:49:52,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:52,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:52,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:52,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:52,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 157 [2025-03-14 01:49:52,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 138 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:52,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:52,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 157 [2025-03-14 01:49:52,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:52,646 INFO L124 PetriNetUnfolderBase]: 783/3073 cut-off events. [2025-03-14 01:49:52,646 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-03-14 01:49:52,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4520 conditions, 3073 events. 783/3073 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 26289 event pairs, 211 based on Foata normal form. 1/2754 useless extension candidates. Maximal degree in co-relation 1300. Up to 1205 conditions per place. [2025-03-14 01:49:52,662 INFO L140 encePairwiseOnDemand]: 150/157 looper letters, 44 selfloop transitions, 5 changer transitions 1/152 dead transitions. [2025-03-14 01:49:52,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 152 transitions, 424 flow [2025-03-14 01:49:52,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2025-03-14 01:49:52,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8057324840764332 [2025-03-14 01:49:52,664 INFO L175 Difference]: Start difference. First operand has 142 places, 138 transitions, 298 flow. Second operand 6 states and 759 transitions. [2025-03-14 01:49:52,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 152 transitions, 424 flow [2025-03-14 01:49:52,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 152 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:52,669 INFO L231 Difference]: Finished difference. Result has 144 places, 135 transitions, 298 flow [2025-03-14 01:49:52,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=144, PETRI_TRANSITIONS=135} [2025-03-14 01:49:52,670 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2025-03-14 01:49:52,670 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 135 transitions, 298 flow [2025-03-14 01:49:52,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:52,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:52,670 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] [2025-03-14 01:49:52,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:49:52,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:52,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2006048303, now seen corresponding path program 1 times [2025-03-14 01:49:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:52,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486216489] [2025-03-14 01:49:52,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:52,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:49:52,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:49:52,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:52,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:52,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:52,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486216489] [2025-03-14 01:49:52,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486216489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:52,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:52,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:49:52,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023487569] [2025-03-14 01:49:52,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:52,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:52,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:52,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:52,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:52,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 157 [2025-03-14 01:49:52,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 135 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:52,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:52,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 157 [2025-03-14 01:49:52,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:53,229 INFO L124 PetriNetUnfolderBase]: 809/3936 cut-off events. [2025-03-14 01:49:53,229 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-03-14 01:49:53,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5435 conditions, 3936 events. 809/3936 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 35365 event pairs, 556 based on Foata normal form. 0/3582 useless extension candidates. Maximal degree in co-relation 4150. Up to 1169 conditions per place. [2025-03-14 01:49:53,252 INFO L140 encePairwiseOnDemand]: 151/157 looper letters, 43 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2025-03-14 01:49:53,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 152 transitions, 428 flow [2025-03-14 01:49:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2025-03-14 01:49:53,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8227176220806794 [2025-03-14 01:49:53,254 INFO L175 Difference]: Start difference. First operand has 144 places, 135 transitions, 298 flow. Second operand 6 states and 775 transitions. [2025-03-14 01:49:53,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 152 transitions, 428 flow [2025-03-14 01:49:53,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 152 transitions, 418 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:49:53,256 INFO L231 Difference]: Finished difference. Result has 142 places, 134 transitions, 296 flow [2025-03-14 01:49:53,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=142, PETRI_TRANSITIONS=134} [2025-03-14 01:49:53,257 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 0 predicate places. [2025-03-14 01:49:53,257 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 134 transitions, 296 flow [2025-03-14 01:49:53,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:53,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:53,259 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] [2025-03-14 01:49:53,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:49:53,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1935622146, now seen corresponding path program 1 times [2025-03-14 01:49:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788678775] [2025-03-14 01:49:53,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:53,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:49:53,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:49:53,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:53,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:53,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:53,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788678775] [2025-03-14 01:49:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788678775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:53,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:53,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:53,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977145087] [2025-03-14 01:49:53,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:53,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:53,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:53,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:53,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 157 [2025-03-14 01:49:53,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 134 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:53,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:53,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 157 [2025-03-14 01:49:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:53,628 INFO L124 PetriNetUnfolderBase]: 1075/3990 cut-off events. [2025-03-14 01:49:53,629 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-03-14 01:49:53,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5849 conditions, 3990 events. 1075/3990 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 36865 event pairs, 695 based on Foata normal form. 0/3550 useless extension candidates. Maximal degree in co-relation 4558. Up to 1401 conditions per place. [2025-03-14 01:49:53,659 INFO L140 encePairwiseOnDemand]: 150/157 looper letters, 27 selfloop transitions, 6 changer transitions 0/147 dead transitions. [2025-03-14 01:49:53,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 147 transitions, 398 flow [2025-03-14 01:49:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2025-03-14 01:49:53,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9065817409766455 [2025-03-14 01:49:53,661 INFO L175 Difference]: Start difference. First operand has 142 places, 134 transitions, 296 flow. Second operand 3 states and 427 transitions. [2025-03-14 01:49:53,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 147 transitions, 398 flow [2025-03-14 01:49:53,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 147 transitions, 388 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:49:53,664 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 332 flow [2025-03-14 01:49:53,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2025-03-14 01:49:53,664 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -1 predicate places. [2025-03-14 01:49:53,664 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 332 flow [2025-03-14 01:49:53,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:53,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:53,665 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] [2025-03-14 01:49:53,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:49:53,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:53,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash -31939902, now seen corresponding path program 1 times [2025-03-14 01:49:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:53,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025132857] [2025-03-14 01:49:53,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:53,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:53,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:49:53,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:49:53,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:53,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:49:53,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:53,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025132857] [2025-03-14 01:49:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025132857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021644407] [2025-03-14 01:49:53,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:53,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:53,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:53,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:53,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 157 [2025-03-14 01:49:53,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 139 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:53,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:53,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 157 [2025-03-14 01:49:53,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:54,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][124], [177#true, 182#true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 122#L1024true, 41#L1023-2true, 123#L1039-1true]) [2025-03-14 01:49:54,098 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-14 01:49:54,098 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:49:54,098 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:49:54,099 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 01:49:54,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][124], [136#L1024-3true, 177#true, 182#true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 41#L1023-2true, 123#L1039-1true]) [2025-03-14 01:49:54,099 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:49:54,099 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:49:54,099 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:54,099 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:54,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][143], [177#true, 182#true, 132#L1023-2true, 161#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 162#true, 41#L1023-2true, 123#L1039-1true]) [2025-03-14 01:49:54,099 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:49:54,099 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:54,099 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:54,099 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:49:54,185 INFO L124 PetriNetUnfolderBase]: 1719/6346 cut-off events. [2025-03-14 01:49:54,186 INFO L125 PetriNetUnfolderBase]: For 2028/2225 co-relation queries the response was YES. [2025-03-14 01:49:54,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10851 conditions, 6346 events. 1719/6346 cut-off events. For 2028/2225 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 64106 event pairs, 918 based on Foata normal form. 5/5616 useless extension candidates. Maximal degree in co-relation 8197. Up to 2119 conditions per place. [2025-03-14 01:49:54,212 INFO L140 encePairwiseOnDemand]: 150/157 looper letters, 27 selfloop transitions, 9 changer transitions 0/152 dead transitions. [2025-03-14 01:49:54,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 452 flow [2025-03-14 01:49:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2025-03-14 01:49:54,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9023354564755839 [2025-03-14 01:49:54,214 INFO L175 Difference]: Start difference. First operand has 141 places, 139 transitions, 332 flow. Second operand 3 states and 425 transitions. [2025-03-14 01:49:54,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 452 flow [2025-03-14 01:49:54,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:54,221 INFO L231 Difference]: Finished difference. Result has 143 places, 146 transitions, 396 flow [2025-03-14 01:49:54,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=143, PETRI_TRANSITIONS=146} [2025-03-14 01:49:54,222 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 1 predicate places. [2025-03-14 01:49:54,222 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 146 transitions, 396 flow [2025-03-14 01:49:54,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:54,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:54,222 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] [2025-03-14 01:49:54,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:49:54,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:54,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash 766744268, now seen corresponding path program 1 times [2025-03-14 01:49:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:54,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125632046] [2025-03-14 01:49:54,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:54,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:49:54,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:49:54,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:54,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:49:54,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:54,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125632046] [2025-03-14 01:49:54,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125632046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:54,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:54,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:54,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142987504] [2025-03-14 01:49:54,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:54,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:54,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:54,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:54,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:54,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 157 [2025-03-14 01:49:54,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 146 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:54,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:54,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 157 [2025-03-14 01:49:54,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:54,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][148], [182#true, 132#L1023-2true, 189#(= |#race~data~0| 0), 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 41#L1023-2true, 123#L1039-1true, Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|)]) [2025-03-14 01:49:54,831 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:49:54,831 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:54,831 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:49:54,831 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:54,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][85], [182#true, 132#L1023-2true, 189#(= |#race~data~0| 0), 161#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 162#true, 123#L1039-1true, Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 119#L1024-3true]) [2025-03-14 01:49:54,857 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:49:54,857 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:49:54,857 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:54,857 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:54,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][85], [182#true, 132#L1023-2true, 189#(= |#race~data~0| 0), 161#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 162#true, 78#L1024true, 123#L1039-1true, Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|)]) [2025-03-14 01:49:54,865 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-14 01:49:54,865 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:49:54,865 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:49:54,865 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 01:49:54,996 INFO L124 PetriNetUnfolderBase]: 2793/9528 cut-off events. [2025-03-14 01:49:54,996 INFO L125 PetriNetUnfolderBase]: For 5667/5766 co-relation queries the response was YES. [2025-03-14 01:49:55,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18474 conditions, 9528 events. 2793/9528 cut-off events. For 5667/5766 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 101414 event pairs, 958 based on Foata normal form. 3/8421 useless extension candidates. Maximal degree in co-relation 14677. Up to 2383 conditions per place. [2025-03-14 01:49:55,049 INFO L140 encePairwiseOnDemand]: 151/157 looper letters, 28 selfloop transitions, 13 changer transitions 0/161 dead transitions. [2025-03-14 01:49:55,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 161 transitions, 550 flow [2025-03-14 01:49:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2025-03-14 01:49:55,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087048832271762 [2025-03-14 01:49:55,051 INFO L175 Difference]: Start difference. First operand has 143 places, 146 transitions, 396 flow. Second operand 3 states and 428 transitions. [2025-03-14 01:49:55,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 161 transitions, 550 flow [2025-03-14 01:49:55,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 161 transitions, 522 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:55,063 INFO L231 Difference]: Finished difference. Result has 145 places, 155 transitions, 500 flow [2025-03-14 01:49:55,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=145, PETRI_TRANSITIONS=155} [2025-03-14 01:49:55,063 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2025-03-14 01:49:55,063 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 155 transitions, 500 flow [2025-03-14 01:49:55,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:55,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:55,064 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] [2025-03-14 01:49:55,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:49:55,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:55,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1512431966, now seen corresponding path program 1 times [2025-03-14 01:49:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:55,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690344378] [2025-03-14 01:49:55,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:55,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:49:55,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:49:55,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:55,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:49:55,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:55,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690344378] [2025-03-14 01:49:55,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690344378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:55,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:55,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:49:55,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931490291] [2025-03-14 01:49:55,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:55,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:49:55,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:55,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:49:55,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:49:55,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 157 [2025-03-14 01:49:55,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 155 transitions, 500 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:55,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:55,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 157 [2025-03-14 01:49:55,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:56,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][154], [132#L1023-2true, 189#(= |#race~data~0| 0), 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 41#L1023-2true, 192#true, 123#L1039-1true, Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 187#true]) [2025-03-14 01:49:56,056 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:49:56,056 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:56,056 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:56,056 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:49:56,159 INFO L124 PetriNetUnfolderBase]: 2904/11526 cut-off events. [2025-03-14 01:49:56,159 INFO L125 PetriNetUnfolderBase]: For 6066/7154 co-relation queries the response was YES. [2025-03-14 01:49:56,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21451 conditions, 11526 events. 2904/11526 cut-off events. For 6066/7154 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 132535 event pairs, 1140 based on Foata normal form. 38/10174 useless extension candidates. Maximal degree in co-relation 12154. Up to 2813 conditions per place. [2025-03-14 01:49:56,211 INFO L140 encePairwiseOnDemand]: 149/157 looper letters, 28 selfloop transitions, 7 changer transitions 1/168 dead transitions. [2025-03-14 01:49:56,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 168 transitions, 599 flow [2025-03-14 01:49:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 811 transitions. [2025-03-14 01:49:56,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8609341825902336 [2025-03-14 01:49:56,213 INFO L175 Difference]: Start difference. First operand has 145 places, 155 transitions, 500 flow. Second operand 6 states and 811 transitions. [2025-03-14 01:49:56,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 168 transitions, 599 flow [2025-03-14 01:49:56,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 168 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:56,230 INFO L231 Difference]: Finished difference. Result has 152 places, 161 transitions, 525 flow [2025-03-14 01:49:56,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=152, PETRI_TRANSITIONS=161} [2025-03-14 01:49:56,231 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 10 predicate places. [2025-03-14 01:49:56,231 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 161 transitions, 525 flow [2025-03-14 01:49:56,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:56,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:56,231 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] [2025-03-14 01:49:56,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:49:56,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:56,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1432147228, now seen corresponding path program 1 times [2025-03-14 01:49:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:56,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579798518] [2025-03-14 01:49:56,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:56,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:49:56,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:49:56,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:56,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:49:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579798518] [2025-03-14 01:49:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579798518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:56,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:56,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:49:56,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570222013] [2025-03-14 01:49:56,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:56,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:56,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:56,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:56,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:56,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 157 [2025-03-14 01:49:56,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 161 transitions, 525 flow. Second operand has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:56,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:56,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 157 [2025-03-14 01:49:56,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:56,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of2ForFork1_#t~nondet5_3|) InVars {threadThread2of2ForFork1_#t~nondet5=|v_threadThread2of2ForFork1_#t~nondet5_3|} OutVars{threadThread2of2ForFork1_#t~nondet5=|v_threadThread2of2ForFork1_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][161], [132#L1023-2true, 161#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 192#true, Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 25#L1023-1true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 78#L1024true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 82#L1039-2true, 163#true, Black: 189#(= |#race~data~0| 0)]) [2025-03-14 01:49:56,751 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-14 01:49:56,751 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:49:56,751 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:49:56,751 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:49:56,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][113], [161#true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 41#L1023-2true, Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 136#L1024-3true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 123#L1039-1true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 187#true]) [2025-03-14 01:49:56,784 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:49:56,784 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:56,784 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:49:56,784 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:56,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][106], [132#L1023-2true, 161#true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 123#L1039-1true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 187#true]) [2025-03-14 01:49:56,831 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:49:56,831 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:49:56,831 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:56,831 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:56,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][144], [132#L1023-2true, 161#true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 41#L1023-2true, 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 123#L1039-1true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 187#true]) [2025-03-14 01:49:56,832 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:49:56,832 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:56,832 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:49:56,832 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:56,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][145], [161#true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 41#L1023-2true, 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 182#true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 19#L1023-1true, 82#L1039-2true, Black: 189#(= |#race~data~0| 0)]) [2025-03-14 01:49:56,845 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:49:56,846 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:56,846 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:56,846 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:49:56,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][109], [161#true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 182#true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 19#L1023-1true, 82#L1039-2true, Black: 189#(= |#race~data~0| 0)]) [2025-03-14 01:49:56,863 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:49:56,863 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:49:56,863 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:56,863 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:56,919 INFO L124 PetriNetUnfolderBase]: 1960/7725 cut-off events. [2025-03-14 01:49:56,920 INFO L125 PetriNetUnfolderBase]: For 3504/4113 co-relation queries the response was YES. [2025-03-14 01:49:56,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14748 conditions, 7725 events. 1960/7725 cut-off events. For 3504/4113 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 81945 event pairs, 310 based on Foata normal form. 7/6713 useless extension candidates. Maximal degree in co-relation 10066. Up to 1233 conditions per place. [2025-03-14 01:49:56,964 INFO L140 encePairwiseOnDemand]: 150/157 looper letters, 28 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2025-03-14 01:49:56,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 164 transitions, 580 flow [2025-03-14 01:49:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2025-03-14 01:49:56,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8397027600849257 [2025-03-14 01:49:56,966 INFO L175 Difference]: Start difference. First operand has 152 places, 161 transitions, 525 flow. Second operand 6 states and 791 transitions. [2025-03-14 01:49:56,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 164 transitions, 580 flow [2025-03-14 01:49:56,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 164 transitions, 568 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:49:56,975 INFO L231 Difference]: Finished difference. Result has 150 places, 156 transitions, 496 flow [2025-03-14 01:49:56,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=496, PETRI_PLACES=150, PETRI_TRANSITIONS=156} [2025-03-14 01:49:56,976 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 8 predicate places. [2025-03-14 01:49:56,976 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 156 transitions, 496 flow [2025-03-14 01:49:56,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:56,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:56,976 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-03-14 01:49:56,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:49:56,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:56,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1729590520, now seen corresponding path program 1 times [2025-03-14 01:49:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882050765] [2025-03-14 01:49:56,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:56,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:49:56,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:49:56,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:56,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:49:57,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:57,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882050765] [2025-03-14 01:49:57,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882050765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:57,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:57,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:57,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899402784] [2025-03-14 01:49:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:57,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:57,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:57,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:57,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 157 [2025-03-14 01:49:57,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 156 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:57,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:57,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 157 [2025-03-14 01:49:57,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:57,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][146], [211#true, 132#L1023-2true, 161#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 41#L1023-2true, 123#L1039-1true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 187#true]) [2025-03-14 01:49:57,824 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][103], [211#true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 41#L1023-2true, 123#L1039-1true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 152#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 187#true]) [2025-03-14 01:49:57,824 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][146], [211#true, 132#L1023-2true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 41#L1023-2true, 123#L1039-1true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 187#true]) [2025-03-14 01:49:57,824 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:57,824 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:49:57,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][104], [211#true, 132#L1023-2true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 123#L1039-1true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 187#true, 119#L1024-3true]) [2025-03-14 01:49:57,852 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:49:57,852 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:49:57,852 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:57,852 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:57,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][103], [211#true, 136#L1024-3true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 41#L1023-2true, 123#L1039-1true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 187#true]) [2025-03-14 01:49:57,855 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:49:57,855 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:57,855 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:49:57,855 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:49:57,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][104], [211#true, 132#L1023-2true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 78#L1024true, 123#L1039-1true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 187#true]) [2025-03-14 01:49:57,863 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-14 01:49:57,863 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 01:49:57,863 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:49:57,863 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:49:57,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][103], [211#true, 161#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 162#true, 122#L1024true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 41#L1023-2true, 123#L1039-1true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 187#true]) [2025-03-14 01:49:57,941 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-14 01:49:57,941 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:49:57,941 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:49:57,941 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 01:49:58,004 INFO L124 PetriNetUnfolderBase]: 4177/14175 cut-off events. [2025-03-14 01:49:58,004 INFO L125 PetriNetUnfolderBase]: For 14646/14907 co-relation queries the response was YES. [2025-03-14 01:49:58,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31128 conditions, 14175 events. 4177/14175 cut-off events. For 14646/14907 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 167053 event pairs, 1498 based on Foata normal form. 3/12422 useless extension candidates. Maximal degree in co-relation 29684. Up to 4674 conditions per place. [2025-03-14 01:49:58,067 INFO L140 encePairwiseOnDemand]: 150/157 looper letters, 35 selfloop transitions, 22 changer transitions 0/177 dead transitions. [2025-03-14 01:49:58,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 177 transitions, 729 flow [2025-03-14 01:49:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2025-03-14 01:49:58,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9044585987261147 [2025-03-14 01:49:58,070 INFO L175 Difference]: Start difference. First operand has 150 places, 156 transitions, 496 flow. Second operand 3 states and 426 transitions. [2025-03-14 01:49:58,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 177 transitions, 729 flow [2025-03-14 01:49:58,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 177 transitions, 717 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:49:58,104 INFO L231 Difference]: Finished difference. Result has 149 places, 170 transitions, 702 flow [2025-03-14 01:49:58,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=149, PETRI_TRANSITIONS=170} [2025-03-14 01:49:58,106 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 7 predicate places. [2025-03-14 01:49:58,106 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 170 transitions, 702 flow [2025-03-14 01:49:58,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:58,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:58,107 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] [2025-03-14 01:49:58,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:49:58,107 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:49:58,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash 718379915, now seen corresponding path program 1 times [2025-03-14 01:49:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:58,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350305660] [2025-03-14 01:49:58,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:58,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-14 01:49:58,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 01:49:58,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:58,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:49:58,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:58,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350305660] [2025-03-14 01:49:58,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350305660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:58,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:58,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:49:58,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040842506] [2025-03-14 01:49:58,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:58,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:49:58,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:58,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:49:58,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:49:58,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 157 [2025-03-14 01:49:58,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 170 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:58,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:58,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 157 [2025-03-14 01:49:58,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:00,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][161], [211#true, 132#L1023-2true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#(= |threadThread2of2ForFork1_#t~nondet5| |#race~data~0|), 41#L1023-2true, 123#L1039-1true, Black: 184#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 216#true, Black: 187#true]) [2025-03-14 01:50:00,056 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:50:00,056 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:50:00,056 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:00,056 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:00,147 INFO L124 PetriNetUnfolderBase]: 5526/17647 cut-off events. [2025-03-14 01:50:00,147 INFO L125 PetriNetUnfolderBase]: For 17570/19621 co-relation queries the response was YES. [2025-03-14 01:50:00,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39247 conditions, 17647 events. 5526/17647 cut-off events. For 17570/19621 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 209403 event pairs, 1800 based on Foata normal form. 43/15849 useless extension candidates. Maximal degree in co-relation 34885. Up to 3139 conditions per place. [2025-03-14 01:50:00,233 INFO L140 encePairwiseOnDemand]: 151/157 looper letters, 50 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-03-14 01:50:00,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 193 transitions, 858 flow [2025-03-14 01:50:00,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 776 transitions. [2025-03-14 01:50:00,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8237791932059448 [2025-03-14 01:50:00,235 INFO L175 Difference]: Start difference. First operand has 149 places, 170 transitions, 702 flow. Second operand 6 states and 776 transitions. [2025-03-14 01:50:00,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 193 transitions, 858 flow [2025-03-14 01:50:00,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 193 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:00,263 INFO L231 Difference]: Finished difference. Result has 151 places, 169 transitions, 666 flow [2025-03-14 01:50:00,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=666, PETRI_PLACES=151, PETRI_TRANSITIONS=169} [2025-03-14 01:50:00,264 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2025-03-14 01:50:00,264 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 169 transitions, 666 flow [2025-03-14 01:50:00,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:00,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:00,265 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-03-14 01:50:00,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:50:00,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:50:00,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash 547945250, now seen corresponding path program 1 times [2025-03-14 01:50:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:00,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264922794] [2025-03-14 01:50:00,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:00,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:50:00,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:50:00,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:00,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:00,282 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:50:00,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:50:00,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:50:00,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:00,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:50:00,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:50:00,296 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-14 01:50:00,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-14 01:50:00,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:50:00,297 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:50:00,297 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:50:00,297 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:50:00,323 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-14 01:50:00,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 193 transitions, 440 flow [2025-03-14 01:50:00,357 INFO L124 PetriNetUnfolderBase]: 21/654 cut-off events. [2025-03-14 01:50:00,357 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-14 01:50:00,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 654 events. 21/654 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2655 event pairs, 6 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 703. Up to 32 conditions per place. [2025-03-14 01:50:00,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 193 transitions, 440 flow [2025-03-14 01:50:00,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 156 transitions, 345 flow [2025-03-14 01:50:00,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:50:00,363 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;@55618f93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:50:00,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-14 01:50:00,365 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:50:00,366 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-03-14 01:50:00,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:50:00,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:00,366 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] [2025-03-14 01:50:00,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:00,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:00,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1144614882, now seen corresponding path program 1 times [2025-03-14 01:50:00,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:00,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111802498] [2025-03-14 01:50:00,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:00,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:00,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:50:00,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:50:00,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:00,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:00,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:00,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111802498] [2025-03-14 01:50:00,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111802498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:00,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:00,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:00,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079990995] [2025-03-14 01:50:00,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:00,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:00,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:00,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:00,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:00,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 193 [2025-03-14 01:50:00,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:00,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:00,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 193 [2025-03-14 01:50:00,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:01,510 INFO L124 PetriNetUnfolderBase]: 4132/12545 cut-off events. [2025-03-14 01:50:01,510 INFO L125 PetriNetUnfolderBase]: For 887/887 co-relation queries the response was YES. [2025-03-14 01:50:01,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19188 conditions, 12545 events. 4132/12545 cut-off events. For 887/887 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 130680 event pairs, 928 based on Foata normal form. 1/11362 useless extension candidates. Maximal degree in co-relation 4512. Up to 5634 conditions per place. [2025-03-14 01:50:01,561 INFO L140 encePairwiseOnDemand]: 186/193 looper letters, 56 selfloop transitions, 5 changer transitions 1/178 dead transitions. [2025-03-14 01:50:01,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 178 transitions, 511 flow [2025-03-14 01:50:01,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 939 transitions. [2025-03-14 01:50:01,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.810880829015544 [2025-03-14 01:50:01,563 INFO L175 Difference]: Start difference. First operand has 161 places, 156 transitions, 345 flow. Second operand 6 states and 939 transitions. [2025-03-14 01:50:01,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 178 transitions, 511 flow [2025-03-14 01:50:01,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 178 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:01,566 INFO L231 Difference]: Finished difference. Result has 163 places, 153 transitions, 345 flow [2025-03-14 01:50:01,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=163, PETRI_TRANSITIONS=153} [2025-03-14 01:50:01,566 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 2 predicate places. [2025-03-14 01:50:01,567 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 153 transitions, 345 flow [2025-03-14 01:50:01,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:01,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:01,567 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] [2025-03-14 01:50:01,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:50:01,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:01,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1849905887, now seen corresponding path program 1 times [2025-03-14 01:50:01,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:01,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679502943] [2025-03-14 01:50:01,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:01,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:50:01,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:50:01,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:01,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:01,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679502943] [2025-03-14 01:50:01,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679502943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:01,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:01,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220005109] [2025-03-14 01:50:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:01,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:01,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:01,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:01,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 193 [2025-03-14 01:50:01,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 153 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 150.33333333333334) internal successors, (902), 6 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:01,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:01,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 193 [2025-03-14 01:50:01,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:03,098 INFO L124 PetriNetUnfolderBase]: 4216/17526 cut-off events. [2025-03-14 01:50:03,098 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2025-03-14 01:50:03,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24317 conditions, 17526 events. 4216/17526 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 205801 event pairs, 2764 based on Foata normal form. 0/16005 useless extension candidates. Maximal degree in co-relation 18052. Up to 5480 conditions per place. [2025-03-14 01:50:03,187 INFO L140 encePairwiseOnDemand]: 187/193 looper letters, 55 selfloop transitions, 5 changer transitions 0/178 dead transitions. [2025-03-14 01:50:03,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 178 transitions, 515 flow [2025-03-14 01:50:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 955 transitions. [2025-03-14 01:50:03,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8246977547495682 [2025-03-14 01:50:03,189 INFO L175 Difference]: Start difference. First operand has 163 places, 153 transitions, 345 flow. Second operand 6 states and 955 transitions. [2025-03-14 01:50:03,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 178 transitions, 515 flow [2025-03-14 01:50:03,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 178 transitions, 505 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:03,193 INFO L231 Difference]: Finished difference. Result has 161 places, 152 transitions, 343 flow [2025-03-14 01:50:03,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=161, PETRI_TRANSITIONS=152} [2025-03-14 01:50:03,193 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 0 predicate places. [2025-03-14 01:50:03,193 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 152 transitions, 343 flow [2025-03-14 01:50:03,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 150.33333333333334) internal successors, (902), 6 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:03,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:03,194 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] [2025-03-14 01:50:03,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:50:03,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:03,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:03,195 INFO L85 PathProgramCache]: Analyzing trace with hash -850317503, now seen corresponding path program 1 times [2025-03-14 01:50:03,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:03,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433562680] [2025-03-14 01:50:03,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:03,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:03,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:50:03,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:50:03,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:03,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:03,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:03,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433562680] [2025-03-14 01:50:03,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433562680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:03,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:03,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:03,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395743446] [2025-03-14 01:50:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:03,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:03,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:03,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:03,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 193 [2025-03-14 01:50:03,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 152 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:03,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:03,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 193 [2025-03-14 01:50:03,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:05,382 INFO L124 PetriNetUnfolderBase]: 7646/22441 cut-off events. [2025-03-14 01:50:05,382 INFO L125 PetriNetUnfolderBase]: For 2760/2760 co-relation queries the response was YES. [2025-03-14 01:50:05,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34295 conditions, 22441 events. 7646/22441 cut-off events. For 2760/2760 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 261772 event pairs, 5213 based on Foata normal form. 0/20028 useless extension candidates. Maximal degree in co-relation 26703. Up to 9001 conditions per place. [2025-03-14 01:50:05,482 INFO L140 encePairwiseOnDemand]: 185/193 looper letters, 36 selfloop transitions, 7 changer transitions 0/170 dead transitions. [2025-03-14 01:50:05,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 170 transitions, 485 flow [2025-03-14 01:50:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2025-03-14 01:50:05,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8894645941278065 [2025-03-14 01:50:05,486 INFO L175 Difference]: Start difference. First operand has 161 places, 152 transitions, 343 flow. Second operand 3 states and 515 transitions. [2025-03-14 01:50:05,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 170 transitions, 485 flow [2025-03-14 01:50:05,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 170 transitions, 475 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:50:05,498 INFO L231 Difference]: Finished difference. Result has 160 places, 158 transitions, 387 flow [2025-03-14 01:50:05,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=160, PETRI_TRANSITIONS=158} [2025-03-14 01:50:05,498 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, -1 predicate places. [2025-03-14 01:50:05,498 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 158 transitions, 387 flow [2025-03-14 01:50:05,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:05,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:05,499 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] [2025-03-14 01:50:05,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:50:05,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:05,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1551466148, now seen corresponding path program 1 times [2025-03-14 01:50:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82771942] [2025-03-14 01:50:05,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:05,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:50:05,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:50:05,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:05,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:05,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:05,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82771942] [2025-03-14 01:50:05,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82771942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:05,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:05,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558065246] [2025-03-14 01:50:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:05,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:05,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:05,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:05,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:05,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2025-03-14 01:50:05,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 158 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:05,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:05,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2025-03-14 01:50:05,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:07,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][81], [189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 48#L1024true, 215#true, 144#L1039-1true, 222#(= |#race~data~0| 0), 197#true, 55#L1023-1true]) [2025-03-14 01:50:07,902 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:07,902 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:07,902 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:07,902 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:08,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][81], [189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 200#true, 199#true, 175#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 48#L1024true, 215#true, 144#L1039-1true, 222#(= |#race~data~0| 0), 197#true]) [2025-03-14 01:50:08,033 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-03-14 01:50:08,033 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-14 01:50:08,033 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:50:08,033 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:50:08,273 INFO L124 PetriNetUnfolderBase]: 13659/39024 cut-off events. [2025-03-14 01:50:08,273 INFO L125 PetriNetUnfolderBase]: For 10658/10754 co-relation queries the response was YES. [2025-03-14 01:50:08,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69370 conditions, 39024 events. 13659/39024 cut-off events. For 10658/10754 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 476013 event pairs, 6479 based on Foata normal form. 0/34982 useless extension candidates. Maximal degree in co-relation 54849. Up to 12676 conditions per place. [2025-03-14 01:50:08,662 INFO L140 encePairwiseOnDemand]: 186/193 looper letters, 33 selfloop transitions, 10 changer transitions 0/174 dead transitions. [2025-03-14 01:50:08,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 174 transitions, 527 flow [2025-03-14 01:50:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-03-14 01:50:08,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8877374784110535 [2025-03-14 01:50:08,664 INFO L175 Difference]: Start difference. First operand has 160 places, 158 transitions, 387 flow. Second operand 3 states and 514 transitions. [2025-03-14 01:50:08,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 174 transitions, 527 flow [2025-03-14 01:50:08,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 174 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:08,730 INFO L231 Difference]: Finished difference. Result has 162 places, 166 transitions, 461 flow [2025-03-14 01:50:08,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=162, PETRI_TRANSITIONS=166} [2025-03-14 01:50:08,731 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 1 predicate places. [2025-03-14 01:50:08,731 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 166 transitions, 461 flow [2025-03-14 01:50:08,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:08,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:08,731 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] [2025-03-14 01:50:08,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:50:08,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:08,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash 666594706, now seen corresponding path program 1 times [2025-03-14 01:50:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:08,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037918449] [2025-03-14 01:50:08,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:08,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:50:08,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:50:08,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:08,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037918449] [2025-03-14 01:50:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037918449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:08,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:08,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:08,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254660685] [2025-03-14 01:50:08,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:08,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:08,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:08,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:08,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:08,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 193 [2025-03-14 01:50:08,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 166 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:08,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:08,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 193 [2025-03-14 01:50:08,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:10,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][125], [225#true, 9#L1023-2true, 200#true, 175#L1024true, 198#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 222#(= |#race~data~0| 0), 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:10,854 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-14 01:50:10,854 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:50:10,854 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 01:50:10,854 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:50:10,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][125], [225#true, 9#L1023-2true, 200#true, 198#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 222#(= |#race~data~0| 0), 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:10,854 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:50:10,855 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:10,855 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:10,855 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:10,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][147], [225#true, 9#L1023-2true, 200#true, 31#L1023-2true, 198#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 222#(= |#race~data~0| 0), 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:10,855 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:50:10,855 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:50:10,855 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:10,855 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:12,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 136#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 201#true, 220#true, 8#L1023-1true, 9#L1023-2true, 199#true, 175#L1024true, 70#L1023-1true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 197#true]) [2025-03-14 01:50:12,285 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2025-03-14 01:50:12,285 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-14 01:50:12,285 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-14 01:50:12,285 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-14 01:50:12,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][180], [Black: 222#(= |#race~data~0| 0), 136#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 201#true, 220#true, 8#L1023-1true, 199#true, 70#L1023-1true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 197#true, 119#L1024-3true]) [2025-03-14 01:50:12,296 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-03-14 01:50:12,296 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-14 01:50:12,296 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-14 01:50:12,296 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-14 01:50:12,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 225#true, 201#true, 8#L1023-1true, 220#true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 199#true, 175#L1024true, 70#L1023-1true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 95#L1039-2true, 197#true]) [2025-03-14 01:50:12,451 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is not cut-off event [2025-03-14 01:50:12,451 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is not cut-off event [2025-03-14 01:50:12,451 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is not cut-off event [2025-03-14 01:50:12,451 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is not cut-off event [2025-03-14 01:50:12,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [136#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 222#(= |#race~data~0| 0), 225#true, 201#true, 220#true, 9#L1023-2true, 199#true, 175#L1024true, 70#L1023-1true, 48#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 197#true]) [2025-03-14 01:50:12,612 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2025-03-14 01:50:12,612 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-14 01:50:12,612 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-14 01:50:12,612 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][125], [225#true, 9#L1023-2true, 200#true, 199#true, 91#threadENTRYtrue, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 144#L1039-1true, 222#(= |#race~data~0| 0), 197#true, Black: 220#true]) [2025-03-14 01:50:12,657 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][125], [225#true, 9#L1023-2true, 200#true, 199#true, 175#L1024true, 91#threadENTRYtrue, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 222#(= |#race~data~0| 0), 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:12,657 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][147], [225#true, 9#L1023-2true, 200#true, 199#true, 31#L1023-2true, 91#threadENTRYtrue, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 144#L1039-1true, 222#(= |#race~data~0| 0), 197#true, Black: 220#true]) [2025-03-14 01:50:12,657 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:12,657 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:12,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][180], [136#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 222#(= |#race~data~0| 0), 225#true, 201#true, 220#true, 199#true, 70#L1023-1true, 31#L1023-2true, 48#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 197#true, 119#L1024-3true]) [2025-03-14 01:50:12,680 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2025-03-14 01:50:12,680 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2025-03-14 01:50:12,680 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2025-03-14 01:50:12,680 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2025-03-14 01:50:12,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 225#true, 201#true, 220#true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 199#true, 175#L1024true, 70#L1023-1true, 48#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 95#L1039-2true, 197#true]) [2025-03-14 01:50:12,757 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event [2025-03-14 01:50:12,757 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2025-03-14 01:50:12,757 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2025-03-14 01:50:12,757 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2025-03-14 01:50:12,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][125], [183#L1022true, 225#true, 9#L1023-2true, 200#true, 199#true, 175#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 144#L1039-1true, 222#(= |#race~data~0| 0), 197#true, Black: 220#true]) [2025-03-14 01:50:12,806 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2025-03-14 01:50:12,806 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-14 01:50:12,806 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-14 01:50:12,806 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-14 01:50:12,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][125], [183#L1022true, 225#true, 9#L1023-2true, 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 222#(= |#race~data~0| 0), 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:12,806 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-03-14 01:50:12,806 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-14 01:50:12,806 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-14 01:50:12,806 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-14 01:50:12,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][147], [183#L1022true, 225#true, 9#L1023-2true, 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 144#L1039-1true, 222#(= |#race~data~0| 0), 197#true, Black: 220#true]) [2025-03-14 01:50:12,807 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:50:12,807 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:12,807 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:12,807 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:50:12,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][147], [225#true, 9#L1023-2true, 8#L1023-1true, 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 144#L1039-1true, 222#(= |#race~data~0| 0), 197#true, Black: 220#true]) [2025-03-14 01:50:12,927 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:12,927 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:12,927 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:12,927 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:13,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][147], [225#true, 9#L1023-2true, 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 48#L1024true, 222#(= |#race~data~0| 0), 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:13,419 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:50:13,420 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:13,420 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:13,420 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:14,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][81], [225#true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 48#L1024true, 127#L1024-3true, 222#(= |#race~data~0| 0), 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:14,031 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2025-03-14 01:50:14,031 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:50:14,031 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-14 01:50:14,031 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:50:14,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][81], [225#true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 200#true, 199#true, 175#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 48#L1024true, 222#(= |#race~data~0| 0), 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:14,067 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-03-14 01:50:14,067 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:50:14,067 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-14 01:50:14,067 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:50:14,290 INFO L124 PetriNetUnfolderBase]: 23220/65965 cut-off events. [2025-03-14 01:50:14,291 INFO L125 PetriNetUnfolderBase]: For 54932/60147 co-relation queries the response was YES. [2025-03-14 01:50:14,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136860 conditions, 65965 events. 23220/65965 cut-off events. For 54932/60147 co-relation queries the response was YES. Maximal size of possible extension queue 2352. Compared 872389 event pairs, 11187 based on Foata normal form. 76/57618 useless extension candidates. Maximal degree in co-relation 108784. Up to 25831 conditions per place. [2025-03-14 01:50:14,990 INFO L140 encePairwiseOnDemand]: 185/193 looper letters, 41 selfloop transitions, 18 changer transitions 0/189 dead transitions. [2025-03-14 01:50:14,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 189 transitions, 696 flow [2025-03-14 01:50:14,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:50:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:50:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2025-03-14 01:50:14,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2025-03-14 01:50:14,991 INFO L175 Difference]: Start difference. First operand has 162 places, 166 transitions, 461 flow. Second operand 3 states and 512 transitions. [2025-03-14 01:50:14,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 189 transitions, 696 flow [2025-03-14 01:50:15,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 189 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:15,397 INFO L231 Difference]: Finished difference. Result has 164 places, 180 transitions, 619 flow [2025-03-14 01:50:15,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=164, PETRI_TRANSITIONS=180} [2025-03-14 01:50:15,398 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 3 predicate places. [2025-03-14 01:50:15,398 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 180 transitions, 619 flow [2025-03-14 01:50:15,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:15,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:15,398 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] [2025-03-14 01:50:15,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:50:15,399 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:15,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash -224609486, now seen corresponding path program 1 times [2025-03-14 01:50:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508199982] [2025-03-14 01:50:15,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:15,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:50:15,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:50:15,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:15,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508199982] [2025-03-14 01:50:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508199982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:15,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:15,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:50:15,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787225365] [2025-03-14 01:50:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:50:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:15,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:50:15,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:50:15,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 193 [2025-03-14 01:50:15,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 180 transitions, 619 flow. Second operand has 5 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:15,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:15,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 193 [2025-03-14 01:50:15,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:16,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][162], [225#true, 9#L1023-2true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 31#L1023-2true, 198#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:16,762 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:50:16,762 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:50:16,762 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:16,762 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:19,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][162], [225#true, 9#L1023-2true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, 91#threadENTRYtrue, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:19,182 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-03-14 01:50:19,182 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-14 01:50:19,182 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:19,182 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:20,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][185], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 9#L1023-2true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,382 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,382 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,382 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,382 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][183], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true, 188#L1023-1true]) [2025-03-14 01:50:20,383 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:20,383 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:20,383 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:20,383 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:20,383 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][185], [Black: 222#(= |#race~data~0| 0), 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,383 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,383 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,383 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,383 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,383 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][183], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,384 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,384 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,384 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,384 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true, 55#L1023-1true]) [2025-03-14 01:50:20,391 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:20,391 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][182], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 9#L1023-2true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, 197#true]) [2025-03-14 01:50:20,392 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][182], [Black: 222#(= |#race~data~0| 0), 136#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 197#true]) [2025-03-14 01:50:20,392 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][185], [Black: 222#(= |#race~data~0| 0), 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,392 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,392 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][183], [Black: 222#(= |#race~data~0| 0), 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,452 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,452 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,452 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,452 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][182], [Black: 222#(= |#race~data~0| 0), 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,470 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,470 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,470 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,470 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 9#L1023-2true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,470 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,470 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,470 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,470 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 152#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,471 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,471 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,471 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:20,471 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:20,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][183], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true, 119#L1024-3true]) [2025-03-14 01:50:20,525 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,525 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,525 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,525 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 9#L1023-2true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 127#L1024-3true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,535 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,535 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,535 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,535 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,543 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][183], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true, 119#L1024-3true]) [2025-03-14 01:50:20,543 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,543 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,543 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,543 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,543 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][170], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, 197#true, 119#L1024-3true]) [2025-03-14 01:50:20,543 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:20,543 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:20,543 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:20,543 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:20,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][170], [136#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 197#true, 119#L1024-3true]) [2025-03-14 01:50:20,544 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,544 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,544 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,544 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true, 55#L1023-1true, 119#L1024-3true]) [2025-03-14 01:50:20,592 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:20,592 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:20,592 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:20,592 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:20,595 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][183], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true, 119#L1024-3true]) [2025-03-14 01:50:20,595 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,595 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,595 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,595 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,595 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,595 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 95#L1039-2true, 197#true, 188#L1023-1true]) [2025-03-14 01:50:20,604 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:20,604 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:20,604 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:20,604 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:20,605 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,605 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,605 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,605 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,605 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,605 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,605 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,605 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,605 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,605 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][170], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true, 119#L1024-3true]) [2025-03-14 01:50:20,616 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,616 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,616 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,616 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 152#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 230#true, 95#L1039-2true, 197#true, 119#L1024-3true]) [2025-03-14 01:50:20,618 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,618 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,618 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,618 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][132], [Black: 222#(= |#race~data~0| 0), 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 144#L1039-1true, 197#true]) [2025-03-14 01:50:20,618 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:20,618 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:20,618 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:20,618 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][132], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 9#L1023-2true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,620 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 9#L1023-2true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,620 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][132], [Black: 222#(= |#race~data~0| 0), 136#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 197#true]) [2025-03-14 01:50:20,621 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,621 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,621 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,621 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true, 119#L1024-3true]) [2025-03-14 01:50:20,669 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,669 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,669 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,669 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 225#true, 9#L1023-2true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:20,675 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,675 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,675 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:20,675 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:20,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 127#L1024-3true, 95#L1039-2true, 197#true, 119#L1024-3true]) [2025-03-14 01:50:20,898 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-03-14 01:50:20,898 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:50:20,898 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:50:20,898 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-14 01:50:20,915 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 225#true, 8#L1023-1true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 95#L1039-2true, 197#true, 119#L1024-3true]) [2025-03-14 01:50:20,916 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-03-14 01:50:20,916 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:50:20,916 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-14 01:50:20,916 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:50:20,916 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-14 01:50:21,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][188], [Black: 222#(= |#race~data~0| 0), 225#true, 201#true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 175#L1024true, 70#L1023-1true, 198#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 95#L1039-2true, 197#true]) [2025-03-14 01:50:21,059 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:50:21,059 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:21,059 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:21,059 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:21,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][105], [225#true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 31#L1023-2true, 198#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, 197#true, Black: 220#true]) [2025-03-14 01:50:21,365 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2025-03-14 01:50:21,365 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:50:21,365 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:21,365 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:50:21,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][105], [225#true, 200#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 31#L1023-2true, 198#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, 197#true, Black: 220#true, 119#L1024-3true]) [2025-03-14 01:50:21,396 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-03-14 01:50:21,396 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:21,396 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:21,396 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:21,506 INFO L124 PetriNetUnfolderBase]: 21778/70714 cut-off events. [2025-03-14 01:50:21,506 INFO L125 PetriNetUnfolderBase]: For 38194/49949 co-relation queries the response was YES. [2025-03-14 01:50:21,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135593 conditions, 70714 events. 21778/70714 cut-off events. For 38194/49949 co-relation queries the response was YES. Maximal size of possible extension queue 2191. Compared 989647 event pairs, 11522 based on Foata normal form. 232/61131 useless extension candidates. Maximal degree in co-relation 96062. Up to 18154 conditions per place. [2025-03-14 01:50:22,026 INFO L140 encePairwiseOnDemand]: 185/193 looper letters, 32 selfloop transitions, 7 changer transitions 1/193 dead transitions. [2025-03-14 01:50:22,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 193 transitions, 726 flow [2025-03-14 01:50:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 983 transitions. [2025-03-14 01:50:22,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488773747841105 [2025-03-14 01:50:22,027 INFO L175 Difference]: Start difference. First operand has 164 places, 180 transitions, 619 flow. Second operand 6 states and 983 transitions. [2025-03-14 01:50:22,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 193 transitions, 726 flow [2025-03-14 01:50:22,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 193 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:50:22,150 INFO L231 Difference]: Finished difference. Result has 171 places, 186 transitions, 634 flow [2025-03-14 01:50:22,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=171, PETRI_TRANSITIONS=186} [2025-03-14 01:50:22,151 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 10 predicate places. [2025-03-14 01:50:22,151 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 186 transitions, 634 flow [2025-03-14 01:50:22,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:22,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:22,151 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] [2025-03-14 01:50:22,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:50:22,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:22,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash 685176664, now seen corresponding path program 1 times [2025-03-14 01:50:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:22,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666146903] [2025-03-14 01:50:22,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:22,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:50:22,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:50:22,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:22,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:22,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666146903] [2025-03-14 01:50:22,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666146903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:22,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:50:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382132982] [2025-03-14 01:50:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:22,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:50:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:22,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:50:22,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:50:22,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 193 [2025-03-14 01:50:22,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 186 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 156.16666666666666) internal successors, (937), 6 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:22,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:22,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 193 [2025-03-14 01:50:22,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:50:22,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 95#L1039-2true, Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 57#L1024true, 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:22,920 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-14 01:50:22,920 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:22,920 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:22,920 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:23,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][112], [9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 198#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:23,020 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:50:23,020 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:23,020 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:23,020 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:23,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][147], [9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 31#L1023-2true, 198#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:23,274 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:50:23,274 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:23,274 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:23,274 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:50:23,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][110], [Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 31#L1023-2true, 198#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:23,276 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:50:23,276 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:23,276 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:23,276 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:23,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([616] L1023-3-->L1023-1: Formula: (= |v_threadThread1of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread1of3ForFork0_#t~nondet5=|v_threadThread1of3ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread1of3ForFork0_#t~nondet5=|v_threadThread1of3ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][146], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, Black: 225#true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 95#L1039-2true, Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 198#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 55#L1023-1true]) [2025-03-14 01:50:23,596 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:50:23,596 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:23,596 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:50:23,596 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:23,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([616] L1023-3-->L1023-1: Formula: (= |v_threadThread1of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread1of3ForFork0_#t~nondet5=|v_threadThread1of3ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread1of3ForFork0_#t~nondet5=|v_threadThread1of3ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][107], [Black: 222#(= |#race~data~0| 0), Black: 225#true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 95#L1039-2true, Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 198#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 55#L1023-1true]) [2025-03-14 01:50:23,820 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:50:23,820 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:23,820 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:23,820 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:24,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 201#true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 57#L1024true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 199#true, 31#L1023-2true, 7#threadENTRYtrue, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:24,060 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:50:24,060 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:24,060 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:24,060 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:24,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][188], [Black: 222#(= |#race~data~0| 0), 201#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 70#L1023-1true, 91#threadENTRYtrue, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 57#L1024true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:24,063 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 01:50:24,063 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:24,063 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:24,063 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:24,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][188], [Black: 222#(= |#race~data~0| 0), 201#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 70#L1023-1true, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 57#L1024true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 183#L1022true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:24,270 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2025-03-14 01:50:24,270 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-14 01:50:24,270 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-14 01:50:24,270 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-14 01:50:25,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][186], [Black: 222#(= |#race~data~0| 0), 201#true, 8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 70#L1023-1true, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 199#true, 175#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,021 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2025-03-14 01:50:25,021 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-14 01:50:25,021 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-14 01:50:25,021 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-14 01:50:25,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][147], [9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 91#threadENTRYtrue, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:25,099 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-03-14 01:50:25,099 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:25,099 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:25,099 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-14 01:50:25,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][110], [Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 91#threadENTRYtrue, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, 119#L1024-3true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:25,100 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,100 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,100 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,100 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 93#threadENTRYtrue, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:25,212 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-03-14 01:50:25,212 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-14 01:50:25,212 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:25,212 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:25,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([616] L1023-3-->L1023-1: Formula: (= |v_threadThread1of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread1of3ForFork0_#t~nondet5=|v_threadThread1of3ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread1of3ForFork0_#t~nondet5=|v_threadThread1of3ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][146], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, Black: 225#true, 91#threadENTRYtrue, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 55#L1023-1true]) [2025-03-14 01:50:25,213 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-03-14 01:50:25,213 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:25,213 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:25,213 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-14 01:50:25,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 73#threadENTRYtrue, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 95#L1039-2true, 197#true, Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,230 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-03-14 01:50:25,230 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:25,230 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-14 01:50:25,230 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:50:25,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][186], [Black: 222#(= |#race~data~0| 0), 201#true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 70#L1023-1true, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 199#true, 175#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 48#L1024true, 230#true]) [2025-03-14 01:50:25,266 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2025-03-14 01:50:25,266 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-14 01:50:25,266 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-14 01:50:25,266 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-14 01:50:25,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 95#L1039-2true, Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 143#L1022true, 199#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:25,335 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,335 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,335 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,335 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 51#L1022true, 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,342 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,342 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,342 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,343 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, 119#L1024-3true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 93#threadENTRYtrue, 230#true]) [2025-03-14 01:50:25,370 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,370 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,370 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,370 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([616] L1023-3-->L1023-1: Formula: (= |v_threadThread1of3ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread1of3ForFork0_#t~nondet5=|v_threadThread1of3ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread1of3ForFork0_#t~nondet5=|v_threadThread1of3ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][107], [Black: 222#(= |#race~data~0| 0), Black: 225#true, 91#threadENTRYtrue, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, 119#L1024-3true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 55#L1023-1true]) [2025-03-14 01:50:25,370 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,370 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,370 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,370 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 73#threadENTRYtrue, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 197#true, Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true]) [2025-03-14 01:50:25,404 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,404 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,404 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:50:25,404 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:50:25,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 143#L1022true, 199#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:25,477 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-03-14 01:50:25,477 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-14 01:50:25,477 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-14 01:50:25,477 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-14 01:50:25,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 95#L1039-2true, Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 51#L1022true, 200#true, 199#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 127#L1024-3true]) [2025-03-14 01:50:25,502 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-03-14 01:50:25,502 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-14 01:50:25,502 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-14 01:50:25,502 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-14 01:50:25,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 201#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 70#L1023-1true, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, 119#L1024-3true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 199#true, 175#L1024true, 48#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,526 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is not cut-off event [2025-03-14 01:50:25,526 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2025-03-14 01:50:25,526 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2025-03-14 01:50:25,526 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2025-03-14 01:50:25,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][112], [8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 127#L1024-3true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:25,549 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,549 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,549 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,549 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][147], [8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:25,558 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,558 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:25,558 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:25,558 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][182], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,660 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,660 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,660 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,660 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:25,662 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 188#L1023-1true]) [2025-03-14 01:50:25,662 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][182], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,662 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,662 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][186], [Black: 222#(= |#race~data~0| 0), 201#true, 8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 70#L1023-1true, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 199#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:25,831 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,831 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,831 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,831 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 55#L1023-1true]) [2025-03-14 01:50:25,832 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 136#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:25,832 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true]) [2025-03-14 01:50:25,832 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,832 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:25,833 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][182], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:25,833 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,833 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,833 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,833 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,833 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,833 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 152#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,833 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,833 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,833 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,833 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,871 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,871 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,871 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,871 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][102], [8#L1023-1true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 127#L1024-3true, 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:25,880 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,880 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,880 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,880 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 152#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 144#L1039-1true]) [2025-03-14 01:50:25,885 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,885 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:25,885 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,885 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:25,885 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][102], [8#L1023-1true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:25,885 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,885 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,885 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,885 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,885 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][178], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:25,892 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,892 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,892 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,892 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,893 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,893 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,893 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,893 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true]) [2025-03-14 01:50:25,941 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,941 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,941 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,941 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 152#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,941 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,941 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-14 01:50:25,941 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,941 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:50:25,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, 119#L1024-3true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,947 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,947 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,947 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,947 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 201#true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 70#L1023-1true, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 199#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:25,976 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 55#L1023-1true]) [2025-03-14 01:50:25,976 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,976 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,976 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 152#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,977 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][165], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true]) [2025-03-14 01:50:25,977 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:25,977 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,977 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][165], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, 136#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:25,978 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,978 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,978 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,978 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][104], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true, 144#L1039-1true]) [2025-03-14 01:50:25,983 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,983 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,983 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,983 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true, 188#L1023-1true]) [2025-03-14 01:50:25,992 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true]) [2025-03-14 01:50:25,992 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true]) [2025-03-14 01:50:25,992 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,992 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,993 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true]) [2025-03-14 01:50:25,993 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,993 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,993 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,993 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,993 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,993 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][104], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 136#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true]) [2025-03-14 01:50:25,993 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,993 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:25,993 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:25,993 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:26,019 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][179], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 57#L1024true, 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:26,019 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:50:26,019 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:26,019 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:26,019 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:26,019 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:26,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, 119#L1024-3true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:26,025 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:26,025 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:26,025 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:26,025 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:26,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][165], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:26,026 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:26,026 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:26,026 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:26,026 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:26,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true]) [2025-03-14 01:50:26,030 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:26,030 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:26,030 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:26,030 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:26,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][104], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true]) [2025-03-14 01:50:26,031 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:50:26,031 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:26,031 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-14 01:50:26,031 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:50:26,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 222#(= |#race~data~0| 0), 9#L1023-2true, 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 175#L1024true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:26,038 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:50:26,038 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:26,038 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:26,038 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:26,044 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 175#L1024true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:26,044 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:50:26,044 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:26,044 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:26,044 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:26,044 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:50:26,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][110], [8#L1023-1true, 189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 31#L1023-2true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:26,079 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:50:26,079 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:50:26,079 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:26,079 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 01:50:26,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true, 127#L1024-3true]) [2025-03-14 01:50:26,110 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-03-14 01:50:26,110 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:50:26,110 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-14 01:50:26,110 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:50:26,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread2of3ForFork1_#t~nondet5_3|) InVars {threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread2of3ForFork1_#t~nondet5=|v_threadThread2of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][163], [Black: 222#(= |#race~data~0| 0), 8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 199#true, 175#L1024true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:26,145 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2025-03-14 01:50:26,145 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:50:26,145 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-14 01:50:26,145 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:50:26,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][186], [Black: 222#(= |#race~data~0| 0), 201#true, 9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 70#L1023-1true, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 175#L1024true, 198#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true]) [2025-03-14 01:50:26,187 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:50:26,187 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:26,187 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:26,187 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:50:26,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet5_3|) InVars {threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of3ForFork1_#t~nondet5=|v_threadThread3of3ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][181], [Black: 222#(= |#race~data~0| 0), 201#true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 70#L1023-1true, 95#L1039-2true, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, 119#L1024-3true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 175#L1024true, 198#true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 230#true]) [2025-03-14 01:50:26,294 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2025-03-14 01:50:26,294 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-14 01:50:26,294 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-14 01:50:26,294 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-14 01:50:26,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_1|, ULTIMATE.start_main_#t~post12#1=|v_ULTIMATE.start_main_#t~post12#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~post17#1=|v_ULTIMATE.start_main_#t~post17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~tids~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~tids~0#1.base, ULTIMATE.start_main_#t~post12#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~post17#1, ULTIMATE.start_main_#t~nondet15#1][125], [8#L1023-1true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 57#L1024true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 90#ULTIMATE.startFINALtrue, 241#true, 199#true, 175#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, Black: 220#true]) [2025-03-14 01:50:26,372 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2025-03-14 01:50:26,372 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-14 01:50:26,372 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-14 01:50:26,372 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-14 01:50:26,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_1|, ULTIMATE.start_main_#t~post12#1=|v_ULTIMATE.start_main_#t~post12#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~post17#1=|v_ULTIMATE.start_main_#t~post17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~tids~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~tids~0#1.base, ULTIMATE.start_main_#t~post12#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~post17#1, ULTIMATE.start_main_#t~nondet15#1][125], [Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 90#ULTIMATE.startFINALtrue, 241#true, 199#true, 175#L1024true, 48#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 188#L1023-1true, Black: 220#true]) [2025-03-14 01:50:26,380 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2025-03-14 01:50:26,380 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-14 01:50:26,380 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-14 01:50:26,380 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-14 01:50:26,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_1|, ULTIMATE.start_main_#t~post12#1=|v_ULTIMATE.start_main_#t~post12#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~post17#1=|v_ULTIMATE.start_main_#t~post17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~tids~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~tids~0#1.base, ULTIMATE.start_main_#t~post12#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~post17#1, ULTIMATE.start_main_#t~nondet15#1][125], [9#L1023-2true, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 197#true, Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 90#ULTIMATE.startFINALtrue, 241#true, 199#true, 175#L1024true, 48#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, Black: 220#true]) [2025-03-14 01:50:26,397 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2025-03-14 01:50:26,397 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-03-14 01:50:26,397 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-03-14 01:50:26,397 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-03-14 01:50:26,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][110], [189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 31#L1023-2true, 198#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:26,412 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2025-03-14 01:50:26,412 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:50:26,412 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:50:26,412 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:50:26,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_1|, ULTIMATE.start_main_#t~post12#1=|v_ULTIMATE.start_main_#t~post12#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~post17#1=|v_ULTIMATE.start_main_#t~post17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~tids~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~tids~0#1.base, ULTIMATE.start_main_#t~post12#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~post17#1, ULTIMATE.start_main_#t~nondet15#1][125], [Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, 119#L1024-3true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 90#ULTIMATE.startFINALtrue, 241#true, 199#true, 175#L1024true, 48#L1024true, Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, Black: 220#true]) [2025-03-14 01:50:26,421 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-03-14 01:50:26,421 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-14 01:50:26,421 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-14 01:50:26,421 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-14 01:50:26,431 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][110], [Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, 119#L1024-3true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 31#L1023-2true, 198#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:26,431 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-03-14 01:50:26,431 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:26,431 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:26,431 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:26,431 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:26,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][102], [189#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 198#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 127#L1024-3true, 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:26,462 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-03-14 01:50:26,462 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:26,462 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:26,462 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:26,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1038-->L1039-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][102], [Black: 227#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), 152#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 236#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 233#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 197#true, Black: 234#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 119#L1024-3true, Black: 232#(= |ULTIMATE.start_main_~i~0#1| 0), 200#true, 198#true, 245#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 217#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet5|), 230#true, 144#L1039-1true, Black: 220#true]) [2025-03-14 01:50:26,465 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-03-14 01:50:26,465 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:26,465 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 01:50:26,465 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:50:26,497 INFO L124 PetriNetUnfolderBase]: 14676/45874 cut-off events. [2025-03-14 01:50:26,497 INFO L125 PetriNetUnfolderBase]: For 23353/28195 co-relation queries the response was YES. [2025-03-14 01:50:26,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91011 conditions, 45874 events. 14676/45874 cut-off events. For 23353/28195 co-relation queries the response was YES. Maximal size of possible extension queue 1613. Compared 599192 event pairs, 3920 based on Foata normal form. 53/38657 useless extension candidates. Maximal degree in co-relation 80691. Up to 8484 conditions per place. [2025-03-14 01:50:26,834 INFO L140 encePairwiseOnDemand]: 186/193 looper letters, 34 selfloop transitions, 6 changer transitions 0/191 dead transitions. [2025-03-14 01:50:26,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 191 transitions, 705 flow [2025-03-14 01:50:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:50:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:50:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 965 transitions. [2025-03-14 01:50:26,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-14 01:50:26,835 INFO L175 Difference]: Start difference. First operand has 171 places, 186 transitions, 634 flow. Second operand 6 states and 965 transitions. [2025-03-14 01:50:26,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 191 transitions, 705 flow [2025-03-14 01:50:27,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 191 transitions, 693 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:50:27,037 INFO L231 Difference]: Finished difference. Result has 169 places, 181 transitions, 605 flow [2025-03-14 01:50:27,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=169, PETRI_TRANSITIONS=181} [2025-03-14 01:50:27,038 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 8 predicate places. [2025-03-14 01:50:27,038 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 181 transitions, 605 flow [2025-03-14 01:50:27,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.16666666666666) internal successors, (937), 6 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:27,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:50:27,038 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-03-14 01:50:27,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:50:27,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:50:27,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:50:27,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1891477144, now seen corresponding path program 1 times [2025-03-14 01:50:27,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:50:27,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004841958] [2025-03-14 01:50:27,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:50:27,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:50:27,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:50:27,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:50:27,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:50:27,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:50:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:50:27,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:50:27,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004841958] [2025-03-14 01:50:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004841958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:50:27,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:50:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:50:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494831217] [2025-03-14 01:50:27,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:50:27,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:50:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:50:27,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:50:27,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:50:27,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 193 [2025-03-14 01:50:27,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 181 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:50:27,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:50:27,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 193 [2025-03-14 01:50:27,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand