./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 10:42:21,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:42:21,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:42:21,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:42:21,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:42:21,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:42:21,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:42:21,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:42:21,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:42:21,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:42:21,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:42:21,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:42:21,676 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:42:21,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:42:21,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:42:21,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:42:21,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:42:21,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:42:21,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:42:21,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:42:21,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:42:21,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:42:21,678 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:42:21,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:42:21,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:42:21,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:42:21,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:42:21,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:42:21,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:42:21,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:42:21,679 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-17 10:42:21,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:42:21,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:42:21,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:42:21,892 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:42:21,892 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:42:21,893 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-17 10:42:23,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48dff4ba2/f70cc87f354547afb6174c398914a036/FLAG04684bd7e [2025-03-17 10:42:23,270 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:42:23,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2025-03-17 10:42:23,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48dff4ba2/f70cc87f354547afb6174c398914a036/FLAG04684bd7e [2025-03-17 10:42:23,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48dff4ba2/f70cc87f354547afb6174c398914a036 [2025-03-17 10:42:23,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:42:23,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:42:23,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:42:23,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:42:23,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:42:23,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:42:23" (1/1) ... [2025-03-17 10:42:23,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@324e0482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:23, skipping insertion in model container [2025-03-17 10:42:23,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:42:23" (1/1) ... [2025-03-17 10:42:23,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:42:23,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:42:23,961 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:42:24,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:42:24,065 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:42:24,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24 WrapperNode [2025-03-17 10:42:24,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:42:24,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:42:24,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:42:24,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:42:24,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,084 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,117 INFO L138 Inliner]: procedures = 277, calls = 432, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 588 [2025-03-17 10:42:24,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:42:24,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:42:24,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:42:24,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:42:24,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,148 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:42:24,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:42:24,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:42:24,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:42:24,156 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (1/1) ... [2025-03-17 10:42:24,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:42:24,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:42:24,181 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-17 10:42:24,185 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-17 10:42:24,202 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 10:42:24,202 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 10:42:24,202 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 10:42:24,202 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 10:42:24,202 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:42:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:42:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:42:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:42:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:42:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:42:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:42:24,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:42:24,205 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:42:24,304 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:42:24,305 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:42:24,904 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc pop_#t~mem41#1; [2025-03-17 10:42:24,905 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: havoc pop_#t~ret40#1; [2025-03-17 10:42:24,905 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: pop_#res#1 := 0; [2025-03-17 10:42:24,906 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:42:24,906 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:42:24,930 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:42:24,931 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:42:24,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:24 BoogieIcfgContainer [2025-03-17 10:42:24,931 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:42:24,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:42:24,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:42:24,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:42:24,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:42:23" (1/3) ... [2025-03-17 10:42:24,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bce2fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:42:24, skipping insertion in model container [2025-03-17 10:42:24,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:24" (2/3) ... [2025-03-17 10:42:24,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bce2fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:42:24, skipping insertion in model container [2025-03-17 10:42:24,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:24" (3/3) ... [2025-03-17 10:42:24,940 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2025-03-17 10:42:24,952 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:42:24,954 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-1.i that has 3 procedures, 604 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-17 10:42:24,954 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:42:25,051 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 10:42:25,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 610 places, 613 transitions, 1240 flow [2025-03-17 10:42:25,279 INFO L124 PetriNetUnfolderBase]: 10/611 cut-off events. [2025-03-17 10:42:25,281 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:42:25,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 611 events. 10/611 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 529 event pairs, 0 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 523. Up to 3 conditions per place. [2025-03-17 10:42:25,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 610 places, 613 transitions, 1240 flow [2025-03-17 10:42:25,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 603 places, 606 transitions, 1221 flow [2025-03-17 10:42:25,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:42:25,324 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;@3e0670fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:42:25,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-17 10:42:25,403 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:42:25,403 INFO L124 PetriNetUnfolderBase]: 0/461 cut-off events. [2025-03-17 10:42:25,403 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:42:25,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:25,408 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-17 10:42:25,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-17 10:42:25,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash 268981861, now seen corresponding path program 1 times [2025-03-17 10:42:25,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:25,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459473694] [2025-03-17 10:42:25,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:25,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 10:42:25,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 10:42:25,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:25,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:25,914 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-17 10:42:25,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459473694] [2025-03-17 10:42:25,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459473694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:25,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434116368] [2025-03-17 10:42:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:25,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:25,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:25,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:25,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 613 [2025-03-17 10:42:25,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 606 transitions, 1221 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-17 10:42:25,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:25,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 613 [2025-03-17 10:42:25,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:26,267 INFO L124 PetriNetUnfolderBase]: 59/1225 cut-off events. [2025-03-17 10:42:26,267 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-17 10:42:26,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 1225 events. 59/1225 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4206 event pairs, 10 based on Foata normal form. 37/1160 useless extension candidates. Maximal degree in co-relation 791. Up to 54 conditions per place. [2025-03-17 10:42:26,286 INFO L140 encePairwiseOnDemand]: 604/613 looper letters, 16 selfloop transitions, 3 changer transitions 0/605 dead transitions. [2025-03-17 10:42:26,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 605 transitions, 1260 flow [2025-03-17 10:42:26,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1812 transitions. [2025-03-17 10:42:26,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9853181076672104 [2025-03-17 10:42:26,307 INFO L175 Difference]: Start difference. First operand has 603 places, 606 transitions, 1221 flow. Second operand 3 states and 1812 transitions. [2025-03-17 10:42:26,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 605 transitions, 1260 flow [2025-03-17 10:42:26,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 605 transitions, 1253 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 10:42:26,332 INFO L231 Difference]: Finished difference. Result has 600 places, 600 transitions, 1224 flow [2025-03-17 10:42:26,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=613, 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-17 10:42:26,338 INFO L279 CegarLoopForPetriNet]: 603 programPoint places, -3 predicate places. [2025-03-17 10:42:26,339 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 600 transitions, 1224 flow [2025-03-17 10:42:26,340 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-17 10:42:26,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:26,341 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-17 10:42:26,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:42:26,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-17 10:42:26,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:26,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1275607956, now seen corresponding path program 1 times [2025-03-17 10:42:26,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:26,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389824998] [2025-03-17 10:42:26,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:26,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:26,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-17 10:42:26,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-17 10:42:26,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:26,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:26,605 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-17 10:42:26,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:26,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389824998] [2025-03-17 10:42:26,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389824998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:26,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:26,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:26,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602079256] [2025-03-17 10:42:26,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:26,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:26,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:26,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:26,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:26,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 578 out of 613 [2025-03-17 10:42:26,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 600 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 579.6666666666666) internal successors, (1739), 3 states have internal predecessors, (1739), 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-17 10:42:26,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:26,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 578 of 613 [2025-03-17 10:42:26,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:27,237 INFO L124 PetriNetUnfolderBase]: 414/4154 cut-off events. [2025-03-17 10:42:27,238 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-17 10:42:27,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 4154 events. 414/4154 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 31598 event pairs, 106 based on Foata normal form. 0/3788 useless extension candidates. Maximal degree in co-relation 3845. Up to 583 conditions per place. [2025-03-17 10:42:27,260 INFO L140 encePairwiseOnDemand]: 593/613 looper letters, 33 selfloop transitions, 14 changer transitions 0/620 dead transitions. [2025-03-17 10:42:27,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 620 transitions, 1361 flow [2025-03-17 10:42:27,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1787 transitions. [2025-03-17 10:42:27,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717237629146275 [2025-03-17 10:42:27,266 INFO L175 Difference]: Start difference. First operand has 600 places, 600 transitions, 1224 flow. Second operand 3 states and 1787 transitions. [2025-03-17 10:42:27,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 620 transitions, 1361 flow [2025-03-17 10:42:27,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 620 transitions, 1355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:42:27,277 INFO L231 Difference]: Finished difference. Result has 602 places, 614 transitions, 1342 flow [2025-03-17 10:42:27,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=613, 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-17 10:42:27,279 INFO L279 CegarLoopForPetriNet]: 603 programPoint places, -1 predicate places. [2025-03-17 10:42:27,279 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 614 transitions, 1342 flow [2025-03-17 10:42:27,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 579.6666666666666) internal successors, (1739), 3 states have internal predecessors, (1739), 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-17 10:42:27,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:27,280 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-17 10:42:27,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:42:27,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-17 10:42:27,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:27,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1919294026, now seen corresponding path program 1 times [2025-03-17 10:42:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:27,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655676475] [2025-03-17 10:42:27,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:27,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-17 10:42:27,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-17 10:42:27,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:27,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:27,873 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-17 10:42:27,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:27,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655676475] [2025-03-17 10:42:27,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655676475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:27,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:27,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:27,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662382614] [2025-03-17 10:42:27,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:27,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:42:27,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:27,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:42:27,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:42:27,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 613 [2025-03-17 10:42:27,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 614 transitions, 1342 flow. Second operand has 5 states, 5 states have (on average 585.2) internal successors, (2926), 5 states have internal predecessors, (2926), 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-17 10:42:27,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:27,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 613 [2025-03-17 10:42:27,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:29,115 INFO L124 PetriNetUnfolderBase]: 694/7074 cut-off events. [2025-03-17 10:42:29,116 INFO L125 PetriNetUnfolderBase]: For 257/259 co-relation queries the response was YES. [2025-03-17 10:42:29,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9049 conditions, 7074 events. 694/7074 cut-off events. For 257/259 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 67885 event pairs, 261 based on Foata normal form. 11/6454 useless extension candidates. Maximal degree in co-relation 8212. Up to 691 conditions per place. [2025-03-17 10:42:29,146 INFO L140 encePairwiseOnDemand]: 604/613 looper letters, 55 selfloop transitions, 13 changer transitions 0/660 dead transitions. [2025-03-17 10:42:29,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 660 transitions, 1578 flow [2025-03-17 10:42:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 10:42:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 10:42:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4737 transitions. [2025-03-17 10:42:29,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659461663947798 [2025-03-17 10:42:29,153 INFO L175 Difference]: Start difference. First operand has 602 places, 614 transitions, 1342 flow. Second operand 8 states and 4737 transitions. [2025-03-17 10:42:29,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 660 transitions, 1578 flow [2025-03-17 10:42:29,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 660 transitions, 1550 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:42:29,164 INFO L231 Difference]: Finished difference. Result has 613 places, 625 transitions, 1412 flow [2025-03-17 10:42:29,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=613, 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-17 10:42:29,165 INFO L279 CegarLoopForPetriNet]: 603 programPoint places, 10 predicate places. [2025-03-17 10:42:29,165 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 625 transitions, 1412 flow [2025-03-17 10:42:29,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 585.2) internal successors, (2926), 5 states have internal predecessors, (2926), 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-17 10:42:29,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:29,167 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-17 10:42:29,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:42:29,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-17 10:42:29,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -351846133, now seen corresponding path program 1 times [2025-03-17 10:42:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:29,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534127781] [2025-03-17 10:42:29,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:29,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:29,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-17 10:42:29,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-17 10:42:29,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:29,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:30,594 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-17 10:42:30,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:30,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534127781] [2025-03-17 10:42:30,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534127781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:30,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:30,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:30,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856047660] [2025-03-17 10:42:30,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:30,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:42:30,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:30,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:42:30,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:42:30,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 613 [2025-03-17 10:42:30,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 625 transitions, 1412 flow. Second operand has 6 states, 6 states have (on average 582.8333333333334) internal successors, (3497), 6 states have internal predecessors, (3497), 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-17 10:42:30,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:30,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 613 [2025-03-17 10:42:30,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:31,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1351] 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][469], [623#true, 640#true, Black: 613#true, 394#L1022-1true, Black: 618#true, 609#true, 255#L1013true, 581#L995-4true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:31,290 INFO L294 olderBase$Statistics]: this new event has 555 ancestors and is cut-off event [2025-03-17 10:42:31,290 INFO L297 olderBase$Statistics]: existing Event has 534 ancestors and is cut-off event [2025-03-17 10:42:31,290 INFO L297 olderBase$Statistics]: existing Event has 516 ancestors and is cut-off event [2025-03-17 10:42:31,290 INFO L297 olderBase$Statistics]: existing Event has 539 ancestors and is cut-off event [2025-03-17 10:42:31,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1351] 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][469], [623#true, 640#true, Black: 615#(= |#race~flag~0| 0), 394#L1022-1true, Black: 618#true, 609#true, 255#L1013true, 581#L995-4true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:31,793 INFO L294 olderBase$Statistics]: this new event has 578 ancestors and is cut-off event [2025-03-17 10:42:31,793 INFO L297 olderBase$Statistics]: existing Event has 534 ancestors and is cut-off event [2025-03-17 10:42:31,793 INFO L297 olderBase$Statistics]: existing Event has 579 ancestors and is cut-off event [2025-03-17 10:42:31,793 INFO L297 olderBase$Statistics]: existing Event has 555 ancestors and is cut-off event [2025-03-17 10:42:31,942 INFO L124 PetriNetUnfolderBase]: 922/7343 cut-off events. [2025-03-17 10:42:31,943 INFO L125 PetriNetUnfolderBase]: For 344/355 co-relation queries the response was YES. [2025-03-17 10:42:31,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10237 conditions, 7343 events. 922/7343 cut-off events. For 344/355 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 68495 event pairs, 387 based on Foata normal form. 3/6717 useless extension candidates. Maximal degree in co-relation 9201. Up to 1293 conditions per place. [2025-03-17 10:42:31,984 INFO L140 encePairwiseOnDemand]: 602/613 looper letters, 35 selfloop transitions, 22 changer transitions 0/658 dead transitions. [2025-03-17 10:42:31,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 658 transitions, 1600 flow [2025-03-17 10:42:31,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:42:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:42:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3544 transitions. [2025-03-17 10:42:31,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635671560630777 [2025-03-17 10:42:31,989 INFO L175 Difference]: Start difference. First operand has 613 places, 625 transitions, 1412 flow. Second operand 6 states and 3544 transitions. [2025-03-17 10:42:31,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 658 transitions, 1600 flow [2025-03-17 10:42:31,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 658 transitions, 1600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:42:32,002 INFO L231 Difference]: Finished difference. Result has 623 places, 646 transitions, 1562 flow [2025-03-17 10:42:32,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=613, 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-17 10:42:32,003 INFO L279 CegarLoopForPetriNet]: 603 programPoint places, 20 predicate places. [2025-03-17 10:42:32,003 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 646 transitions, 1562 flow [2025-03-17 10:42:32,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 582.8333333333334) internal successors, (3497), 6 states have internal predecessors, (3497), 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-17 10:42:32,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:32,006 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-17 10:42:32,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:42:32,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-17 10:42:32,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash -668555788, now seen corresponding path program 1 times [2025-03-17 10:42:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442294316] [2025-03-17 10:42:32,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:32,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:32,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-17 10:42:32,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-17 10:42:32,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:32,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:32,148 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-17 10:42:32,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:32,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442294316] [2025-03-17 10:42:32,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442294316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:32,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:32,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:32,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816992561] [2025-03-17 10:42:32,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:32,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:32,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:32,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:32,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:32,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 613 [2025-03-17 10:42:32,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 646 transitions, 1562 flow. Second operand has 3 states, 3 states have (on average 587.0) internal successors, (1761), 3 states have internal predecessors, (1761), 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-17 10:42:32,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:32,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 613 [2025-03-17 10:42:32,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:33,307 INFO L124 PetriNetUnfolderBase]: 821/7273 cut-off events. [2025-03-17 10:42:33,308 INFO L125 PetriNetUnfolderBase]: For 822/916 co-relation queries the response was YES. [2025-03-17 10:42:33,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10716 conditions, 7273 events. 821/7273 cut-off events. For 822/916 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 66469 event pairs, 300 based on Foata normal form. 18/6719 useless extension candidates. Maximal degree in co-relation 6307. Up to 1120 conditions per place. [2025-03-17 10:42:33,350 INFO L140 encePairwiseOnDemand]: 605/613 looper letters, 30 selfloop transitions, 11 changer transitions 0/658 dead transitions. [2025-03-17 10:42:33,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 658 transitions, 1684 flow [2025-03-17 10:42:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-03-17 10:42:33,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695486677542142 [2025-03-17 10:42:33,356 INFO L175 Difference]: Start difference. First operand has 623 places, 646 transitions, 1562 flow. Second operand 3 states and 1783 transitions. [2025-03-17 10:42:33,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 658 transitions, 1684 flow [2025-03-17 10:42:33,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 658 transitions, 1684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:42:33,369 INFO L231 Difference]: Finished difference. Result has 627 places, 655 transitions, 1658 flow [2025-03-17 10:42:33,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=613, 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-17 10:42:33,372 INFO L279 CegarLoopForPetriNet]: 603 programPoint places, 24 predicate places. [2025-03-17 10:42:33,372 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 655 transitions, 1658 flow [2025-03-17 10:42:33,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 587.0) internal successors, (1761), 3 states have internal predecessors, (1761), 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-17 10:42:33,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:33,374 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-17 10:42:33,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:42:33,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-17 10:42:33,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash 877543972, now seen corresponding path program 1 times [2025-03-17 10:42:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:33,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712611403] [2025-03-17 10:42:33,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:33,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:33,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-17 10:42:33,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-17 10:42:33,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:33,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:33,481 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-17 10:42:33,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:33,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712611403] [2025-03-17 10:42:33,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712611403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:33,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:33,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:33,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258202853] [2025-03-17 10:42:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:33,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:33,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:33,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:33,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:33,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 613 [2025-03-17 10:42:33,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 655 transitions, 1658 flow. Second operand has 3 states, 3 states have (on average 593.6666666666666) internal successors, (1781), 3 states have internal predecessors, (1781), 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-17 10:42:33,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:33,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 613 [2025-03-17 10:42:33,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:34,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1351] 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][589], [623#true, 132#L997-1true, 658#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), Black: 645#(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|)), 640#true, Black: 642#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 651#true, Black: 615#(= |#race~flag~0| 0), 394#L1022-1true, Black: 644#(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: 643#(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: 618#true, Black: 653#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 609#true, 255#L1013true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:34,354 INFO L294 olderBase$Statistics]: this new event has 586 ancestors and is cut-off event [2025-03-17 10:42:34,354 INFO L297 olderBase$Statistics]: existing Event has 524 ancestors and is cut-off event [2025-03-17 10:42:34,354 INFO L297 olderBase$Statistics]: existing Event has 524 ancestors and is cut-off event [2025-03-17 10:42:34,354 INFO L297 olderBase$Statistics]: existing Event has 563 ancestors and is cut-off event [2025-03-17 10:42:34,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1351] 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][589], [623#true, 658#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), Black: 645#(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|)), 640#true, Black: 642#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 651#true, Black: 615#(= |#race~flag~0| 0), 394#L1022-1true, Black: 644#(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: 643#(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|)), 159#L997true, Black: 618#true, Black: 653#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 609#true, 255#L1013true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:34,354 INFO L294 olderBase$Statistics]: this new event has 585 ancestors and is cut-off event [2025-03-17 10:42:34,354 INFO L297 olderBase$Statistics]: existing Event has 523 ancestors and is cut-off event [2025-03-17 10:42:34,354 INFO L297 olderBase$Statistics]: existing Event has 523 ancestors and is cut-off event [2025-03-17 10:42:34,354 INFO L297 olderBase$Statistics]: existing Event has 562 ancestors and is cut-off event [2025-03-17 10:42:34,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1351] 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][469], [623#true, Black: 645#(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|)), 640#true, Black: 642#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 651#true, Black: 615#(= |#race~flag~0| 0), 394#L1022-1true, Black: 644#(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: 643#(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: 618#true, Black: 653#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 609#true, 255#L1013true, 656#true, 430#L998true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:34,354 INFO L294 olderBase$Statistics]: this new event has 588 ancestors and is cut-off event [2025-03-17 10:42:34,354 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2025-03-17 10:42:34,357 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2025-03-17 10:42:34,357 INFO L297 olderBase$Statistics]: existing Event has 565 ancestors and is cut-off event [2025-03-17 10:42:34,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1351] 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][469], [623#true, Black: 645#(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|)), 640#true, Black: 642#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 651#true, Black: 615#(= |#race~flag~0| 0), 394#L1022-1true, Black: 644#(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: 643#(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: 618#true, Black: 653#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 25#L998-3true, 609#true, 255#L1013true, 656#true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:34,358 INFO L294 olderBase$Statistics]: this new event has 587 ancestors and is cut-off event [2025-03-17 10:42:34,358 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is cut-off event [2025-03-17 10:42:34,358 INFO L297 olderBase$Statistics]: existing Event has 564 ancestors and is cut-off event [2025-03-17 10:42:34,358 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is cut-off event [2025-03-17 10:42:34,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1351] 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][469], [623#true, 33#L992true, Black: 645#(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|)), 640#true, Black: 642#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 651#true, Black: 615#(= |#race~flag~0| 0), 394#L1022-1true, Black: 644#(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: 643#(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: 618#true, Black: 653#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 609#true, 255#L1013true, 656#true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:34,358 INFO L294 olderBase$Statistics]: this new event has 594 ancestors and is cut-off event [2025-03-17 10:42:34,358 INFO L297 olderBase$Statistics]: existing Event has 571 ancestors and is cut-off event [2025-03-17 10:42:34,358 INFO L297 olderBase$Statistics]: existing Event has 532 ancestors and is cut-off event [2025-03-17 10:42:34,358 INFO L297 olderBase$Statistics]: existing Event has 532 ancestors and is cut-off event [2025-03-17 10:42:34,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1351] 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][469], [623#true, Black: 645#(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|)), 640#true, Black: 642#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 651#true, 394#L1022-1true, Black: 615#(= |#race~flag~0| 0), Black: 644#(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: 643#(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: 618#true, Black: 653#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 609#true, 255#L1013true, 656#true, 206#L997-2true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:34,361 INFO L294 olderBase$Statistics]: this new event has 585 ancestors and is cut-off event [2025-03-17 10:42:34,361 INFO L297 olderBase$Statistics]: existing Event has 561 ancestors and is cut-off event [2025-03-17 10:42:34,361 INFO L297 olderBase$Statistics]: existing Event has 540 ancestors and is cut-off event [2025-03-17 10:42:34,361 INFO L297 olderBase$Statistics]: existing Event has 584 ancestors and is cut-off event [2025-03-17 10:42:34,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1351] 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][469], [623#true, Black: 645#(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|)), 640#true, Black: 642#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 651#true, Black: 615#(= |#race~flag~0| 0), Black: 644#(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: 643#(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: 618#true, Black: 653#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 171#L1024true, 609#true, 255#L1013true, 656#true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:34,363 INFO L294 olderBase$Statistics]: this new event has 598 ancestors and is cut-off event [2025-03-17 10:42:34,363 INFO L297 olderBase$Statistics]: existing Event has 575 ancestors and is cut-off event [2025-03-17 10:42:34,363 INFO L297 olderBase$Statistics]: existing Event has 536 ancestors and is cut-off event [2025-03-17 10:42:34,363 INFO L297 olderBase$Statistics]: existing Event has 536 ancestors and is cut-off event [2025-03-17 10:42:34,395 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1351] 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][469], [623#true, Black: 645#(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: 642#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 651#true, 640#true, Black: 644#(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|)), 394#L1022-1true, Black: 615#(= |#race~flag~0| 0), Black: 643#(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: 618#true, Black: 653#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 609#true, 255#L1013true, 656#true, 206#L997-2true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:34,395 INFO L294 olderBase$Statistics]: this new event has 585 ancestors and is cut-off event [2025-03-17 10:42:34,395 INFO L297 olderBase$Statistics]: existing Event has 561 ancestors and is cut-off event [2025-03-17 10:42:34,395 INFO L297 olderBase$Statistics]: existing Event has 585 ancestors and is cut-off event [2025-03-17 10:42:34,395 INFO L297 olderBase$Statistics]: existing Event has 540 ancestors and is cut-off event [2025-03-17 10:42:34,395 INFO L297 olderBase$Statistics]: existing Event has 584 ancestors and is cut-off event [2025-03-17 10:42:34,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1272] L960-2-->L960-1: Formula: (= |v_#race~top~0_12| 0) InVars {} OutVars{#race~top~0=|v_#race~top~0_12|} AuxVars[] AssignedVars[#race~top~0][498], [623#true, Black: 645#(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|)), 640#true, Black: 642#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 651#true, Black: 615#(= |#race~flag~0| 0), 394#L1022-1true, Black: 644#(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: 643#(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|)), 410#L952-1true, Black: 618#true, Black: 653#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 609#true, 15#L960-1true, 656#true, Black: 633#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 629#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 626#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 625#(= ~top~0 0), Black: 631#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0))]) [2025-03-17 10:42:34,481 INFO L294 olderBase$Statistics]: this new event has 591 ancestors and is cut-off event [2025-03-17 10:42:34,481 INFO L297 olderBase$Statistics]: existing Event has 552 ancestors and is cut-off event [2025-03-17 10:42:34,481 INFO L297 olderBase$Statistics]: existing Event has 552 ancestors and is cut-off event [2025-03-17 10:42:34,481 INFO L297 olderBase$Statistics]: existing Event has 591 ancestors and is cut-off event [2025-03-17 10:42:34,582 INFO L124 PetriNetUnfolderBase]: 816/7387 cut-off events. [2025-03-17 10:42:34,582 INFO L125 PetriNetUnfolderBase]: For 981/1022 co-relation queries the response was YES. [2025-03-17 10:42:34,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10997 conditions, 7387 events. 816/7387 cut-off events. For 981/1022 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 68859 event pairs, 217 based on Foata normal form. 10/6846 useless extension candidates. Maximal degree in co-relation 6638. Up to 685 conditions per place. [2025-03-17 10:42:34,620 INFO L140 encePairwiseOnDemand]: 608/613 looper letters, 16 selfloop transitions, 6 changer transitions 0/662 dead transitions. [2025-03-17 10:42:34,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 662 transitions, 1722 flow [2025-03-17 10:42:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1796 transitions. [2025-03-17 10:42:34,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9766177270255574 [2025-03-17 10:42:34,623 INFO L175 Difference]: Start difference. First operand has 627 places, 655 transitions, 1658 flow. Second operand 3 states and 1796 transitions. [2025-03-17 10:42:34,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 662 transitions, 1722 flow [2025-03-17 10:42:34,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 662 transitions, 1700 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:42:34,638 INFO L231 Difference]: Finished difference. Result has 629 places, 659 transitions, 1682 flow [2025-03-17 10:42:34,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=613, 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-17 10:42:34,639 INFO L279 CegarLoopForPetriNet]: 603 programPoint places, 26 predicate places. [2025-03-17 10:42:34,639 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 659 transitions, 1682 flow [2025-03-17 10:42:34,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.6666666666666) internal successors, (1781), 3 states have internal predecessors, (1781), 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-17 10:42:34,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:34,640 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-17 10:42:34,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:42:34,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-17 10:42:34,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:34,642 INFO L85 PathProgramCache]: Analyzing trace with hash -428298751, now seen corresponding path program 1 times [2025-03-17 10:42:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:34,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372121117] [2025-03-17 10:42:34,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:34,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:34,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-17 10:42:34,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-17 10:42:34,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:34,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:34,910 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-17 10:42:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372121117] [2025-03-17 10:42:34,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372121117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:34,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:34,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:42:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642296715] [2025-03-17 10:42:34,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:34,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:34,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:34,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:34,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:34,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 613 [2025-03-17 10:42:34,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 659 transitions, 1682 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 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-17 10:42:34,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:34,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 613 [2025-03-17 10:42:34,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:35,107 INFO L124 PetriNetUnfolderBase]: 64/1700 cut-off events. [2025-03-17 10:42:35,108 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2025-03-17 10:42:35,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1700 events. 64/1700 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6941 event pairs, 9 based on Foata normal form. 24/1656 useless extension candidates. Maximal degree in co-relation 2178. Up to 86 conditions per place. [2025-03-17 10:42:35,114 INFO L140 encePairwiseOnDemand]: 609/613 looper letters, 7 selfloop transitions, 4 changer transitions 0/601 dead transitions. [2025-03-17 10:42:35,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 601 transitions, 1401 flow [2025-03-17 10:42:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-03-17 10:42:35,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9793365959760739 [2025-03-17 10:42:35,117 INFO L175 Difference]: Start difference. First operand has 629 places, 659 transitions, 1682 flow. Second operand 3 states and 1801 transitions. [2025-03-17 10:42:35,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 601 transitions, 1401 flow [2025-03-17 10:42:35,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 601 transitions, 1311 flow, removed 27 selfloop flow, removed 17 redundant places. [2025-03-17 10:42:35,125 INFO L231 Difference]: Finished difference. Result has 603 places, 599 transitions, 1290 flow [2025-03-17 10:42:35,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=613, 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-17 10:42:35,128 INFO L279 CegarLoopForPetriNet]: 603 programPoint places, 0 predicate places. [2025-03-17 10:42:35,128 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 599 transitions, 1290 flow [2025-03-17 10:42:35,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 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-17 10:42:35,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:35,129 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-17 10:42:35,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:42:35,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-17 10:42:35,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash 482913775, now seen corresponding path program 1 times [2025-03-17 10:42:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424326782] [2025-03-17 10:42:35,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:35,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:35,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-17 10:42:35,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-17 10:42:35,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:35,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:35,229 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-17 10:42:35,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:35,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424326782] [2025-03-17 10:42:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424326782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:35,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:35,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025958723] [2025-03-17 10:42:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:35,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:35,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:35,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:35,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:35,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 613 [2025-03-17 10:42:35,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 599 transitions, 1290 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-17 10:42:35,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:35,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 613 [2025-03-17 10:42:35,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:35,423 INFO L124 PetriNetUnfolderBase]: 78/1636 cut-off events. [2025-03-17 10:42:35,423 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-03-17 10:42:35,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 1636 events. 78/1636 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6713 event pairs, 38 based on Foata normal form. 0/1558 useless extension candidates. Maximal degree in co-relation 1422. Up to 171 conditions per place. [2025-03-17 10:42:35,428 INFO L140 encePairwiseOnDemand]: 610/613 looper letters, 21 selfloop transitions, 2 changer transitions 5/599 dead transitions. [2025-03-17 10:42:35,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 599 transitions, 1337 flow [2025-03-17 10:42:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1774 transitions. [2025-03-17 10:42:35,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646547036432844 [2025-03-17 10:42:35,431 INFO L175 Difference]: Start difference. First operand has 603 places, 599 transitions, 1290 flow. Second operand 3 states and 1774 transitions. [2025-03-17 10:42:35,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 599 transitions, 1337 flow [2025-03-17 10:42:35,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 599 transitions, 1333 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:35,438 INFO L231 Difference]: Finished difference. Result has 603 places, 593 transitions, 1278 flow [2025-03-17 10:42:35,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=613, 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=1278, PETRI_PLACES=603, PETRI_TRANSITIONS=593} [2025-03-17 10:42:35,441 INFO L279 CegarLoopForPetriNet]: 603 programPoint places, 0 predicate places. [2025-03-17 10:42:35,441 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 593 transitions, 1278 flow [2025-03-17 10:42:35,442 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-17 10:42:35,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:35,442 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-17 10:42:35,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:42:35,442 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-17 10:42:35,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:35,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1840307267, now seen corresponding path program 1 times [2025-03-17 10:42:35,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:35,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465824022] [2025-03-17 10:42:35,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:35,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:35,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-17 10:42:35,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-17 10:42:35,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:35,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:42:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:36,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465824022] [2025-03-17 10:42:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465824022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:36,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:36,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513640948] [2025-03-17 10:42:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:36,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:42:36,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:36,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:42:36,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:42:36,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 613 [2025-03-17 10:42:36,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 593 transitions, 1278 flow. Second operand has 6 states, 6 states have (on average 585.8333333333334) internal successors, (3515), 6 states have internal predecessors, (3515), 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-17 10:42:36,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:36,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 613 [2025-03-17 10:42:36,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:36,867 INFO L124 PetriNetUnfolderBase]: 92/1650 cut-off events. [2025-03-17 10:42:36,867 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-17 10:42:36,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 1650 events. 92/1650 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6847 event pairs, 47 based on Foata normal form. 0/1607 useless extension candidates. Maximal degree in co-relation 1980. Up to 190 conditions per place. [2025-03-17 10:42:36,871 INFO L140 encePairwiseOnDemand]: 607/613 looper letters, 0 selfloop transitions, 0 changer transitions 596/596 dead transitions. [2025-03-17 10:42:36,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 596 transitions, 1338 flow [2025-03-17 10:42:36,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:42:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:42:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3524 transitions. [2025-03-17 10:42:36,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581294181620446 [2025-03-17 10:42:36,876 INFO L175 Difference]: Start difference. First operand has 603 places, 593 transitions, 1278 flow. Second operand 6 states and 3524 transitions. [2025-03-17 10:42:36,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 596 transitions, 1338 flow [2025-03-17 10:42:36,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 596 transitions, 1334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:42:36,881 INFO L231 Difference]: Finished difference. Result has 600 places, 0 transitions, 0 flow [2025-03-17 10:42:36,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=613, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=600, PETRI_TRANSITIONS=0} [2025-03-17 10:42:36,882 INFO L279 CegarLoopForPetriNet]: 603 programPoint places, -3 predicate places. [2025-03-17 10:42:36,882 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 0 transitions, 0 flow [2025-03-17 10:42:36,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 585.8333333333334) internal successors, (3515), 6 states have internal predecessors, (3515), 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-17 10:42:36,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2025-03-17 10:42:36,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 26 remaining) [2025-03-17 10:42:36,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-03-17 10:42:36,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-03-17 10:42:36,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-03-17 10:42:36,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-03-17 10:42:36,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-03-17 10:42:36,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:42:36,886 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:36,890 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 10:42:36,890 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 10:42:36,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 10:42:36 BasicIcfg [2025-03-17 10:42:36,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 10:42:36,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 10:42:36,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 10:42:36,894 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 10:42:36,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:24" (3/4) ... [2025-03-17 10:42:36,896 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 10:42:36,898 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-17 10:42:36,898 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-17 10:42:36,903 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 10:42:36,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 10:42:36,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 10:42:36,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 10:42:36,972 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 10:42:36,973 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 10:42:36,973 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 10:42:36,973 INFO L158 Benchmark]: Toolchain (without parser) took 13390.25ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 104.7MB in the beginning and 606.5MB in the end (delta: -501.8MB). Peak memory consumption was 921.6MB. Max. memory is 16.1GB. [2025-03-17 10:42:36,973 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:42:36,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.00ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 72.0MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 10:42:36,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.70ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 65.6MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:42:36,974 INFO L158 Benchmark]: Boogie Preprocessor took 37.37ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 62.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:42:36,974 INFO L158 Benchmark]: IcfgBuilder took 775.43ms. Allocated memory is still 142.6MB. Free memory was 62.6MB in the beginning and 79.3MB in the end (delta: -16.7MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2025-03-17 10:42:36,974 INFO L158 Benchmark]: TraceAbstraction took 11961.58ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 78.6MB in the beginning and 619.1MB in the end (delta: -540.5MB). Peak memory consumption was 887.4MB. Max. memory is 16.1GB. [2025-03-17 10:42:36,975 INFO L158 Benchmark]: Witness Printer took 78.66ms. Allocated memory is still 1.6GB. Free memory was 619.1MB in the beginning and 606.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:42:36,975 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.82ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.00ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 72.0MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.70ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 65.6MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.37ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 62.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 775.43ms. Allocated memory is still 142.6MB. Free memory was 62.6MB in the beginning and 79.3MB in the end (delta: -16.7MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11961.58ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 78.6MB in the beginning and 619.1MB in the end (delta: -540.5MB). Peak memory consumption was 887.4MB. Max. memory is 16.1GB. * Witness Printer took 78.66ms. Allocated memory is still 1.6GB. Free memory was 619.1MB in the beginning and 606.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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, 769 locations, 788 edges, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 632 IncrementalHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 66 mSDtfsCounter, 632 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, 5486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 1/1 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-17 10:42:36,987 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