./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/singleton-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/singleton-b.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8df6b0e07576c0f44be76a2619065be37971886a948c5dcc3b73910d3c970468 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:02:35,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:02:35,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:02:36,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:02:36,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:02:36,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:02:36,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:02:36,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:02:36,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:02:36,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:02:36,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:02:36,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:02:36,020 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:02:36,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:02:36,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:02:36,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:02:36,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:02:36,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:02:36,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:02:36,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:02:36,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:02:36,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:02:36,021 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:02:36,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:02:36,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:02:36,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:02:36,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:02:36,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:02:36,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:02:36,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:02:36,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:02:36,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:36,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:02:36,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:02:36,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:02:36,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:36,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:02:36,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:02:36,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:02:36,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:02:36,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:02:36,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:02:36,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:02:36,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:02:36,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:02:36,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:02:36,023 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8df6b0e07576c0f44be76a2619065be37971886a948c5dcc3b73910d3c970468 [2025-01-09 21:02:36,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:02:36,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:02:36,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:02:36,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:02:36,275 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:02:36,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton-b.i [2025-01-09 21:02:37,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24414ce6d/8a2f143a87b9499aa340ae22d3417a70/FLAG7c6622820 [2025-01-09 21:02:37,883 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:02:37,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/singleton-b.i [2025-01-09 21:02:37,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24414ce6d/8a2f143a87b9499aa340ae22d3417a70/FLAG7c6622820 [2025-01-09 21:02:37,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24414ce6d/8a2f143a87b9499aa340ae22d3417a70 [2025-01-09 21:02:37,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:02:37,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:02:37,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:02:37,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:02:37,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:02:37,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63171e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37, skipping insertion in model container [2025-01-09 21:02:37,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:02:38,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:02:38,230 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:02:38,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:02:38,302 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:02:38,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38 WrapperNode [2025-01-09 21:02:38,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:02:38,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:02:38,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:02:38,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:02:38,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,330 INFO L138 Inliner]: procedures = 322, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 34 [2025-01-09 21:02:38,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:02:38,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:02:38,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:02:38,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:02:38,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:02:38,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:02:38,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:02:38,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:02:38,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (1/1) ... [2025-01-09 21:02:38,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:38,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:02:38,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:02:38,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:02:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:02:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2025-01-09 21:02:38,404 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2025-01-09 21:02:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:02:38,404 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:02:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:02:38,404 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:02:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:02:38,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:02:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:02:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:02:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:02:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:02:38,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:02:38,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:02:38,407 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:02:38,532 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:02:38,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:02:38,680 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:02:38,680 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:02:38,690 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:02:38,690 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:02:38,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:38 BoogieIcfgContainer [2025-01-09 21:02:38,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:02:38,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:02:38,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:02:38,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:02:38,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:02:37" (1/3) ... [2025-01-09 21:02:38,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eddb088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:38, skipping insertion in model container [2025-01-09 21:02:38,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:38" (2/3) ... [2025-01-09 21:02:38,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eddb088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:38, skipping insertion in model container [2025-01-09 21:02:38,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:38" (3/3) ... [2025-01-09 21:02:38,698 INFO L128 eAbstractionObserver]: Analyzing ICFG singleton-b.i [2025-01-09 21:02:38,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:02:38,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG singleton-b.i that has 5 procedures, 123 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-01-09 21:02:38,710 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:02:38,833 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-01-09 21:02:38,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 193 transitions, 483 flow [2025-01-09 21:02:38,921 INFO L124 PetriNetUnfolderBase]: 7/149 cut-off events. [2025-01-09 21:02:38,923 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:02:38,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 149 events. 7/149 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 154 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 129. Up to 3 conditions per place. [2025-01-09 21:02:38,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 193 transitions, 483 flow [2025-01-09 21:02:38,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 130 transitions, 311 flow [2025-01-09 21:02:38,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:02:38,947 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;@f2d78aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:02:38,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-01-09 21:02:38,958 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:02:38,960 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-01-09 21:02:38,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:38,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:38,961 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-01-09 21:02:38,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-09 21:02:38,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash -260483121, now seen corresponding path program 1 times [2025-01-09 21:02:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:38,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189421260] [2025-01-09 21:02:38,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:39,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:02:39,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:02:39,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:39,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:39,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189421260] [2025-01-09 21:02:39,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189421260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:39,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:39,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470690095] [2025-01-09 21:02:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:39,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:39,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:39,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:39,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 195 [2025-01-09 21:02:39,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 130 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:39,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:39,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 195 [2025-01-09 21:02:39,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:39,427 INFO L124 PetriNetUnfolderBase]: 67/524 cut-off events. [2025-01-09 21:02:39,427 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-01-09 21:02:39,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 524 events. 67/524 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2598 event pairs, 51 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 685. Up to 120 conditions per place. [2025-01-09 21:02:39,432 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 24 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2025-01-09 21:02:39,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 129 transitions, 361 flow [2025-01-09 21:02:39,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2025-01-09 21:02:39,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2025-01-09 21:02:39,445 INFO L175 Difference]: Start difference. First operand has 144 places, 130 transitions, 311 flow. Second operand 3 states and 480 transitions. [2025-01-09 21:02:39,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 129 transitions, 361 flow [2025-01-09 21:02:39,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 129 transitions, 327 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-01-09 21:02:39,452 INFO L231 Difference]: Finished difference. Result has 133 places, 129 transitions, 279 flow [2025-01-09 21:02:39,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=133, PETRI_TRANSITIONS=129} [2025-01-09 21:02:39,456 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -11 predicate places. [2025-01-09 21:02:39,456 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 129 transitions, 279 flow [2025-01-09 21:02:39,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:39,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:39,456 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] [2025-01-09 21:02:39,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:02:39,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-09 21:02:39,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash -88378552, now seen corresponding path program 1 times [2025-01-09 21:02:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:39,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423764901] [2025-01-09 21:02:39,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:39,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:02:39,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:02:39,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:39,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423764901] [2025-01-09 21:02:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423764901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586430102] [2025-01-09 21:02:39,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:39,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:39,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:39,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:39,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:39,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 195 [2025-01-09 21:02:39,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 129 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:39,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:39,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 195 [2025-01-09 21:02:39,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:39,733 INFO L124 PetriNetUnfolderBase]: 313/1152 cut-off events. [2025-01-09 21:02:39,733 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-01-09 21:02:39,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 1152 events. 313/1152 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7612 event pairs, 188 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1649. Up to 471 conditions per place. [2025-01-09 21:02:39,742 INFO L140 encePairwiseOnDemand]: 186/195 looper letters, 31 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2025-01-09 21:02:39,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 131 transitions, 356 flow [2025-01-09 21:02:39,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-01-09 21:02:39,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.811965811965812 [2025-01-09 21:02:39,746 INFO L175 Difference]: Start difference. First operand has 133 places, 129 transitions, 279 flow. Second operand 3 states and 475 transitions. [2025-01-09 21:02:39,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 131 transitions, 356 flow [2025-01-09 21:02:39,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 131 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:39,750 INFO L231 Difference]: Finished difference. Result has 129 places, 128 transitions, 293 flow [2025-01-09 21:02:39,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=129, PETRI_TRANSITIONS=128} [2025-01-09 21:02:39,751 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -15 predicate places. [2025-01-09 21:02:39,751 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 293 flow [2025-01-09 21:02:39,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:39,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:39,752 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] [2025-01-09 21:02:39,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:02:39,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-09 21:02:39,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:39,754 INFO L85 PathProgramCache]: Analyzing trace with hash -582238325, now seen corresponding path program 1 times [2025-01-09 21:02:39,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:39,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386283618] [2025-01-09 21:02:39,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:39,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:02:39,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:02:39,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:39,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:39,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386283618] [2025-01-09 21:02:39,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386283618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:39,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:39,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:39,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313344437] [2025-01-09 21:02:39,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:39,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:39,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:39,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:39,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:39,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 195 [2025-01-09 21:02:39,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:39,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:39,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 195 [2025-01-09 21:02:39,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:40,132 INFO L124 PetriNetUnfolderBase]: 322/1241 cut-off events. [2025-01-09 21:02:40,132 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:02:40,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 1241 events. 322/1241 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9452 event pairs, 187 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1847. Up to 447 conditions per place. [2025-01-09 21:02:40,141 INFO L140 encePairwiseOnDemand]: 188/195 looper letters, 30 selfloop transitions, 6 changer transitions 0/136 dead transitions. [2025-01-09 21:02:40,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 136 transitions, 384 flow [2025-01-09 21:02:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2025-01-09 21:02:40,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8324786324786325 [2025-01-09 21:02:40,143 INFO L175 Difference]: Start difference. First operand has 129 places, 128 transitions, 293 flow. Second operand 3 states and 487 transitions. [2025-01-09 21:02:40,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 136 transitions, 384 flow [2025-01-09 21:02:40,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 136 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:40,145 INFO L231 Difference]: Finished difference. Result has 133 places, 133 transitions, 339 flow [2025-01-09 21:02:40,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=133, PETRI_TRANSITIONS=133} [2025-01-09 21:02:40,147 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -11 predicate places. [2025-01-09 21:02:40,147 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 133 transitions, 339 flow [2025-01-09 21:02:40,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:40,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:40,148 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] [2025-01-09 21:02:40,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:02:40,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-09 21:02:40,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash 173848095, now seen corresponding path program 1 times [2025-01-09 21:02:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:40,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162578347] [2025-01-09 21:02:40,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:40,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:02:40,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:02:40,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:40,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:40,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:40,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162578347] [2025-01-09 21:02:40,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162578347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:40,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:40,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:40,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470142105] [2025-01-09 21:02:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:40,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:40,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:40,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:40,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:40,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 195 [2025-01-09 21:02:40,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 133 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:40,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:40,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 195 [2025-01-09 21:02:40,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:40,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L1116-4-->L1116-5: Formula: (= |v_#race_1| (store |v_#race_2| v_~v~0.base_3 (store (select |v_#race_2| v_~v~0.base_3) v_~v~0.offset_3 |v_thread2Thread1of1ForFork4_#t~nondet5_3|))) InVars {#race=|v_#race_2|, ~v~0.offset=v_~v~0.offset_3, thread2Thread1of1ForFork4_#t~nondet5=|v_thread2Thread1of1ForFork4_#t~nondet5_3|, ~v~0.base=v_~v~0.base_3} OutVars{#race=|v_#race_1|, ~v~0.offset=v_~v~0.offset_3, thread2Thread1of1ForFork4_#t~nondet5=|v_thread2Thread1of1ForFork4_#t~nondet5_3|, ~v~0.base=v_~v~0.base_3} AuxVars[] AssignedVars[#race][123], [34#L1142-4true, 139#L1116-5true, Black: 208#true, Black: 214#(= (select (select |#race| ~v~0.base) ~v~0.offset) |thread2Thread1of1ForFork0_#t~nondet5|), 210#(= |#race~v~0| 0), 22#L1116-6true, 186#L1116-5true, 91#L1132-4true, 54#L1121-6true, 217#true, 212#true]) [2025-01-09 21:02:40,448 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:02:40,449 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:02:40,449 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:02:40,449 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:02:40,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L1116-4-->L1116-5: Formula: (= |v_#race_1| (store |v_#race_2| v_~v~0.base_3 (store (select |v_#race_2| v_~v~0.base_3) v_~v~0.offset_3 |v_thread2Thread1of1ForFork4_#t~nondet5_3|))) InVars {#race=|v_#race_2|, ~v~0.offset=v_~v~0.offset_3, thread2Thread1of1ForFork4_#t~nondet5=|v_thread2Thread1of1ForFork4_#t~nondet5_3|, ~v~0.base=v_~v~0.base_3} OutVars{#race=|v_#race_1|, ~v~0.offset=v_~v~0.offset_3, thread2Thread1of1ForFork4_#t~nondet5=|v_thread2Thread1of1ForFork4_#t~nondet5_3|, ~v~0.base=v_~v~0.base_3} AuxVars[] AssignedVars[#race][105], [139#L1116-5true, 34#L1142-4true, Black: 208#true, Black: 214#(= (select (select |#race| ~v~0.base) ~v~0.offset) |thread2Thread1of1ForFork0_#t~nondet5|), 210#(= |#race~v~0| 0), 6#L1122true, 91#L1132-4true, 22#L1116-6true, 186#L1116-5true, 217#true, 212#true]) [2025-01-09 21:02:40,472 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,473 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,473 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,473 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L1116-4-->L1116-5: Formula: (= |v_#race_1| (store |v_#race_2| v_~v~0.base_3 (store (select |v_#race_2| v_~v~0.base_3) v_~v~0.offset_3 |v_thread2Thread1of1ForFork1_#t~nondet5_3|))) InVars {#race=|v_#race_2|, thread2Thread1of1ForFork1_#t~nondet5=|v_thread2Thread1of1ForFork1_#t~nondet5_3|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} OutVars{#race=|v_#race_1|, thread2Thread1of1ForFork1_#t~nondet5=|v_thread2Thread1of1ForFork1_#t~nondet5_3|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} AuxVars[] AssignedVars[#race][116], [139#L1116-5true, 34#L1142-4true, 8#thread2Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#true, Black: 214#(= (select (select |#race| ~v~0.base) ~v~0.offset) |thread2Thread1of1ForFork0_#t~nondet5|), 210#(= |#race~v~0| 0), 6#L1122true, 186#L1116-5true, 91#L1132-4true, 217#true, 212#true]) [2025-01-09 21:02:40,474 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,474 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,474 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,474 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L1116-4-->L1116-5: Formula: (= |v_#race_1| (store |v_#race_2| v_~v~0.base_3 (store (select |v_#race_2| v_~v~0.base_3) v_~v~0.offset_3 |v_thread2Thread1of1ForFork1_#t~nondet5_3|))) InVars {#race=|v_#race_2|, thread2Thread1of1ForFork1_#t~nondet5=|v_thread2Thread1of1ForFork1_#t~nondet5_3|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} OutVars{#race=|v_#race_1|, thread2Thread1of1ForFork1_#t~nondet5=|v_thread2Thread1of1ForFork1_#t~nondet5_3|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} AuxVars[] AssignedVars[#race][119], [139#L1116-5true, 34#L1142-4true, Black: 208#true, Black: 214#(= (select (select |#race| ~v~0.base) ~v~0.offset) |thread2Thread1of1ForFork0_#t~nondet5|), 210#(= |#race~v~0| 0), 6#L1122true, 22#L1116-6true, 91#L1132-4true, 186#L1116-5true, 217#true, 212#true]) [2025-01-09 21:02:40,489 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,489 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,489 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,489 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:02:40,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L1116-4-->L1116-5: Formula: (= |v_#race_1| (store |v_#race_2| v_~v~0.base_3 (store (select |v_#race_2| v_~v~0.base_3) v_~v~0.offset_3 |v_thread2Thread1of1ForFork4_#t~nondet5_3|))) InVars {#race=|v_#race_2|, ~v~0.offset=v_~v~0.offset_3, thread2Thread1of1ForFork4_#t~nondet5=|v_thread2Thread1of1ForFork4_#t~nondet5_3|, ~v~0.base=v_~v~0.base_3} OutVars{#race=|v_#race_1|, ~v~0.offset=v_~v~0.offset_3, thread2Thread1of1ForFork4_#t~nondet5=|v_thread2Thread1of1ForFork4_#t~nondet5_3|, ~v~0.base=v_~v~0.base_3} AuxVars[] AssignedVars[#race][93], [139#L1116-5true, 34#L1142-4true, 8#thread2Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#true, Black: 214#(= (select (select |#race| ~v~0.base) ~v~0.offset) |thread2Thread1of1ForFork0_#t~nondet5|), 210#(= |#race~v~0| 0), 6#L1122true, 91#L1132-4true, 186#L1116-5true, 217#true, 212#true]) [2025-01-09 21:02:40,494 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is not cut-off event [2025-01-09 21:02:40,494 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2025-01-09 21:02:40,494 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2025-01-09 21:02:40,494 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2025-01-09 21:02:40,509 INFO L124 PetriNetUnfolderBase]: 954/2714 cut-off events. [2025-01-09 21:02:40,509 INFO L125 PetriNetUnfolderBase]: For 881/1071 co-relation queries the response was YES. [2025-01-09 21:02:40,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5520 conditions, 2714 events. 954/2714 cut-off events. For 881/1071 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 23160 event pairs, 365 based on Foata normal form. 2/2302 useless extension candidates. Maximal degree in co-relation 5488. Up to 1059 conditions per place. [2025-01-09 21:02:40,532 INFO L140 encePairwiseOnDemand]: 188/195 looper letters, 33 selfloop transitions, 9 changer transitions 0/144 dead transitions. [2025-01-09 21:02:40,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 144 transitions, 465 flow [2025-01-09 21:02:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-01-09 21:02:40,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8341880341880342 [2025-01-09 21:02:40,534 INFO L175 Difference]: Start difference. First operand has 133 places, 133 transitions, 339 flow. Second operand 3 states and 488 transitions. [2025-01-09 21:02:40,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 144 transitions, 465 flow [2025-01-09 21:02:40,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 144 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:40,545 INFO L231 Difference]: Finished difference. Result has 135 places, 140 transitions, 403 flow [2025-01-09 21:02:40,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=135, PETRI_TRANSITIONS=140} [2025-01-09 21:02:40,547 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -9 predicate places. [2025-01-09 21:02:40,547 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 140 transitions, 403 flow [2025-01-09 21:02:40,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:40,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:40,548 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] [2025-01-09 21:02:40,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:02:40,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-09 21:02:40,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1118394648, now seen corresponding path program 1 times [2025-01-09 21:02:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:40,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627549839] [2025-01-09 21:02:40,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:40,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:40,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:02:40,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:02:40,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:40,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:02:40,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:02:40,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:02:40,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:02:40,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:40,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:02:40,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:02:40,621 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:02:40,621 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-01-09 21:02:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 27 remaining) [2025-01-09 21:02:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 27 remaining) [2025-01-09 21:02:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 27 remaining) [2025-01-09 21:02:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 27 remaining) [2025-01-09 21:02:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 27 remaining) [2025-01-09 21:02:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-01-09 21:02:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-01-09 21:02:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-01-09 21:02:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-01-09 21:02:40,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-01-09 21:02:40,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-01-09 21:02:40,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-01-09 21:02:40,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-01-09 21:02:40,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-01-09 21:02:40,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:02:40,626 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:02:40,684 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:02:40,687 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:02:40,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:02:40 BasicIcfg [2025-01-09 21:02:40,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:02:40,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:02:40,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:02:40,693 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:02:40,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:38" (3/4) ... [2025-01-09 21:02:40,694 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:02:40,764 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-01-09 21:02:40,796 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:02:40,797 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:02:40,797 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:02:40,799 INFO L158 Benchmark]: Toolchain (without parser) took 2872.67ms. Allocated memory is still 201.3MB. Free memory was 157.1MB in the beginning and 162.9MB in the end (delta: -5.9MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. [2025-01-09 21:02:40,799 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 218.1MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:40,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.50ms. Allocated memory is still 201.3MB. Free memory was 157.1MB in the beginning and 124.8MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:02:40,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.65ms. Allocated memory is still 201.3MB. Free memory was 124.8MB in the beginning and 123.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:40,799 INFO L158 Benchmark]: Boogie Preprocessor took 16.70ms. Allocated memory is still 201.3MB. Free memory was 123.0MB in the beginning and 121.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:40,799 INFO L158 Benchmark]: RCFGBuilder took 342.70ms. Allocated memory is still 201.3MB. Free memory was 121.7MB in the beginning and 107.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:02:40,799 INFO L158 Benchmark]: TraceAbstraction took 1999.53ms. Allocated memory is still 201.3MB. Free memory was 106.5MB in the beginning and 64.8MB in the end (delta: 41.7MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-01-09 21:02:40,799 INFO L158 Benchmark]: Witness Printer took 104.65ms. Allocated memory is still 201.3MB. Free memory was 64.8MB in the beginning and 162.9MB in the end (delta: -98.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:02:40,800 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.21ms. Allocated memory is still 218.1MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.50ms. Allocated memory is still 201.3MB. Free memory was 157.1MB in the beginning and 124.8MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.65ms. Allocated memory is still 201.3MB. Free memory was 124.8MB in the beginning and 123.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.70ms. Allocated memory is still 201.3MB. Free memory was 123.0MB in the beginning and 121.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 342.70ms. Allocated memory is still 201.3MB. Free memory was 121.7MB in the beginning and 107.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1999.53ms. Allocated memory is still 201.3MB. Free memory was 106.5MB in the beginning and 64.8MB in the end (delta: 41.7MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 104.65ms. Allocated memory is still 201.3MB. Free memory was 64.8MB in the beginning and 162.9MB in the end (delta: -98.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1116]: Data race detected Data race detected The following path leads to a data race: [L1108] 0 char *v; VAL [v={0:0}] [L1141] 0 pthread_t t; VAL [v={0:0}] [L1142] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [\old(arg)={0:0}, t=-3, v={0:0}] [L1126] 1 pthread_t t1, t2, t3, t4, t5; VAL [\old(arg)={0:0}, arg={0:0}, v={0:0}] [L1127] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, t1=-2, v={0:0}] [L1111] 2 v = malloc(sizeof(char)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, t1=-2, v={-1:0}] [L1112] 2 return 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, v={-1:0}] [L1128] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, v={-1:0}] [L1129] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, v={-1:0}] [L1130] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1116] EXPR 3 v[0] VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1121] EXPR 4 v[0] VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1121] 4 v[0] = 'Y' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1116] EXPR 3 v[0] VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1116] 3 v[0] = 'X' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1121] 4 v[0] = 'Y' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L1116] 3 v[0] = 'X' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: v[0] [1121] * C: v[0] [1116] * C: v[0] = 'Y' [1121] * C: v = malloc(sizeof(char)) [1111] and C: v[0] = 'X' [1116] - UnprovableResult [Line: 1131]: 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: 1127]: 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: 1132]: 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: 1130]: 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: 1129]: 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: 1111]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1116]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1121]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1121]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1144]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1144]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1142]: 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: 1130]: 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: 1127]: 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: 1131]: 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: 1129]: 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: 1132]: 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 11 procedures, 242 locations, 27 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263 IncrementalHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 12 mSDtfsCounter, 263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 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-01-09 21:02:40,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)