./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/szymanski-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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-atomic/szymanski-b.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 85c07d53d6385c45c48e29a19b83e4c86409a0ffe74e084bb9e5c8a5937c23fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:58:10,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:58:10,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:58:10,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:58:10,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:58:10,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:58:10,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:58:10,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:58:10,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:58:10,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:58:10,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:58:10,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:58:10,341 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:58:10,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:58:10,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:58:10,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:58:10,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:10,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:58:10,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:58:10,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:58:10,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:58:10,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:58:10,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:58:10,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:58:10,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:58:10,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:58:10,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:58:10,344 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 -> 85c07d53d6385c45c48e29a19b83e4c86409a0ffe74e084bb9e5c8a5937c23fb [2025-03-13 21:58:10,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:58:10,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:58:10,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:58:10,608 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:58:10,608 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:58:10,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/szymanski-b.i [2025-03-13 21:58:11,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0fb9ace/770b829573fc4e9c851a5a636b033049/FLAGa51f83d55 [2025-03-13 21:58:12,008 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:58:12,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/szymanski-b.i [2025-03-13 21:58:12,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0fb9ace/770b829573fc4e9c851a5a636b033049/FLAGa51f83d55 [2025-03-13 21:58:12,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0fb9ace/770b829573fc4e9c851a5a636b033049 [2025-03-13 21:58:12,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:58:12,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:58:12,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:12,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:58:12,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:58:12,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce871ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12, skipping insertion in model container [2025-03-13 21:58:12,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:58:12,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:12,597 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:58:12,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:12,669 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:58:12,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12 WrapperNode [2025-03-13 21:58:12,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:12,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:12,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:58:12,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:58:12,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,706 INFO L138 Inliner]: procedures = 160, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2025-03-13 21:58:12,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:12,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:58:12,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:58:12,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:58:12,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:58:12,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:58:12,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:58:12,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:58:12,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (1/1) ... [2025-03-13 21:58:12,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:12,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:12,759 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-13 21:58:12,762 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-13 21:58:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-13 21:58:12,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-13 21:58:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:58:12,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:58:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:58:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:58:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:58:12,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:58:12,778 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:58:12,867 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:58:12,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:58:13,079 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:58:13,080 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:58:13,080 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:58:13,092 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:58:13,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:13 BoogieIcfgContainer [2025-03-13 21:58:13,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:58:13,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:58:13,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:58:13,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:58:13,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:58:12" (1/3) ... [2025-03-13 21:58:13,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7633c148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:13, skipping insertion in model container [2025-03-13 21:58:13,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:12" (2/3) ... [2025-03-13 21:58:13,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7633c148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:13, skipping insertion in model container [2025-03-13 21:58:13,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:13" (3/3) ... [2025-03-13 21:58:13,101 INFO L128 eAbstractionObserver]: Analyzing ICFG szymanski-b.i [2025-03-13 21:58:13,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:58:13,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG szymanski-b.i that has 3 procedures, 184 locations, 1 initial locations, 8 loop locations, and 26 error locations. [2025-03-13 21:58:13,115 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:58:13,202 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:58:13,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 207 transitions, 428 flow [2025-03-13 21:58:13,299 INFO L124 PetriNetUnfolderBase]: 24/205 cut-off events. [2025-03-13 21:58:13,302 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:58:13,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 205 events. 24/205 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 503 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 184. Up to 3 conditions per place. [2025-03-13 21:58:13,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 207 transitions, 428 flow [2025-03-13 21:58:13,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 200 transitions, 409 flow [2025-03-13 21:58:13,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:13,337 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;@4b40d4f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:13,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-03-13 21:58:13,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:13,346 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-13 21:58:13,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:13,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:13,347 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] [2025-03-13 21:58:13,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err10ASSERT_VIOLATIONDATA_RACE, thr2Err9ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 21:58:13,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:13,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1087105918, now seen corresponding path program 1 times [2025-03-13 21:58:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:13,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284159158] [2025-03-13 21:58:13,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:13,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:58:13,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:58:13,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:13,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:13,568 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-13 21:58:13,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:13,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284159158] [2025-03-13 21:58:13,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284159158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:13,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:13,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:13,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852968705] [2025-03-13 21:58:13,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:13,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:13,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:13,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:13,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 207 [2025-03-13 21:58:13,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 200 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-13 21:58:13,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:13,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 207 [2025-03-13 21:58:13,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:13,817 INFO L124 PetriNetUnfolderBase]: 144/965 cut-off events. [2025-03-13 21:58:13,817 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-13 21:58:13,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 965 events. 144/965 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5781 event pairs, 43 based on Foata normal form. 64/790 useless extension candidates. Maximal degree in co-relation 1053. Up to 160 conditions per place. [2025-03-13 21:58:13,831 INFO L140 encePairwiseOnDemand]: 185/207 looper letters, 18 selfloop transitions, 9 changer transitions 0/195 dead transitions. [2025-03-13 21:58:13,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 195 transitions, 456 flow [2025-03-13 21:58:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2025-03-13 21:58:13,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243156199677939 [2025-03-13 21:58:13,847 INFO L175 Difference]: Start difference. First operand has 183 places, 200 transitions, 409 flow. Second operand 3 states and 574 transitions. [2025-03-13 21:58:13,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 195 transitions, 456 flow [2025-03-13 21:58:13,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 195 transitions, 450 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:58:13,856 INFO L231 Difference]: Finished difference. Result has 182 places, 194 transitions, 446 flow [2025-03-13 21:58:13,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=182, PETRI_TRANSITIONS=194} [2025-03-13 21:58:13,860 INFO L279 CegarLoopForPetriNet]: 183 programPoint places, -1 predicate places. [2025-03-13 21:58:13,860 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 194 transitions, 446 flow [2025-03-13 21:58:13,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-13 21:58:13,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:13,861 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] [2025-03-13 21:58:13,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:58:13,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err10ASSERT_VIOLATIONDATA_RACE, thr2Err9ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 21:58:13,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1918520582, now seen corresponding path program 1 times [2025-03-13 21:58:13,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:13,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287820938] [2025-03-13 21:58:13,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:13,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:13,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:58:13,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:58:13,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:13,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:13,898 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-13 21:58:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:13,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287820938] [2025-03-13 21:58:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287820938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:13,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:13,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916094968] [2025-03-13 21:58:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:13,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:13,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:13,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:13,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 207 [2025-03-13 21:58:13,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 194 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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-13 21:58:13,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:13,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 207 [2025-03-13 21:58:13,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:14,166 INFO L124 PetriNetUnfolderBase]: 361/2397 cut-off events. [2025-03-13 21:58:14,166 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-13 21:58:14,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 2397 events. 361/2397 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19672 event pairs, 11 based on Foata normal form. 0/1831 useless extension candidates. Maximal degree in co-relation 2902. Up to 253 conditions per place. [2025-03-13 21:58:14,184 INFO L140 encePairwiseOnDemand]: 184/207 looper letters, 28 selfloop transitions, 17 changer transitions 0/213 dead transitions. [2025-03-13 21:58:14,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 213 transitions, 577 flow [2025-03-13 21:58:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-03-13 21:58:14,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.893719806763285 [2025-03-13 21:58:14,189 INFO L175 Difference]: Start difference. First operand has 182 places, 194 transitions, 446 flow. Second operand 3 states and 555 transitions. [2025-03-13 21:58:14,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 213 transitions, 577 flow [2025-03-13 21:58:14,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 213 transitions, 559 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:14,196 INFO L231 Difference]: Finished difference. Result has 184 places, 211 transitions, 576 flow [2025-03-13 21:58:14,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=184, PETRI_TRANSITIONS=211} [2025-03-13 21:58:14,197 INFO L279 CegarLoopForPetriNet]: 183 programPoint places, 1 predicate places. [2025-03-13 21:58:14,197 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 211 transitions, 576 flow [2025-03-13 21:58:14,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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-13 21:58:14,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:14,198 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] [2025-03-13 21:58:14,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:58:14,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err12ASSERT_VIOLATIONDATA_RACE === [thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err10ASSERT_VIOLATIONDATA_RACE, thr2Err9ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 21:58:14,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1036010325, now seen corresponding path program 1 times [2025-03-13 21:58:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:14,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369977453] [2025-03-13 21:58:14,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:14,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:58:14,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:58:14,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:14,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:14,262 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-13 21:58:14,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:14,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369977453] [2025-03-13 21:58:14,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369977453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:14,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:14,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658382747] [2025-03-13 21:58:14,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:14,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:14,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:14,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:14,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 207 [2025-03-13 21:58:14,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 211 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-13 21:58:14,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:14,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 207 [2025-03-13 21:58:14,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:14,498 INFO L124 PetriNetUnfolderBase]: 438/2632 cut-off events. [2025-03-13 21:58:14,499 INFO L125 PetriNetUnfolderBase]: For 498/559 co-relation queries the response was YES. [2025-03-13 21:58:14,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 2632 events. 438/2632 cut-off events. For 498/559 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 21829 event pairs, 31 based on Foata normal form. 1/2042 useless extension candidates. Maximal degree in co-relation 2946. Up to 404 conditions per place. [2025-03-13 21:58:14,512 INFO L140 encePairwiseOnDemand]: 197/207 looper letters, 28 selfloop transitions, 16 changer transitions 0/226 dead transitions. [2025-03-13 21:58:14,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 226 transitions, 731 flow [2025-03-13 21:58:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2025-03-13 21:58:14,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.895330112721417 [2025-03-13 21:58:14,515 INFO L175 Difference]: Start difference. First operand has 184 places, 211 transitions, 576 flow. Second operand 3 states and 556 transitions. [2025-03-13 21:58:14,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 226 transitions, 731 flow [2025-03-13 21:58:14,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 226 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:14,521 INFO L231 Difference]: Finished difference. Result has 186 places, 225 transitions, 688 flow [2025-03-13 21:58:14,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=186, PETRI_TRANSITIONS=225} [2025-03-13 21:58:14,522 INFO L279 CegarLoopForPetriNet]: 183 programPoint places, 3 predicate places. [2025-03-13 21:58:14,523 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 225 transitions, 688 flow [2025-03-13 21:58:14,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-13 21:58:14,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:14,523 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] [2025-03-13 21:58:14,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:58:14,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err10ASSERT_VIOLATIONDATA_RACE, thr2Err9ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 21:58:14,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1240445397, now seen corresponding path program 1 times [2025-03-13 21:58:14,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:14,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56767903] [2025-03-13 21:58:14,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:14,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:58:14,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:58:14,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:14,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:14,571 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-13 21:58:14,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:14,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56767903] [2025-03-13 21:58:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56767903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:14,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:14,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808019472] [2025-03-13 21:58:14,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:14,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:14,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:14,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:14,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 207 [2025-03-13 21:58:14,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 225 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-13 21:58:14,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:14,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 207 [2025-03-13 21:58:14,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:14,890 INFO L124 PetriNetUnfolderBase]: 624/3292 cut-off events. [2025-03-13 21:58:14,890 INFO L125 PetriNetUnfolderBase]: For 561/602 co-relation queries the response was YES. [2025-03-13 21:58:14,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4964 conditions, 3292 events. 624/3292 cut-off events. For 561/602 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 28738 event pairs, 93 based on Foata normal form. 5/2530 useless extension candidates. Maximal degree in co-relation 4797. Up to 439 conditions per place. [2025-03-13 21:58:14,912 INFO L140 encePairwiseOnDemand]: 197/207 looper letters, 24 selfloop transitions, 9 changer transitions 0/234 dead transitions. [2025-03-13 21:58:14,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 234 transitions, 786 flow [2025-03-13 21:58:14,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2025-03-13 21:58:14,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.895330112721417 [2025-03-13 21:58:14,916 INFO L175 Difference]: Start difference. First operand has 186 places, 225 transitions, 688 flow. Second operand 3 states and 556 transitions. [2025-03-13 21:58:14,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 234 transitions, 786 flow [2025-03-13 21:58:14,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 234 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:14,924 INFO L231 Difference]: Finished difference. Result has 188 places, 233 transitions, 738 flow [2025-03-13 21:58:14,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=188, PETRI_TRANSITIONS=233} [2025-03-13 21:58:14,924 INFO L279 CegarLoopForPetriNet]: 183 programPoint places, 5 predicate places. [2025-03-13 21:58:14,925 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 233 transitions, 738 flow [2025-03-13 21:58:14,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-13 21:58:14,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:14,925 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] [2025-03-13 21:58:14,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:58:14,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err11ASSERT_VIOLATIONDATA_RACE === [thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err10ASSERT_VIOLATIONDATA_RACE, thr2Err9ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 21:58:14,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash -148218694, now seen corresponding path program 1 times [2025-03-13 21:58:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068497979] [2025-03-13 21:58:14,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:14,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:14,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:58:14,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:58:14,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:14,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:14,961 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-13 21:58:14,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:14,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068497979] [2025-03-13 21:58:14,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068497979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:14,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:14,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:14,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31299235] [2025-03-13 21:58:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:14,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:14,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:14,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:14,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:14,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 207 [2025-03-13 21:58:15,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 233 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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-13 21:58:15,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:15,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 207 [2025-03-13 21:58:15,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:15,378 INFO L124 PetriNetUnfolderBase]: 1136/5289 cut-off events. [2025-03-13 21:58:15,378 INFO L125 PetriNetUnfolderBase]: For 1890/1962 co-relation queries the response was YES. [2025-03-13 21:58:15,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8915 conditions, 5289 events. 1136/5289 cut-off events. For 1890/1962 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 50632 event pairs, 42 based on Foata normal form. 14/4187 useless extension candidates. Maximal degree in co-relation 8757. Up to 703 conditions per place. [2025-03-13 21:58:15,405 INFO L140 encePairwiseOnDemand]: 184/207 looper letters, 39 selfloop transitions, 29 changer transitions 0/263 dead transitions. [2025-03-13 21:58:15,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 263 transitions, 1013 flow [2025-03-13 21:58:15,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2025-03-13 21:58:15,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8921095008051529 [2025-03-13 21:58:15,407 INFO L175 Difference]: Start difference. First operand has 188 places, 233 transitions, 738 flow. Second operand 3 states and 554 transitions. [2025-03-13 21:58:15,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 263 transitions, 1013 flow [2025-03-13 21:58:15,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 263 transitions, 957 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:15,418 INFO L231 Difference]: Finished difference. Result has 190 places, 262 transitions, 1004 flow [2025-03-13 21:58:15,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1004, PETRI_PLACES=190, PETRI_TRANSITIONS=262} [2025-03-13 21:58:15,419 INFO L279 CegarLoopForPetriNet]: 183 programPoint places, 7 predicate places. [2025-03-13 21:58:15,419 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 262 transitions, 1004 flow [2025-03-13 21:58:15,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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-13 21:58:15,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:15,420 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] [2025-03-13 21:58:15,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:58:15,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr2Err12ASSERT_VIOLATIONDATA_RACE, thr2Err11ASSERT_VIOLATIONDATA_RACE, thr2Err10ASSERT_VIOLATIONDATA_RACE, thr2Err9ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-03-13 21:58:15,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash -392745288, now seen corresponding path program 1 times [2025-03-13 21:58:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:15,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302415872] [2025-03-13 21:58:15,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:15,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:58:15,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:58:15,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:15,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:15,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:15,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:58:15,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:58:15,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:15,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:15,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:15,464 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:15,465 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining) [2025-03-13 21:58:15,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err12ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2025-03-13 21:58:15,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err11ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2025-03-13 21:58:15,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err10ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2025-03-13 21:58:15,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2025-03-13 21:58:15,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2025-03-13 21:58:15,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (47 of 54 remaining) [2025-03-13 21:58:15,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (46 of 54 remaining) [2025-03-13 21:58:15,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2025-03-13 21:58:15,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2025-03-13 21:58:15,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2025-03-13 21:58:15,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2025-03-13 21:58:15,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2025-03-13 21:58:15,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2025-03-13 21:58:15,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err12ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err11ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err10ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2025-03-13 21:58:15,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2025-03-13 21:58:15,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2025-03-13 21:58:15,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:58:15,472 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-13 21:58:15,496 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:58:15,496 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:58:15,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:58:15 BasicIcfg [2025-03-13 21:58:15,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:58:15,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:58:15,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:58:15,501 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:58:15,502 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:13" (3/4) ... [2025-03-13 21:58:15,502 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:58:15,539 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-03-13 21:58:15,569 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:58:15,569 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:58:15,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:58:15,570 INFO L158 Benchmark]: Toolchain (without parser) took 3258.76ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 112.0MB in the beginning and 101.4MB in the end (delta: 10.5MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2025-03-13 21:58:15,570 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:15,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.02ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 92.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:58:15,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.35ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:15,572 INFO L158 Benchmark]: Boogie Preprocessor took 16.65ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 90.0MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:58:15,572 INFO L158 Benchmark]: IcfgBuilder took 368.31ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 71.7MB in the end (delta: 18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:58:15,573 INFO L158 Benchmark]: TraceAbstraction took 2406.38ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 70.8MB in the beginning and 109.8MB in the end (delta: -39.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2025-03-13 21:58:15,573 INFO L158 Benchmark]: Witness Printer took 67.93ms. Allocated memory is still 201.3MB. Free memory was 109.8MB in the beginning and 101.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:58:15,574 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.42ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.02ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 92.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.35ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.65ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 90.0MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 368.31ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 71.7MB in the end (delta: 18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2406.38ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 70.8MB in the beginning and 109.8MB in the end (delta: -39.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 67.93ms. Allocated memory is still 201.3MB. Free memory was 109.8MB in the beginning and 101.4MB 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: 678]: Data race detected Data race detected The following path leads to a data race: [L674] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L675] 0 int x; VAL [flag1=0, flag2=0, x=0] [L709] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, x=0] [L710] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1=-1, x=0] [L711] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=0, flag2=0, t1=-1, t2=0, x=0] [L677] 1 flag1 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L678] COND TRUE 1 flag2 >= 3 [L678] 1 flag2 >= 3 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L693] 2 flag2 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, x=0] [L678] 1 flag2 >= 3 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, x=0] Now there is a data race on ~flag2~0 between C: flag2 = 1 [693] and C: flag2 >= 3 [678] - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 677]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 679]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 680]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 684]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 682]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 711]: 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 5 procedures, 338 locations, 54 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: 2.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 299 IncrementalHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 88 mSDtfsCounter, 299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1004occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 141 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-13 21:58:15,589 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)