./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 490e43bb8ca19cea87b27390f3d2ab0cf6fc9da6355c682d1c6272a9c3d813c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:39:07,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:39:08,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:39:08,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:39:08,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:39:08,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:39:08,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:39:08,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:39:08,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:39:08,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:39:08,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:39:08,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:39:08,071 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:39:08,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:39:08,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:39:08,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:39:08,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:39:08,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:39:08,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:39:08,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:39:08,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:39:08,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:39:08,072 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:39:08,072 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:39:08,072 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:39:08,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:39:08,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:39:08,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:39:08,073 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:39:08,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:08,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:08,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:08,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:39:08,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:08,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:08,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:08,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:39:08,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:39:08,074 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:39:08,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:39:08,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:39:08,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:39:08,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:39:08,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:39:08,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:39:08,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:39:08,075 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 490e43bb8ca19cea87b27390f3d2ab0cf6fc9da6355c682d1c6272a9c3d813c1 [2025-01-09 21:39:08,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:39:08,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:39:08,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:39:08,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:39:08,361 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:39:08,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race.i [2025-01-09 21:39:09,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f042e5969/9268f1bb83424c50a937bbc0f49766a6/FLAG8bd080c45 [2025-01-09 21:39:10,007 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:39:10,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race.i [2025-01-09 21:39:10,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f042e5969/9268f1bb83424c50a937bbc0f49766a6/FLAG8bd080c45 [2025-01-09 21:39:10,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f042e5969/9268f1bb83424c50a937bbc0f49766a6 [2025-01-09 21:39:10,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:39:10,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:39:10,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:10,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:39:10,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:39:10,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3f32cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10, skipping insertion in model container [2025-01-09 21:39:10,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:39:10,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:10,625 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:39:10,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:10,714 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:39:10,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10 WrapperNode [2025-01-09 21:39:10,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:10,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:10,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:39:10,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:39:10,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,755 INFO L138 Inliner]: procedures = 159, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-01-09 21:39:10,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:10,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:39:10,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:39:10,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:39:10,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:39:10,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:39:10,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:39:10,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:39:10,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (1/1) ... [2025-01-09 21:39:10,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:10,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:39:10,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:39:10,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:39:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:39:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:39:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:39:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:39:10,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:39:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:39:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:39:10,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:39:10,832 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:39:10,941 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:39:10,943 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:39:11,156 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:39:11,157 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:39:11,186 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:39:11,186 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:39:11,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:11 BoogieIcfgContainer [2025-01-09 21:39:11,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:39:11,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:39:11,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:39:11,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:39:11,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:10" (1/3) ... [2025-01-09 21:39:11,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337a2697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:11, skipping insertion in model container [2025-01-09 21:39:11,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:10" (2/3) ... [2025-01-09 21:39:11,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337a2697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:11, skipping insertion in model container [2025-01-09 21:39:11,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:11" (3/3) ... [2025-01-09 21:39:11,198 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-inner-race.i [2025-01-09 21:39:11,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:39:11,214 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-inner-race.i that has 2 procedures, 125 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-01-09 21:39:11,215 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:39:11,280 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:11,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 132 transitions, 268 flow [2025-01-09 21:39:11,404 INFO L124 PetriNetUnfolderBase]: 11/168 cut-off events. [2025-01-09 21:39:11,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:11,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 168 events. 11/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 348 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 96. Up to 4 conditions per place. [2025-01-09 21:39:11,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 132 transitions, 268 flow [2025-01-09 21:39:11,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 132 transitions, 268 flow [2025-01-09 21:39:11,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:11,446 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;@1c43302e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:11,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-09 21:39:11,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:11,465 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-01-09 21:39:11,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:11,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:11,466 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-01-09 21:39:11,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:39:11,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1663378957, now seen corresponding path program 1 times [2025-01-09 21:39:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:11,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990572624] [2025-01-09 21:39:11,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:11,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:11,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:39:11,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:39:11,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:11,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:11,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990572624] [2025-01-09 21:39:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990572624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:11,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924060516] [2025-01-09 21:39:11,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:11,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:11,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:11,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:11,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2025-01-09 21:39:11,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 132 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:11,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:11,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2025-01-09 21:39:11,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:11,970 INFO L124 PetriNetUnfolderBase]: 159/812 cut-off events. [2025-01-09 21:39:11,971 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:39:11,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 812 events. 159/812 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4918 event pairs, 32 based on Foata normal form. 16/719 useless extension candidates. Maximal degree in co-relation 1043. Up to 204 conditions per place. [2025-01-09 21:39:11,978 INFO L140 encePairwiseOnDemand]: 116/132 looper letters, 27 selfloop transitions, 8 changer transitions 1/140 dead transitions. [2025-01-09 21:39:11,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 140 transitions, 354 flow [2025-01-09 21:39:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-01-09 21:39:11,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9116161616161617 [2025-01-09 21:39:11,995 INFO L175 Difference]: Start difference. First operand has 128 places, 132 transitions, 268 flow. Second operand 3 states and 361 transitions. [2025-01-09 21:39:11,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 140 transitions, 354 flow [2025-01-09 21:39:12,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 140 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:12,006 INFO L231 Difference]: Finished difference. Result has 130 places, 131 transitions, 314 flow [2025-01-09 21:39:12,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=130, PETRI_TRANSITIONS=131} [2025-01-09 21:39:12,013 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 2 predicate places. [2025-01-09 21:39:12,013 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 131 transitions, 314 flow [2025-01-09 21:39:12,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:12,014 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] [2025-01-09 21:39:12,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:39:12,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:39:12,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:12,015 INFO L85 PathProgramCache]: Analyzing trace with hash -77756437, now seen corresponding path program 1 times [2025-01-09 21:39:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:12,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029083574] [2025-01-09 21:39:12,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:12,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:39:12,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:39:12,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:12,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:12,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:12,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029083574] [2025-01-09 21:39:12,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029083574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:12,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:12,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490358018] [2025-01-09 21:39:12,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:12,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:12,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:12,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:12,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:12,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 132 [2025-01-09 21:39:12,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 131 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:12,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 132 [2025-01-09 21:39:12,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:12,346 INFO L124 PetriNetUnfolderBase]: 198/1064 cut-off events. [2025-01-09 21:39:12,346 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2025-01-09 21:39:12,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 1064 events. 198/1064 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7495 event pairs, 88 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1485. Up to 271 conditions per place. [2025-01-09 21:39:12,356 INFO L140 encePairwiseOnDemand]: 127/132 looper letters, 22 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2025-01-09 21:39:12,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 140 transitions, 384 flow [2025-01-09 21:39:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2025-01-09 21:39:12,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-01-09 21:39:12,359 INFO L175 Difference]: Start difference. First operand has 130 places, 131 transitions, 314 flow. Second operand 3 states and 360 transitions. [2025-01-09 21:39:12,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 140 transitions, 384 flow [2025-01-09 21:39:12,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 140 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:12,366 INFO L231 Difference]: Finished difference. Result has 131 places, 134 transitions, 328 flow [2025-01-09 21:39:12,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=131, PETRI_TRANSITIONS=134} [2025-01-09 21:39:12,367 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2025-01-09 21:39:12,367 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 134 transitions, 328 flow [2025-01-09 21:39:12,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:12,368 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-01-09 21:39:12,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:39:12,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:39:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -136255783, now seen corresponding path program 1 times [2025-01-09 21:39:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254998901] [2025-01-09 21:39:12,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:12,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:39:12,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:39:12,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:12,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254998901] [2025-01-09 21:39:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254998901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:12,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:12,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:12,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281205934] [2025-01-09 21:39:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:12,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:12,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:12,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:12,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:12,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2025-01-09 21:39:12,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 134 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:12,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2025-01-09 21:39:12,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:12,641 INFO L124 PetriNetUnfolderBase]: 179/1009 cut-off events. [2025-01-09 21:39:12,642 INFO L125 PetriNetUnfolderBase]: For 123/152 co-relation queries the response was YES. [2025-01-09 21:39:12,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1009 events. 179/1009 cut-off events. For 123/152 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6828 event pairs, 60 based on Foata normal form. 8/900 useless extension candidates. Maximal degree in co-relation 1486. Up to 297 conditions per place. [2025-01-09 21:39:12,651 INFO L140 encePairwiseOnDemand]: 126/132 looper letters, 24 selfloop transitions, 7 changer transitions 0/142 dead transitions. [2025-01-09 21:39:12,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 142 transitions, 414 flow [2025-01-09 21:39:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2025-01-09 21:39:12,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8914141414141414 [2025-01-09 21:39:12,656 INFO L175 Difference]: Start difference. First operand has 131 places, 134 transitions, 328 flow. Second operand 3 states and 353 transitions. [2025-01-09 21:39:12,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 142 transitions, 414 flow [2025-01-09 21:39:12,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 142 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:12,662 INFO L231 Difference]: Finished difference. Result has 133 places, 140 transitions, 382 flow [2025-01-09 21:39:12,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=133, PETRI_TRANSITIONS=140} [2025-01-09 21:39:12,664 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2025-01-09 21:39:12,664 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 140 transitions, 382 flow [2025-01-09 21:39:12,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:12,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, 1, 1, 1, 1] [2025-01-09 21:39:12,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:39:12,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:39:12,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1596046409, now seen corresponding path program 1 times [2025-01-09 21:39:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481984762] [2025-01-09 21:39:12,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:12,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:39:12,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:39:12,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:12,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:12,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:12,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481984762] [2025-01-09 21:39:12,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481984762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:12,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:12,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:12,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577790441] [2025-01-09 21:39:12,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:12,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:12,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:12,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:12,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 132 [2025-01-09 21:39:12,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 140 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:12,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 132 [2025-01-09 21:39:12,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:12,913 INFO L124 PetriNetUnfolderBase]: 198/1203 cut-off events. [2025-01-09 21:39:12,913 INFO L125 PetriNetUnfolderBase]: For 98/106 co-relation queries the response was YES. [2025-01-09 21:39:12,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 1203 events. 198/1203 cut-off events. For 98/106 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8116 event pairs, 50 based on Foata normal form. 4/1057 useless extension candidates. Maximal degree in co-relation 1742. Up to 201 conditions per place. [2025-01-09 21:39:12,921 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 18 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2025-01-09 21:39:12,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 148 transitions, 440 flow [2025-01-09 21:39:12,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2025-01-09 21:39:12,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9267676767676768 [2025-01-09 21:39:12,923 INFO L175 Difference]: Start difference. First operand has 133 places, 140 transitions, 382 flow. Second operand 3 states and 367 transitions. [2025-01-09 21:39:12,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 148 transitions, 440 flow [2025-01-09 21:39:12,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 148 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:12,946 INFO L231 Difference]: Finished difference. Result has 135 places, 142 transitions, 390 flow [2025-01-09 21:39:12,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=135, PETRI_TRANSITIONS=142} [2025-01-09 21:39:12,948 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2025-01-09 21:39:12,948 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 142 transitions, 390 flow [2025-01-09 21:39:12,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:12,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:12,949 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 21:39:12,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:39:12,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:39:12,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1349461623, now seen corresponding path program 1 times [2025-01-09 21:39:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:12,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360748463] [2025-01-09 21:39:12,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:12,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:39:12,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:39:12,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:12,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:12,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:39:12,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:39:12,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:39:12,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:12,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:13,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:39:13,022 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:39:13,023 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-09 21:39:13,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-01-09 21:39:13,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-01-09 21:39:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-01-09 21:39:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-01-09 21:39:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-01-09 21:39:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-01-09 21:39:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-01-09 21:39:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-01-09 21:39:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-01-09 21:39:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-01-09 21:39:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-01-09 21:39:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-01-09 21:39:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-01-09 21:39:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-01-09 21:39:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-01-09 21:39:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-01-09 21:39:13,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:39:13,029 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:39:13,031 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:39:13,032 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:39:13,069 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:13,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 185 transitions, 380 flow [2025-01-09 21:39:13,105 INFO L124 PetriNetUnfolderBase]: 17/265 cut-off events. [2025-01-09 21:39:13,105 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:39:13,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 265 events. 17/265 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 758 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 169. Up to 6 conditions per place. [2025-01-09 21:39:13,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 185 transitions, 380 flow [2025-01-09 21:39:13,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 185 transitions, 380 flow [2025-01-09 21:39:13,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:13,115 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;@1c43302e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:13,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:39:13,121 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:13,121 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-01-09 21:39:13,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:13,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:13,121 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-01-09 21:39:13,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:39:13,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1777307085, now seen corresponding path program 1 times [2025-01-09 21:39:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:13,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97328775] [2025-01-09 21:39:13,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:13,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:39:13,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:39:13,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:13,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97328775] [2025-01-09 21:39:13,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97328775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:13,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:13,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568228599] [2025-01-09 21:39:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:13,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:13,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:13,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:13,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:13,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 185 [2025-01-09 21:39:13,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 185 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:13,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:13,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 185 [2025-01-09 21:39:13,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:15,218 INFO L124 PetriNetUnfolderBase]: 5875/17635 cut-off events. [2025-01-09 21:39:15,218 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-09 21:39:15,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26569 conditions, 17635 events. 5875/17635 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 197262 event pairs, 1985 based on Foata normal form. 531/15546 useless extension candidates. Maximal degree in co-relation 20027. Up to 5255 conditions per place. [2025-01-09 21:39:15,363 INFO L140 encePairwiseOnDemand]: 158/185 looper letters, 53 selfloop transitions, 16 changer transitions 1/211 dead transitions. [2025-01-09 21:39:15,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 211 transitions, 575 flow [2025-01-09 21:39:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2025-01-09 21:39:15,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2025-01-09 21:39:15,367 INFO L175 Difference]: Start difference. First operand has 181 places, 185 transitions, 380 flow. Second operand 3 states and 510 transitions. [2025-01-09 21:39:15,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 211 transitions, 575 flow [2025-01-09 21:39:15,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 211 transitions, 575 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:15,372 INFO L231 Difference]: Finished difference. Result has 185 places, 195 transitions, 508 flow [2025-01-09 21:39:15,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=185, PETRI_TRANSITIONS=195} [2025-01-09 21:39:15,374 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 4 predicate places. [2025-01-09 21:39:15,374 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 195 transitions, 508 flow [2025-01-09 21:39:15,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:15,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:15,376 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] [2025-01-09 21:39:15,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:39:15,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:39:15,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1477404420, now seen corresponding path program 1 times [2025-01-09 21:39:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661472716] [2025-01-09 21:39:15,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:15,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:39:15,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:39:15,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:15,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:15,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:15,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661472716] [2025-01-09 21:39:15,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661472716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:15,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:15,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:15,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130316887] [2025-01-09 21:39:15,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:15,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:15,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:15,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:15,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 185 [2025-01-09 21:39:15,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 195 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:15,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:15,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 185 [2025-01-09 21:39:15,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:17,715 INFO L124 PetriNetUnfolderBase]: 6244/21577 cut-off events. [2025-01-09 21:39:17,715 INFO L125 PetriNetUnfolderBase]: For 995/1101 co-relation queries the response was YES. [2025-01-09 21:39:17,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33913 conditions, 21577 events. 6244/21577 cut-off events. For 995/1101 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 271377 event pairs, 3371 based on Foata normal form. 0/18804 useless extension candidates. Maximal degree in co-relation 32262. Up to 6414 conditions per place. [2025-01-09 21:39:17,853 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 36 selfloop transitions, 5 changer transitions 0/211 dead transitions. [2025-01-09 21:39:17,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 211 transitions, 622 flow [2025-01-09 21:39:17,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2025-01-09 21:39:17,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9135135135135135 [2025-01-09 21:39:17,855 INFO L175 Difference]: Start difference. First operand has 185 places, 195 transitions, 508 flow. Second operand 3 states and 507 transitions. [2025-01-09 21:39:17,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 211 transitions, 622 flow [2025-01-09 21:39:17,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 211 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:17,872 INFO L231 Difference]: Finished difference. Result has 186 places, 199 transitions, 514 flow [2025-01-09 21:39:17,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=186, PETRI_TRANSITIONS=199} [2025-01-09 21:39:17,874 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 5 predicate places. [2025-01-09 21:39:17,874 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 199 transitions, 514 flow [2025-01-09 21:39:17,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:17,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:17,875 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-01-09 21:39:17,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:39:17,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:39:17,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash 350445293, now seen corresponding path program 1 times [2025-01-09 21:39:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:17,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511665354] [2025-01-09 21:39:17,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:17,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:39:17,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:39:17,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:17,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:18,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511665354] [2025-01-09 21:39:18,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511665354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:18,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:18,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:18,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193450940] [2025-01-09 21:39:18,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:18,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:18,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:18,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:18,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:18,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 185 [2025-01-09 21:39:18,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 199 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:18,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:18,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 185 [2025-01-09 21:39:18,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:18,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][118], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 8#L691-7true, 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,293 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-01-09 21:39:18,293 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-01-09 21:39:18,293 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-01-09 21:39:18,294 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:39:18,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 189#true, 194#true, 180#true, 100#L712-1true, 45#L692true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,340 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-01-09 21:39:18,340 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-01-09 21:39:18,340 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-01-09 21:39:18,340 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:39:18,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 189#true, 194#true, 28#L692-3true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,341 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-01-09 21:39:18,341 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:39:18,341 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:39:18,341 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:39:18,369 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 189#true, 194#true, 28#L692-3true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,369 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-01-09 21:39:18,369 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:39:18,369 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:39:18,369 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:39:18,369 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:39:18,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 20#L700-2true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,432 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:39:18,432 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:39:18,432 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:39:18,432 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:39:18,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 4#L694-2true, 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,432 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:39:18,432 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:39:18,432 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:39:18,432 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:39:18,462 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 20#L700-2true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,463 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:39:18,463 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:39:18,463 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:39:18,463 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:39:18,463 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:39:18,463 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 4#L694-2true, 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,463 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:39:18,463 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:39:18,463 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:39:18,463 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:39:18,463 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-01-09 21:39:18,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 122#L695-3true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,471 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:39:18,471 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:39:18,471 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:39:18,471 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:39:18,497 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 122#L695-3true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,497 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-01-09 21:39:18,497 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:39:18,497 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:39:18,497 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:39:18,497 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-01-09 21:39:18,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][118], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 8#L691-7true, 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:18,614 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2025-01-09 21:39:18,614 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-01-09 21:39:18,614 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-01-09 21:39:18,614 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:39:18,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 189#true, 194#true, 180#true, 100#L712-1true, 45#L692true, Black: 184#true]) [2025-01-09 21:39:18,842 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:39:18,842 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:39:18,842 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:39:18,842 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:39:18,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 189#true, 194#true, 28#L692-3true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:18,842 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:39:18,842 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:39:18,842 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:39:18,842 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:39:18,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 177#L697-3true, 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,875 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-01-09 21:39:18,875 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:39:18,875 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:39:18,875 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:39:18,882 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 189#true, 194#true, 180#true, 28#L692-3true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:18,882 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:39:18,882 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:39:18,882 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:39:18,882 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:39:18,883 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:39:18,913 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 177#L697-3true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:18,913 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-01-09 21:39:18,913 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:39:18,913 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:39:18,913 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-01-09 21:39:18,913 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:39:18,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true, 97#L698-3true, 121#L691-2true]) [2025-01-09 21:39:18,940 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-01-09 21:39:18,940 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:39:18,940 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:39:18,940 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:18,993 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true, 97#L698-3true, 121#L691-2true]) [2025-01-09 21:39:18,994 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-01-09 21:39:18,994 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:18,994 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:39:18,994 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:39:18,994 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:19,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 20#L700-2true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:19,020 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:39:19,020 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:19,021 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:19,021 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:19,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 4#L694-2true, 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:19,022 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:39:19,022 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:19,022 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:19,022 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:19,069 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 189#true, 20#L700-2true, 194#true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:19,069 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:39:19,069 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:19,069 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:19,069 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:19,069 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:19,070 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 4#L694-2true, 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:19,070 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:39:19,070 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:19,070 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:19,070 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:19,070 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:19,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 122#L695-3true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:19,101 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:39:19,101 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:19,101 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:19,101 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:19,147 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 189#true, 194#true, 122#L695-3true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:19,147 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:39:19,147 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:19,147 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:19,147 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:19,147 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:19,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 177#L697-3true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:19,631 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-01-09 21:39:19,631 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:39:19,631 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:39:19,631 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:19,674 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 177#L697-3true, 182#true, 189#true, 194#true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:19,675 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-01-09 21:39:19,675 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:19,675 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:39:19,675 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:39:19,675 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:19,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 189#true, 194#true, 180#true, 100#L712-1true, 97#L698-3true, Black: 184#true]) [2025-01-09 21:39:19,707 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-01-09 21:39:19,707 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:19,707 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:19,707 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:19,741 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 189#true, 194#true, 180#true, 100#L712-1true, 97#L698-3true, Black: 184#true]) [2025-01-09 21:39:19,741 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-01-09 21:39:19,741 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:19,741 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:19,742 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:19,742 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:20,008 INFO L124 PetriNetUnfolderBase]: 7571/25064 cut-off events. [2025-01-09 21:39:20,009 INFO L125 PetriNetUnfolderBase]: For 4169/5357 co-relation queries the response was YES. [2025-01-09 21:39:20,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42986 conditions, 25064 events. 7571/25064 cut-off events. For 4169/5357 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 312324 event pairs, 3421 based on Foata normal form. 210/21895 useless extension candidates. Maximal degree in co-relation 41284. Up to 9528 conditions per place. [2025-01-09 21:39:20,191 INFO L140 encePairwiseOnDemand]: 175/185 looper letters, 47 selfloop transitions, 16 changer transitions 0/222 dead transitions. [2025-01-09 21:39:20,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 222 transitions, 715 flow [2025-01-09 21:39:20,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-01-09 21:39:20,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972972972972973 [2025-01-09 21:39:20,195 INFO L175 Difference]: Start difference. First operand has 186 places, 199 transitions, 514 flow. Second operand 3 states and 498 transitions. [2025-01-09 21:39:20,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 222 transitions, 715 flow [2025-01-09 21:39:20,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 222 transitions, 705 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:20,208 INFO L231 Difference]: Finished difference. Result has 188 places, 213 transitions, 650 flow [2025-01-09 21:39:20,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=188, PETRI_TRANSITIONS=213} [2025-01-09 21:39:20,210 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 7 predicate places. [2025-01-09 21:39:20,210 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 213 transitions, 650 flow [2025-01-09 21:39:20,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:20,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:20,211 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] [2025-01-09 21:39:20,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:39:20,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:39:20,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1715512912, now seen corresponding path program 1 times [2025-01-09 21:39:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923050647] [2025-01-09 21:39:20,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:20,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:39:20,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:39:20,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:20,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:20,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:20,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923050647] [2025-01-09 21:39:20,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923050647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:20,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41493656] [2025-01-09 21:39:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:20,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:20,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:20,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:20,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2025-01-09 21:39:20,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 213 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:20,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:20,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2025-01-09 21:39:20,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:20,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][116], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 8#L691-7true, 194#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:20,383 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-01-09 21:39:20,383 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-01-09 21:39:20,383 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-01-09 21:39:20,384 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:39:20,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 194#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 100#L712-1true, 45#L692true, Black: 184#true, 121#L691-2true]) [2025-01-09 21:39:20,419 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-01-09 21:39:20,419 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:39:20,419 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-01-09 21:39:20,419 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-01-09 21:39:20,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][116], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 8#L691-7true, 194#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:20,804 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2025-01-09 21:39:20,804 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:39:20,804 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-01-09 21:39:20,804 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-01-09 21:39:20,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 194#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 100#L712-1true, 45#L692true, Black: 184#true]) [2025-01-09 21:39:20,885 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:39:20,885 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:39:20,885 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:39:20,885 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:39:21,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L701-->L701-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][203], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 106#L701-1true, 8#L691-7true, 132#L716-2true, 194#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 184#true]) [2025-01-09 21:39:21,065 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-01-09 21:39:21,065 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:21,065 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:21,065 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:21,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L716-3-->L716-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][162], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 8#L691-7true, 194#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 148#L716-1true, Black: 184#true]) [2025-01-09 21:39:21,174 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-01-09 21:39:21,174 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:21,174 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:21,174 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:21,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L701-->L701-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][169], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 106#L701-1true, 132#L716-2true, 194#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 45#L692true, Black: 184#true]) [2025-01-09 21:39:21,207 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-01-09 21:39:21,207 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:39:21,207 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:39:21,207 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:39:22,392 INFO L124 PetriNetUnfolderBase]: 7298/27862 cut-off events. [2025-01-09 21:39:22,392 INFO L125 PetriNetUnfolderBase]: For 3086/3705 co-relation queries the response was YES. [2025-01-09 21:39:22,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45202 conditions, 27862 events. 7298/27862 cut-off events. For 3086/3705 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 365803 event pairs, 3021 based on Foata normal form. 35/24037 useless extension candidates. Maximal degree in co-relation 43287. Up to 5991 conditions per place. [2025-01-09 21:39:22,565 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 32 selfloop transitions, 4 changer transitions 0/228 dead transitions. [2025-01-09 21:39:22,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 228 transitions, 752 flow [2025-01-09 21:39:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-01-09 21:39:22,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9261261261261261 [2025-01-09 21:39:22,567 INFO L175 Difference]: Start difference. First operand has 188 places, 213 transitions, 650 flow. Second operand 3 states and 514 transitions. [2025-01-09 21:39:22,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 228 transitions, 752 flow [2025-01-09 21:39:22,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 228 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:22,577 INFO L231 Difference]: Finished difference. Result has 190 places, 216 transitions, 648 flow [2025-01-09 21:39:22,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=190, PETRI_TRANSITIONS=216} [2025-01-09 21:39:22,578 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 9 predicate places. [2025-01-09 21:39:22,578 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 216 transitions, 648 flow [2025-01-09 21:39:22,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:22,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:22,579 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] [2025-01-09 21:39:22,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:39:22,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:39:22,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash -167807534, now seen corresponding path program 1 times [2025-01-09 21:39:22,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:22,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629857170] [2025-01-09 21:39:22,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:22,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:22,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:39:22,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:39:22,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:22,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:22,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:22,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629857170] [2025-01-09 21:39:22,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629857170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:22,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:22,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:22,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190025605] [2025-01-09 21:39:22,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:22,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:22,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:22,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:22,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:22,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 185 [2025-01-09 21:39:22,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 216 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:22,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:22,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 185 [2025-01-09 21:39:22,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:22,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][116], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 8#L691-7true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 100#L712-1true, Black: 184#true, 204#true, 121#L691-2true]) [2025-01-09 21:39:22,726 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-01-09 21:39:22,726 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-01-09 21:39:22,726 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-01-09 21:39:22,726 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-01-09 21:39:22,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 100#L712-1true, 45#L692true, Black: 184#true, 204#true, 121#L691-2true]) [2025-01-09 21:39:22,747 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-01-09 21:39:22,748 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-01-09 21:39:22,748 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-01-09 21:39:22,748 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-01-09 21:39:23,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][116], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 8#L691-7true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 100#L712-1true, Black: 184#true]) [2025-01-09 21:39:23,003 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2025-01-09 21:39:23,003 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-01-09 21:39:23,003 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-01-09 21:39:23,003 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-01-09 21:39:23,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 100#L712-1true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 45#L692true, Black: 184#true]) [2025-01-09 21:39:23,114 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-01-09 21:39:23,114 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:39:23,114 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-01-09 21:39:23,114 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-01-09 21:39:23,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L701-->L701-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][210], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 106#L701-1true, 8#L691-7true, 132#L716-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), Black: 184#true]) [2025-01-09 21:39:23,443 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-01-09 21:39:23,443 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:23,443 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:23,444 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:23,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L716-3-->L716-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][163], [130#L701-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 8#L691-7true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 148#L716-1true, Black: 184#true, 204#true]) [2025-01-09 21:39:23,872 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-01-09 21:39:23,872 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:39:23,872 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:23,872 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:23,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L701-->L701-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 106#L701-1true, 132#L716-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 45#L692true, Black: 184#true]) [2025-01-09 21:39:23,921 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-01-09 21:39:23,922 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:39:23,922 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:39:23,922 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:39:24,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 184#true, 94#L693-2true]) [2025-01-09 21:39:24,857 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-01-09 21:39:24,857 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:24,857 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:24,857 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-01-09 21:39:24,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 186#(= |#race~threads_alive~0| 0), 94#L693-2true]) [2025-01-09 21:39:24,859 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-01-09 21:39:24,859 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:24,859 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-01-09 21:39:24,859 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:24,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 30#L693-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 51#L714-4true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 184#true]) [2025-01-09 21:39:24,902 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-01-09 21:39:24,902 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:24,902 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-01-09 21:39:24,902 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:24,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 51#L714-4true, 30#L693-2true, 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:24,902 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-01-09 21:39:24,902 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:24,902 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:39:24,902 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-01-09 21:39:24,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 184#true, 94#L693-2true]) [2025-01-09 21:39:24,925 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-01-09 21:39:24,925 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:24,925 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-01-09 21:39:24,925 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:24,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 104#L693-1true, 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), 94#L693-2true]) [2025-01-09 21:39:24,926 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-01-09 21:39:24,926 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:24,926 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:24,926 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-01-09 21:39:24,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 51#L714-4true, 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 175#L700-2true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 184#true]) [2025-01-09 21:39:24,947 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,947 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,947 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,947 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 184#true, 119#L694-2true]) [2025-01-09 21:39:24,947 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,947 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,947 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,947 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 175#L700-2true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:24,949 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,949 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,949 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,949 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), Black: 186#(= |#race~threads_alive~0| 0), 119#L694-2true]) [2025-01-09 21:39:24,949 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,949 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,949 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,949 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 30#L693-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 184#true]) [2025-01-09 21:39:24,972 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-01-09 21:39:24,973 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:24,973 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-01-09 21:39:24,973 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:24,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 30#L693-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:24,973 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-01-09 21:39:24,973 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:24,973 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-01-09 21:39:24,973 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:39:24,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 20#L700-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 184#true]) [2025-01-09 21:39:24,992 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,992 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,992 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,992 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 51#L714-4true, 182#true, 20#L700-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:24,992 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,992 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,992 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,993 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 4#L694-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), Black: 184#true]) [2025-01-09 21:39:24,993 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,993 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,993 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,993 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 4#L694-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:24,994 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,994 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:24,994 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-01-09 21:39:24,994 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:39:25,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 104#L693-1true, 199#true, 180#true, 175#L700-2true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 184#true]) [2025-01-09 21:39:25,018 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,018 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,018 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,018 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 184#true, 119#L694-2true]) [2025-01-09 21:39:25,018 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,018 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,018 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,019 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 175#L700-2true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,019 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,019 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,020 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,020 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 104#L693-1true, 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), 119#L694-2true]) [2025-01-09 21:39:25,020 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,020 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,020 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,020 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [34#L695-3true, 51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 184#true]) [2025-01-09 21:39:25,041 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-01-09 21:39:25,041 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-01-09 21:39:25,041 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:25,041 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:25,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 34#L695-3true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,042 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-01-09 21:39:25,042 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-01-09 21:39:25,042 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:25,042 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:25,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 20#L700-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 184#true]) [2025-01-09 21:39:25,061 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,061 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,061 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,061 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 20#L700-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,061 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,061 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,061 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,061 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 4#L694-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 184#true]) [2025-01-09 21:39:25,062 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,062 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,062 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,062 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 4#L694-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,062 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,062 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:39:25,063 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,063 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:39:25,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 51#L714-4true, 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 122#L695-3true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), Black: 184#true]) [2025-01-09 21:39:25,078 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-01-09 21:39:25,078 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-01-09 21:39:25,078 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:25,078 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:25,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 51#L714-4true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 122#L695-3true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,078 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-01-09 21:39:25,078 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:25,078 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:39:25,078 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-01-09 21:39:25,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [34#L695-3true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 184#true]) [2025-01-09 21:39:25,099 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-01-09 21:39:25,099 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:25,099 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-01-09 21:39:25,099 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:25,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 34#L695-3true, 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 104#L693-1true, 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,100 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-01-09 21:39:25,100 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-01-09 21:39:25,100 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:25,100 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:25,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 122#L695-3true, 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 184#true]) [2025-01-09 21:39:25,138 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-01-09 21:39:25,138 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-01-09 21:39:25,138 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:25,138 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:25,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 122#L695-3true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,138 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-01-09 21:39:25,138 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:25,138 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:39:25,138 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-01-09 21:39:25,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 51#L714-4true, 182#true, 161#L697-3true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 184#true]) [2025-01-09 21:39:25,347 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-01-09 21:39:25,347 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:25,347 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:39:25,347 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:25,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 161#L697-3true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,348 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-01-09 21:39:25,348 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:25,348 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:39:25,348 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:25,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 177#L697-3true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 184#true]) [2025-01-09 21:39:25,541 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-01-09 21:39:25,541 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:25,541 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:25,541 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:39:25,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 177#L697-3true, 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,541 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-01-09 21:39:25,541 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:25,541 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-01-09 21:39:25,541 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:39:25,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 161#L697-3true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 184#true]) [2025-01-09 21:39:25,550 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-01-09 21:39:25,550 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:25,550 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-01-09 21:39:25,550 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:25,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 161#L697-3true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,551 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-01-09 21:39:25,551 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:25,551 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-01-09 21:39:25,551 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:25,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 29#L698-3true, 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 184#true]) [2025-01-09 21:39:25,555 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-01-09 21:39:25,555 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-01-09 21:39:25,555 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-01-09 21:39:25,555 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-01-09 21:39:25,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 29#L698-3true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,556 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-01-09 21:39:25,556 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-01-09 21:39:25,556 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-01-09 21:39:25,556 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-01-09 21:39:25,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 177#L697-3true, 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 184#true]) [2025-01-09 21:39:25,564 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-01-09 21:39:25,564 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-01-09 21:39:25,564 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:25,564 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:25,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 177#L697-3true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,565 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-01-09 21:39:25,565 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-01-09 21:39:25,565 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:25,565 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-01-09 21:39:25,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 51#L714-4true, 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 184#true, 97#L698-3true]) [2025-01-09 21:39:25,571 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-01-09 21:39:25,571 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-01-09 21:39:25,571 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-01-09 21:39:25,571 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-01-09 21:39:25,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), Black: 186#(= |#race~threads_alive~0| 0), 97#L698-3true]) [2025-01-09 21:39:25,572 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-01-09 21:39:25,572 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-01-09 21:39:25,572 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-01-09 21:39:25,572 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-01-09 21:39:25,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 29#L698-3true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 104#L693-1true, 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 184#true]) [2025-01-09 21:39:25,581 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-01-09 21:39:25,581 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-01-09 21:39:25,581 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:25,581 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:25,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, 29#L698-3true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:25,581 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-01-09 21:39:25,581 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:25,581 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:25,581 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-01-09 21:39:25,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 182#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, Black: 201#(= |#race~data~0| 0), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 184#true, 97#L698-3true]) [2025-01-09 21:39:25,591 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-01-09 21:39:25,591 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:25,591 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-01-09 21:39:25,591 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:25,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 201#(= |#race~data~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), 97#L698-3true]) [2025-01-09 21:39:25,592 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-01-09 21:39:25,592 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:25,592 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-01-09 21:39:25,592 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-01-09 21:39:25,635 INFO L124 PetriNetUnfolderBase]: 9643/37245 cut-off events. [2025-01-09 21:39:25,635 INFO L125 PetriNetUnfolderBase]: For 6034/6992 co-relation queries the response was YES. [2025-01-09 21:39:25,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63911 conditions, 37245 events. 9643/37245 cut-off events. For 6034/6992 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 511430 event pairs, 2245 based on Foata normal form. 36/32878 useless extension candidates. Maximal degree in co-relation 61601. Up to 8514 conditions per place. [2025-01-09 21:39:25,815 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 40 selfloop transitions, 7 changer transitions 0/238 dead transitions. [2025-01-09 21:39:25,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 238 transitions, 801 flow [2025-01-09 21:39:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2025-01-09 21:39:25,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9297297297297298 [2025-01-09 21:39:25,817 INFO L175 Difference]: Start difference. First operand has 190 places, 216 transitions, 648 flow. Second operand 3 states and 516 transitions. [2025-01-09 21:39:25,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 238 transitions, 801 flow [2025-01-09 21:39:25,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 238 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:25,865 INFO L231 Difference]: Finished difference. Result has 192 places, 223 transitions, 710 flow [2025-01-09 21:39:25,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=192, PETRI_TRANSITIONS=223} [2025-01-09 21:39:25,866 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 11 predicate places. [2025-01-09 21:39:25,866 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 223 transitions, 710 flow [2025-01-09 21:39:25,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:25,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:25,866 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] [2025-01-09 21:39:25,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:39:25,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:39:25,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1663397000, now seen corresponding path program 1 times [2025-01-09 21:39:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:25,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768533687] [2025-01-09 21:39:25,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:25,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:39:25,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:39:25,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:25,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:25,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:39:25,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:39:25,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:39:25,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:25,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:25,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:39:25,903 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:39:25,903 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 23 remaining) [2025-01-09 21:39:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:39:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:39:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:39:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 23 remaining) [2025-01-09 21:39:25,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:39:25,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:39:25,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:39:25,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:39:25,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:39:25,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:39:25,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:39:25,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:39:25,905 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:39:25,963 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-01-09 21:39:25,963 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:39:25,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:39:25 BasicIcfg [2025-01-09 21:39:25,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:39:25,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:39:25,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:39:25,972 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:39:25,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:11" (3/4) ... [2025-01-09 21:39:25,974 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:39:26,029 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-01-09 21:39:26,068 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:39:26,068 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:39:26,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:39:26,070 INFO L158 Benchmark]: Toolchain (without parser) took 15805.65ms. Allocated memory was 167.8MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 123.5MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 989.5MB. Max. memory is 16.1GB. [2025-01-09 21:39:26,071 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:39:26,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.53ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 104.1MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:39:26,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.75ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:39:26,072 INFO L158 Benchmark]: Boogie Preprocessor took 22.66ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 101.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:39:26,073 INFO L158 Benchmark]: RCFGBuilder took 407.50ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 83.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:39:26,073 INFO L158 Benchmark]: TraceAbstraction took 14781.01ms. Allocated memory was 167.8MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 83.0MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 939.2MB. Max. memory is 16.1GB. [2025-01-09 21:39:26,073 INFO L158 Benchmark]: Witness Printer took 96.62ms. Allocated memory is still 3.6GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:39:26,074 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.53ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 104.1MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.75ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.66ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 101.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 407.50ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 83.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14781.01ms. Allocated memory was 167.8MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 83.0MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 939.2MB. Max. memory is 16.1GB. * Witness Printer took 96.62ms. Allocated memory is still 3.6GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 712]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = 0; VAL [threads_alive=0] [L686] 0 _Bool keep_alive = 1; VAL [keep_alive=1, threads_alive=0] [L687] 0 pthread_mutex_t keep_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0] [L688] 0 int data = 0; VAL [data=0, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0] [L705] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L706] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0] [L706] RET 0 assume_abort_if_not(threads_total >= 0) [L707] 0 int i = 0; VAL [data=0, data_mutex={2:0}, i=0, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L707] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={2:0}, i=0, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L708] 0 pthread_t tid; VAL [data=0, data_mutex={2:0}, i=0, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L709] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=0, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1, tid=-1] [L707] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L707] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L712] 0 threads_alive != threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L691] 1 threads_alive++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=1] [L712] 0 threads_alive != threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=1, threads_total=1] Now there is a data race on ~threads_alive~0 between C: threads_alive++ [691] and C: threads_alive != threads_total [712] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 177 locations, 17 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 30 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 228 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 63 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=710occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:39:26,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)