./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems-b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems-b.c -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 b4380a4f51f7a259a7430dc3cfcd9d2028a59a15b5d4a5d1bc3a5eedf5d3cc23 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:12:52,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:12:52,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:12:52,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:12:52,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:12:52,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:12:52,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:12:52,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:12:52,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:12:52,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:12:52,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:12:52,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:12:52,788 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:12:52,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:12:52,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:12:52,790 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:12:52,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:12:52,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:12:52,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:12:52,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:52,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:12:52,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:12:52,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:12:52,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:52,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:12:52,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:12:52,791 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:12:52,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:12:52,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:12:52,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:12:52,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:12:52,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:12:52,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:12:52,791 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 -> b4380a4f51f7a259a7430dc3cfcd9d2028a59a15b5d4a5d1bc3a5eedf5d3cc23 [2025-04-29 11:12:52,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:12:53,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:12:53,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:12:53,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:12:53,007 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:12:53,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems-b.c [2025-04-29 11:12:54,200 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889bc0f9f/a4d8fd4d43ea4ca1a6918a9c872c6d24/FLAG74313ab65 [2025-04-29 11:12:54,391 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:12:54,392 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems-b.c [2025-04-29 11:12:54,393 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:54,393 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:54,393 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:54,393 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:54,398 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889bc0f9f/a4d8fd4d43ea4ca1a6918a9c872c6d24/FLAG74313ab65 [2025-04-29 11:12:55,401 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889bc0f9f/a4d8fd4d43ea4ca1a6918a9c872c6d24 [2025-04-29 11:12:55,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:12:55,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:12:55,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:12:55,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:12:55,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:12:55,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23308c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55, skipping insertion in model container [2025-04-29 11:12:55,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:12:55,571 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:12:55,577 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:12:55,597 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:12:55,624 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:12:55,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55 WrapperNode [2025-04-29 11:12:55,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:12:55,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:12:55,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:12:55,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:12:55,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,649 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2025-04-29 11:12:55,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:12:55,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:12:55,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:12:55,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:12:55,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:12:55,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:12:55,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:12:55,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:12:55,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (1/1) ... [2025-04-29 11:12:55,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:55,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:12:55,696 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-04-29 11:12:55,698 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-04-29 11:12:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2025-04-29 11:12:55,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2025-04-29 11:12:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-29 11:12:55,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-29 11:12:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-29 11:12:55,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-29 11:12:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-29 11:12:55,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-29 11:12:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:12:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:12:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:12:55,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:12:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:12:55,715 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:12:55,776 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:12:55,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:12:55,909 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:12:55,909 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:12:55,921 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:12:55,921 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:12:55,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:55 BoogieIcfgContainer [2025-04-29 11:12:55,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:12:55,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:12:55,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:12:55,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:12:55,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:12:55" (1/3) ... [2025-04-29 11:12:55,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff6d8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:12:55, skipping insertion in model container [2025-04-29 11:12:55,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:55" (2/3) ... [2025-04-29 11:12:55,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff6d8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:12:55, skipping insertion in model container [2025-04-29 11:12:55,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:55" (3/3) ... [2025-04-29 11:12:55,931 INFO L128 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems-b.c [2025-04-29 11:12:55,943 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:12:55,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG singleton_with-uninit-problems-b.c that has 5 procedures, 128 locations, 125 edges, 1 initial locations, 0 loop locations, and 9 error locations. [2025-04-29 11:12:55,944 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:12:56,048 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-04-29 11:12:56,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 198 transitions, 493 flow [2025-04-29 11:12:56,135 INFO L116 PetriNetUnfolderBase]: 7/154 cut-off events. [2025-04-29 11:12:56,136 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:12:56,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 154 events. 7/154 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 171 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 136. Up to 3 conditions per place. [2025-04-29 11:12:56,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 198 transitions, 493 flow [2025-04-29 11:12:56,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 135 transitions, 321 flow [2025-04-29 11:12:56,153 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:56,160 INFO L340 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;@54195fd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:56,160 INFO L341 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-04-29 11:12:56,166 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:56,167 INFO L116 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-04-29 11:12:56,167 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:56,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:56,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:56,168 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-04-29 11:12:56,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:56,172 INFO L85 PathProgramCache]: Analyzing trace with hash 439870355, now seen corresponding path program 1 times [2025-04-29 11:12:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:56,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493819016] [2025-04-29 11:12:56,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:56,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:12:56,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:12:56,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:56,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:56,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:56,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493819016] [2025-04-29 11:12:56,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493819016] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:56,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:56,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:56,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650900346] [2025-04-29 11:12:56,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:56,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:56,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:56,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:56,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:56,380 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 200 [2025-04-29 11:12:56,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 135 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-04-29 11:12:56,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:56,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 200 [2025-04-29 11:12:56,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:56,526 INFO L116 PetriNetUnfolderBase]: 67/529 cut-off events. [2025-04-29 11:12:56,526 INFO L117 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-04-29 11:12:56,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 529 events. 67/529 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2590 event pairs, 51 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 685. Up to 121 conditions per place. [2025-04-29 11:12:56,534 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 25 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-04-29 11:12:56,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 134 transitions, 373 flow [2025-04-29 11:12:56,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-04-29 11:12:56,547 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2025-04-29 11:12:56,549 INFO L175 Difference]: Start difference. First operand has 149 places, 135 transitions, 321 flow. Second operand 3 states and 496 transitions. [2025-04-29 11:12:56,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 134 transitions, 373 flow [2025-04-29 11:12:56,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 134 transitions, 339 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-29 11:12:56,557 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 289 flow [2025-04-29 11:12:56,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2025-04-29 11:12:56,562 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -11 predicate places. [2025-04-29 11:12:56,562 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 289 flow [2025-04-29 11:12:56,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-04-29 11:12:56,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:56,563 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] [2025-04-29 11:12:56,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:12:56,564 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-04-29 11:12:56,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:56,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1957271124, now seen corresponding path program 1 times [2025-04-29 11:12:56,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:56,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795099899] [2025-04-29 11:12:56,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:56,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:56,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:12:56,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:12:56,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:56,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:56,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795099899] [2025-04-29 11:12:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795099899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015777659] [2025-04-29 11:12:56,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:56,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:56,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:56,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:56,664 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 200 [2025-04-29 11:12:56,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-04-29 11:12:56,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:56,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 200 [2025-04-29 11:12:56,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:56,814 INFO L116 PetriNetUnfolderBase]: 313/1156 cut-off events. [2025-04-29 11:12:56,814 INFO L117 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-04-29 11:12:56,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1685 conditions, 1156 events. 313/1156 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7610 event pairs, 188 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 1649. Up to 473 conditions per place. [2025-04-29 11:12:56,821 INFO L140 encePairwiseOnDemand]: 190/200 looper letters, 33 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-04-29 11:12:56,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 135 transitions, 368 flow [2025-04-29 11:12:56,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2025-04-29 11:12:56,826 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8116666666666666 [2025-04-29 11:12:56,826 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 289 flow. Second operand 3 states and 487 transitions. [2025-04-29 11:12:56,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 135 transitions, 368 flow [2025-04-29 11:12:56,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 135 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:56,830 INFO L231 Difference]: Finished difference. Result has 133 places, 132 transitions, 301 flow [2025-04-29 11:12:56,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=133, PETRI_TRANSITIONS=132} [2025-04-29 11:12:56,831 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -16 predicate places. [2025-04-29 11:12:56,831 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 132 transitions, 301 flow [2025-04-29 11:12:56,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-04-29 11:12:56,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:56,832 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-04-29 11:12:56,832 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:12:56,832 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-04-29 11:12:56,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1038337425, now seen corresponding path program 1 times [2025-04-29 11:12:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:56,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219139627] [2025-04-29 11:12:56,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:56,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:12:56,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:12:56,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:56,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:56,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:56,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219139627] [2025-04-29 11:12:56,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219139627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:56,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:56,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:56,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249969368] [2025-04-29 11:12:56,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:56,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:56,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:56,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:56,981 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 200 [2025-04-29 11:12:56,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 132 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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-04-29 11:12:56,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:56,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 200 [2025-04-29 11:12:56,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:57,117 INFO L116 PetriNetUnfolderBase]: 330/1244 cut-off events. [2025-04-29 11:12:57,118 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-29 11:12:57,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1244 events. 330/1244 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9364 event pairs, 193 based on Foata normal form. 0/1034 useless extension candidates. Maximal degree in co-relation 1854. Up to 448 conditions per place. [2025-04-29 11:12:57,126 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 31 selfloop transitions, 6 changer transitions 0/140 dead transitions. [2025-04-29 11:12:57,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 140 transitions, 394 flow [2025-04-29 11:12:57,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-04-29 11:12:57,128 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8383333333333334 [2025-04-29 11:12:57,128 INFO L175 Difference]: Start difference. First operand has 133 places, 132 transitions, 301 flow. Second operand 3 states and 503 transitions. [2025-04-29 11:12:57,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 140 transitions, 394 flow [2025-04-29 11:12:57,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 140 transitions, 394 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:57,130 INFO L231 Difference]: Finished difference. Result has 137 places, 137 transitions, 347 flow [2025-04-29 11:12:57,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=137, PETRI_TRANSITIONS=137} [2025-04-29 11:12:57,131 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -12 predicate places. [2025-04-29 11:12:57,131 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 137 transitions, 347 flow [2025-04-29 11:12:57,132 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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-04-29 11:12:57,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:57,132 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] [2025-04-29 11:12:57,132 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:12:57,132 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-04-29 11:12:57,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:57,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1113483677, now seen corresponding path program 1 times [2025-04-29 11:12:57,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:57,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243238483] [2025-04-29 11:12:57,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:57,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:57,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:12:57,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:12:57,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:57,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:12:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:57,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243238483] [2025-04-29 11:12:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243238483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917133181] [2025-04-29 11:12:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:57,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:57,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:57,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:57,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 200 [2025-04-29 11:12:57,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-04-29 11:12:57,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:57,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 200 [2025-04-29 11:12:57,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:57,443 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L29-4-->L29-5: Formula: (= (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_thread2Thread1of1ForFork5_#t~nondet2_3|)) |v_#race_1|) InVars {#race=|v_#race_2|, thread2Thread1of1ForFork5_#t~nondet2=|v_thread2Thread1of1ForFork5_#t~nondet2_3|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} OutVars{#race=|v_#race_1|, thread2Thread1of1ForFork5_#t~nondet2=|v_thread2Thread1of1ForFork5_#t~nondet2_3|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} AuxVars[] AssignedVars[#race][120], [Black: 219#(= (select (select |#race| ~v~0.base) ~v~0.offset) |thread2Thread1of1ForFork0_#t~nondet2|), 33#L61-4true, 179#L29-5true, 181#L48-4true, 175#L35-6true, 3#L29-6true, 28#L29-5true, 215#(= |#race~v~0| 0), Black: 213#true, 222#true, 217#true]) [2025-04-29 11:12:57,443 INFO L286 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-04-29 11:12:57,443 INFO L289 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-04-29 11:12:57,444 INFO L289 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-04-29 11:12:57,444 INFO L289 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-04-29 11:12:57,464 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L29-4-->L29-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~nondet2_3|))) InVars {#race=|v_#race_2|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{#race=|v_#race_1|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[#race][122], [69#L36true, Black: 219#(= (select (select |#race| ~v~0.base) ~v~0.offset) |thread2Thread1of1ForFork0_#t~nondet2|), 179#L29-5true, 33#L61-4true, 181#L48-4true, 3#L29-6true, 28#L29-5true, 215#(= |#race~v~0| 0), Black: 213#true, 222#true, 217#true]) [2025-04-29 11:12:57,464 INFO L286 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,464 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,465 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,465 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,489 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L29-4-->L29-5: Formula: (= (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_thread2Thread1of1ForFork5_#t~nondet2_3|)) |v_#race_1|) InVars {#race=|v_#race_2|, thread2Thread1of1ForFork5_#t~nondet2=|v_thread2Thread1of1ForFork5_#t~nondet2_3|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} OutVars{#race=|v_#race_1|, thread2Thread1of1ForFork5_#t~nondet2=|v_thread2Thread1of1ForFork5_#t~nondet2_3|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} AuxVars[] AssignedVars[#race][111], [69#L36true, Black: 219#(= (select (select |#race| ~v~0.base) ~v~0.offset) |thread2Thread1of1ForFork0_#t~nondet2|), 179#L29-5true, 33#L61-4true, 181#L48-4true, 3#L29-6true, 28#L29-5true, 215#(= |#race~v~0| 0), 222#true, Black: 213#true, 217#true]) [2025-04-29 11:12:57,489 INFO L286 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,489 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,489 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,489 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,490 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([323] L29-4-->L29-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~nondet2_3|))) InVars {#race=|v_#race_2|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} OutVars{#race=|v_#race_1|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3, thread2Thread1of1ForFork1_#t~nondet2=|v_thread2Thread1of1ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[#race][112], [69#L36true, 4#thread2Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 219#(= (select (select |#race| ~v~0.base) ~v~0.offset) |thread2Thread1of1ForFork0_#t~nondet2|), 179#L29-5true, 33#L61-4true, 181#L48-4true, 28#L29-5true, 215#(= |#race~v~0| 0), Black: 213#true, 222#true, 217#true]) [2025-04-29 11:12:57,490 INFO L286 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,490 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,491 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,491 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,503 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L29-4-->L29-5: Formula: (= (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_thread2Thread1of1ForFork5_#t~nondet2_3|)) |v_#race_1|) InVars {#race=|v_#race_2|, thread2Thread1of1ForFork5_#t~nondet2=|v_thread2Thread1of1ForFork5_#t~nondet2_3|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} OutVars{#race=|v_#race_1|, thread2Thread1of1ForFork5_#t~nondet2=|v_thread2Thread1of1ForFork5_#t~nondet2_3|, ~v~0.offset=v_~v~0.offset_3, ~v~0.base=v_~v~0.base_3} AuxVars[] AssignedVars[#race][89], [69#L36true, Black: 219#(= (select (select |#race| ~v~0.base) ~v~0.offset) |thread2Thread1of1ForFork0_#t~nondet2|), 4#thread2Err1ASSERT_VIOLATIONDATA_RACEtrue, 33#L61-4true, 179#L29-5true, 181#L48-4true, 28#L29-5true, 215#(= |#race~v~0| 0), 222#true, Black: 213#true, 217#true]) [2025-04-29 11:12:57,504 INFO L286 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,504 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,504 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,504 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:12:57,519 INFO L116 PetriNetUnfolderBase]: 967/2690 cut-off events. [2025-04-29 11:12:57,520 INFO L117 PetriNetUnfolderBase]: For 876/1135 co-relation queries the response was YES. [2025-04-29 11:12:57,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5501 conditions, 2690 events. 967/2690 cut-off events. For 876/1135 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22872 event pairs, 374 based on Foata normal form. 1/2266 useless extension candidates. Maximal degree in co-relation 5464. Up to 1070 conditions per place. [2025-04-29 11:12:57,539 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 34 selfloop transitions, 9 changer transitions 0/148 dead transitions. [2025-04-29 11:12:57,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 148 transitions, 475 flow [2025-04-29 11:12:57,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2025-04-29 11:12:57,541 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.84 [2025-04-29 11:12:57,541 INFO L175 Difference]: Start difference. First operand has 137 places, 137 transitions, 347 flow. Second operand 3 states and 504 transitions. [2025-04-29 11:12:57,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 148 transitions, 475 flow [2025-04-29 11:12:57,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 148 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:57,551 INFO L231 Difference]: Finished difference. Result has 139 places, 144 transitions, 411 flow [2025-04-29 11:12:57,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=139, PETRI_TRANSITIONS=144} [2025-04-29 11:12:57,552 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -10 predicate places. [2025-04-29 11:12:57,552 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 144 transitions, 411 flow [2025-04-29 11:12:57,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-04-29 11:12:57,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:57,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:57,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:12:57,553 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-04-29 11:12:57,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:57,554 INFO L85 PathProgramCache]: Analyzing trace with hash 437800456, now seen corresponding path program 1 times [2025-04-29 11:12:57,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:57,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521186043] [2025-04-29 11:12:57,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:57,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:57,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:12:57,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:12:57,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:57,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:57,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:57,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:12:57,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:12:57,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:57,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:57,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:57,622 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:57,622 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-04-29 11:12:57,624 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-04-29 11:12:57,625 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-04-29 11:12:57,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-04-29 11:12:57,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-04-29 11:12:57,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-04-29 11:12:57,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-04-29 11:12:57,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-04-29 11:12:57,626 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-04-29 11:12:57,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:12:57,626 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-29 11:12:57,694 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:12:57,694 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:12:57,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:12:57 BasicIcfg [2025-04-29 11:12:57,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:12:57,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:12:57,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:12:57,700 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:12:57,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:55" (3/4) ... [2025-04-29 11:12:57,701 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:12:57,746 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-04-29 11:12:57,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:12:57,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:12:57,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:12:57,773 INFO L158 Benchmark]: Toolchain (without parser) took 2369.72ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 113.8MB in the beginning and 198.2MB in the end (delta: -84.4MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2025-04-29 11:12:57,774 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:57,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.93ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 99.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:12:57,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.74ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:57,774 INFO L158 Benchmark]: Boogie Preprocessor took 20.69ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 97.2MB in the end (delta: 792.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:57,774 INFO L158 Benchmark]: RCFGBuilder took 249.38ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 82.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:12:57,774 INFO L158 Benchmark]: TraceAbstraction took 1774.38ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 82.0MB in the beginning and 213.2MB in the end (delta: -131.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:57,774 INFO L158 Benchmark]: Witness Printer took 73.50ms. Allocated memory is still 302.0MB. Free memory was 213.2MB in the beginning and 198.2MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:57,775 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.93ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 99.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.74ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.69ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 97.2MB in the end (delta: 792.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 249.38ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 82.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1774.38ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 82.0MB in the beginning and 213.2MB in the end (delta: -131.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Witness Printer took 73.50ms. Allocated memory is still 302.0MB. Free memory was 213.2MB in the beginning and 198.2MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 29]: Data race detected Data race detected The following path leads to a data race: [L19] 0 char *v; VAL [v={0:0}] [L59] 0 pthread_t t; VAL [v={0:0}] [L61] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [\at(arg, Pre)={0:0}, t=-3, v={0:0}] [L41] 1 pthread_t t1, t2, t3, t4, t5; VAL [\at(arg, Pre)={0:0}, arg={0:0}, v={0:0}] [L43] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, t1=-2, v={0:0}] [L23] 2 v = malloc(sizeof(char)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, t1=-2, v={-1:0}] [L24] 2 return 0; VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, v={-1:0}] [L44] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, v={-1:0}] [L45] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, v={-1:0}] [L29] EXPR 3 v[0] VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, v={-1:0}] [L29] 3 v[0] = 'X' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, v={-1:0}] [L46] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-2, t2=-1, t3=0, v={-1:0}] [L35] EXPR 4 v[0] VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={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}] [L35] 4 v[0] = 'Y' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={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}] [L29] 3 v[0] = 'X' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={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] = 'Y' [35] * C: v = malloc(sizeof(char)) [23] * C: v[0] [29] * C: v[0] [35] and C: v[0] = 'X' [29] - UnprovableResult [Line: 47]: 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: 45]: 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: 48]: 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: 46]: 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: 43]: 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: 23]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 61]: 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: 43]: 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: 47]: 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: 45]: 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: 48]: 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: 46]: 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, 247 locations, 270 edges, 29 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.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 52 mSDtfsCounter, 285 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=411occurred 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.3s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 172 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-04-29 11:12:57,787 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)