./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_10-equ_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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/goblint-regression/06-symbeq_10-equ_rc.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 fd55bbfa1518dd7815f07d7de8c2030374bbc7b7998290c12df563b95f65f709 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:45:31,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:45:31,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:45:31,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:45:31,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:45:31,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:45:31,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:45:31,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:45:31,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:45:31,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:45:31,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:45:31,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:45:31,180 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:45:31,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:45:31,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:45:31,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:45:31,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:45:31,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:45:31,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:45:31,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:45:31,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:45:31,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:45:31,181 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:45:31,181 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:45:31,181 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:45:31,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:31,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:45:31,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:45:31,182 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 -> fd55bbfa1518dd7815f07d7de8c2030374bbc7b7998290c12df563b95f65f709 [2025-03-04 06:45:31,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:45:31,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:45:31,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:45:31,400 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:45:31,400 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:45:31,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_10-equ_rc.i [2025-03-04 06:45:32,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2c0ed6a/81081ef784d944289bb33d07dfb2d13d/FLAGd24fab505 [2025-03-04 06:45:32,801 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:45:32,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_10-equ_rc.i [2025-03-04 06:45:32,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2c0ed6a/81081ef784d944289bb33d07dfb2d13d/FLAGd24fab505 [2025-03-04 06:45:32,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2c0ed6a/81081ef784d944289bb33d07dfb2d13d [2025-03-04 06:45:32,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:45:32,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:45:32,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:32,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:45:32,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:45:32,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:32" (1/1) ... [2025-03-04 06:45:32,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350ce49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:32, skipping insertion in model container [2025-03-04 06:45:32,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:32" (1/1) ... [2025-03-04 06:45:32,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:45:33,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:33,130 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:45:33,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:33,193 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:45:33,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33 WrapperNode [2025-03-04 06:45:33,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:33,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:33,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:45:33,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:45:33,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,231 INFO L138 Inliner]: procedures = 265, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2025-03-04 06:45:33,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:33,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:45:33,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:45:33,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:45:33,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:45:33,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:45:33,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:45:33,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:45:33,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (1/1) ... [2025-03-04 06:45:33,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:33,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:33,274 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-04 06:45:33,277 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-04 06:45:33,289 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:45:33,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:45:33,289 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:45:33,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:45:33,289 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:45:33,289 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:45:33,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:45:33,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:45:33,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:45:33,290 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:45:33,388 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:45:33,390 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:45:33,522 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:45:33,522 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:45:33,536 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:45:33,536 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:45:33,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:33 BoogieIcfgContainer [2025-03-04 06:45:33,536 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:45:33,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:45:33,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:45:33,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:45:33,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:45:32" (1/3) ... [2025-03-04 06:45:33,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35aee975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:33, skipping insertion in model container [2025-03-04 06:45:33,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:33" (2/3) ... [2025-03-04 06:45:33,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35aee975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:33, skipping insertion in model container [2025-03-04 06:45:33,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:33" (3/3) ... [2025-03-04 06:45:33,545 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_10-equ_rc.i [2025-03-04 06:45:33,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:45:33,557 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_10-equ_rc.i that has 2 procedures, 86 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 06:45:33,558 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:45:33,606 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:45:33,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 86 transitions, 176 flow [2025-03-04 06:45:33,675 INFO L124 PetriNetUnfolderBase]: 1/85 cut-off events. [2025-03-04 06:45:33,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:33,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 85 events. 1/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-04 06:45:33,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 86 transitions, 176 flow [2025-03-04 06:45:33,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 85 transitions, 173 flow [2025-03-04 06:45:33,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:45:33,704 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;@db6efba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:45:33,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 06:45:33,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:45:33,730 INFO L124 PetriNetUnfolderBase]: 1/69 cut-off events. [2025-03-04 06:45:33,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:33,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:33,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:33,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-04 06:45:33,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:33,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1431733065, now seen corresponding path program 1 times [2025-03-04 06:45:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:33,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533984322] [2025-03-04 06:45:33,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:33,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:45:33,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:45:33,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:33,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:34,466 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-04 06:45:34,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533984322] [2025-03-04 06:45:34,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533984322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:34,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:34,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:34,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115672307] [2025-03-04 06:45:34,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:34,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:34,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:34,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:34,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:34,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 86 [2025-03-04 06:45:34,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-04 06:45:34,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:34,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 86 [2025-03-04 06:45:34,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:34,798 INFO L124 PetriNetUnfolderBase]: 79/332 cut-off events. [2025-03-04 06:45:34,800 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:34,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 332 events. 79/332 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1426 event pairs, 25 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 459. Up to 130 conditions per place. [2025-03-04 06:45:34,805 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 21 selfloop transitions, 22 changer transitions 4/114 dead transitions. [2025-03-04 06:45:34,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 114 transitions, 325 flow [2025-03-04 06:45:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-03-04 06:45:34,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8837209302325582 [2025-03-04 06:45:34,818 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 173 flow. Second operand 6 states and 456 transitions. [2025-03-04 06:45:34,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 114 transitions, 325 flow [2025-03-04 06:45:34,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 114 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:34,827 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 322 flow [2025-03-04 06:45:34,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-03-04 06:45:34,832 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2025-03-04 06:45:34,833 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 322 flow [2025-03-04 06:45:34,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-04 06:45:34,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:34,834 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] [2025-03-04 06:45:34,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:45:34,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-04 06:45:34,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1657911155, now seen corresponding path program 1 times [2025-03-04 06:45:34,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:34,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132783237] [2025-03-04 06:45:34,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:34,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 06:45:34,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 06:45:34,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:34,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:35,155 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-04 06:45:35,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:35,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132783237] [2025-03-04 06:45:35,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132783237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:35,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:35,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970272275] [2025-03-04 06:45:35,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:35,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:35,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:35,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:35,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 86 [2025-03-04 06:45:35,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 6 states have internal predecessors, (401), 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-04 06:45:35,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:35,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 86 [2025-03-04 06:45:35,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:35,354 INFO L124 PetriNetUnfolderBase]: 132/465 cut-off events. [2025-03-04 06:45:35,354 INFO L125 PetriNetUnfolderBase]: For 136/144 co-relation queries the response was YES. [2025-03-04 06:45:35,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 465 events. 132/465 cut-off events. For 136/144 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2211 event pairs, 31 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 995. Up to 218 conditions per place. [2025-03-04 06:45:35,359 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 39 selfloop transitions, 29 changer transitions 7/141 dead transitions. [2025-03-04 06:45:35,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 141 transitions, 612 flow [2025-03-04 06:45:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 441 transitions. [2025-03-04 06:45:35,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8546511627906976 [2025-03-04 06:45:35,362 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 322 flow. Second operand 6 states and 441 transitions. [2025-03-04 06:45:35,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 141 transitions, 612 flow [2025-03-04 06:45:35,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 141 transitions, 612 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:35,369 INFO L231 Difference]: Finished difference. Result has 107 places, 130 transitions, 576 flow [2025-03-04 06:45:35,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=107, PETRI_TRANSITIONS=130} [2025-03-04 06:45:35,371 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 19 predicate places. [2025-03-04 06:45:35,371 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 130 transitions, 576 flow [2025-03-04 06:45:35,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 6 states have internal predecessors, (401), 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-04 06:45:35,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:35,372 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] [2025-03-04 06:45:35,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:45:35,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-04 06:45:35,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash -634091643, now seen corresponding path program 1 times [2025-03-04 06:45:35,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:35,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042235654] [2025-03-04 06:45:35,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:35,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:45:35,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:45:35,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:35,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:35,788 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-04 06:45:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042235654] [2025-03-04 06:45:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042235654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:35,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:35,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:45:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598583245] [2025-03-04 06:45:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:35,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:45:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:35,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:45:35,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:45:36,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 86 [2025-03-04 06:45:36,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 130 transitions, 576 flow. Second operand has 11 states, 11 states have (on average 61.54545454545455) internal successors, (677), 11 states have internal predecessors, (677), 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-04 06:45:36,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:36,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 86 [2025-03-04 06:45:36,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:36,507 INFO L124 PetriNetUnfolderBase]: 275/886 cut-off events. [2025-03-04 06:45:36,507 INFO L125 PetriNetUnfolderBase]: For 697/697 co-relation queries the response was YES. [2025-03-04 06:45:36,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 886 events. 275/886 cut-off events. For 697/697 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5511 event pairs, 60 based on Foata normal form. 11/887 useless extension candidates. Maximal degree in co-relation 1536. Up to 285 conditions per place. [2025-03-04 06:45:36,512 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 118 selfloop transitions, 38 changer transitions 19/236 dead transitions. [2025-03-04 06:45:36,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 236 transitions, 1588 flow [2025-03-04 06:45:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:45:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 06:45:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 743 transitions. [2025-03-04 06:45:36,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7854122621564482 [2025-03-04 06:45:36,514 INFO L175 Difference]: Start difference. First operand has 107 places, 130 transitions, 576 flow. Second operand 11 states and 743 transitions. [2025-03-04 06:45:36,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 236 transitions, 1588 flow [2025-03-04 06:45:36,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 236 transitions, 1552 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:36,522 INFO L231 Difference]: Finished difference. Result has 125 places, 164 transitions, 1003 flow [2025-03-04 06:45:36,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1003, PETRI_PLACES=125, PETRI_TRANSITIONS=164} [2025-03-04 06:45:36,523 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 37 predicate places. [2025-03-04 06:45:36,523 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 164 transitions, 1003 flow [2025-03-04 06:45:36,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 61.54545454545455) internal successors, (677), 11 states have internal predecessors, (677), 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-04 06:45:36,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:36,524 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] [2025-03-04 06:45:36,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:45:36,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-04 06:45:36,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:36,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1295229484, now seen corresponding path program 1 times [2025-03-04 06:45:36,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:36,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662798246] [2025-03-04 06:45:36,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:36,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:45:36,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:45:36,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:36,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:36,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-04 06:45:36,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:36,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662798246] [2025-03-04 06:45:36,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662798246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:36,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:36,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:45:36,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978016744] [2025-03-04 06:45:36,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:36,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:45:36,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:36,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:45:36,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:45:37,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 86 [2025-03-04 06:45:37,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 164 transitions, 1003 flow. Second operand has 11 states, 11 states have (on average 61.54545454545455) internal successors, (677), 11 states have internal predecessors, (677), 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-04 06:45:37,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:37,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 86 [2025-03-04 06:45:37,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:37,574 INFO L124 PetriNetUnfolderBase]: 243/834 cut-off events. [2025-03-04 06:45:37,574 INFO L125 PetriNetUnfolderBase]: For 1312/1356 co-relation queries the response was YES. [2025-03-04 06:45:37,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 834 events. 243/834 cut-off events. For 1312/1356 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5120 event pairs, 55 based on Foata normal form. 16/844 useless extension candidates. Maximal degree in co-relation 2217. Up to 266 conditions per place. [2025-03-04 06:45:37,581 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 103 selfloop transitions, 38 changer transitions 32/234 dead transitions. [2025-03-04 06:45:37,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 234 transitions, 1867 flow [2025-03-04 06:45:37,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:45:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 06:45:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 736 transitions. [2025-03-04 06:45:37,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7780126849894292 [2025-03-04 06:45:37,584 INFO L175 Difference]: Start difference. First operand has 125 places, 164 transitions, 1003 flow. Second operand 11 states and 736 transitions. [2025-03-04 06:45:37,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 234 transitions, 1867 flow [2025-03-04 06:45:37,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 234 transitions, 1860 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 06:45:37,598 INFO L231 Difference]: Finished difference. Result has 140 places, 180 transitions, 1291 flow [2025-03-04 06:45:37,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1291, PETRI_PLACES=140, PETRI_TRANSITIONS=180} [2025-03-04 06:45:37,599 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 52 predicate places. [2025-03-04 06:45:37,599 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 180 transitions, 1291 flow [2025-03-04 06:45:37,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 61.54545454545455) internal successors, (677), 11 states have internal predecessors, (677), 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-04 06:45:37,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:37,600 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] [2025-03-04 06:45:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:45:37,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-03-04 06:45:37,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:37,603 INFO L85 PathProgramCache]: Analyzing trace with hash 288052445, now seen corresponding path program 1 times [2025-03-04 06:45:37,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:37,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-03-04 06:45:37,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:37,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:45:37,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:45:37,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:37,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:45:37,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:45:37,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:45:37,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:45:37,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:37,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:45:37,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:45:37,664 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:45:37,664 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 4 remaining) [2025-03-04 06:45:37,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2025-03-04 06:45:37,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-04 06:45:37,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2025-03-04 06:45:37,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:45:37,666 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 06:45:37,704 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:45:37,704 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:45:37,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:45:37 BasicIcfg [2025-03-04 06:45:37,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:45:37,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:45:37,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:45:37,711 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:45:37,711 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:33" (3/4) ... [2025-03-04 06:45:37,712 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 06:45:37,754 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-03-04 06:45:37,782 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:45:37,783 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:45:37,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:45:37,784 INFO L158 Benchmark]: Toolchain (without parser) took 4944.68ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.2MB in the beginning and 246.0MB in the end (delta: -133.8MB). Peak memory consumption was 147.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:37,784 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:37,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.68ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 84.3MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:45:37,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.54ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:37,786 INFO L158 Benchmark]: Boogie Preprocessor took 16.05ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 80.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:37,786 INFO L158 Benchmark]: IcfgBuilder took 287.59ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 65.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:45:37,786 INFO L158 Benchmark]: TraceAbstraction took 4171.30ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 65.2MB in the beginning and 254.4MB in the end (delta: -189.2MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2025-03-04 06:45:37,788 INFO L158 Benchmark]: Witness Printer took 72.01ms. Allocated memory is still 427.8MB. Free memory was 254.4MB in the beginning and 246.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:37,789 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.68ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 84.3MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.54ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.05ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 80.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 287.59ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 65.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4171.30ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 65.2MB in the beginning and 254.4MB in the end (delta: -189.2MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 72.01ms. Allocated memory is still 427.8MB. Free memory was 254.4MB in the beginning and 246.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 996]: Data race detected Data race detected The following path leads to a data race: [L989-L993] 0 struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; VAL [A={1:0}, B={2:0}] [L1003] 0 int x = __VERIFIER_nondet_int(); VAL [A={1:0}, B={2:0}, x=0] [L1004] 0 pthread_t id; VAL [A={1:0}, B={2:0}, x=0] [L1005] 0 struct s *s; VAL [A={1:0}, B={2:0}, x=0] [L1006] 0 int *d; VAL [A={1:0}, B={2:0}, x=0] [L1007] 0 pthread_mutex_t *m; VAL [A={1:0}, B={2:0}, x=0] [L1008] COND FALSE 0 !(\read(x)) VAL [A={1:0}, B={2:0}, x=0] [L1012] 0 s = &B VAL [A={1:0}, B={2:0}, s={2:0}, x=0] [L1013] 0 x++ VAL [A={1:0}, B={2:0}, s={2:0}, x=1] [L1015] 0 m = &s->mutex VAL [A={1:0}, B={2:0}, m={2:12}, s={2:0}, x=1] [L1016] 0 d = &s->datum VAL [A={1:0}, B={2:0}, d={2:0}, m={2:12}, s={2:0}, x=1] [L1017] FCALL, FORK 0 pthread_create(&id,((void *)0),t_fun,((void *)0)) VAL [A={1:0}, B={2:0}, \old(arg)={0:0}, d={2:0}, id=-1, m={2:12}, s={2:0}, x=1] [L1019] 0 *d = 8 VAL [A={1:0}, B={2:0}, \old(arg)={0:0}, arg={0:0}, d={2:0}, id=-1, m={2:12}, s={2:0}, x=1] [L996] 1 B.datum = 5 VAL [A={1:0}, B={2:0}, \old(arg)={0:0}, arg={0:0}] [L1019] 0 *d = 8 VAL [A={1:0}, B={2:0}, \old(arg)={0:0}, arg={0:0}, d={2:0}, id=-1, m={2:12}, s={2:0}, x=1] [L996] 1 B.datum = 5 VAL [A={1:0}, B={2:0}, \old(arg)={0:0}, arg={0:0}] Now there is a data race (on the heap) between C: *d = 8 [1019] and C: B.datum = 5 [996] - UnprovableResult [Line: 1019]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 104 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 869 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 717 mSDsluCounter, 518 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 497 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2427 IncrementalHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 21 mSDtfsCounter, 2427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1291occurred in iteration=4, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 995 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 06:45:37,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)