./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/qrcu-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/qrcu-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:57:58,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:57:58,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:57:58,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:57:58,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:57:58,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:57:58,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:57:58,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:57:58,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:57:58,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:57:58,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:57:58,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:57:58,696 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:57:58,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:57:58,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:57:58,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:57:58,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:57:58,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:57:58,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:57:58,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:57:58,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:57:58,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:57:58,697 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:57:58,697 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:57:58,697 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:57:58,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:57:58,697 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:57:58,698 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:57:58,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:57:58,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:57:58,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:57:58,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:57:58,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:57:58,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:57:58,698 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:57:58,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:57:58,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:57:58,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:57:58,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:57:58,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:57:58,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:57:58,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:57:58,699 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 [2025-03-13 21:57:58,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:57:58,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:57:58,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:57:58,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:57:58,941 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:57:58,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/qrcu-1.i [2025-03-13 21:58:00,105 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb49940c6/aba1f5eda71642ec8e4a4abd026d61ef/FLAG7ee0d0ab8 [2025-03-13 21:58:00,394 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:58:00,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i [2025-03-13 21:58:00,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb49940c6/aba1f5eda71642ec8e4a4abd026d61ef/FLAG7ee0d0ab8 [2025-03-13 21:58:00,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb49940c6/aba1f5eda71642ec8e4a4abd026d61ef [2025-03-13 21:58:00,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:58:00,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:58:00,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:00,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:58:00,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:58:00,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00, skipping insertion in model container [2025-03-13 21:58:00,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:58:00,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:00,773 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:58:00,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:00,852 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:58:00,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00 WrapperNode [2025-03-13 21:58:00,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:00,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:00,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:58:00,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:58:00,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,904 INFO L138 Inliner]: procedures = 178, calls = 42, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 446 [2025-03-13 21:58:00,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:00,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:58:00,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:58:00,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:58:00,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:58:00,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:58:00,945 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:58:00,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:58:00,948 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (1/1) ... [2025-03-13 21:58:00,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:00,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:00,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:58:00,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:58:00,998 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2025-03-13 21:58:00,998 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2025-03-13 21:58:00,998 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2025-03-13 21:58:00,998 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2025-03-13 21:58:00,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:58:00,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 21:58:00,998 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2025-03-13 21:58:00,998 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2025-03-13 21:58:00,999 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:58:00,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:58:00,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 21:58:00,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 21:58:00,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:58:00,999 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:58:00,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:58:00,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:58:01,000 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:58:01,119 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:58:01,121 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:58:01,562 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: havoc ~#readerstart2~0#1.base, ~#readerstart2~0#1.offset; [2025-03-13 21:58:01,562 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-1: SUMMARY for call ULTIMATE.dealloc(~#readerstart2~0#1.base, ~#readerstart2~0#1.offset); srcloc: null [2025-03-13 21:58:01,562 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-2: havoc ~#readerstart1~0#1.base, ~#readerstart1~0#1.offset; [2025-03-13 21:58:01,562 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-3: SUMMARY for call ULTIMATE.dealloc(~#readerstart1~0#1.base, ~#readerstart1~0#1.offset); srcloc: null [2025-03-13 21:58:01,597 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:58:01,598 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:58:01,598 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:58:01,827 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:58:01,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:01 BoogieIcfgContainer [2025-03-13 21:58:01,827 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:58:01,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:58:01,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:58:01,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:58:01,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:58:00" (1/3) ... [2025-03-13 21:58:01,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254bd62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:01, skipping insertion in model container [2025-03-13 21:58:01,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:00" (2/3) ... [2025-03-13 21:58:01,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254bd62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:01, skipping insertion in model container [2025-03-13 21:58:01,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:01" (3/3) ... [2025-03-13 21:58:01,834 INFO L128 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2025-03-13 21:58:01,844 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:58:01,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG qrcu-1.i that has 4 procedures, 295 locations, 1 initial locations, 4 loop locations, and 56 error locations. [2025-03-13 21:58:01,846 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:58:01,944 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:58:01,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 304 places, 310 transitions, 641 flow [2025-03-13 21:58:02,046 INFO L124 PetriNetUnfolderBase]: 16/307 cut-off events. [2025-03-13 21:58:02,048 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:58:02,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 307 events. 16/307 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1003 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 276. Up to 4 conditions per place. [2025-03-13 21:58:02,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 304 places, 310 transitions, 641 flow [2025-03-13 21:58:02,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 302 transitions, 619 flow [2025-03-13 21:58:02,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:02,080 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;@626a4b50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:02,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 115 error locations. [2025-03-13 21:58:02,116 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:02,117 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-03-13 21:58:02,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:02,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:02,118 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] [2025-03-13 21:58:02,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (and 112 more)] === [2025-03-13 21:58:02,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:02,123 INFO L85 PathProgramCache]: Analyzing trace with hash 236129465, now seen corresponding path program 1 times [2025-03-13 21:58:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:02,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230212157] [2025-03-13 21:58:02,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:02,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:02,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 21:58:02,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 21:58:02,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:02,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:02,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230212157] [2025-03-13 21:58:02,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230212157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:02,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:02,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:02,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104101747] [2025-03-13 21:58:02,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:02,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:02,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:02,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:02,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 310 [2025-03-13 21:58:02,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 302 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:02,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:02,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 310 [2025-03-13 21:58:02,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:03,251 INFO L124 PetriNetUnfolderBase]: 1319/6770 cut-off events. [2025-03-13 21:58:03,251 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2025-03-13 21:58:03,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8643 conditions, 6770 events. 1319/6770 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 68876 event pairs, 503 based on Foata normal form. 86/5658 useless extension candidates. Maximal degree in co-relation 7254. Up to 1526 conditions per place. [2025-03-13 21:58:03,307 INFO L140 encePairwiseOnDemand]: 268/310 looper letters, 40 selfloop transitions, 8 changer transitions 0/290 dead transitions. [2025-03-13 21:58:03,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 703 flow [2025-03-13 21:58:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-13 21:58:03,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.921505376344086 [2025-03-13 21:58:03,326 INFO L175 Difference]: Start difference. First operand has 296 places, 302 transitions, 619 flow. Second operand 3 states and 857 transitions. [2025-03-13 21:58:03,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 703 flow [2025-03-13 21:58:03,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 290 transitions, 687 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:58:03,338 INFO L231 Difference]: Finished difference. Result has 267 places, 276 transitions, 606 flow [2025-03-13 21:58:03,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=267, PETRI_TRANSITIONS=276} [2025-03-13 21:58:03,344 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -29 predicate places. [2025-03-13 21:58:03,345 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 276 transitions, 606 flow [2025-03-13 21:58:03,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:03,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:03,346 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] [2025-03-13 21:58:03,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:58:03,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (and 112 more)] === [2025-03-13 21:58:03,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:03,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1708029064, now seen corresponding path program 1 times [2025-03-13 21:58:03,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:03,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901872951] [2025-03-13 21:58:03,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:03,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:03,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 21:58:03,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:58:03,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:03,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:03,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:03,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901872951] [2025-03-13 21:58:03,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901872951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:03,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:03,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:03,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596489237] [2025-03-13 21:58:03,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:03,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:03,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:03,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:03,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:03,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 310 [2025-03-13 21:58:03,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 276 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:03,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:03,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 310 [2025-03-13 21:58:03,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:04,188 INFO L124 PetriNetUnfolderBase]: 1267/6633 cut-off events. [2025-03-13 21:58:04,188 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-03-13 21:58:04,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8744 conditions, 6633 events. 1267/6633 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 69530 event pairs, 474 based on Foata normal form. 0/5496 useless extension candidates. Maximal degree in co-relation 4055. Up to 1264 conditions per place. [2025-03-13 21:58:04,238 INFO L140 encePairwiseOnDemand]: 305/310 looper letters, 30 selfloop transitions, 4 changer transitions 0/288 dead transitions. [2025-03-13 21:58:04,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 288 transitions, 701 flow [2025-03-13 21:58:04,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 806 transitions. [2025-03-13 21:58:04,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-03-13 21:58:04,241 INFO L175 Difference]: Start difference. First operand has 267 places, 276 transitions, 606 flow. Second operand 3 states and 806 transitions. [2025-03-13 21:58:04,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 288 transitions, 701 flow [2025-03-13 21:58:04,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 288 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:04,251 INFO L231 Difference]: Finished difference. Result has 269 places, 279 transitions, 620 flow [2025-03-13 21:58:04,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=269, PETRI_TRANSITIONS=279} [2025-03-13 21:58:04,251 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -27 predicate places. [2025-03-13 21:58:04,252 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 279 transitions, 620 flow [2025-03-13 21:58:04,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:04,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:04,252 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-03-13 21:58:04,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:58:04,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting qrcu_reader1Err4ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (and 112 more)] === [2025-03-13 21:58:04,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash 701917112, now seen corresponding path program 1 times [2025-03-13 21:58:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:04,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494086720] [2025-03-13 21:58:04,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:04,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 21:58:04,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 21:58:04,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:04,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:04,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:04,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494086720] [2025-03-13 21:58:04,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494086720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:04,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:04,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603385717] [2025-03-13 21:58:04,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:04,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:04,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:04,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:04,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:04,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 310 [2025-03-13 21:58:04,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 279 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:04,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:04,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 310 [2025-03-13 21:58:04,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:05,211 INFO L124 PetriNetUnfolderBase]: 1474/8473 cut-off events. [2025-03-13 21:58:05,211 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-03-13 21:58:05,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10986 conditions, 8473 events. 1474/8473 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 94935 event pairs, 533 based on Foata normal form. 0/7001 useless extension candidates. Maximal degree in co-relation 3808. Up to 1408 conditions per place. [2025-03-13 21:58:05,273 INFO L140 encePairwiseOnDemand]: 305/310 looper letters, 31 selfloop transitions, 4 changer transitions 0/291 dead transitions. [2025-03-13 21:58:05,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 291 transitions, 719 flow [2025-03-13 21:58:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 806 transitions. [2025-03-13 21:58:05,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-03-13 21:58:05,276 INFO L175 Difference]: Start difference. First operand has 269 places, 279 transitions, 620 flow. Second operand 3 states and 806 transitions. [2025-03-13 21:58:05,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 291 transitions, 719 flow [2025-03-13 21:58:05,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 291 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:05,281 INFO L231 Difference]: Finished difference. Result has 271 places, 282 transitions, 644 flow [2025-03-13 21:58:05,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=271, PETRI_TRANSITIONS=282} [2025-03-13 21:58:05,282 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -25 predicate places. [2025-03-13 21:58:05,282 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 282 transitions, 644 flow [2025-03-13 21:58:05,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:05,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:05,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:05,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:58:05,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting qrcu_reader2Err5ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (and 112 more)] === [2025-03-13 21:58:05,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1220243087, now seen corresponding path program 1 times [2025-03-13 21:58:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:05,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059241389] [2025-03-13 21:58:05,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:05,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:05,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 21:58:05,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 21:58:05,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:05,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:05,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059241389] [2025-03-13 21:58:05,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059241389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:05,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:05,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:05,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957668439] [2025-03-13 21:58:05,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:05,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:05,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:05,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:05,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:05,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 310 [2025-03-13 21:58:05,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 282 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:05,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:05,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 310 [2025-03-13 21:58:05,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:06,429 INFO L124 PetriNetUnfolderBase]: 1923/12537 cut-off events. [2025-03-13 21:58:06,430 INFO L125 PetriNetUnfolderBase]: For 480/498 co-relation queries the response was YES. [2025-03-13 21:58:06,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16110 conditions, 12537 events. 1923/12537 cut-off events. For 480/498 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 155374 event pairs, 718 based on Foata normal form. 0/10294 useless extension candidates. Maximal degree in co-relation 10078. Up to 1953 conditions per place. [2025-03-13 21:58:06,507 INFO L140 encePairwiseOnDemand]: 305/310 looper letters, 32 selfloop transitions, 6 changer transitions 0/296 dead transitions. [2025-03-13 21:58:06,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 296 transitions, 763 flow [2025-03-13 21:58:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 806 transitions. [2025-03-13 21:58:06,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-03-13 21:58:06,510 INFO L175 Difference]: Start difference. First operand has 271 places, 282 transitions, 644 flow. Second operand 3 states and 806 transitions. [2025-03-13 21:58:06,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 296 transitions, 763 flow [2025-03-13 21:58:06,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 296 transitions, 749 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:06,518 INFO L231 Difference]: Finished difference. Result has 273 places, 287 transitions, 688 flow [2025-03-13 21:58:06,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=273, PETRI_TRANSITIONS=287} [2025-03-13 21:58:06,519 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -23 predicate places. [2025-03-13 21:58:06,519 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 287 transitions, 688 flow [2025-03-13 21:58:06,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:06,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:06,520 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] [2025-03-13 21:58:06,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:58:06,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (and 112 more)] === [2025-03-13 21:58:06,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1080783974, now seen corresponding path program 1 times [2025-03-13 21:58:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:06,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494098155] [2025-03-13 21:58:06,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:06,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 21:58:06,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 21:58:06,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:06,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:06,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:06,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494098155] [2025-03-13 21:58:06,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494098155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:06,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:06,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:06,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940828822] [2025-03-13 21:58:06,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:06,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:06,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:06,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:06,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:06,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 310 [2025-03-13 21:58:06,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 287 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:06,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:06,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 310 [2025-03-13 21:58:06,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:08,571 INFO L124 PetriNetUnfolderBase]: 3809/21312 cut-off events. [2025-03-13 21:58:08,571 INFO L125 PetriNetUnfolderBase]: For 1122/1129 co-relation queries the response was YES. [2025-03-13 21:58:08,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30432 conditions, 21312 events. 3809/21312 cut-off events. For 1122/1129 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 290881 event pairs, 598 based on Foata normal form. 0/18395 useless extension candidates. Maximal degree in co-relation 14176. Up to 3606 conditions per place. [2025-03-13 21:58:08,814 INFO L140 encePairwiseOnDemand]: 283/310 looper letters, 50 selfloop transitions, 20 changer transitions 0/313 dead transitions. [2025-03-13 21:58:08,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 313 transitions, 882 flow [2025-03-13 21:58:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2025-03-13 21:58:08,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8516129032258064 [2025-03-13 21:58:08,816 INFO L175 Difference]: Start difference. First operand has 273 places, 287 transitions, 688 flow. Second operand 3 states and 792 transitions. [2025-03-13 21:58:08,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 313 transitions, 882 flow [2025-03-13 21:58:08,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 313 transitions, 870 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:08,825 INFO L231 Difference]: Finished difference. Result has 275 places, 305 transitions, 842 flow [2025-03-13 21:58:08,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=275, PETRI_TRANSITIONS=305} [2025-03-13 21:58:08,826 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -21 predicate places. [2025-03-13 21:58:08,826 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 305 transitions, 842 flow [2025-03-13 21:58:08,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:08,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:08,827 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] [2025-03-13 21:58:08,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:58:08,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting qrcu_updaterErr25ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (and 112 more)] === [2025-03-13 21:58:08,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:08,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1080753189, now seen corresponding path program 1 times [2025-03-13 21:58:08,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:08,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882902789] [2025-03-13 21:58:08,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:08,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:08,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 21:58:08,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 21:58:08,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:08,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:08,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882902789] [2025-03-13 21:58:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882902789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:08,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:08,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:08,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36881656] [2025-03-13 21:58:08,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:08,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:08,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:08,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:08,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:08,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 310 [2025-03-13 21:58:08,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 305 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:08,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:08,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 310 [2025-03-13 21:58:08,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:11,448 INFO L124 PetriNetUnfolderBase]: 6405/33643 cut-off events. [2025-03-13 21:58:11,449 INFO L125 PetriNetUnfolderBase]: For 8651/9475 co-relation queries the response was YES. [2025-03-13 21:58:11,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55938 conditions, 33643 events. 6405/33643 cut-off events. For 8651/9475 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 492938 event pairs, 895 based on Foata normal form. 32/29751 useless extension candidates. Maximal degree in co-relation 20116. Up to 6050 conditions per place. [2025-03-13 21:58:11,643 INFO L140 encePairwiseOnDemand]: 283/310 looper letters, 56 selfloop transitions, 22 changer transitions 0/335 dead transitions. [2025-03-13 21:58:11,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 335 transitions, 1084 flow [2025-03-13 21:58:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2025-03-13 21:58:11,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8516129032258064 [2025-03-13 21:58:11,645 INFO L175 Difference]: Start difference. First operand has 275 places, 305 transitions, 842 flow. Second operand 3 states and 792 transitions. [2025-03-13 21:58:11,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 335 transitions, 1084 flow [2025-03-13 21:58:11,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 335 transitions, 1036 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:11,796 INFO L231 Difference]: Finished difference. Result has 277 places, 325 transitions, 992 flow [2025-03-13 21:58:11,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=992, PETRI_PLACES=277, PETRI_TRANSITIONS=325} [2025-03-13 21:58:11,797 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -19 predicate places. [2025-03-13 21:58:11,797 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 325 transitions, 992 flow [2025-03-13 21:58:11,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:11,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:11,797 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-03-13 21:58:11,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:58:11,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting qrcu_reader2Err4ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (and 112 more)] === [2025-03-13 21:58:11,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:11,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1442264803, now seen corresponding path program 1 times [2025-03-13 21:58:11,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:11,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173747123] [2025-03-13 21:58:11,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:11,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:11,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 21:58:11,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 21:58:11,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:11,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:11,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:11,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173747123] [2025-03-13 21:58:11,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173747123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:11,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:11,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:11,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254369768] [2025-03-13 21:58:11,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:11,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:11,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:11,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:11,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:11,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 310 [2025-03-13 21:58:11,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 325 transitions, 992 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:11,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:11,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 310 [2025-03-13 21:58:11,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:15,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1264] L739-3-->L740: Formula: (or (and (= (+ v_~ctr1~0_126 1) v_~ctr1~0_127) (= |v_#race~ctr2~0_295| |v_#race~ctr2~0_294|) (= |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet12#1_63| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet12#1_62|) (= v_~ctr2~0_185 v_~ctr2~0_184) (= |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post11#1_63| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post11#1_62|) (<= |v_qrcu_reader1Thread1of1ForFork0_~myidx~0#1_9| 0)) (and (= (+ v_~ctr2~0_184 1) v_~ctr2~0_185) (< 0 |v_qrcu_reader1Thread1of1ForFork0_~myidx~0#1_9|) (= |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet10#1_63| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet10#1_62|) (= |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post9#1_63| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post9#1_62|) (= v_~ctr1~0_127 v_~ctr1~0_126) (= |v_#race~ctr1~0_203| |v_#race~ctr1~0_202|))) InVars {qrcu_reader1Thread1of1ForFork0_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork0_~myidx~0#1_9|, #race~ctr1~0=|v_#race~ctr1~0_203|, ~ctr1~0=v_~ctr1~0_127, #race~ctr2~0=|v_#race~ctr2~0_295|, ~ctr2~0=v_~ctr2~0_185} OutVars{qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx#1_9|, qrcu_reader1Thread1of1ForFork0_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork0_~myidx~0#1_9|, #race~ctr1~0=|v_#race~ctr1~0_202|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet10#1_9|, #race~ctr2~0=|v_#race~ctr2~0_294|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post9#1_9|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx#1_9|, ~ctr1~0=v_~ctr1~0_126, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post11#1_9|, ~ctr2~0=v_~ctr2~0_184} AuxVars[|v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post11#1_63|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post11#1_62|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet12#1_63|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet12#1_62|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post9#1_62|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post9#1_63|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet10#1_63|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet10#1_62|] AssignedVars[qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx#1, #race~ctr1~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet10#1, #race~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post9#1, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx#1, ~ctr1~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post11#1, ~ctr2~0][207], [Black: 319#(= |#race~readerprogress1~0| |qrcu_reader1Thread1of1ForFork0_#t~nondet22#1|), Black: 324#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet25#1|), 233#L772-6true, 276#L786-1true, Black: 329#(= |#race~ctr1~0| 0), Black: 334#(= |#race~ctr2~0| 0), 337#true, 332#true, Black: 309#(= |#race~idx~0| 0), 301#true, 280#L740true, Black: 314#(= |#race~readerprogress1~0| |qrcu_reader1Thread1of1ForFork0_#t~nondet21#1|), 196#L758-3true]) [2025-03-13 21:58:15,548 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-03-13 21:58:15,548 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 21:58:15,548 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 21:58:15,548 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 21:58:15,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1264] L739-3-->L740: Formula: (or (and (= (+ v_~ctr1~0_126 1) v_~ctr1~0_127) (= |v_#race~ctr2~0_295| |v_#race~ctr2~0_294|) (= |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet12#1_63| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet12#1_62|) (= v_~ctr2~0_185 v_~ctr2~0_184) (= |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post11#1_63| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post11#1_62|) (<= |v_qrcu_reader1Thread1of1ForFork0_~myidx~0#1_9| 0)) (and (= (+ v_~ctr2~0_184 1) v_~ctr2~0_185) (< 0 |v_qrcu_reader1Thread1of1ForFork0_~myidx~0#1_9|) (= |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet10#1_63| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet10#1_62|) (= |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post9#1_63| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post9#1_62|) (= v_~ctr1~0_127 v_~ctr1~0_126) (= |v_#race~ctr1~0_203| |v_#race~ctr1~0_202|))) InVars {qrcu_reader1Thread1of1ForFork0_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork0_~myidx~0#1_9|, #race~ctr1~0=|v_#race~ctr1~0_203|, ~ctr1~0=v_~ctr1~0_127, #race~ctr2~0=|v_#race~ctr2~0_295|, ~ctr2~0=v_~ctr2~0_185} OutVars{qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet12#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet12#1_9|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx#1_9|, qrcu_reader1Thread1of1ForFork0_~myidx~0#1=|v_qrcu_reader1Thread1of1ForFork0_~myidx~0#1_9|, #race~ctr1~0=|v_#race~ctr1~0_202|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet10#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet10#1_9|, #race~ctr2~0=|v_#race~ctr2~0_294|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post9#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post9#1_9|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx#1_9|, ~ctr1~0=v_~ctr1~0_126, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post11#1=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post11#1_9|, ~ctr2~0=v_~ctr2~0_184} AuxVars[|v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post11#1_63|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post11#1_62|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet12#1_63|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet12#1_62|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post9#1_62|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post9#1_63|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet10#1_63|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~nondet10#1_62|] AssignedVars[qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet12#1, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx#1, #race~ctr1~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~nondet10#1, #race~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post9#1, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx#1, ~ctr1~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post11#1, ~ctr2~0][207], [Black: 319#(= |#race~readerprogress1~0| |qrcu_reader1Thread1of1ForFork0_#t~nondet22#1|), Black: 324#(= |#race~readerprogress2~0| |qrcu_reader2Thread1of1ForFork2_#t~nondet25#1|), 122#L772-7true, 276#L786-1true, Black: 329#(= |#race~ctr1~0| 0), Black: 334#(= |#race~ctr2~0| 0), 337#true, 332#true, Black: 309#(= |#race~idx~0| 0), 301#true, 280#L740true, Black: 314#(= |#race~readerprogress1~0| |qrcu_reader1Thread1of1ForFork0_#t~nondet21#1|), 196#L758-3true]) [2025-03-13 21:58:15,597 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-13 21:58:15,597 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 21:58:15,597 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 21:58:15,597 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 21:58:16,146 INFO L124 PetriNetUnfolderBase]: 10676/46684 cut-off events. [2025-03-13 21:58:16,146 INFO L125 PetriNetUnfolderBase]: For 20979/23466 co-relation queries the response was YES. [2025-03-13 21:58:16,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88550 conditions, 46684 events. 10676/46684 cut-off events. For 20979/23466 co-relation queries the response was YES. Maximal size of possible extension queue 1633. Compared 693269 event pairs, 2642 based on Foata normal form. 265/41327 useless extension candidates. Maximal degree in co-relation 33416. Up to 12231 conditions per place. [2025-03-13 21:58:16,603 INFO L140 encePairwiseOnDemand]: 305/310 looper letters, 50 selfloop transitions, 6 changer transitions 0/344 dead transitions. [2025-03-13 21:58:16,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 344 transitions, 1189 flow [2025-03-13 21:58:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 806 transitions. [2025-03-13 21:58:16,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-03-13 21:58:16,605 INFO L175 Difference]: Start difference. First operand has 277 places, 325 transitions, 992 flow. Second operand 3 states and 806 transitions. [2025-03-13 21:58:16,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 344 transitions, 1189 flow [2025-03-13 21:58:16,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 344 transitions, 1139 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:16,644 INFO L231 Difference]: Finished difference. Result has 279 places, 330 transitions, 1008 flow [2025-03-13 21:58:16,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=279, PETRI_TRANSITIONS=330} [2025-03-13 21:58:16,645 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -17 predicate places. [2025-03-13 21:58:16,646 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 330 transitions, 1008 flow [2025-03-13 21:58:16,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:16,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:16,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:16,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:58:16,647 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE === [qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE, qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (and 112 more)] === [2025-03-13 21:58:16,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash 884522793, now seen corresponding path program 1 times [2025-03-13 21:58:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:16,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675493113] [2025-03-13 21:58:16,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:16,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-13 21:58:16,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-13 21:58:16,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:16,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:16,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:16,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-13 21:58:16,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-13 21:58:16,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:16,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:16,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:16,735 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:16,735 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE (114 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE (113 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err5ASSERT_VIOLATIONDATA_RACE (112 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (111 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE (110 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err6ASSERT_VIOLATIONDATA_RACE (109 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err4ASSERT_VIOLATIONDATA_RACE (108 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err11ASSERT_VIOLATIONDATA_RACE (107 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err10ASSERT_VIOLATIONDATA_RACE (106 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err9ASSERT_VIOLATIONDATA_RACE (105 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err3ASSERT_VIOLATIONDATA_RACE (104 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err2ASSERT_VIOLATIONDATA_RACE (103 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (102 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE (101 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err12ASSERT_VIOLATIONDATA_RACE (100 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err5ASSERT_VIOLATIONDATA_RACE (99 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err8ASSERT_VIOLATIONDATA_RACE (98 of 115 remaining) [2025-03-13 21:58:16,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err7ASSERT_VIOLATIONDATA_RACE (97 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err6ASSERT_VIOLATIONDATA_RACE (96 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err4ASSERT_VIOLATIONDATA_RACE (95 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err11ASSERT_VIOLATIONDATA_RACE (94 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err10ASSERT_VIOLATIONDATA_RACE (93 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err9ASSERT_VIOLATIONDATA_RACE (92 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err3ASSERT_VIOLATIONDATA_RACE (91 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err2ASSERT_VIOLATIONDATA_RACE (90 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err1ASSERT_VIOLATIONDATA_RACE (89 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err0ASSERT_VIOLATIONDATA_RACE (88 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr29ASSERT_VIOLATIONDATA_RACE (87 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr28ASSERT_VIOLATIONDATA_RACE (86 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr27ASSERT_VIOLATIONDATA_RACE (85 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr26ASSERT_VIOLATIONDATA_RACE (84 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACE (83 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr25ASSERT_VIOLATIONDATA_RACE (82 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr22ASSERT_VIOLATIONDATA_RACE (81 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr24ASSERT_VIOLATIONDATA_RACE (80 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr17ASSERT_VIOLATIONDATA_RACE (79 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr19ASSERT_VIOLATIONDATA_RACE (78 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr21ASSERT_VIOLATIONDATA_RACE (77 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACE (76 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr11ASSERT_VIOLATIONDATA_RACE (75 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr16ASSERT_VIOLATIONDATA_RACE (74 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr2ASSERT_VIOLATIONDATA_RACE (73 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr18ASSERT_VIOLATIONDATA_RACE (72 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr20ASSERT_VIOLATIONDATA_RACE (71 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr10ASSERT_VIOLATIONDATA_RACE (70 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr15ASSERT_VIOLATIONDATA_RACE (69 of 115 remaining) [2025-03-13 21:58:16,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr1ASSERT_VIOLATIONDATA_RACE (68 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr0ASSERT_VIOLATIONDATA_RACE (67 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr9ASSERT_VIOLATIONDATA_RACE (66 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr14ASSERT_VIOLATIONDATA_RACE (65 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr8ASSERT_VIOLATIONDATA_RACE (64 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr13ASSERT_VIOLATIONDATA_RACE (63 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACE (62 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr12ASSERT_VIOLATIONDATA_RACE (61 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr6ASSERT_VIOLATIONDATA_RACE (60 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACE (59 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr5ASSERT_VIOLATIONDATA_RACE (58 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err12ASSERT_VIOLATIONDATA_RACE (54 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err8ASSERT_VIOLATIONDATA_RACE (53 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err7ASSERT_VIOLATIONDATA_RACE (52 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err6ASSERT_VIOLATIONDATA_RACE (51 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err4ASSERT_VIOLATIONDATA_RACE (50 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err11ASSERT_VIOLATIONDATA_RACE (49 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err10ASSERT_VIOLATIONDATA_RACE (48 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err9ASSERT_VIOLATIONDATA_RACE (47 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err3ASSERT_VIOLATIONDATA_RACE (46 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err2ASSERT_VIOLATIONDATA_RACE (45 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err1ASSERT_VIOLATIONDATA_RACE (44 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader1Err0ASSERT_VIOLATIONDATA_RACE (43 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err12ASSERT_VIOLATIONDATA_RACE (42 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err5ASSERT_VIOLATIONDATA_RACE (41 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err8ASSERT_VIOLATIONDATA_RACE (40 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err7ASSERT_VIOLATIONDATA_RACE (39 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err6ASSERT_VIOLATIONDATA_RACE (38 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err4ASSERT_VIOLATIONDATA_RACE (37 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err11ASSERT_VIOLATIONDATA_RACE (36 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err10ASSERT_VIOLATIONDATA_RACE (35 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err9ASSERT_VIOLATIONDATA_RACE (34 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err3ASSERT_VIOLATIONDATA_RACE (33 of 115 remaining) [2025-03-13 21:58:16,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err2ASSERT_VIOLATIONDATA_RACE (32 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err1ASSERT_VIOLATIONDATA_RACE (31 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_reader2Err0ASSERT_VIOLATIONDATA_RACE (30 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr29ASSERT_VIOLATIONDATA_RACE (29 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr28ASSERT_VIOLATIONDATA_RACE (28 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr27ASSERT_VIOLATIONDATA_RACE (27 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr26ASSERT_VIOLATIONDATA_RACE (26 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr23ASSERT_VIOLATIONDATA_RACE (25 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr25ASSERT_VIOLATIONDATA_RACE (24 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr22ASSERT_VIOLATIONDATA_RACE (23 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr24ASSERT_VIOLATIONDATA_RACE (22 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr17ASSERT_VIOLATIONDATA_RACE (21 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr19ASSERT_VIOLATIONDATA_RACE (20 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr21ASSERT_VIOLATIONDATA_RACE (19 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr3ASSERT_VIOLATIONDATA_RACE (18 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr11ASSERT_VIOLATIONDATA_RACE (17 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr16ASSERT_VIOLATIONDATA_RACE (16 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr2ASSERT_VIOLATIONDATA_RACE (15 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr18ASSERT_VIOLATIONDATA_RACE (14 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr20ASSERT_VIOLATIONDATA_RACE (13 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr10ASSERT_VIOLATIONDATA_RACE (12 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr15ASSERT_VIOLATIONDATA_RACE (11 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr1ASSERT_VIOLATIONDATA_RACE (10 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr0ASSERT_VIOLATIONDATA_RACE (9 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr9ASSERT_VIOLATIONDATA_RACE (8 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr14ASSERT_VIOLATIONDATA_RACE (7 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr8ASSERT_VIOLATIONDATA_RACE (6 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr13ASSERT_VIOLATIONDATA_RACE (5 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr7ASSERT_VIOLATIONDATA_RACE (4 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr12ASSERT_VIOLATIONDATA_RACE (3 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr6ASSERT_VIOLATIONDATA_RACE (2 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr4ASSERT_VIOLATIONDATA_RACE (1 of 115 remaining) [2025-03-13 21:58:16,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location qrcu_updaterErr5ASSERT_VIOLATIONDATA_RACE (0 of 115 remaining) [2025-03-13 21:58:16,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:58:16,741 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:16,796 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:58:16,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:58:16,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:58:16 BasicIcfg [2025-03-13 21:58:16,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:58:16,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:58:16,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:58:16,803 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:58:16,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:01" (3/4) ... [2025-03-13 21:58:16,805 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:58:16,866 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 10. [2025-03-13 21:58:16,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:58:16,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:58:16,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:58:16,905 INFO L158 Benchmark]: Toolchain (without parser) took 16475.96ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 131.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 982.4MB. Max. memory is 16.1GB. [2025-03-13 21:58:16,905 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:16,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.95ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 109.5MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 21:58:16,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.41ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 106.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:16,906 INFO L158 Benchmark]: Boogie Preprocessor took 38.56ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 104.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:16,906 INFO L158 Benchmark]: IcfgBuilder took 882.56ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 100.2MB in the end (delta: 4.4MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2025-03-13 21:58:16,906 INFO L158 Benchmark]: TraceAbstraction took 14973.44ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 100.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 932.6MB. Max. memory is 16.1GB. [2025-03-13 21:58:16,906 INFO L158 Benchmark]: Witness Printer took 101.69ms. Allocated memory is still 2.5GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:58:16,907 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.95ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 109.5MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.41ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 106.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.56ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 104.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 882.56ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 100.2MB in the end (delta: 4.4MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14973.44ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 100.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 932.6MB. Max. memory is 16.1GB. * Witness Printer took 101.69ms. Allocated memory is still 2.5GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 737]: Data race detected Data race detected The following path leads to a data race: [L689] 0 int idx=0; VAL [idx=0] [L690] 0 int ctr1=1, ctr2=0; VAL [ctr1=1, ctr2=0, idx=0] [L691] 0 int readerprogress1=0, readerprogress2=0; VAL [ctr1=1, ctr2=0, idx=0, readerprogress1=0, readerprogress2=0] [L692] 0 pthread_mutex_t mutex; VAL [ctr1=1, ctr2=0, idx=0, mutex={3:0}, readerprogress1=0, readerprogress2=0] [L782] 0 pthread_t t1, t2, t3; VAL [ctr1=1, ctr2=0, idx=0, mutex={3:0}, readerprogress1=0, readerprogress2=0] [L784] FCALL, FORK 0 pthread_create(&t1, 0, qrcu_reader1, 0) VAL [ctr1=1, ctr2=0, idx=0, mutex={3:0}, readerprogress1=0, readerprogress2=0, t1=-2] [L724] 1 int myidx; VAL [\old(arg)={0:0}, arg={0:0}, ctr1=1, ctr2=0, idx=0, mutex={3:0}, readerprogress1=0, readerprogress2=0] [L725] COND TRUE 1 1 [L726] 1 myidx = idx VAL [\old(arg)={0:0}, arg={0:0}, ctr1=1, ctr2=0, idx=0, mutex={3:0}, myidx=0, readerprogress1=0, readerprogress2=0] [L727] COND TRUE 1 __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, ctr1=1, ctr2=0, idx=0, mutex={3:0}, myidx=0, readerprogress1=0, readerprogress2=0] [L728] CALL 1 __VERIFIER_atomic_use1(myidx) [L694] EXPR 1 myidx <= 0 && ctr1>0 [L694] EXPR 1 ctr1>0 [L694] EXPR 1 myidx <= 0 && ctr1>0 [L694] CALL 1 assume_abort_if_not(myidx <= 0 && ctr1>0) [L3] COND FALSE 1 !(!cond) [L694] RET 1 assume_abort_if_not(myidx <= 0 && ctr1>0) [L695] 1 ctr1++ [L728] RET 1 __VERIFIER_atomic_use1(myidx) [L737] 1 readerprogress1 = 1 VAL [\old(arg)={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, myidx=0, readerprogress1=1, readerprogress2=0] [L785] FCALL, FORK 0 pthread_create(&t2, 0, qrcu_reader2, 0) VAL [ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0, t1=-2, t2=-1] [L786] FCALL, FORK 0 pthread_create(&t3, 0, qrcu_updater, 0) VAL [ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0, t1=-2, t2=-1, t3=0] [L762] 3 int i; VAL [\old(arg)={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0] [L763] 3 int readerstart1, readerstart2; VAL [\old(arg)={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0, readerstart1={6:0}, readerstart2={5:0}] [L764] 3 int sum; VAL [\old(arg)={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, readerprogress1=1, readerprogress2=0, readerstart1={6:0}, readerstart2={5:0}] [L765] CALL 3 __VERIFIER_atomic_take_snapshot(&readerstart1, &readerstart2) [L706] 3 *readerstart1 = readerprogress1 [L707] 3 *readerstart2 = readerprogress2 [L765] RET 3 __VERIFIER_atomic_take_snapshot(&readerstart1, &readerstart2) [L737] 1 readerprogress1 = 1 VAL [\old(arg)={0:0}, arg={0:0}, ctr1=2, ctr2=0, idx=0, mutex={3:0}, myidx=0, readerprogress1=1, readerprogress2=0] Now there is a data race on ~readerprogress1~0 between C: *readerstart1 = readerprogress1 [706] and C: readerprogress1 = 1 [737] - UnprovableResult [Line: 726]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 786]: 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: 785]: 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: 784]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 543 locations, 115 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: 14.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 45 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1008occurred in iteration=7, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 319 ConstructedInterpolants, 0 QuantifiedInterpolants, 333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-13 21:58:16,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)