./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.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/goblint-regression/02-base_24-malloc_races.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 10776deb9ece8603196e8eecaf972964a6cae8e272af6ac2269e1894470ceda6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:21:32,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:21:32,347 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:21:32,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:21:32,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:21:32,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:21:32,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:21:32,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:21:32,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:21:32,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:21:32,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:21:32,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:21:32,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:21:32,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:21:32,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:21:32,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:21:32,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:21:32,375 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 -> 10776deb9ece8603196e8eecaf972964a6cae8e272af6ac2269e1894470ceda6 [2025-01-09 21:21:32,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:21:32,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:21:32,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:21:32,630 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:21:32,630 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:21:32,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i [2025-01-09 21:21:33,797 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9875740c6/ef3795fa99f540aca8c0f30a7f541ab7/FLAG5a22bc18d [2025-01-09 21:21:34,145 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:21:34,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i [2025-01-09 21:21:34,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9875740c6/ef3795fa99f540aca8c0f30a7f541ab7/FLAG5a22bc18d [2025-01-09 21:21:34,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9875740c6/ef3795fa99f540aca8c0f30a7f541ab7 [2025-01-09 21:21:34,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:21:34,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:21:34,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:21:34,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:21:34,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:21:34,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f809624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34, skipping insertion in model container [2025-01-09 21:21:34,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:21:34,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:21:34,588 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:21:34,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:21:34,680 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:21:34,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34 WrapperNode [2025-01-09 21:21:34,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:21:34,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:21:34,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:21:34,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:21:34,686 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:21:34" (1/1) ... [2025-01-09 21:21:34,697 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:21:34" (1/1) ... [2025-01-09 21:21:34,710 INFO L138 Inliner]: procedures = 365, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2025-01-09 21:21:34,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:21:34,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:21:34,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:21:34,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:21:34,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,725 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:21:34,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:21:34,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:21:34,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:21:34,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (1/1) ... [2025-01-09 21:21:34,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:21:34,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:21:34,757 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:21:34,759 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:21:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:21:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:21:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:21:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:21:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:21:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:21:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:21:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:21:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:21:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:21:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:21:34,777 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:21:34,872 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:21:34,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:21:35,040 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:21:35,041 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:21:35,055 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:21:35,055 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:21:35,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:21:35 BoogieIcfgContainer [2025-01-09 21:21:35,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:21:35,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:21:35,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:21:35,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:21:35,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:21:34" (1/3) ... [2025-01-09 21:21:35,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1083f57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:21:35, skipping insertion in model container [2025-01-09 21:21:35,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:21:34" (2/3) ... [2025-01-09 21:21:35,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1083f57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:21:35, skipping insertion in model container [2025-01-09 21:21:35,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:21:35" (3/3) ... [2025-01-09 21:21:35,063 INFO L128 eAbstractionObserver]: Analyzing ICFG 02-base_24-malloc_races.i [2025-01-09 21:21:35,073 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:21:35,075 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02-base_24-malloc_races.i that has 2 procedures, 103 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-01-09 21:21:35,075 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:21:35,112 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:21:35,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 102 transitions, 208 flow [2025-01-09 21:21:35,174 INFO L124 PetriNetUnfolderBase]: 0/101 cut-off events. [2025-01-09 21:21:35,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:21:35,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 101 events. 0/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-09 21:21:35,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 102 transitions, 208 flow [2025-01-09 21:21:35,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 101 transitions, 205 flow [2025-01-09 21:21:35,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:21:35,202 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;@7e96bee4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:21:35,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-09 21:21:35,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:21:35,209 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-01-09 21:21:35,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:21:35,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:35,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:35,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:35,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:35,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1567190117, now seen corresponding path program 1 times [2025-01-09 21:21:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164923263] [2025-01-09 21:21:35,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:35,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 21:21:35,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 21:21:35,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:35,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:35,367 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:21:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164923263] [2025-01-09 21:21:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164923263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:35,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:35,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503034255] [2025-01-09 21:21:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:35,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:35,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:35,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:35,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2025-01-09 21:21:35,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 101 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:21:35,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:35,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2025-01-09 21:21:35,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:35,471 INFO L124 PetriNetUnfolderBase]: 12/232 cut-off events. [2025-01-09 21:21:35,471 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:21:35,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 232 events. 12/232 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 658 event pairs, 12 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 230. Up to 36 conditions per place. [2025-01-09 21:21:35,474 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 11 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-01-09 21:21:35,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 100 transitions, 229 flow [2025-01-09 21:21:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2025-01-09 21:21:35,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2025-01-09 21:21:35,484 INFO L175 Difference]: Start difference. First operand has 105 places, 101 transitions, 205 flow. Second operand 3 states and 278 transitions. [2025-01-09 21:21:35,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 100 transitions, 229 flow [2025-01-09 21:21:35,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 100 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:21:35,490 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 206 flow [2025-01-09 21:21:35,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2025-01-09 21:21:35,493 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 0 predicate places. [2025-01-09 21:21:35,493 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 206 flow [2025-01-09 21:21:35,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:21:35,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:35,494 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-01-09 21:21:35,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:21:35,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:35,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash 166918694, now seen corresponding path program 1 times [2025-01-09 21:21:35,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:35,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122999436] [2025-01-09 21:21:35,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:35,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:21:35,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:21:35,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:35,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:35,543 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:21:35,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:35,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122999436] [2025-01-09 21:21:35,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122999436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:35,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:35,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:35,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888631471] [2025-01-09 21:21:35,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:35,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:35,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:35,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:35,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2025-01-09 21:21:35,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:21:35,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:35,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2025-01-09 21:21:35,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:35,619 INFO L124 PetriNetUnfolderBase]: 12/231 cut-off events. [2025-01-09 21:21:35,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:21:35,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 231 events. 12/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 702 event pairs, 12 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 248. Up to 36 conditions per place. [2025-01-09 21:21:35,622 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 11 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-01-09 21:21:35,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 230 flow [2025-01-09 21:21:35,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:35,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2025-01-09 21:21:35,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2025-01-09 21:21:35,625 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 206 flow. Second operand 3 states and 278 transitions. [2025-01-09 21:21:35,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 230 flow [2025-01-09 21:21:35,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:35,628 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 204 flow [2025-01-09 21:21:35,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2025-01-09 21:21:35,629 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -1 predicate places. [2025-01-09 21:21:35,629 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 204 flow [2025-01-09 21:21:35,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:21:35,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:35,629 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] [2025-01-09 21:21:35,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:21:35,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:35,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1560174162, now seen corresponding path program 1 times [2025-01-09 21:21:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748060747] [2025-01-09 21:21:35,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:35,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:35,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:21:35,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:21:35,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:35,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:35,680 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:21:35,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:35,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748060747] [2025-01-09 21:21:35,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748060747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:35,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:35,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879829990] [2025-01-09 21:21:35,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:35,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:35,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:35,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:35,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 102 [2025-01-09 21:21:35,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:21:35,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:35,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 102 [2025-01-09 21:21:35,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:35,726 INFO L124 PetriNetUnfolderBase]: 16/262 cut-off events. [2025-01-09 21:21:35,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:21:35,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 262 events. 16/262 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 907 event pairs, 7 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 277. Up to 36 conditions per place. [2025-01-09 21:21:35,728 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 12 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-01-09 21:21:35,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 236 flow [2025-01-09 21:21:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-01-09 21:21:35,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934640522875817 [2025-01-09 21:21:35,729 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 204 flow. Second operand 3 states and 286 transitions. [2025-01-09 21:21:35,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 236 flow [2025-01-09 21:21:35,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 101 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:21:35,731 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 210 flow [2025-01-09 21:21:35,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2025-01-09 21:21:35,732 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -2 predicate places. [2025-01-09 21:21:35,732 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 210 flow [2025-01-09 21:21:35,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:21:35,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:35,733 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:21:35,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:21:35,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:35,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash 228185078, now seen corresponding path program 1 times [2025-01-09 21:21:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:35,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806644872] [2025-01-09 21:21:35,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:35,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:35,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:21:35,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:21:35,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:35,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:36,117 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:21:36,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806644872] [2025-01-09 21:21:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806644872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:36,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:36,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473376739] [2025-01-09 21:21:36,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:36,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:21:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:36,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:21:36,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:21:36,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2025-01-09 21:21:36,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 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:21:36,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:36,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2025-01-09 21:21:36,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:36,429 INFO L124 PetriNetUnfolderBase]: 231/883 cut-off events. [2025-01-09 21:21:36,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:21:36,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 883 events. 231/883 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5174 event pairs, 96 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 1360. Up to 348 conditions per place. [2025-01-09 21:21:36,434 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 51 selfloop transitions, 41 changer transitions 0/163 dead transitions. [2025-01-09 21:21:36,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 163 transitions, 522 flow [2025-01-09 21:21:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:21:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:21:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions. [2025-01-09 21:21:36,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8774509803921569 [2025-01-09 21:21:36,436 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 210 flow. Second operand 6 states and 537 transitions. [2025-01-09 21:21:36,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 163 transitions, 522 flow [2025-01-09 21:21:36,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 163 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:21:36,439 INFO L231 Difference]: Finished difference. Result has 112 places, 141 transitions, 468 flow [2025-01-09 21:21:36,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=112, PETRI_TRANSITIONS=141} [2025-01-09 21:21:36,439 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2025-01-09 21:21:36,440 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 141 transitions, 468 flow [2025-01-09 21:21:36,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 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:21:36,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:36,440 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] [2025-01-09 21:21:36,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:21:36,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:36,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash 712846405, now seen corresponding path program 1 times [2025-01-09 21:21:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:36,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700360574] [2025-01-09 21:21:36,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:36,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:21:36,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:21:36,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:36,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:36,713 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:21:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700360574] [2025-01-09 21:21:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700360574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:36,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49179184] [2025-01-09 21:21:36,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:36,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:21:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:36,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:21:36,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:21:36,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2025-01-09 21:21:36,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 141 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 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:21:36,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:36,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2025-01-09 21:21:36,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:37,218 INFO L124 PetriNetUnfolderBase]: 285/1200 cut-off events. [2025-01-09 21:21:37,218 INFO L125 PetriNetUnfolderBase]: For 367/441 co-relation queries the response was YES. [2025-01-09 21:21:37,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2467 conditions, 1200 events. 285/1200 cut-off events. For 367/441 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8271 event pairs, 29 based on Foata normal form. 31/1165 useless extension candidates. Maximal degree in co-relation 2422. Up to 272 conditions per place. [2025-01-09 21:21:37,227 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 71 selfloop transitions, 48 changer transitions 0/216 dead transitions. [2025-01-09 21:21:37,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 216 transitions, 970 flow [2025-01-09 21:21:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:21:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:21:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2025-01-09 21:21:37,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9264705882352942 [2025-01-09 21:21:37,230 INFO L175 Difference]: Start difference. First operand has 112 places, 141 transitions, 468 flow. Second operand 6 states and 567 transitions. [2025-01-09 21:21:37,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 216 transitions, 970 flow [2025-01-09 21:21:37,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 216 transitions, 970 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:21:37,241 INFO L231 Difference]: Finished difference. Result has 122 places, 187 transitions, 874 flow [2025-01-09 21:21:37,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=874, PETRI_PLACES=122, PETRI_TRANSITIONS=187} [2025-01-09 21:21:37,243 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 17 predicate places. [2025-01-09 21:21:37,245 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 187 transitions, 874 flow [2025-01-09 21:21:37,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 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:21:37,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:37,246 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] [2025-01-09 21:21:37,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:21:37,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:37,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1071308684, now seen corresponding path program 1 times [2025-01-09 21:21:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033515440] [2025-01-09 21:21:37,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:37,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:37,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:21:37,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:21:37,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:37,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:37,284 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:21:37,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:37,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033515440] [2025-01-09 21:21:37,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033515440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:37,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:37,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:21:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113758332] [2025-01-09 21:21:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:37,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:37,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:37,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:37,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 102 [2025-01-09 21:21:37,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 187 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:21:37,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:37,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 102 [2025-01-09 21:21:37,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:37,418 INFO L124 PetriNetUnfolderBase]: 231/1142 cut-off events. [2025-01-09 21:21:37,418 INFO L125 PetriNetUnfolderBase]: For 568/631 co-relation queries the response was YES. [2025-01-09 21:21:37,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 1142 events. 231/1142 cut-off events. For 568/631 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8031 event pairs, 24 based on Foata normal form. 14/1112 useless extension candidates. Maximal degree in co-relation 2406. Up to 215 conditions per place. [2025-01-09 21:21:37,425 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 13 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-01-09 21:21:37,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 190 transitions, 910 flow [2025-01-09 21:21:37,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-01-09 21:21:37,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2025-01-09 21:21:37,431 INFO L175 Difference]: Start difference. First operand has 122 places, 187 transitions, 874 flow. Second operand 3 states and 287 transitions. [2025-01-09 21:21:37,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 190 transitions, 910 flow [2025-01-09 21:21:37,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 190 transitions, 902 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-09 21:21:37,441 INFO L231 Difference]: Finished difference. Result has 123 places, 187 transitions, 876 flow [2025-01-09 21:21:37,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=123, PETRI_TRANSITIONS=187} [2025-01-09 21:21:37,442 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 18 predicate places. [2025-01-09 21:21:37,445 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 187 transitions, 876 flow [2025-01-09 21:21:37,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:21:37,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:37,446 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] [2025-01-09 21:21:37,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:21:37,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:37,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:37,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1425661799, now seen corresponding path program 1 times [2025-01-09 21:21:37,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:37,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187517275] [2025-01-09 21:21:37,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:37,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:37,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:21:37,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:21:37,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:37,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:37,559 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:21:37,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187517275] [2025-01-09 21:21:37,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187517275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:37,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:37,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:21:37,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247744376] [2025-01-09 21:21:37,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:37,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:21:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:37,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:21:37,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:21:37,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 102 [2025-01-09 21:21:37,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 187 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:21:37,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:37,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 102 [2025-01-09 21:21:37,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:37,631 INFO L124 PetriNetUnfolderBase]: 40/302 cut-off events. [2025-01-09 21:21:37,631 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-01-09 21:21:37,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 302 events. 40/302 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1117 event pairs, 4 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 523. Up to 68 conditions per place. [2025-01-09 21:21:37,633 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 2 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-01-09 21:21:37,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 422 flow [2025-01-09 21:21:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:21:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:21:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-01-09 21:21:37,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9673202614379085 [2025-01-09 21:21:37,634 INFO L175 Difference]: Start difference. First operand has 123 places, 187 transitions, 876 flow. Second operand 3 states and 296 transitions. [2025-01-09 21:21:37,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 422 flow [2025-01-09 21:21:37,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 372 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-01-09 21:21:37,640 INFO L231 Difference]: Finished difference. Result has 116 places, 120 transitions, 368 flow [2025-01-09 21:21:37,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=116, PETRI_TRANSITIONS=120} [2025-01-09 21:21:37,641 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 11 predicate places. [2025-01-09 21:21:37,641 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 120 transitions, 368 flow [2025-01-09 21:21:37,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:21:37,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:37,642 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:21:37,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:21:37,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:37,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:37,642 INFO L85 PathProgramCache]: Analyzing trace with hash 793310716, now seen corresponding path program 1 times [2025-01-09 21:21:37,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:37,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010517923] [2025-01-09 21:21:37,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:37,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:37,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:21:37,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:21:37,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:37,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:37,938 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:21:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010517923] [2025-01-09 21:21:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010517923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:37,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:37,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:37,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011782866] [2025-01-09 21:21:37,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:37,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:21:37,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:37,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:21:37,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:21:38,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2025-01-09 21:21:38,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 120 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 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:21:38,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:38,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2025-01-09 21:21:38,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:38,153 INFO L124 PetriNetUnfolderBase]: 142/645 cut-off events. [2025-01-09 21:21:38,154 INFO L125 PetriNetUnfolderBase]: For 114/129 co-relation queries the response was YES. [2025-01-09 21:21:38,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 645 events. 142/645 cut-off events. For 114/129 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3453 event pairs, 35 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 1226. Up to 231 conditions per place. [2025-01-09 21:21:38,157 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 59 selfloop transitions, 25 changer transitions 4/160 dead transitions. [2025-01-09 21:21:38,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 160 transitions, 656 flow [2025-01-09 21:21:38,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:21:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:21:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2025-01-09 21:21:38,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8382352941176471 [2025-01-09 21:21:38,159 INFO L175 Difference]: Start difference. First operand has 116 places, 120 transitions, 368 flow. Second operand 6 states and 513 transitions. [2025-01-09 21:21:38,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 160 transitions, 656 flow [2025-01-09 21:21:38,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 160 transitions, 652 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:21:38,162 INFO L231 Difference]: Finished difference. Result has 124 places, 145 transitions, 552 flow [2025-01-09 21:21:38,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=124, PETRI_TRANSITIONS=145} [2025-01-09 21:21:38,163 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 19 predicate places. [2025-01-09 21:21:38,163 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 145 transitions, 552 flow [2025-01-09 21:21:38,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 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:21:38,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:38,163 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] [2025-01-09 21:21:38,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:21:38,163 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:38,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1221870245, now seen corresponding path program 1 times [2025-01-09 21:21:38,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:38,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033215113] [2025-01-09 21:21:38,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:38,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:21:38,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:21:38,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:38,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:21:38,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:38,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033215113] [2025-01-09 21:21:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033215113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:38,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:21:38,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683776932] [2025-01-09 21:21:38,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:38,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:21:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:38,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:21:38,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:21:38,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2025-01-09 21:21:38,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 145 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 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:21:38,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:38,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2025-01-09 21:21:38,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:38,739 INFO L124 PetriNetUnfolderBase]: 204/839 cut-off events. [2025-01-09 21:21:38,740 INFO L125 PetriNetUnfolderBase]: For 456/476 co-relation queries the response was YES. [2025-01-09 21:21:38,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 839 events. 204/839 cut-off events. For 456/476 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4982 event pairs, 16 based on Foata normal form. 22/859 useless extension candidates. Maximal degree in co-relation 2122. Up to 239 conditions per place. [2025-01-09 21:21:38,744 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 65 selfloop transitions, 51 changer transitions 24/219 dead transitions. [2025-01-09 21:21:38,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 219 transitions, 1178 flow [2025-01-09 21:21:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:21:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:21:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 563 transitions. [2025-01-09 21:21:38,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9199346405228758 [2025-01-09 21:21:38,745 INFO L175 Difference]: Start difference. First operand has 124 places, 145 transitions, 552 flow. Second operand 6 states and 563 transitions. [2025-01-09 21:21:38,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 219 transitions, 1178 flow [2025-01-09 21:21:38,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 219 transitions, 1164 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-01-09 21:21:38,751 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 922 flow [2025-01-09 21:21:38,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2025-01-09 21:21:38,752 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 28 predicate places. [2025-01-09 21:21:38,752 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 922 flow [2025-01-09 21:21:38,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 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:21:38,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:38,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:21:38,752 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:38,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:38,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1326670820, now seen corresponding path program 1 times [2025-01-09 21:21:38,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:38,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864445819] [2025-01-09 21:21:38,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:38,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:38,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:21:38,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:21:38,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:38,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:21:39,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:39,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864445819] [2025-01-09 21:21:39,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864445819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:39,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:39,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:21:39,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922109630] [2025-01-09 21:21:39,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:39,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:21:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:39,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:21:39,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:21:39,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2025-01-09 21:21:39,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 179 transitions, 922 flow. Second operand has 11 states, 11 states have (on average 68.27272727272727) internal successors, (751), 11 states have internal predecessors, (751), 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:21:39,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:39,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2025-01-09 21:21:39,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:39,708 INFO L124 PetriNetUnfolderBase]: 220/863 cut-off events. [2025-01-09 21:21:39,708 INFO L125 PetriNetUnfolderBase]: For 1081/1108 co-relation queries the response was YES. [2025-01-09 21:21:39,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2700 conditions, 863 events. 220/863 cut-off events. For 1081/1108 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5346 event pairs, 46 based on Foata normal form. 12/857 useless extension candidates. Maximal degree in co-relation 2635. Up to 299 conditions per place. [2025-01-09 21:21:39,715 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 94 selfloop transitions, 31 changer transitions 4/205 dead transitions. [2025-01-09 21:21:39,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 205 transitions, 1408 flow [2025-01-09 21:21:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:21:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:21:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 848 transitions. [2025-01-09 21:21:39,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6928104575163399 [2025-01-09 21:21:39,719 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 922 flow. Second operand 12 states and 848 transitions. [2025-01-09 21:21:39,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 205 transitions, 1408 flow [2025-01-09 21:21:39,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 205 transitions, 1359 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-01-09 21:21:39,732 INFO L231 Difference]: Finished difference. Result has 139 places, 178 transitions, 931 flow [2025-01-09 21:21:39,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=931, PETRI_PLACES=139, PETRI_TRANSITIONS=178} [2025-01-09 21:21:39,734 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 34 predicate places. [2025-01-09 21:21:39,735 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 178 transitions, 931 flow [2025-01-09 21:21:39,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 68.27272727272727) internal successors, (751), 11 states have internal predecessors, (751), 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:21:39,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:39,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:39,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:21:39,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:39,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:39,736 INFO L85 PathProgramCache]: Analyzing trace with hash 680857159, now seen corresponding path program 1 times [2025-01-09 21:21:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:39,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688433282] [2025-01-09 21:21:39,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:39,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:39,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:21:39,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:21:39,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:39,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:21:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:21:40,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:21:40,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688433282] [2025-01-09 21:21:40,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688433282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:21:40,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:21:40,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:21:40,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017205568] [2025-01-09 21:21:40,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:21:40,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:21:40,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:21:40,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:21:40,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:21:40,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 102 [2025-01-09 21:21:40,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 178 transitions, 931 flow. Second operand has 11 states, 11 states have (on average 73.72727272727273) internal successors, (811), 11 states have internal predecessors, (811), 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:21:40,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:21:40,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 102 [2025-01-09 21:21:40,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:21:40,901 INFO L124 PetriNetUnfolderBase]: 219/829 cut-off events. [2025-01-09 21:21:40,901 INFO L125 PetriNetUnfolderBase]: For 1108/1142 co-relation queries the response was YES. [2025-01-09 21:21:40,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2748 conditions, 829 events. 219/829 cut-off events. For 1108/1142 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5047 event pairs, 20 based on Foata normal form. 18/836 useless extension candidates. Maximal degree in co-relation 2679. Up to 177 conditions per place. [2025-01-09 21:21:40,905 INFO L140 encePairwiseOnDemand]: 85/102 looper letters, 95 selfloop transitions, 59 changer transitions 12/236 dead transitions. [2025-01-09 21:21:40,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 236 transitions, 1662 flow [2025-01-09 21:21:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:21:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:21:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 959 transitions. [2025-01-09 21:21:40,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7834967320261438 [2025-01-09 21:21:40,908 INFO L175 Difference]: Start difference. First operand has 139 places, 178 transitions, 931 flow. Second operand 12 states and 959 transitions. [2025-01-09 21:21:40,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 236 transitions, 1662 flow [2025-01-09 21:21:40,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 236 transitions, 1560 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-01-09 21:21:40,916 INFO L231 Difference]: Finished difference. Result has 144 places, 185 transitions, 1160 flow [2025-01-09 21:21:40,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1160, PETRI_PLACES=144, PETRI_TRANSITIONS=185} [2025-01-09 21:21:40,917 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 39 predicate places. [2025-01-09 21:21:40,917 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 185 transitions, 1160 flow [2025-01-09 21:21:40,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 73.72727272727273) internal successors, (811), 11 states have internal predecessors, (811), 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:21:40,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:21:40,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:40,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:21:40,918 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:21:40,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:21:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash 913595489, now seen corresponding path program 1 times [2025-01-09 21:21:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:21:40,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597207314] [2025-01-09 21:21:40,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:21:40,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:21:40,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:21:40,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:21:40,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:40,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:21:40,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:21:40,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:21:40,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:21:40,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:21:40,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:21:40,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:21:40,967 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:21:40,967 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-01-09 21:21:40,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-01-09 21:21:40,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-01-09 21:21:40,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-01-09 21:21:40,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:21:40,970 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:21:41,016 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:21:41,017 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:21:41,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:21:41 BasicIcfg [2025-01-09 21:21:41,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:21:41,022 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:21:41,022 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:21:41,022 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:21:41,024 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:21:35" (3/4) ... [2025-01-09 21:21:41,025 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:21:41,075 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-01-09 21:21:41,102 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:21:41,102 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:21:41,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:21:41,103 INFO L158 Benchmark]: Toolchain (without parser) took 6922.77ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 130.8MB in the beginning and 102.8MB in the end (delta: 28.0MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2025-01-09 21:21:41,104 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:21:41,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.23ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 93.4MB in the end (delta: 37.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 21:21:41,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.27ms. Allocated memory is still 167.8MB. Free memory was 93.4MB in the beginning and 91.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:21:41,104 INFO L158 Benchmark]: Boogie Preprocessor took 19.66ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 89.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:21:41,104 INFO L158 Benchmark]: RCFGBuilder took 324.54ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 72.9MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:21:41,104 INFO L158 Benchmark]: TraceAbstraction took 5964.77ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 72.2MB in the beginning and 111.2MB in the end (delta: -39.0MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2025-01-09 21:21:41,104 INFO L158 Benchmark]: Witness Printer took 79.57ms. Allocated memory is still 268.4MB. Free memory was 111.2MB in the beginning and 102.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:21:41,105 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.13ms. Allocated memory is still 209.7MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.23ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 93.4MB in the end (delta: 37.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.27ms. Allocated memory is still 167.8MB. Free memory was 93.4MB in the beginning and 91.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.66ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 89.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 324.54ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 72.9MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5964.77ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 72.2MB in the beginning and 111.2MB in the end (delta: -39.0MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Witness Printer took 79.57ms. Allocated memory is still 268.4MB. Free memory was 111.2MB in the beginning and 102.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1241]: Data race detected Data race detected The following path leads to a data race: [L1223] 0 int *x; VAL [x={0:0}] [L1224] 0 int *y; VAL [x={0:0}, y={0:0}] [L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [m={1:0}, x={0:0}, y={0:0}] [L1234] 0 pthread_t id; VAL [m={1:0}, x={0:0}, y={0:0}] [L1235] 0 x = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={0:0}] [L1236] 0 y = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={-3:0}] [L1237] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1239] EXPR 0 *x VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1239] EXPR 0 \read(*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1239] 0 printf("%d\n",*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 *y VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1228] EXPR 1 *x VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] EXPR 1 *y VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 *y VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 \read(*y) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1241] 0 printf("%d\n",*y) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3: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: y = malloc(sizeof(int)) [1236] * C: x = malloc(sizeof(int)) [1235] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: *y = 8 [1229] * C: *x = 3 [1228] * C: *x = 3 [1228] and C: printf("%d\n",*y) [1241] - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1236]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: 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: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 136 locations, 15 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: 5.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 852 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 580 mSDsluCounter, 395 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2902 IncrementalHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 90 mSDtfsCounter, 2902 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1160occurred in iteration=11, InterpolantAutomatonStates: 63, 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, 2.0s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 1637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 3/3 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:21:41,129 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)