./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stack_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/stack_longer-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:35:19,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:35:19,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:35:19,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:35:19,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:35:19,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:35:19,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:35:19,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:35:19,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:35:19,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:35:19,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:35:19,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:35:19,666 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:35:19,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:35:19,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:35:19,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:35:19,668 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:35:19,668 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:35:19,668 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:35:19,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:35:19,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:35:19,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:35:19,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:35:19,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:35:19,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:35:19,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:35:19,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:35:19,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:35:19,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:35:19,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:35:19,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:35:19,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:35:19,669 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2025-03-08 21:35:19,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:35:19,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:35:19,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:35:19,900 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:35:19,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:35:19,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-1.i [2025-03-08 21:35:21,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3a87944/3a7f4f2655f4421c803480306fe427b8/FLAG29e6d1902 [2025-03-08 21:35:21,388 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:35:21,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2025-03-08 21:35:21,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3a87944/3a7f4f2655f4421c803480306fe427b8/FLAG29e6d1902 [2025-03-08 21:35:21,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3a87944/3a7f4f2655f4421c803480306fe427b8 [2025-03-08 21:35:21,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:35:21,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:35:21,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:35:21,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:35:21,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:35:21,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:21,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68001dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21, skipping insertion in model container [2025-03-08 21:35:21,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:21,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:35:21,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:35:21,839 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:35:21,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:35:21,943 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:35:21,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21 WrapperNode [2025-03-08 21:35:21,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:35:21,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:35:21,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:35:21,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:35:21,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:21,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:21,991 INFO L138 Inliner]: procedures = 277, calls = 432, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 588 [2025-03-08 21:35:21,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:35:21,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:35:21,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:35:21,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:35:22,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:22,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:22,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:22,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:22,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:22,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:22,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:22,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:22,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:35:22,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:35:22,045 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:35:22,045 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:35:22,046 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:22,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:35:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:35:22,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:35:22,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:35:22,095 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-08 21:35:22,095 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-08 21:35:22,095 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-08 21:35:22,096 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-08 21:35:22,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:35:22,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:35:22,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:35:22,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:35:22,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:35:22,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:35:22,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:35:22,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:35:22,097 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:35:22,204 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:35:22,206 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:35:22,834 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc pop_#t~mem41#1; [2025-03-08 21:35:22,835 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: havoc pop_#t~ret40#1; [2025-03-08 21:35:22,835 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: pop_#res#1 := 0; [2025-03-08 21:35:22,835 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:35:22,835 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:35:22,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:35:22,866 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:35:22,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:22 BoogieIcfgContainer [2025-03-08 21:35:22,866 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:35:22,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:35:22,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:35:22,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:35:22,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:35:21" (1/3) ... [2025-03-08 21:35:22,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a38529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:35:22, skipping insertion in model container [2025-03-08 21:35:22,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (2/3) ... [2025-03-08 21:35:22,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a38529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:35:22, skipping insertion in model container [2025-03-08 21:35:22,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:22" (3/3) ... [2025-03-08 21:35:22,873 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2025-03-08 21:35:22,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:35:22,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-1.i that has 3 procedures, 606 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-08 21:35:22,886 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:35:22,966 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 21:35:23,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 612 places, 615 transitions, 1244 flow [2025-03-08 21:35:23,202 INFO L124 PetriNetUnfolderBase]: 10/613 cut-off events. [2025-03-08 21:35:23,204 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:35:23,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 613 events. 10/613 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 541 event pairs, 0 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 524. Up to 3 conditions per place. [2025-03-08 21:35:23,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 612 places, 615 transitions, 1244 flow [2025-03-08 21:35:23,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 605 places, 608 transitions, 1225 flow [2025-03-08 21:35:23,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:35:23,236 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;@7d89868f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:35:23,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-08 21:35:23,283 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:35:23,284 INFO L124 PetriNetUnfolderBase]: 0/461 cut-off events. [2025-03-08 21:35:23,284 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:35:23,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:23,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:23,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:23,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2007511788, now seen corresponding path program 1 times [2025-03-08 21:35:23,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:23,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16955084] [2025-03-08 21:35:23,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:23,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:23,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-08 21:35:23,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-08 21:35:23,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:23,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:23,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:23,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16955084] [2025-03-08 21:35:23,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16955084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:23,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:23,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:23,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392628907] [2025-03-08 21:35:23,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:23,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:23,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:23,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:23,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:23,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 615 [2025-03-08 21:35:23,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 608 transitions, 1225 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:23,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:23,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 615 [2025-03-08 21:35:23,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:24,202 INFO L124 PetriNetUnfolderBase]: 73/1363 cut-off events. [2025-03-08 21:35:24,203 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-08 21:35:24,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 1363 events. 73/1363 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5207 event pairs, 10 based on Foata normal form. 40/1283 useless extension candidates. Maximal degree in co-relation 965. Up to 58 conditions per place. [2025-03-08 21:35:24,215 INFO L140 encePairwiseOnDemand]: 606/615 looper letters, 16 selfloop transitions, 3 changer transitions 0/605 dead transitions. [2025-03-08 21:35:24,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 605 transitions, 1260 flow [2025-03-08 21:35:24,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2025-03-08 21:35:24,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9853658536585366 [2025-03-08 21:35:24,235 INFO L175 Difference]: Start difference. First operand has 605 places, 608 transitions, 1225 flow. Second operand 3 states and 1818 transitions. [2025-03-08 21:35:24,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 605 transitions, 1260 flow [2025-03-08 21:35:24,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 605 transitions, 1253 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 21:35:24,255 INFO L231 Difference]: Finished difference. Result has 600 places, 600 transitions, 1224 flow [2025-03-08 21:35:24,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=615, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1224, PETRI_PLACES=600, PETRI_TRANSITIONS=600} [2025-03-08 21:35:24,263 INFO L279 CegarLoopForPetriNet]: 605 programPoint places, -5 predicate places. [2025-03-08 21:35:24,264 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 600 transitions, 1224 flow [2025-03-08 21:35:24,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:24,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:24,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:24,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:35:24,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:24,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash 590352795, now seen corresponding path program 1 times [2025-03-08 21:35:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:24,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318543246] [2025-03-08 21:35:24,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:24,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 21:35:24,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 21:35:24,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:24,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:24,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:24,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318543246] [2025-03-08 21:35:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318543246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:24,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536492272] [2025-03-08 21:35:24,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:24,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:24,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:24,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:24,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:24,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 615 [2025-03-08 21:35:24,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 600 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 581.6666666666666) internal successors, (1745), 3 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:24,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:24,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 615 [2025-03-08 21:35:24,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:25,193 INFO L124 PetriNetUnfolderBase]: 417/4283 cut-off events. [2025-03-08 21:35:25,193 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-03-08 21:35:25,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5189 conditions, 4283 events. 417/4283 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 32825 event pairs, 106 based on Foata normal form. 0/3902 useless extension candidates. Maximal degree in co-relation 4573. Up to 580 conditions per place. [2025-03-08 21:35:25,212 INFO L140 encePairwiseOnDemand]: 595/615 looper letters, 33 selfloop transitions, 14 changer transitions 0/620 dead transitions. [2025-03-08 21:35:25,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 620 transitions, 1361 flow [2025-03-08 21:35:25,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:25,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2025-03-08 21:35:25,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9718157181571816 [2025-03-08 21:35:25,216 INFO L175 Difference]: Start difference. First operand has 600 places, 600 transitions, 1224 flow. Second operand 3 states and 1793 transitions. [2025-03-08 21:35:25,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 620 transitions, 1361 flow [2025-03-08 21:35:25,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 620 transitions, 1355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:25,224 INFO L231 Difference]: Finished difference. Result has 602 places, 614 transitions, 1342 flow [2025-03-08 21:35:25,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=615, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1342, PETRI_PLACES=602, PETRI_TRANSITIONS=614} [2025-03-08 21:35:25,225 INFO L279 CegarLoopForPetriNet]: 605 programPoint places, -3 predicate places. [2025-03-08 21:35:25,225 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 614 transitions, 1342 flow [2025-03-08 21:35:25,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.6666666666666) internal successors, (1745), 3 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:25,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:25,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:25,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:35:25,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1860527282, now seen corresponding path program 1 times [2025-03-08 21:35:25,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:25,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691331332] [2025-03-08 21:35:25,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:25,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:25,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 21:35:25,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 21:35:25,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:25,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:25,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:25,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691331332] [2025-03-08 21:35:25,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691331332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:25,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:25,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:25,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116649175] [2025-03-08 21:35:25,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:25,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:35:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:25,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:35:25,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:35:25,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 615 [2025-03-08 21:35:25,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 614 transitions, 1342 flow. Second operand has 5 states, 5 states have (on average 587.2) internal successors, (2936), 5 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:25,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:25,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 615 [2025-03-08 21:35:25,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:27,069 INFO L124 PetriNetUnfolderBase]: 691/7356 cut-off events. [2025-03-08 21:35:27,070 INFO L125 PetriNetUnfolderBase]: For 262/264 co-relation queries the response was YES. [2025-03-08 21:35:27,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9379 conditions, 7356 events. 691/7356 cut-off events. For 262/264 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 70154 event pairs, 263 based on Foata normal form. 17/6741 useless extension candidates. Maximal degree in co-relation 8719. Up to 697 conditions per place. [2025-03-08 21:35:27,096 INFO L140 encePairwiseOnDemand]: 606/615 looper letters, 55 selfloop transitions, 13 changer transitions 0/660 dead transitions. [2025-03-08 21:35:27,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 660 transitions, 1578 flow [2025-03-08 21:35:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 21:35:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 21:35:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4753 transitions. [2025-03-08 21:35:27,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9660569105691057 [2025-03-08 21:35:27,103 INFO L175 Difference]: Start difference. First operand has 602 places, 614 transitions, 1342 flow. Second operand 8 states and 4753 transitions. [2025-03-08 21:35:27,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 660 transitions, 1578 flow [2025-03-08 21:35:27,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 660 transitions, 1550 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:27,115 INFO L231 Difference]: Finished difference. Result has 613 places, 625 transitions, 1412 flow [2025-03-08 21:35:27,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=615, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1412, PETRI_PLACES=613, PETRI_TRANSITIONS=625} [2025-03-08 21:35:27,117 INFO L279 CegarLoopForPetriNet]: 605 programPoint places, 8 predicate places. [2025-03-08 21:35:27,117 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 625 transitions, 1412 flow [2025-03-08 21:35:27,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 587.2) internal successors, (2936), 5 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:27,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:27,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:27,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:35:27,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:27,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash -8925395, now seen corresponding path program 1 times [2025-03-08 21:35:27,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:27,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308989341] [2025-03-08 21:35:27,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:27,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:27,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-08 21:35:27,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-08 21:35:27,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:27,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:28,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:28,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308989341] [2025-03-08 21:35:28,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308989341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:28,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:28,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:28,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150040148] [2025-03-08 21:35:28,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:28,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:28,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:28,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:28,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 615 [2025-03-08 21:35:28,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 625 transitions, 1412 flow. Second operand has 6 states, 6 states have (on average 584.8333333333334) internal successors, (3509), 6 states have internal predecessors, (3509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:28,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:28,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 615 [2025-03-08 21:35:28,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:29,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 395#L1022-1true, 582#L995-4true, Black: 615#true, Black: 620#true, 611#true, 625#true, 642#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 256#L1013true, Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:29,333 INFO L294 olderBase$Statistics]: this new event has 555 ancestors and is cut-off event [2025-03-08 21:35:29,334 INFO L297 olderBase$Statistics]: existing Event has 516 ancestors and is cut-off event [2025-03-08 21:35:29,334 INFO L297 olderBase$Statistics]: existing Event has 534 ancestors and is cut-off event [2025-03-08 21:35:29,334 INFO L297 olderBase$Statistics]: existing Event has 539 ancestors and is cut-off event [2025-03-08 21:35:29,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 582#L995-4true, Black: 617#(= |#race~flag~0| 0), Black: 620#true, 611#true, 625#true, 642#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 256#L1013true, Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:29,762 INFO L294 olderBase$Statistics]: this new event has 578 ancestors and is cut-off event [2025-03-08 21:35:29,762 INFO L297 olderBase$Statistics]: existing Event has 555 ancestors and is cut-off event [2025-03-08 21:35:29,762 INFO L297 olderBase$Statistics]: existing Event has 579 ancestors and is cut-off event [2025-03-08 21:35:29,762 INFO L297 olderBase$Statistics]: existing Event has 534 ancestors and is cut-off event [2025-03-08 21:35:29,905 INFO L124 PetriNetUnfolderBase]: 918/7315 cut-off events. [2025-03-08 21:35:29,905 INFO L125 PetriNetUnfolderBase]: For 341/351 co-relation queries the response was YES. [2025-03-08 21:35:29,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10186 conditions, 7315 events. 918/7315 cut-off events. For 341/351 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 68292 event pairs, 388 based on Foata normal form. 4/6702 useless extension candidates. Maximal degree in co-relation 9398. Up to 1294 conditions per place. [2025-03-08 21:35:29,943 INFO L140 encePairwiseOnDemand]: 604/615 looper letters, 35 selfloop transitions, 22 changer transitions 0/658 dead transitions. [2025-03-08 21:35:29,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 658 transitions, 1600 flow [2025-03-08 21:35:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3556 transitions. [2025-03-08 21:35:29,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636856368563685 [2025-03-08 21:35:29,948 INFO L175 Difference]: Start difference. First operand has 613 places, 625 transitions, 1412 flow. Second operand 6 states and 3556 transitions. [2025-03-08 21:35:29,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 658 transitions, 1600 flow [2025-03-08 21:35:29,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 658 transitions, 1600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:29,957 INFO L231 Difference]: Finished difference. Result has 623 places, 646 transitions, 1562 flow [2025-03-08 21:35:29,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=615, PETRI_DIFFERENCE_MINUEND_FLOW=1412, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=623, PETRI_TRANSITIONS=646} [2025-03-08 21:35:29,958 INFO L279 CegarLoopForPetriNet]: 605 programPoint places, 18 predicate places. [2025-03-08 21:35:29,958 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 646 transitions, 1562 flow [2025-03-08 21:35:29,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 584.8333333333334) internal successors, (3509), 6 states have internal predecessors, (3509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:29,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:29,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:29,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:35:29,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:29,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1881999478, now seen corresponding path program 1 times [2025-03-08 21:35:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:29,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609025423] [2025-03-08 21:35:29,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:29,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 21:35:30,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 21:35:30,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:30,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:30,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609025423] [2025-03-08 21:35:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609025423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:30,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:30,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314379999] [2025-03-08 21:35:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:30,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:30,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:30,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 615 [2025-03-08 21:35:30,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 646 transitions, 1562 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:30,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:30,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 615 [2025-03-08 21:35:30,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:31,188 INFO L124 PetriNetUnfolderBase]: 822/7369 cut-off events. [2025-03-08 21:35:31,189 INFO L125 PetriNetUnfolderBase]: For 815/894 co-relation queries the response was YES. [2025-03-08 21:35:31,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10859 conditions, 7369 events. 822/7369 cut-off events. For 815/894 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 67575 event pairs, 300 based on Foata normal form. 16/6818 useless extension candidates. Maximal degree in co-relation 10109. Up to 1129 conditions per place. [2025-03-08 21:35:31,224 INFO L140 encePairwiseOnDemand]: 607/615 looper letters, 30 selfloop transitions, 11 changer transitions 0/658 dead transitions. [2025-03-08 21:35:31,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 658 transitions, 1684 flow [2025-03-08 21:35:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1789 transitions. [2025-03-08 21:35:31,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696476964769648 [2025-03-08 21:35:31,231 INFO L175 Difference]: Start difference. First operand has 623 places, 646 transitions, 1562 flow. Second operand 3 states and 1789 transitions. [2025-03-08 21:35:31,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 658 transitions, 1684 flow [2025-03-08 21:35:31,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 658 transitions, 1684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:31,245 INFO L231 Difference]: Finished difference. Result has 627 places, 655 transitions, 1658 flow [2025-03-08 21:35:31,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=615, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1658, PETRI_PLACES=627, PETRI_TRANSITIONS=655} [2025-03-08 21:35:31,248 INFO L279 CegarLoopForPetriNet]: 605 programPoint places, 22 predicate places. [2025-03-08 21:35:31,248 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 655 transitions, 1658 flow [2025-03-08 21:35:31,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:31,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:31,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:31,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:35:31,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:31,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash 528661030, now seen corresponding path program 1 times [2025-03-08 21:35:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:31,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133827979] [2025-03-08 21:35:31,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:31,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-08 21:35:31,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-08 21:35:31,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:31,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:31,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:31,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133827979] [2025-03-08 21:35:31,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133827979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:31,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:31,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:31,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856770197] [2025-03-08 21:35:31,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:31,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:31,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:31,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:31,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 615 [2025-03-08 21:35:31,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 655 transitions, 1658 flow. Second operand has 3 states, 3 states have (on average 595.6666666666666) internal successors, (1787), 3 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:31,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:31,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 615 [2025-03-08 21:35:31,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:32,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 395#L1022-1true, 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 615#true, Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 209#L997-2true, Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 256#L1013true]) [2025-03-08 21:35:32,177 INFO L294 olderBase$Statistics]: this new event has 561 ancestors and is cut-off event [2025-03-08 21:35:32,177 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2025-03-08 21:35:32,177 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2025-03-08 21:35:32,177 INFO L297 olderBase$Statistics]: existing Event has 540 ancestors and is cut-off event [2025-03-08 21:35:32,511 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 615#true, Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 209#L997-2true, Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 256#L1013true]) [2025-03-08 21:35:32,511 INFO L294 olderBase$Statistics]: this new event has 584 ancestors and is cut-off event [2025-03-08 21:35:32,511 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2025-03-08 21:35:32,511 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2025-03-08 21:35:32,511 INFO L297 olderBase$Statistics]: existing Event has 540 ancestors and is cut-off event [2025-03-08 21:35:32,511 INFO L297 olderBase$Statistics]: existing Event has 561 ancestors and is cut-off event [2025-03-08 21:35:32,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 617#(= |#race~flag~0| 0), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, 430#L998true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 256#L1013true]) [2025-03-08 21:35:32,512 INFO L294 olderBase$Statistics]: this new event has 588 ancestors and is cut-off event [2025-03-08 21:35:32,512 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2025-03-08 21:35:32,512 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2025-03-08 21:35:32,512 INFO L297 olderBase$Statistics]: existing Event has 565 ancestors and is cut-off event [2025-03-08 21:35:32,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 617#(= |#race~flag~0| 0), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 25#L998-3true, 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 256#L1013true]) [2025-03-08 21:35:32,512 INFO L294 olderBase$Statistics]: this new event has 587 ancestors and is cut-off event [2025-03-08 21:35:32,512 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is cut-off event [2025-03-08 21:35:32,512 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is cut-off event [2025-03-08 21:35:32,512 INFO L297 olderBase$Statistics]: existing Event has 564 ancestors and is cut-off event [2025-03-08 21:35:32,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][588], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 617#(= |#race~flag~0| 0), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 133#L997-1true, Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 660#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 256#L1013true]) [2025-03-08 21:35:32,514 INFO L294 olderBase$Statistics]: this new event has 586 ancestors and is cut-off event [2025-03-08 21:35:32,514 INFO L297 olderBase$Statistics]: existing Event has 563 ancestors and is cut-off event [2025-03-08 21:35:32,514 INFO L297 olderBase$Statistics]: existing Event has 524 ancestors and is cut-off event [2025-03-08 21:35:32,514 INFO L297 olderBase$Statistics]: existing Event has 524 ancestors and is cut-off event [2025-03-08 21:35:32,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][588], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 161#L997true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 617#(= |#race~flag~0| 0), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 660#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 256#L1013true]) [2025-03-08 21:35:32,514 INFO L294 olderBase$Statistics]: this new event has 585 ancestors and is cut-off event [2025-03-08 21:35:32,514 INFO L297 olderBase$Statistics]: existing Event has 562 ancestors and is cut-off event [2025-03-08 21:35:32,514 INFO L297 olderBase$Statistics]: existing Event has 523 ancestors and is cut-off event [2025-03-08 21:35:32,514 INFO L297 olderBase$Statistics]: existing Event has 523 ancestors and is cut-off event [2025-03-08 21:35:32,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 617#(= |#race~flag~0| 0), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 34#L992true, 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 256#L1013true, Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:32,515 INFO L294 olderBase$Statistics]: this new event has 594 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L297 olderBase$Statistics]: existing Event has 571 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L297 olderBase$Statistics]: existing Event has 532 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L297 olderBase$Statistics]: existing Event has 532 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 617#(= |#race~flag~0| 0), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 25#L998-3true, 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 256#L1013true, Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:32,516 INFO L294 olderBase$Statistics]: this new event has 587 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L297 olderBase$Statistics]: existing Event has 587 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L297 olderBase$Statistics]: existing Event has 564 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 617#(= |#race~flag~0| 0), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 430#L998true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 256#L1013true, Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:32,516 INFO L294 olderBase$Statistics]: this new event has 588 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L297 olderBase$Statistics]: existing Event has 588 ancestors and is cut-off event [2025-03-08 21:35:32,516 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L297 olderBase$Statistics]: existing Event has 565 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][588], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 161#L997true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 617#(= |#race~flag~0| 0), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 660#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 256#L1013true, Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:32,517 INFO L294 olderBase$Statistics]: this new event has 585 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L297 olderBase$Statistics]: existing Event has 562 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L297 olderBase$Statistics]: existing Event has 523 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L297 olderBase$Statistics]: existing Event has 523 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L297 olderBase$Statistics]: existing Event has 585 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][588], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 133#L997-1true, Black: 617#(= |#race~flag~0| 0), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 660#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 256#L1013true, Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:32,517 INFO L294 olderBase$Statistics]: this new event has 586 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L297 olderBase$Statistics]: existing Event has 563 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L297 olderBase$Statistics]: existing Event has 524 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L297 olderBase$Statistics]: existing Event has 586 ancestors and is cut-off event [2025-03-08 21:35:32,517 INFO L297 olderBase$Statistics]: existing Event has 524 ancestors and is cut-off event [2025-03-08 21:35:32,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 395#L1022-1true, 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 617#(= |#race~flag~0| 0), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 209#L997-2true, Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 256#L1013true]) [2025-03-08 21:35:32,524 INFO L294 olderBase$Statistics]: this new event has 585 ancestors and is cut-off event [2025-03-08 21:35:32,524 INFO L297 olderBase$Statistics]: existing Event has 561 ancestors and is cut-off event [2025-03-08 21:35:32,524 INFO L297 olderBase$Statistics]: existing Event has 540 ancestors and is cut-off event [2025-03-08 21:35:32,524 INFO L297 olderBase$Statistics]: existing Event has 584 ancestors and is cut-off event [2025-03-08 21:35:32,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 617#(= |#race~flag~0| 0), 173#L1024true, Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 256#L1013true]) [2025-03-08 21:35:32,526 INFO L294 olderBase$Statistics]: this new event has 598 ancestors and is cut-off event [2025-03-08 21:35:32,526 INFO L297 olderBase$Statistics]: existing Event has 536 ancestors and is cut-off event [2025-03-08 21:35:32,527 INFO L297 olderBase$Statistics]: existing Event has 575 ancestors and is cut-off event [2025-03-08 21:35:32,527 INFO L297 olderBase$Statistics]: existing Event has 536 ancestors and is cut-off event [2025-03-08 21:35:32,572 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 617#(= |#race~flag~0| 0), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 34#L992true, 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 256#L1013true]) [2025-03-08 21:35:32,573 INFO L294 olderBase$Statistics]: this new event has 594 ancestors and is cut-off event [2025-03-08 21:35:32,573 INFO L297 olderBase$Statistics]: existing Event has 571 ancestors and is cut-off event [2025-03-08 21:35:32,573 INFO L297 olderBase$Statistics]: existing Event has 532 ancestors and is cut-off event [2025-03-08 21:35:32,573 INFO L297 olderBase$Statistics]: existing Event has 532 ancestors and is cut-off event [2025-03-08 21:35:32,573 INFO L297 olderBase$Statistics]: existing Event has 594 ancestors and is cut-off event [2025-03-08 21:35:32,581 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 395#L1022-1true, 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 617#(= |#race~flag~0| 0), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 209#L997-2true, Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 256#L1013true, Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:32,581 INFO L294 olderBase$Statistics]: this new event has 585 ancestors and is cut-off event [2025-03-08 21:35:32,581 INFO L297 olderBase$Statistics]: existing Event has 561 ancestors and is cut-off event [2025-03-08 21:35:32,581 INFO L297 olderBase$Statistics]: existing Event has 585 ancestors and is cut-off event [2025-03-08 21:35:32,581 INFO L297 olderBase$Statistics]: existing Event has 540 ancestors and is cut-off event [2025-03-08 21:35:32,581 INFO L297 olderBase$Statistics]: existing Event has 584 ancestors and is cut-off event [2025-03-08 21:35:32,648 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1362] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][468], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 617#(= |#race~flag~0| 0), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 173#L1024true, Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 256#L1013true]) [2025-03-08 21:35:32,648 INFO L294 olderBase$Statistics]: this new event has 598 ancestors and is cut-off event [2025-03-08 21:35:32,648 INFO L297 olderBase$Statistics]: existing Event has 598 ancestors and is cut-off event [2025-03-08 21:35:32,649 INFO L297 olderBase$Statistics]: existing Event has 536 ancestors and is cut-off event [2025-03-08 21:35:32,649 INFO L297 olderBase$Statistics]: existing Event has 575 ancestors and is cut-off event [2025-03-08 21:35:32,649 INFO L297 olderBase$Statistics]: existing Event has 536 ancestors and is cut-off event [2025-03-08 21:35:32,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L960-2-->L960-1: Formula: (= |v_#race~top~0_1| 0) InVars {} OutVars{#race~top~0=|v_#race~top~0_1|} AuxVars[] AssignedVars[#race~top~0][511], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 617#(= |#race~flag~0| 0), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 297#L952-2true, 15#L960-1true, 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:32,721 INFO L294 olderBase$Statistics]: this new event has 591 ancestors and is cut-off event [2025-03-08 21:35:32,721 INFO L297 olderBase$Statistics]: existing Event has 591 ancestors and is cut-off event [2025-03-08 21:35:32,721 INFO L297 olderBase$Statistics]: existing Event has 552 ancestors and is cut-off event [2025-03-08 21:35:32,721 INFO L297 olderBase$Statistics]: existing Event has 552 ancestors and is cut-off event [2025-03-08 21:35:32,787 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1282] L960-2-->L960-1: Formula: (= |v_#race~top~0_1| 0) InVars {} OutVars{#race~top~0=|v_#race~top~0_1|} AuxVars[] AssignedVars[#race~top~0][511], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 617#(= |#race~flag~0| 0), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 297#L952-2true, 15#L960-1true, 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:32,787 INFO L294 olderBase$Statistics]: this new event has 591 ancestors and is cut-off event [2025-03-08 21:35:32,787 INFO L297 olderBase$Statistics]: existing Event has 591 ancestors and is cut-off event [2025-03-08 21:35:32,787 INFO L297 olderBase$Statistics]: existing Event has 552 ancestors and is cut-off event [2025-03-08 21:35:32,787 INFO L297 olderBase$Statistics]: existing Event has 591 ancestors and is cut-off event [2025-03-08 21:35:32,787 INFO L297 olderBase$Statistics]: existing Event has 552 ancestors and is cut-off event [2025-03-08 21:35:32,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L960-2-->L960-1: Formula: (= |v_#race~top~0_1| 0) InVars {} OutVars{#race~top~0=|v_#race~top~0_1|} AuxVars[] AssignedVars[#race~top~0][511], [Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 395#L1022-1true, Black: 635#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 658#true, Black: 645#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 647#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 617#(= |#race~flag~0| 0), Black: 644#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 646#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 410#L952-1true, Black: 620#true, Black: 655#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 15#L960-1true, 611#true, 625#true, 642#true, 653#true, Black: 627#(= ~top~0 0), Black: 633#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 628#(= |t2Thread1of1ForFork0_get_top_#res#1| 0)]) [2025-03-08 21:35:32,787 INFO L294 olderBase$Statistics]: this new event has 590 ancestors and is cut-off event [2025-03-08 21:35:32,787 INFO L297 olderBase$Statistics]: existing Event has 551 ancestors and is cut-off event [2025-03-08 21:35:32,787 INFO L297 olderBase$Statistics]: existing Event has 590 ancestors and is cut-off event [2025-03-08 21:35:32,787 INFO L297 olderBase$Statistics]: existing Event has 590 ancestors and is cut-off event [2025-03-08 21:35:32,873 INFO L124 PetriNetUnfolderBase]: 814/7679 cut-off events. [2025-03-08 21:35:32,873 INFO L125 PetriNetUnfolderBase]: For 995/1023 co-relation queries the response was YES. [2025-03-08 21:35:32,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11461 conditions, 7679 events. 814/7679 cut-off events. For 995/1023 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 70987 event pairs, 220 based on Foata normal form. 11/7152 useless extension candidates. Maximal degree in co-relation 10732. Up to 684 conditions per place. [2025-03-08 21:35:32,936 INFO L140 encePairwiseOnDemand]: 610/615 looper letters, 16 selfloop transitions, 6 changer transitions 0/662 dead transitions. [2025-03-08 21:35:32,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 662 transitions, 1722 flow [2025-03-08 21:35:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2025-03-08 21:35:32,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9766937669376694 [2025-03-08 21:35:32,939 INFO L175 Difference]: Start difference. First operand has 627 places, 655 transitions, 1658 flow. Second operand 3 states and 1802 transitions. [2025-03-08 21:35:32,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 662 transitions, 1722 flow [2025-03-08 21:35:32,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 662 transitions, 1700 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:32,955 INFO L231 Difference]: Finished difference. Result has 629 places, 659 transitions, 1682 flow [2025-03-08 21:35:32,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=615, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1682, PETRI_PLACES=629, PETRI_TRANSITIONS=659} [2025-03-08 21:35:32,956 INFO L279 CegarLoopForPetriNet]: 605 programPoint places, 24 predicate places. [2025-03-08 21:35:32,956 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 659 transitions, 1682 flow [2025-03-08 21:35:32,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.6666666666666) internal successors, (1787), 3 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:32,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:32,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:32,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:35:32,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:32,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash 972986447, now seen corresponding path program 1 times [2025-03-08 21:35:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045507560] [2025-03-08 21:35:32,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:32,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:32,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 21:35:32,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 21:35:32,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:32,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045507560] [2025-03-08 21:35:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045507560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:33,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:33,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:35:33,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085957798] [2025-03-08 21:35:33,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:33,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:33,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:33,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:33,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:33,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 615 [2025-03-08 21:35:33,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 659 transitions, 1682 flow. Second operand has 3 states, 3 states have (on average 600.0) internal successors, (1800), 3 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:33,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:33,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 615 [2025-03-08 21:35:33,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:33,403 INFO L124 PetriNetUnfolderBase]: 64/1698 cut-off events. [2025-03-08 21:35:33,404 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2025-03-08 21:35:33,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 1698 events. 64/1698 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6951 event pairs, 9 based on Foata normal form. 24/1654 useless extension candidates. Maximal degree in co-relation 2176. Up to 86 conditions per place. [2025-03-08 21:35:33,410 INFO L140 encePairwiseOnDemand]: 611/615 looper letters, 7 selfloop transitions, 4 changer transitions 0/601 dead transitions. [2025-03-08 21:35:33,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 601 transitions, 1401 flow [2025-03-08 21:35:33,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1807 transitions. [2025-03-08 21:35:33,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9794037940379404 [2025-03-08 21:35:33,413 INFO L175 Difference]: Start difference. First operand has 629 places, 659 transitions, 1682 flow. Second operand 3 states and 1807 transitions. [2025-03-08 21:35:33,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 601 transitions, 1401 flow [2025-03-08 21:35:33,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 601 transitions, 1311 flow, removed 27 selfloop flow, removed 17 redundant places. [2025-03-08 21:35:33,421 INFO L231 Difference]: Finished difference. Result has 603 places, 599 transitions, 1290 flow [2025-03-08 21:35:33,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=615, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=603, PETRI_TRANSITIONS=599} [2025-03-08 21:35:33,423 INFO L279 CegarLoopForPetriNet]: 605 programPoint places, -2 predicate places. [2025-03-08 21:35:33,423 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 599 transitions, 1290 flow [2025-03-08 21:35:33,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 600.0) internal successors, (1800), 3 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:33,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:33,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:33,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:35:33,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:33,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1900164075, now seen corresponding path program 1 times [2025-03-08 21:35:33,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:33,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833139859] [2025-03-08 21:35:33,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:33,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:33,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-08 21:35:33,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-08 21:35:33,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:33,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:33,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:33,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:33,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833139859] [2025-03-08 21:35:33,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833139859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:33,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:33,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:33,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652350405] [2025-03-08 21:35:33,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:33,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:33,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:33,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:33,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 615 [2025-03-08 21:35:33,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 599 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:33,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:33,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 615 [2025-03-08 21:35:33,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:33,725 INFO L124 PetriNetUnfolderBase]: 79/1672 cut-off events. [2025-03-08 21:35:33,725 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2025-03-08 21:35:33,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2085 conditions, 1672 events. 79/1672 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6956 event pairs, 38 based on Foata normal form. 0/1604 useless extension candidates. Maximal degree in co-relation 1466. Up to 171 conditions per place. [2025-03-08 21:35:33,730 INFO L140 encePairwiseOnDemand]: 612/615 looper letters, 21 selfloop transitions, 2 changer transitions 0/599 dead transitions. [2025-03-08 21:35:33,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 599 transitions, 1337 flow [2025-03-08 21:35:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2025-03-08 21:35:33,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.964769647696477 [2025-03-08 21:35:33,733 INFO L175 Difference]: Start difference. First operand has 603 places, 599 transitions, 1290 flow. Second operand 3 states and 1780 transitions. [2025-03-08 21:35:33,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 599 transitions, 1337 flow [2025-03-08 21:35:33,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 599 transitions, 1333 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:33,740 INFO L231 Difference]: Finished difference. Result has 603 places, 598 transitions, 1288 flow [2025-03-08 21:35:33,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=615, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=603, PETRI_TRANSITIONS=598} [2025-03-08 21:35:33,741 INFO L279 CegarLoopForPetriNet]: 605 programPoint places, -2 predicate places. [2025-03-08 21:35:33,741 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 598 transitions, 1288 flow [2025-03-08 21:35:33,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:33,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:33,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:33,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:35:33,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:33,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1061459136, now seen corresponding path program 1 times [2025-03-08 21:35:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:33,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403796168] [2025-03-08 21:35:33,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:33,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-08 21:35:33,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-08 21:35:33,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:33,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403796168] [2025-03-08 21:35:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403796168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:34,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:34,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:34,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659023789] [2025-03-08 21:35:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:34,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:34,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:34,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:34,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 615 [2025-03-08 21:35:34,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 598 transitions, 1288 flow. Second operand has 6 states, 6 states have (on average 587.8333333333334) internal successors, (3527), 6 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:34,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:34,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 615 [2025-03-08 21:35:34,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:34,920 INFO L124 PetriNetUnfolderBase]: 92/1722 cut-off events. [2025-03-08 21:35:34,920 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-08 21:35:34,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 1722 events. 92/1722 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7484 event pairs, 47 based on Foata normal form. 0/1654 useless extension candidates. Maximal degree in co-relation 2053. Up to 190 conditions per place. [2025-03-08 21:35:34,925 INFO L140 encePairwiseOnDemand]: 609/615 looper letters, 0 selfloop transitions, 0 changer transitions 601/601 dead transitions. [2025-03-08 21:35:34,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 601 transitions, 1348 flow [2025-03-08 21:35:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3536 transitions. [2025-03-08 21:35:34,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9582655826558265 [2025-03-08 21:35:34,929 INFO L175 Difference]: Start difference. First operand has 603 places, 598 transitions, 1288 flow. Second operand 6 states and 3536 transitions. [2025-03-08 21:35:34,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 601 transitions, 1348 flow [2025-03-08 21:35:34,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 601 transitions, 1344 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:34,935 INFO L231 Difference]: Finished difference. Result has 605 places, 0 transitions, 0 flow [2025-03-08 21:35:34,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=615, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=605, PETRI_TRANSITIONS=0} [2025-03-08 21:35:34,935 INFO L279 CegarLoopForPetriNet]: 605 programPoint places, 0 predicate places. [2025-03-08 21:35:34,936 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 0 transitions, 0 flow [2025-03-08 21:35:34,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 587.8333333333334) internal successors, (3527), 6 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:34,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2025-03-08 21:35:34,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-03-08 21:35:34,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-03-08 21:35:34,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:35:34,941 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:34,944 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:35:34,944 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:35:34,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:35:34 BasicIcfg [2025-03-08 21:35:34,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:35:34,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:35:34,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:35:34,949 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:35:34,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:22" (3/4) ... [2025-03-08 21:35:34,950 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 21:35:34,952 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-08 21:35:34,953 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-08 21:35:34,958 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 21:35:34,958 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 21:35:34,959 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 21:35:34,959 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 21:35:35,043 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:35:35,043 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:35:35,043 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:35:35,044 INFO L158 Benchmark]: Toolchain (without parser) took 13619.29ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 120.6MB in the beginning and 562.0MB in the end (delta: -441.4MB). Peak memory consumption was 842.8MB. Max. memory is 16.1GB. [2025-03-08 21:35:35,044 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:35:35,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.78ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 87.1MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 21:35:35,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.49ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 81.1MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:35:35,045 INFO L158 Benchmark]: Boogie Preprocessor took 45.38ms. Allocated memory is still 167.8MB. Free memory was 81.1MB in the beginning and 77.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:35:35,046 INFO L158 Benchmark]: IcfgBuilder took 824.74ms. Allocated memory is still 167.8MB. Free memory was 77.4MB in the beginning and 110.6MB in the end (delta: -33.2MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2025-03-08 21:35:35,046 INFO L158 Benchmark]: TraceAbstraction took 12080.29ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 110.6MB in the beginning and 570.4MB in the end (delta: -459.8MB). Peak memory consumption was 825.2MB. Max. memory is 16.1GB. [2025-03-08 21:35:35,046 INFO L158 Benchmark]: Witness Printer took 94.37ms. Allocated memory is still 1.5GB. Free memory was 570.4MB in the beginning and 562.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:35:35,048 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.25ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.78ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 87.1MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.49ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 81.1MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.38ms. Allocated memory is still 167.8MB. Free memory was 81.1MB in the beginning and 77.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 824.74ms. Allocated memory is still 167.8MB. Free memory was 77.4MB in the beginning and 110.6MB in the end (delta: -33.2MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12080.29ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 110.6MB in the beginning and 570.4MB in the end (delta: -459.8MB). Peak memory consumption was 825.2MB. Max. memory is 16.1GB. * Witness Printer took 94.37ms. Allocated memory is still 1.5GB. Free memory was 570.4MB in the beginning and 562.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 960]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 952]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 997]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 967]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 944]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 944]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1008]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 952]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 948]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 948]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 952]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 982]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 773 locations, 792 edges, 26 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.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 356 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 616 IncrementalHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 87 mSDtfsCounter, 616 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1682occurred in iteration=6, InterpolantAutomatonStates: 38, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 4329 NumberOfCodeBlocks, 4329 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 4320 ConstructedInterpolants, 0 QuantifiedInterpolants, 5546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 21:35:35,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE