./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/mcslock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/mcslock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 185c5ecec118867d41d6d4e251a2153dc547f1cc961cdbc2b790292b6debb75b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:46:25,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:46:25,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:46:25,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:46:25,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:46:25,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:46:25,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:46:25,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:46:25,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:46:25,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:46:25,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:46:25,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:46:25,271 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:46:25,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:46:25,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:46:25,271 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:46:25,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:46:25,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:46:25,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:46:25,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:46:25,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:46:25,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:46:25,272 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:46:25,272 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:46:25,272 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:46:25,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:46:25,272 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:46:25,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:46:25,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:46:25,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:46:25,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:46:25,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:25,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:46:25,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:46:25,274 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:46:25,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:46:25,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:46:25,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:46:25,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:46:25,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:46:25,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:46:25,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:46:25,275 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 185c5ecec118867d41d6d4e251a2153dc547f1cc961cdbc2b790292b6debb75b [2025-02-08 05:46:25,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:46:25,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:46:25,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:46:25,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:46:25,580 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:46:25,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/mcslock.i [2025-02-08 05:46:26,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/109e348a8/5c631e4ebc8a4b0895dd3cb886388bbb/FLAGb27d4e422 [2025-02-08 05:46:27,548 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:46:27,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/mcslock.i [2025-02-08 05:46:27,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/109e348a8/5c631e4ebc8a4b0895dd3cb886388bbb/FLAGb27d4e422 [2025-02-08 05:46:27,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/109e348a8/5c631e4ebc8a4b0895dd3cb886388bbb [2025-02-08 05:46:27,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:46:27,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:46:27,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:27,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:46:27,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:46:27,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:27" (1/1) ... [2025-02-08 05:46:27,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb036d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:27, skipping insertion in model container [2025-02-08 05:46:27,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:27" (1/1) ... [2025-02-08 05:46:27,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:46:29,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:29,634 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:46:29,731 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-08 05:46:29,733 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-08 05:46:29,733 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-08 05:46:29,734 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-08 05:46:29,735 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-08 05:46:29,735 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-08 05:46:29,738 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-08 05:46:29,738 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-08 05:46:29,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-08 05:46:29,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-08 05:46:29,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-08 05:46:29,740 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-08 05:46:29,740 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-08 05:46:29,741 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-08 05:46:29,743 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-08 05:46:29,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-08 05:46:29,745 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-08 05:46:29,745 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-08 05:46:29,745 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-08 05:46:29,746 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-08 05:46:29,746 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-08 05:46:29,746 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-08 05:46:29,748 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-08 05:46:29,748 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-08 05:46:29,748 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-08 05:46:29,749 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-08 05:46:29,749 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-08 05:46:29,751 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-08 05:46:29,752 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-08 05:46:29,753 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-08 05:46:29,753 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-08 05:46:29,754 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-08 05:46:29,754 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-08 05:46:29,755 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-08 05:46:29,755 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-08 05:46:29,756 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-08 05:46:29,756 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-08 05:46:29,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-08 05:46:29,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-08 05:46:29,759 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-08 05:46:29,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-08 05:46:29,764 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-08 05:46:29,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-08 05:46:29,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-08 05:46:29,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-08 05:46:29,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-08 05:46:29,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-08 05:46:29,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-08 05:46:29,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-08 05:46:29,773 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-08 05:46:29,773 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-08 05:46:29,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-08 05:46:29,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-08 05:46:29,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-08 05:46:29,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-08 05:46:29,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-08 05:46:29,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-08 05:46:29,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-08 05:46:29,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-08 05:46:29,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-08 05:46:29,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-08 05:46:29,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-08 05:46:29,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-08 05:46:29,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-08 05:46:29,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-08 05:46:29,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-08 05:46:29,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-08 05:46:29,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-08 05:46:29,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-08 05:46:29,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-08 05:46:29,787 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-08 05:46:29,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-08 05:46:29,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-08 05:46:29,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-08 05:46:29,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-08 05:46:29,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-08 05:46:29,791 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-08 05:46:29,792 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-08 05:46:29,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-08 05:46:29,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-08 05:46:29,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-08 05:46:29,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-08 05:46:29,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-08 05:46:29,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-08 05:46:29,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-08 05:46:29,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-08 05:46:29,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-08 05:46:29,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-08 05:46:29,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-08 05:46:29,803 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-08 05:46:29,803 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-08 05:46:29,804 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-08 05:46:29,804 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-08 05:46:29,805 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-08 05:46:29,805 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-08 05:46:29,806 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-08 05:46:29,806 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-08 05:46:29,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-08 05:46:29,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-08 05:46:29,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-08 05:46:29,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:30,116 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:46:30,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30 WrapperNode [2025-02-08 05:46:30,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:30,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:30,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:46:30,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:46:30,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,269 INFO L138 Inliner]: procedures = 919, calls = 935, calls flagged for inlining = 830, calls inlined = 57, statements flattened = 612 [2025-02-08 05:46:30,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:30,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:46:30,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:46:30,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:46:30,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:46:30,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:46:30,364 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:46:30,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:46:30,365 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (1/1) ... [2025-02-08 05:46:30,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:30,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:30,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:46:30,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:46:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:46:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:46:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:46:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:46:30,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:46:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-08 05:46:30,426 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-08 05:46:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:46:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:46:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:46:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:46:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:46:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:46:30,428 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:46:30,627 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:46:30,629 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:46:30,883 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 05:46:30,884 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 05:46:31,517 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:31,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:31,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-5: havoc acquire_#t~ite827#1; [2025-02-08 05:46:31,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-8: havoc acquire_#t~ret826#1; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-9: havoc acquire_#t~ret826#1; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-6: havoc acquire_#t~ite827#1; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-7: assume 0 != acquire_#t~ite827#1; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-7: assume !(0 != acquire_#t~ite827#1); [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-10: assume { :end_inline_verification_spin_end } true;acquire_#t~ite827#1 := 0; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-17: havoc mcslock_tryacquire_#in~l#1.base, mcslock_tryacquire_#in~l#1.offset, mcslock_tryacquire_#in~node#1.base, mcslock_tryacquire_#in~node#1.offset;assume { :end_inline_mcslock_tryacquire } true; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-14: assume 0 == acquire_#t~ret826#1 % 256; [2025-02-08 05:46:31,519 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-14: assume !(0 == acquire_#t~ret826#1 % 256); [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-15: acquire_#t~ite827#1 := 1; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-18: havoc mcslock_tryacquire_#t~ret801#1.base, mcslock_tryacquire_#t~ret801#1.offset, mcslock_tryacquire_~l#1.base, mcslock_tryacquire_~l#1.offset, mcslock_tryacquire_~node#1.base, mcslock_tryacquire_~node#1.offset, mcslock_tryacquire_~pred~0#1.base, mcslock_tryacquire_~pred~0#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2282: vatomic32_await_eq_acq_~v#1 := vatomic32_await_eq_acq_#in~v#1; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6047-19: acquire_#t~ret826#1 := mcslock_tryacquire_#res#1; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2282-1: vatomic32_await_eq_acq_~a#1.base, vatomic32_await_eq_acq_~a#1.offset := vatomic32_await_eq_acq_#in~a#1.base, vatomic32_await_eq_acq_#in~a#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4826: vatomicptr_await_neq_~c#1.base, vatomicptr_await_neq_~c#1.offset := vatomicptr_await_neq_#in~c#1.base, vatomicptr_await_neq_#in~c#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4826-1: vatomicptr_await_neq_~a#1.base, vatomicptr_await_neq_~a#1.offset := vatomicptr_await_neq_#in~a#1.base, vatomicptr_await_neq_#in~a#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3670: assume { :end_inline_vatomicptr_write } true;havoc vatomicptr_write_rel_~a#1.base, vatomicptr_write_rel_~a#1.offset, vatomicptr_write_rel_~v#1.base, vatomicptr_write_rel_~v#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3670-2: havoc vatomicptr_write_#t~nondet441#1, vatomicptr_write_~a#1.base, vatomicptr_write_~a#1.offset, vatomicptr_write_~v#1.base, vatomicptr_write_~v#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3670-1: havoc vatomicptr_write_#in~a#1.base, vatomicptr_write_#in~a#1.offset, vatomicptr_write_#in~v#1.base, vatomicptr_write_#in~v#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-2: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3670-4: assume { :begin_inline_vatomicptr_write } true;vatomicptr_write_#in~a#1.base, vatomicptr_write_#in~a#1.offset, vatomicptr_write_#in~v#1.base, vatomicptr_write_#in~v#1.offset := vatomicptr_write_rel_~a#1.base, vatomicptr_write_rel_~a#1.offset, vatomicptr_write_rel_~v#1.base, vatomicptr_write_rel_~v#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-3: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3670-3: havoc vatomicptr_write_#t~nondet441#1, vatomicptr_write_~a#1.base, vatomicptr_write_~a#1.offset, vatomicptr_write_~v#1.base, vatomicptr_write_~v#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-4: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-5: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6049: havoc mcslock_acquire_#in~l#1.base, mcslock_acquire_#in~l#1.offset, mcslock_acquire_#in~node#1.base, mcslock_acquire_#in~node#1.offset;assume { :end_inline_mcslock_acquire } true; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6049-1: havoc mcslock_acquire_#t~ret802#1.base, mcslock_acquire_#t~ret802#1.offset, mcslock_acquire_#t~ret803#1, mcslock_acquire_~l#1.base, mcslock_acquire_~l#1.offset, mcslock_acquire_~node#1.base, mcslock_acquire_~node#1.offset, mcslock_acquire_~pred~1#1.base, mcslock_acquire_~pred~1#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-1: vatomicptr_read_~tmp~5#1.base, vatomicptr_read_~tmp~5#1.offset := vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset; [2025-02-08 05:46:31,520 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803: havoc vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset; [2025-02-08 05:46:31,521 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-3: SUMMARY for call vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset := read~$Pointer$(vatomicptr_read_~a#1.base, vatomicptr_read_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:31,521 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-2: [2025-02-08 05:46:31,521 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-5: #race := #race[vatomicptr_read_~a#1.base,3 + vatomicptr_read_~a#1.offset := 0]; [2025-02-08 05:46:31,521 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-4: assume ((0 == #race[vatomicptr_read_~a#1.base,vatomicptr_read_~a#1.offset] && 0 == #race[vatomicptr_read_~a#1.base,1 + vatomicptr_read_~a#1.offset]) && 0 == #race[vatomicptr_read_~a#1.base,2 + vatomicptr_read_~a#1.offset]) && 0 == #race[vatomicptr_read_~a#1.base,3 + vatomicptr_read_~a#1.offset]; [2025-02-08 05:46:31,521 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-4: assume !(((0 == #race[vatomicptr_read_~a#1.base,vatomicptr_read_~a#1.offset] && 0 == #race[vatomicptr_read_~a#1.base,1 + vatomicptr_read_~a#1.offset]) && 0 == #race[vatomicptr_read_~a#1.base,2 + vatomicptr_read_~a#1.offset]) && 0 == #race[vatomicptr_read_~a#1.base,3 + vatomicptr_read_~a#1.offset]); [2025-02-08 05:46:31,521 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-7: #race := #race[vatomicptr_read_~a#1.base,1 + vatomicptr_read_~a#1.offset := 0]; [2025-02-08 05:46:31,521 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-6: #race := #race[vatomicptr_read_~a#1.base,2 + vatomicptr_read_~a#1.offset := 0]; [2025-02-08 05:46:31,521 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-9: havoc vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset; [2025-02-08 05:46:31,521 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-8: #race := #race[vatomicptr_read_~a#1.base,vatomicptr_read_~a#1.offset := 0]; [2025-02-08 05:46:31,522 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-11: [2025-02-08 05:46:31,522 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-10: vatomicptr_read_~tmp~5#1.base, vatomicptr_read_~tmp~5#1.offset := vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset; [2025-02-08 05:46:31,522 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-13: assume ((0 == #race[vatomicptr_read_~a#1.base,vatomicptr_read_~a#1.offset] && 0 == #race[vatomicptr_read_~a#1.base,1 + vatomicptr_read_~a#1.offset]) && 0 == #race[vatomicptr_read_~a#1.base,2 + vatomicptr_read_~a#1.offset]) && 0 == #race[vatomicptr_read_~a#1.base,3 + vatomicptr_read_~a#1.offset]; [2025-02-08 05:46:31,522 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-13: assume !(((0 == #race[vatomicptr_read_~a#1.base,vatomicptr_read_~a#1.offset] && 0 == #race[vatomicptr_read_~a#1.base,1 + vatomicptr_read_~a#1.offset]) && 0 == #race[vatomicptr_read_~a#1.base,2 + vatomicptr_read_~a#1.offset]) && 0 == #race[vatomicptr_read_~a#1.base,3 + vatomicptr_read_~a#1.offset]); [2025-02-08 05:46:31,523 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-12: SUMMARY for call vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset := read~$Pointer$(vatomicptr_read_~a#1.base, vatomicptr_read_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:31,523 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-15: #race := #race[vatomicptr_read_~a#1.base,2 + vatomicptr_read_~a#1.offset := 0]; [2025-02-08 05:46:31,523 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5389-2: havoc vatomicptr_cmpxchg_#in~a#1.base, vatomicptr_cmpxchg_#in~a#1.offset, vatomicptr_cmpxchg_#in~e#1.base, vatomicptr_cmpxchg_#in~e#1.offset, vatomicptr_cmpxchg_#in~v#1.base, vatomicptr_cmpxchg_#in~v#1.offset; [2025-02-08 05:46:31,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-14: #race := #race[vatomicptr_read_~a#1.base,3 + vatomicptr_read_~a#1.offset := 0]; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5389-3: havoc vatomicptr_cmpxchg_#t~ret474#1, vatomicptr_cmpxchg_#t~mem475#1.base, vatomicptr_cmpxchg_#t~mem475#1.offset, vatomicptr_cmpxchg_#t~ret476#1.base, vatomicptr_cmpxchg_#t~ret476#1.offset, vatomicptr_cmpxchg_#t~nondet477#1, vatomicptr_cmpxchg_~a#1.base, vatomicptr_cmpxchg_~a#1.offset, vatomicptr_cmpxchg_~e#1.base, vatomicptr_cmpxchg_~e#1.offset, vatomicptr_cmpxchg_~v#1.base, vatomicptr_cmpxchg_~v#1.offset, vatomicptr_cmpxchg_~exp~5#1.base, vatomicptr_cmpxchg_~exp~5#1.offset; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-17: #race := #race[vatomicptr_read_~a#1.base,vatomicptr_read_~a#1.offset := 0]; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5389: havoc mcslock_tryacquire_#t~ret801#1.base, mcslock_tryacquire_#t~ret801#1.offset; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3803-16: #race := #race[vatomicptr_read_~a#1.base,1 + vatomicptr_read_~a#1.offset := 0]; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5389-1: assume { :end_inline_vatomicptr_cmpxchg } true;mcslock_tryacquire_~pred~0#1.base, mcslock_tryacquire_~pred~0#1.offset := mcslock_tryacquire_#t~ret801#1.base, mcslock_tryacquire_#t~ret801#1.offset; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5389-4: mcslock_tryacquire_#t~ret801#1.base, mcslock_tryacquire_#t~ret801#1.offset := vatomicptr_cmpxchg_#res#1.base, vatomicptr_cmpxchg_#res#1.offset; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6017-2: ~j~1#1 := 1 + #t~post818#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6017-1: havoc #t~post818#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5390-1: mcslock_tryacquire_#res#1 := (if 0 == (if mcslock_tryacquire_~pred~0#1.base == 0 && mcslock_tryacquire_~pred~0#1.offset == 0 then 1 else 0) then 0 else 1); [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-3: assume { :end_inline_vatomic32_await_eq } true;vatomic32_await_eq_acq_#res#1 := vatomic32_await_eq_acq_#t~ret174#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-2: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-5: havoc vatomic32_await_eq_#t~ret679#1, vatomic32_await_eq_#t~ite680#1, vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset, vatomic32_await_eq_~c#1, vatomic32_await_eq_~ret~0#1, vatomic32_await_eq_~o~5#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-4: havoc vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset, vatomic32_await_eq_#in~c#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-7: havoc vatomic32_await_eq_#t~ret679#1, vatomic32_await_eq_#t~ite680#1, vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset, vatomic32_await_eq_~c#1, vatomic32_await_eq_~ret~0#1, vatomic32_await_eq_~o~5#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-6: vatomic32_await_eq_acq_#t~ret174#1 := vatomic32_await_eq_#res#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-9: assume { :begin_inline_vatomic32_await_eq } true;vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset, vatomic32_await_eq_#in~c#1 := vatomic32_await_eq_acq_~a#1.base, vatomic32_await_eq_acq_~a#1.offset, vatomic32_await_eq_acq_~v#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6018: assume { :end_inline_release } true;#t~post818#1 := ~j~1#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-8: havoc vatomic32_await_eq_#res#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6018-1: havoc release_#in~tid#1; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3805-1: vatomicptr_read_#res#1.base, vatomicptr_read_#res#1.offset := vatomicptr_read_~tmp~5#1.base, vatomicptr_read_~tmp~5#1.offset; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3805-3: vatomicptr_read_#res#1.base, vatomicptr_read_#res#1.offset := vatomicptr_read_~tmp~5#1.base, vatomicptr_read_~tmp~5#1.offset; [2025-02-08 05:46:31,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4829: vatomicptr_await_neq_~cur~7#1.base, vatomicptr_await_neq_~cur~7#1.offset := 0, 0;assume { :begin_inline_verification_loop_begin } true;assume { :end_inline_verification_loop_begin } true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume !true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume !false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume !true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume !false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume !true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume !false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume !true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume !false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume !true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume !false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume !true; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume !false; [2025-02-08 05:46:31,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-12: assume true; [2025-02-08 05:46:31,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-12: assume !true; [2025-02-08 05:46:31,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-13: assume false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-13: assume !false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-14: assume true; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-14: assume !true; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-15: assume false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-15: assume !false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-16: assume true; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-16: assume !true; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-17: assume false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-17: assume !false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-18: assume true; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-18: assume !true; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-19: assume false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-19: assume !false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-20: assume true; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-20: assume !true; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-21: assume false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-21: assume !false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-22: assume true; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-22: assume !true; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-23: assume false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-23: assume !false; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830: assume true;assume { :begin_inline_verification_spin_start } true;assume { :end_inline_verification_spin_start } true;assume { :begin_inline_vatomicptr_read } true;vatomicptr_read_#in~a#1.base, vatomicptr_read_#in~a#1.offset := vatomicptr_await_neq_~a#1.base, vatomicptr_await_neq_~a#1.offset; [2025-02-08 05:46:31,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830: assume !true; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-24: assume true; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-24: assume !true; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-25: assume false; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-25: assume !false; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-26: assume true; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-26: assume !true; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-27: assume false; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-27: assume !false; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-28: assume true; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-28: assume !true; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3707-1: vatomicptr_await_neq_rlx_~a#1.base, vatomicptr_await_neq_rlx_~a#1.offset := vatomicptr_await_neq_rlx_#in~a#1.base, vatomicptr_await_neq_rlx_#in~a#1.offset; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-29: assume false; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-29: assume !false; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3707: vatomicptr_await_neq_rlx_~v#1.base, vatomicptr_await_neq_rlx_~v#1.offset := vatomicptr_await_neq_rlx_#in~v#1.base, vatomicptr_await_neq_rlx_#in~v#1.offset; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-30: assume true; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-30: assume !true; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-7: assume 0 != vatomicptr_await_neq_#t~ite678#1; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-7: assume !(0 != vatomicptr_await_neq_#t~ite678#1); [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-31: assume false; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-31: assume !false; [2025-02-08 05:46:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-8: havoc vatomicptr_await_neq_#t~ret677#1.base, vatomicptr_await_neq_#t~ret677#1.offset; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-32: assume true; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-32: assume !true; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-5: havoc vatomicptr_await_neq_#t~ite678#1; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-33: assume false; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-33: assume !false; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-6: havoc vatomicptr_await_neq_#t~ite678#1; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-34: assume true; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-34: assume !true; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-35: assume false; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-35: assume !false; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-9: havoc vatomicptr_await_neq_#t~ret677#1.base, vatomicptr_await_neq_#t~ret677#1.offset; [2025-02-08 05:46:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-10: assume { :end_inline_verification_spin_end } true;vatomicptr_await_neq_#t~ite678#1 := 0; [2025-02-08 05:46:31,535 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-15: vatomicptr_await_neq_#t~ite678#1 := 1; [2025-02-08 05:46:31,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:31,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-14: assume vatomicptr_await_neq_~cur~7#1.base == vatomicptr_await_neq_~c#1.base && vatomicptr_await_neq_~cur~7#1.offset == vatomicptr_await_neq_~c#1.offset; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-14: assume !(vatomicptr_await_neq_~cur~7#1.base == vatomicptr_await_neq_~c#1.base && vatomicptr_await_neq_~cur~7#1.offset == vatomicptr_await_neq_~c#1.offset); [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-19: havoc vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset, vatomicptr_read_~a#1.base, vatomicptr_read_~a#1.offset, vatomicptr_read_~tmp~5#1.base, vatomicptr_read_~tmp~5#1.offset; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-20: vatomicptr_await_neq_#t~ret677#1.base, vatomicptr_await_neq_#t~ret677#1.offset := vatomicptr_read_#res#1.base, vatomicptr_read_#res#1.offset; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-17: assume { :end_inline_vatomicptr_read } true;vatomicptr_await_neq_~cur~7#1.base, vatomicptr_await_neq_~cur~7#1.offset := vatomicptr_await_neq_#t~ret677#1.base, vatomicptr_await_neq_#t~ret677#1.offset; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-18: havoc vatomicptr_read_#in~a#1.base, vatomicptr_read_#in~a#1.offset; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-21: havoc vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset, vatomicptr_read_~a#1.base, vatomicptr_read_~a#1.offset, vatomicptr_read_~tmp~5#1.base, vatomicptr_read_~tmp~5#1.offset; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4830-22: havoc vatomicptr_read_#res#1.base, vatomicptr_read_#res#1.offset; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4831: assume true; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4831: assume !true; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4831-1: assume false; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4831-1: assume !false; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3775: vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset := vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:31,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6055: assume { :end_inline_mcslock_release } true;havoc release_~tid#1; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6055-1: havoc mcslock_release_#in~l#1.base, mcslock_release_#in~l#1.offset, mcslock_release_#in~node#1.base, mcslock_release_#in~node#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3842-2: vatomicptr_write_~v#1.base, vatomicptr_write_~v#1.offset := vatomicptr_write_#in~v#1.base, vatomicptr_write_#in~v#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710: havoc vatomicptr_await_neq_rlx_#t~ret421#1.base, vatomicptr_await_neq_rlx_#t~ret421#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4833-1: vatomicptr_await_neq_#res#1.base, vatomicptr_await_neq_#res#1.offset := vatomicptr_await_neq_~cur~7#1.base, vatomicptr_await_neq_~cur~7#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3842-3: vatomicptr_write_~a#1.base, vatomicptr_write_~a#1.offset := vatomicptr_write_#in~a#1.base, vatomicptr_write_#in~a#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710-2: havoc vatomicptr_await_neq_rlx_#t~ret421#1.base, vatomicptr_await_neq_rlx_#t~ret421#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710-4: havoc vatomicptr_await_neq_#in~a#1.base, vatomicptr_await_neq_#in~a#1.offset, vatomicptr_await_neq_#in~c#1.base, vatomicptr_await_neq_#in~c#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710-3: assume { :end_inline_vatomicptr_await_neq } true;vatomicptr_await_neq_rlx_#res#1.base, vatomicptr_await_neq_rlx_#res#1.offset := vatomicptr_await_neq_rlx_#t~ret421#1.base, vatomicptr_await_neq_rlx_#t~ret421#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710-6: vatomicptr_await_neq_rlx_#t~ret421#1.base, vatomicptr_await_neq_rlx_#t~ret421#1.offset := vatomicptr_await_neq_#res#1.base, vatomicptr_await_neq_#res#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710-5: havoc vatomicptr_await_neq_#t~ret677#1.base, vatomicptr_await_neq_#t~ret677#1.offset, vatomicptr_await_neq_#t~ite678#1, vatomicptr_await_neq_~a#1.base, vatomicptr_await_neq_~a#1.offset, vatomicptr_await_neq_~c#1.base, vatomicptr_await_neq_~c#1.offset, vatomicptr_await_neq_~cur~7#1.base, vatomicptr_await_neq_~cur~7#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710-8: havoc vatomicptr_await_neq_#res#1.base, vatomicptr_await_neq_#res#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710-7: havoc vatomicptr_await_neq_#t~ret677#1.base, vatomicptr_await_neq_#t~ret677#1.offset, vatomicptr_await_neq_#t~ite678#1, vatomicptr_await_neq_~a#1.base, vatomicptr_await_neq_~a#1.offset, vatomicptr_await_neq_~c#1.base, vatomicptr_await_neq_~c#1.offset, vatomicptr_await_neq_~cur~7#1.base, vatomicptr_await_neq_~cur~7#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710-9: assume { :begin_inline_vatomicptr_await_neq } true;vatomicptr_await_neq_#in~a#1.base, vatomicptr_await_neq_#in~a#1.offset, vatomicptr_await_neq_#in~c#1.base, vatomicptr_await_neq_#in~c#1.offset := vatomicptr_await_neq_rlx_~a#1.base, vatomicptr_await_neq_rlx_~a#1.offset, vatomicptr_await_neq_rlx_~v#1.base, vatomicptr_await_neq_rlx_~v#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4835: vatomic32_await_eq_~c#1 := vatomic32_await_eq_#in~c#1; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4835-1: vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset := vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset; [2025-02-08 05:46:31,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-1: vatomic32_read_~tmp~2#1 := vatomic32_read_#t~mem432#1; [2025-02-08 05:46:31,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779: havoc vatomic32_read_#t~mem432#1; [2025-02-08 05:46:31,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-3: SUMMARY for call vatomic32_read_#t~mem432#1 := read~int(vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:31,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-2: [2025-02-08 05:46:31,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-5: #race := #race[vatomic32_read_~a#1.base,3 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:31,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-4: assume ((0 == #race[vatomic32_read_~a#1.base,vatomic32_read_~a#1.offset] && 0 == #race[vatomic32_read_~a#1.base,1 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,2 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,3 + vatomic32_read_~a#1.offset]; [2025-02-08 05:46:31,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-4: assume !(((0 == #race[vatomic32_read_~a#1.base,vatomic32_read_~a#1.offset] && 0 == #race[vatomic32_read_~a#1.base,1 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,2 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,3 + vatomic32_read_~a#1.offset]); [2025-02-08 05:46:31,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-7: #race := #race[vatomic32_read_~a#1.base,1 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:31,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-6: #race := #race[vatomic32_read_~a#1.base,2 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-8: #race := #race[vatomic32_read_~a#1.base,vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398: havoc mcslock_acquire_#t~ret802#1.base, mcslock_acquire_#t~ret802#1.offset; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-3: havoc vatomicptr_xchg_#t~mem452#1.base, vatomicptr_xchg_#t~mem452#1.offset, vatomicptr_xchg_#t~nondet453#1, vatomicptr_xchg_~a#1.base, vatomicptr_xchg_~a#1.offset, vatomicptr_xchg_~v#1.base, vatomicptr_xchg_~v#1.offset, vatomicptr_xchg_~tmp~11#1.base, vatomicptr_xchg_~tmp~11#1.offset; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-4: mcslock_acquire_#t~ret802#1.base, mcslock_acquire_#t~ret802#1.offset := vatomicptr_xchg_#res#1.base, vatomicptr_xchg_#res#1.offset; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-1: assume { :end_inline_vatomicptr_xchg } true;mcslock_acquire_~pred~1#1.base, mcslock_acquire_~pred~1#1.offset := mcslock_acquire_#t~ret802#1.base, mcslock_acquire_#t~ret802#1.offset; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-2: havoc vatomicptr_xchg_#in~a#1.base, vatomicptr_xchg_#in~a#1.offset, vatomicptr_xchg_#in~v#1.base, vatomicptr_xchg_#in~v#1.offset; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897: vatomic32_write_rel_~v#1 := vatomic32_write_rel_#in~v#1; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897-1: vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset := vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-12: havoc vatomicptr_write_#t~nondet441#1; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-11: havoc vatomicptr_write_#t~nondet441#1; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-14: assume ((#race[vatomicptr_write_~a#1.base,vatomicptr_write_~a#1.offset] == vatomicptr_write_#t~nondet441#1 && #race[vatomicptr_write_~a#1.base,1 + vatomicptr_write_~a#1.offset] == vatomicptr_write_#t~nondet441#1) && #race[vatomicptr_write_~a#1.base,2 + vatomicptr_write_~a#1.offset] == vatomicptr_write_#t~nondet441#1) && #race[vatomicptr_write_~a#1.base,3 + vatomicptr_write_~a#1.offset] == vatomicptr_write_#t~nondet441#1; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-14: assume !(((#race[vatomicptr_write_~a#1.base,vatomicptr_write_~a#1.offset] == vatomicptr_write_#t~nondet441#1 && #race[vatomicptr_write_~a#1.base,1 + vatomicptr_write_~a#1.offset] == vatomicptr_write_#t~nondet441#1) && #race[vatomicptr_write_~a#1.base,2 + vatomicptr_write_~a#1.offset] == vatomicptr_write_#t~nondet441#1) && #race[vatomicptr_write_~a#1.base,3 + vatomicptr_write_~a#1.offset] == vatomicptr_write_#t~nondet441#1); [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5399: assume mcslock_acquire_~pred~1#1.base != 0 || mcslock_acquire_~pred~1#1.offset != 0; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5399: assume !(mcslock_acquire_~pred~1#1.base != 0 || mcslock_acquire_~pred~1#1.offset != 0); [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-13: [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-16: #race := #race[vatomicptr_write_~a#1.base,2 + vatomicptr_write_~a#1.offset := vatomicptr_write_#t~nondet441#1]; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-15: #race := #race[vatomicptr_write_~a#1.base,3 + vatomicptr_write_~a#1.offset := vatomicptr_write_#t~nondet441#1]; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-18: #race := #race[vatomicptr_write_~a#1.base,vatomicptr_write_~a#1.offset := vatomicptr_write_#t~nondet441#1]; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-17: #race := #race[vatomicptr_write_~a#1.base,1 + vatomicptr_write_~a#1.offset := vatomicptr_write_#t~nondet441#1]; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-20: SUMMARY for call write~$Pointer$(vatomicptr_write_~v#1.base, vatomicptr_write_~v#1.offset, vatomicptr_write_~a#1.base, vatomicptr_write_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-19: havoc vatomicptr_write_#t~nondet441#1; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846-21: [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4838: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~c#1; [2025-02-08 05:46:31,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3781-1: vatomic32_read_#res#1 := vatomic32_read_~tmp~2#1; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5400-1: havoc vatomicptr_write_rel_#in~a#1.base, vatomicptr_write_rel_#in~a#1.offset, vatomicptr_write_rel_#in~v#1.base, vatomicptr_write_rel_#in~v#1.offset; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5400-2: havoc vatomicptr_write_rel_~a#1.base, vatomicptr_write_rel_~a#1.offset, vatomicptr_write_rel_~v#1.base, vatomicptr_write_rel_~v#1.offset; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5400: assume { :end_inline_vatomicptr_write_rel } true;assume { :begin_inline_vatomic32_await_eq_acq } true;vatomic32_await_eq_acq_#in~a#1.base, vatomic32_await_eq_acq_#in~a#1.offset, vatomic32_await_eq_acq_#in~v#1 := mcslock_acquire_~node#1.base, 4 + mcslock_acquire_~node#1.offset, 0; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5400-3: assume { :begin_inline_vatomicptr_write_rel } true;vatomicptr_write_rel_#in~a#1.base, vatomicptr_write_rel_#in~a#1.offset, vatomicptr_write_rel_#in~v#1.base, vatomicptr_write_rel_#in~v#1.offset := mcslock_acquire_~pred~1#1.base, mcslock_acquire_~pred~1#1.offset, mcslock_acquire_~node#1.base, mcslock_acquire_~node#1.offset; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4839: vatomic32_await_eq_~o~5#1 := 0;assume { :begin_inline_verification_loop_begin } true;assume { :end_inline_verification_loop_begin } true; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5401-2: havoc vatomic32_await_eq_acq_#t~ret174#1, vatomic32_await_eq_acq_~a#1.base, vatomic32_await_eq_acq_~a#1.offset, vatomic32_await_eq_acq_~v#1; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5401-3: mcslock_acquire_#t~ret803#1 := vatomic32_await_eq_acq_#res#1; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5401: assume { :end_inline_vatomic32_await_eq_acq } true;havoc mcslock_acquire_#t~ret803#1; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5401-1: havoc vatomic32_await_eq_acq_#in~a#1.base, vatomic32_await_eq_acq_#in~a#1.offset, vatomic32_await_eq_acq_#in~v#1; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5401-4: havoc vatomic32_await_eq_acq_#t~ret174#1, vatomic32_await_eq_acq_~a#1.base, vatomic32_await_eq_acq_~a#1.offset, vatomic32_await_eq_acq_~v#1; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5401-5: havoc vatomic32_await_eq_acq_#res#1; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900: assume { :end_inline_vatomic32_write } true;havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-1: havoc vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1; [2025-02-08 05:46:31,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-2: havoc vatomic32_write_#t~nondet438#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 05:46:31,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-3: havoc vatomic32_write_#t~nondet438#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 05:46:31,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:31,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-4: assume { :begin_inline_vatomic32_write } true;vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1 := vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 05:46:31,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840: assume true;assume { :begin_inline_verification_spin_start } true;assume { :end_inline_verification_spin_start } true;assume { :begin_inline_vatomic32_read } true;vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset := vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset; [2025-02-08 05:46:31,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840: assume !true; [2025-02-08 05:46:31,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-5: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:31,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-6: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:31,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:31,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-9: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:31,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_eq_#t~ite680#1 := 0; [2025-02-08 05:46:31,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume 0 != vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:31,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume !(0 != vatomic32_await_eq_#t~ite680#1); [2025-02-08 05:46:31,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-8: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:31,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296; [2025-02-08 05:46:31,546 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume !(vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296); [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_eq_~o~5#1 := vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-15: vatomic32_await_eq_#t~ite680#1 := 1; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-21: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-22: havoc vatomic32_read_#res#1; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-19: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-20: vatomic32_await_eq_#t~ret679#1 := vatomic32_read_#res#1; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume true; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume !true; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume false; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume !false; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4842: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~o~5#1; [2025-02-08 05:46:31,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4844-1: vatomic32_await_eq_#res#1 := vatomic32_await_eq_~ret~0#1; [2025-02-08 05:46:31,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655: havoc vatomicptr_read_rlx_#t~ret412#1.base, vatomicptr_read_rlx_#t~ret412#1.offset; [2025-02-08 05:46:31,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655-3: assume { :end_inline_vatomicptr_read } true;vatomicptr_read_rlx_#res#1.base, vatomicptr_read_rlx_#res#1.offset := vatomicptr_read_rlx_#t~ret412#1.base, vatomicptr_read_rlx_#t~ret412#1.offset; [2025-02-08 05:46:31,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655-2: havoc vatomicptr_read_rlx_#t~ret412#1.base, vatomicptr_read_rlx_#t~ret412#1.offset; [2025-02-08 05:46:31,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655-5: havoc vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset, vatomicptr_read_~a#1.base, vatomicptr_read_~a#1.offset, vatomicptr_read_~tmp~5#1.base, vatomicptr_read_~tmp~5#1.offset; [2025-02-08 05:46:31,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655-4: havoc vatomicptr_read_#in~a#1.base, vatomicptr_read_#in~a#1.offset; [2025-02-08 05:46:31,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655-6: vatomicptr_read_rlx_#t~ret412#1.base, vatomicptr_read_rlx_#t~ret412#1.offset := vatomicptr_read_#res#1.base, vatomicptr_read_#res#1.offset; [2025-02-08 05:46:31,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3953-1: vatomicptr_cmpxchg_~e#1.base, vatomicptr_cmpxchg_~e#1.offset := vatomicptr_cmpxchg_#in~e#1.base, vatomicptr_cmpxchg_#in~e#1.offset; [2025-02-08 05:46:31,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3953: vatomicptr_cmpxchg_~v#1.base, vatomicptr_cmpxchg_~v#1.offset := vatomicptr_cmpxchg_#in~v#1.base, vatomicptr_cmpxchg_#in~v#1.offset; [2025-02-08 05:46:31,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3953-2: vatomicptr_cmpxchg_~a#1.base, vatomicptr_cmpxchg_~a#1.offset := vatomicptr_cmpxchg_#in~a#1.base, vatomicptr_cmpxchg_#in~a#1.offset; [2025-02-08 05:46:31,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3821-1: vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset := vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3821: vatomic32_write_~v#1 := vatomic32_write_#in~v#1; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3657: vatomicptr_read_acq_~a#1.base, vatomicptr_read_acq_~a#1.offset := vatomicptr_read_acq_#in~a#1.base, vatomicptr_read_acq_#in~a#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5408-1: havoc mcslock_release_#t~ret804#1.base, mcslock_release_#t~ret804#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5408-2: havoc mcslock_release_#t~ret804#1.base, mcslock_release_#t~ret804#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5408: assume mcslock_release_#t~ret804#1.base == 0 && mcslock_release_#t~ret804#1.offset == 0; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5408: assume !(mcslock_release_#t~ret804#1.base == 0 && mcslock_release_#t~ret804#1.offset == 0); [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5408-5: mcslock_release_#t~ret804#1.base, mcslock_release_#t~ret804#1.offset := vatomicptr_read_rlx_#res#1.base, vatomicptr_read_rlx_#res#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5408-3: havoc vatomicptr_read_rlx_#in~a#1.base, vatomicptr_read_rlx_#in~a#1.offset;assume { :end_inline_vatomicptr_read_rlx } true; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5408-4: havoc vatomicptr_read_rlx_#t~ret412#1.base, vatomicptr_read_rlx_#t~ret412#1.offset, vatomicptr_read_rlx_~a#1.base, vatomicptr_read_rlx_~a#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409-2: havoc vatomicptr_cmpxchg_rel_#in~a#1.base, vatomicptr_cmpxchg_rel_#in~a#1.offset, vatomicptr_cmpxchg_rel_#in~e#1.base, vatomicptr_cmpxchg_rel_#in~e#1.offset, vatomicptr_cmpxchg_rel_#in~v#1.base, vatomicptr_cmpxchg_rel_#in~v#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409-3: havoc vatomicptr_cmpxchg_rel_#t~ret419#1.base, vatomicptr_cmpxchg_rel_#t~ret419#1.offset, vatomicptr_cmpxchg_rel_~a#1.base, vatomicptr_cmpxchg_rel_~a#1.offset, vatomicptr_cmpxchg_rel_~e#1.base, vatomicptr_cmpxchg_rel_~e#1.offset, vatomicptr_cmpxchg_rel_~v#1.base, vatomicptr_cmpxchg_rel_~v#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409: havoc mcslock_release_#t~ret805#1.base, mcslock_release_#t~ret805#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409-1: assume { :end_inline_vatomicptr_cmpxchg_rel } true;mcslock_release_~next~0#1.base, mcslock_release_~next~0#1.offset := mcslock_release_#t~ret805#1.base, mcslock_release_#t~ret805#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409-6: havoc vatomicptr_cmpxchg_rel_#res#1.base, vatomicptr_cmpxchg_rel_#res#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409-7: assume { :begin_inline_vatomicptr_cmpxchg_rel } true;vatomicptr_cmpxchg_rel_#in~a#1.base, vatomicptr_cmpxchg_rel_#in~a#1.offset, vatomicptr_cmpxchg_rel_#in~e#1.base, vatomicptr_cmpxchg_rel_#in~e#1.offset, vatomicptr_cmpxchg_rel_#in~v#1.base, vatomicptr_cmpxchg_rel_#in~v#1.offset := mcslock_release_~l#1.base, mcslock_release_~l#1.offset, mcslock_release_~node#1.base, mcslock_release_~node#1.offset, 0, 0; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409-4: mcslock_release_#t~ret805#1.base, mcslock_release_#t~ret805#1.offset := vatomicptr_cmpxchg_rel_#res#1.base, vatomicptr_cmpxchg_rel_#res#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409-5: havoc vatomicptr_cmpxchg_rel_#t~ret419#1.base, vatomicptr_cmpxchg_rel_#t~ret419#1.offset, vatomicptr_cmpxchg_rel_~a#1.base, vatomicptr_cmpxchg_rel_~a#1.offset, vatomicptr_cmpxchg_rel_~e#1.base, vatomicptr_cmpxchg_rel_~e#1.offset, vatomicptr_cmpxchg_rel_~v#1.base, vatomicptr_cmpxchg_rel_~v#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3956: vatomicptr_cmpxchg_~exp~5#1.base, vatomicptr_cmpxchg_~exp~5#1.offset := vatomicptr_cmpxchg_~e#1.base, vatomicptr_cmpxchg_~e#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5410: assume mcslock_release_~next~0#1.base == mcslock_release_~node#1.base && mcslock_release_~next~0#1.offset == mcslock_release_~node#1.offset; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5410: assume !(mcslock_release_~next~0#1.base == mcslock_release_~node#1.base && mcslock_release_~next~0#1.offset == mcslock_release_~node#1.offset); [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-1: havoc vatomic32_write_#t~nondet438#1; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825: havoc vatomic32_write_#t~nondet438#1; [2025-02-08 05:46:31,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-3: assume ((#race[vatomic32_write_~a#1.base,vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet438#1 && #race[vatomic32_write_~a#1.base,1 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet438#1) && #race[vatomic32_write_~a#1.base,2 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet438#1) && #race[vatomic32_write_~a#1.base,3 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet438#1; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-3: assume !(((#race[vatomic32_write_~a#1.base,vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet438#1 && #race[vatomic32_write_~a#1.base,1 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet438#1) && #race[vatomic32_write_~a#1.base,2 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet438#1) && #race[vatomic32_write_~a#1.base,3 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet438#1); [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-2: [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-5: #race := #race[vatomic32_write_~a#1.base,2 + vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet438#1]; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-4: #race := #race[vatomic32_write_~a#1.base,3 + vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet438#1]; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-7: #race := #race[vatomic32_write_~a#1.base,vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet438#1]; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660-2: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-6: #race := #race[vatomic32_write_~a#1.base,1 + vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet438#1]; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-9: SUMMARY for call write~int(vatomic32_write_~v#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660-4: havoc vatomicptr_read_#in~a#1.base, vatomicptr_read_#in~a#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-8: havoc vatomic32_write_#t~nondet438#1; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660-3: assume { :end_inline_vatomicptr_read } true;vatomicptr_read_acq_#res#1.base, vatomicptr_read_acq_#res#1.offset := vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660-6: vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset := vatomicptr_read_#res#1.base, vatomicptr_read_#res#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-10: [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660-5: havoc vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset, vatomicptr_read_~a#1.base, vatomicptr_read_~a#1.offset, vatomicptr_read_~tmp~5#1.base, vatomicptr_read_~tmp~5#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660-8: havoc vatomicptr_read_#res#1.base, vatomicptr_read_#res#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660-7: havoc vatomicptr_read_#t~mem435#1.base, vatomicptr_read_#t~mem435#1.offset, vatomicptr_read_~a#1.base, vatomicptr_read_~a#1.offset, vatomicptr_read_~tmp~5#1.base, vatomicptr_read_~tmp~5#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660-9: assume { :begin_inline_vatomicptr_read } true;vatomicptr_read_#in~a#1.base, vatomicptr_read_#in~a#1.offset := vatomicptr_read_acq_~a#1.base, vatomicptr_read_acq_~a#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958: havoc vatomicptr_cmpxchg_#t~nondet477#1; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-2: havoc vatomicptr_cmpxchg_#t~mem475#1.base, vatomicptr_cmpxchg_#t~mem475#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-1: havoc vatomicptr_cmpxchg_#t~ret476#1.base, vatomicptr_cmpxchg_#t~ret476#1.offset; [2025-02-08 05:46:31,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-4: havoc vatomicptr_cmpxchg_#t~nondet477#1; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-3: havoc vatomicptr_cmpxchg_#t~ret474#1; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-6: havoc vatomicptr_cmpxchg_#t~mem475#1.base, vatomicptr_cmpxchg_#t~mem475#1.offset; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-5: havoc vatomicptr_cmpxchg_#t~ret476#1.base, vatomicptr_cmpxchg_#t~ret476#1.offset; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-8: [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-7: havoc vatomicptr_cmpxchg_#t~ret474#1; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-10: #race := #race[vatomicptr_cmpxchg_~a#1.base,3 + vatomicptr_cmpxchg_~a#1.offset := vatomicptr_cmpxchg_#t~nondet477#1]; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-9: assume ((#race[vatomicptr_cmpxchg_~a#1.base,vatomicptr_cmpxchg_~a#1.offset] == vatomicptr_cmpxchg_#t~nondet477#1 && #race[vatomicptr_cmpxchg_~a#1.base,1 + vatomicptr_cmpxchg_~a#1.offset] == vatomicptr_cmpxchg_#t~nondet477#1) && #race[vatomicptr_cmpxchg_~a#1.base,2 + vatomicptr_cmpxchg_~a#1.offset] == vatomicptr_cmpxchg_#t~nondet477#1) && #race[vatomicptr_cmpxchg_~a#1.base,3 + vatomicptr_cmpxchg_~a#1.offset] == vatomicptr_cmpxchg_#t~nondet477#1; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-9: assume !(((#race[vatomicptr_cmpxchg_~a#1.base,vatomicptr_cmpxchg_~a#1.offset] == vatomicptr_cmpxchg_#t~nondet477#1 && #race[vatomicptr_cmpxchg_~a#1.base,1 + vatomicptr_cmpxchg_~a#1.offset] == vatomicptr_cmpxchg_#t~nondet477#1) && #race[vatomicptr_cmpxchg_~a#1.base,2 + vatomicptr_cmpxchg_~a#1.offset] == vatomicptr_cmpxchg_#t~nondet477#1) && #race[vatomicptr_cmpxchg_~a#1.base,3 + vatomicptr_cmpxchg_~a#1.offset] == vatomicptr_cmpxchg_#t~nondet477#1); [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-12: #race := #race[vatomicptr_cmpxchg_~a#1.base,1 + vatomicptr_cmpxchg_~a#1.offset := vatomicptr_cmpxchg_#t~nondet477#1]; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-11: #race := #race[vatomicptr_cmpxchg_~a#1.base,2 + vatomicptr_cmpxchg_~a#1.offset := vatomicptr_cmpxchg_#t~nondet477#1]; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-14: havoc vatomicptr_cmpxchg_#t~nondet477#1; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-13: #race := #race[vatomicptr_cmpxchg_~a#1.base,vatomicptr_cmpxchg_~a#1.offset := vatomicptr_cmpxchg_#t~nondet477#1]; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-16: assume 0 != vatomicptr_cmpxchg_#t~ret474#1 % 256; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-16: assume !(0 != vatomicptr_cmpxchg_#t~ret474#1 % 256); [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-15: SUMMARY for call write~$Pointer$(vatomicptr_cmpxchg_~v#1.base, vatomicptr_cmpxchg_~v#1.offset, vatomicptr_cmpxchg_~a#1.base, vatomicptr_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-18: vatomicptr_cmpxchg_#t~ret474#1 := (if vatomicptr_cmpxchg_#t~mem475#1.base == vatomicptr_cmpxchg_#t~ret476#1.base && vatomicptr_cmpxchg_#t~mem475#1.offset == vatomicptr_cmpxchg_#t~ret476#1.offset then 1 else 0); [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-17: vatomicptr_cmpxchg_~exp~5#1.base, vatomicptr_cmpxchg_~exp~5#1.offset := vatomicptr_cmpxchg_#t~mem475#1.base, vatomicptr_cmpxchg_#t~mem475#1.offset; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-20: SUMMARY for call vatomicptr_cmpxchg_#t~mem475#1.base, vatomicptr_cmpxchg_#t~mem475#1.offset := read~$Pointer$(vatomicptr_cmpxchg_~a#1.base, vatomicptr_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-19: vatomicptr_cmpxchg_#t~ret476#1.base, vatomicptr_cmpxchg_#t~ret476#1.offset := vatomicptr_cmpxchg_~exp~5#1.base, vatomicptr_cmpxchg_~exp~5#1.offset; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-22: #race := #race[vatomicptr_cmpxchg_~a#1.base,3 + vatomicptr_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-21: assume ((0 == #race[vatomicptr_cmpxchg_~a#1.base,vatomicptr_cmpxchg_~a#1.offset] && 0 == #race[vatomicptr_cmpxchg_~a#1.base,1 + vatomicptr_cmpxchg_~a#1.offset]) && 0 == #race[vatomicptr_cmpxchg_~a#1.base,2 + vatomicptr_cmpxchg_~a#1.offset]) && 0 == #race[vatomicptr_cmpxchg_~a#1.base,3 + vatomicptr_cmpxchg_~a#1.offset]; [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-21: assume !(((0 == #race[vatomicptr_cmpxchg_~a#1.base,vatomicptr_cmpxchg_~a#1.offset] && 0 == #race[vatomicptr_cmpxchg_~a#1.base,1 + vatomicptr_cmpxchg_~a#1.offset]) && 0 == #race[vatomicptr_cmpxchg_~a#1.base,2 + vatomicptr_cmpxchg_~a#1.offset]) && 0 == #race[vatomicptr_cmpxchg_~a#1.base,3 + vatomicptr_cmpxchg_~a#1.offset]); [2025-02-08 05:46:31,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-24: #race := #race[vatomicptr_cmpxchg_~a#1.base,1 + vatomicptr_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-23: #race := #race[vatomicptr_cmpxchg_~a#1.base,2 + vatomicptr_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958-25: #race := #race[vatomicptr_cmpxchg_~a#1.base,vatomicptr_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5413-2: havoc vatomicptr_await_neq_rlx_#t~ret421#1.base, vatomicptr_await_neq_rlx_#t~ret421#1.offset, vatomicptr_await_neq_rlx_~a#1.base, vatomicptr_await_neq_rlx_~a#1.offset, vatomicptr_await_neq_rlx_~v#1.base, vatomicptr_await_neq_rlx_~v#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5413-3: mcslock_release_#t~ret806#1.base, mcslock_release_#t~ret806#1.offset := vatomicptr_await_neq_rlx_#res#1.base, vatomicptr_await_neq_rlx_#res#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5413: assume { :end_inline_vatomicptr_await_neq_rlx } true;havoc mcslock_release_#t~ret806#1.base, mcslock_release_#t~ret806#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5413-1: havoc vatomicptr_await_neq_rlx_#in~a#1.base, vatomicptr_await_neq_rlx_#in~a#1.offset, vatomicptr_await_neq_rlx_#in~v#1.base, vatomicptr_await_neq_rlx_#in~v#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5413-6: assume { :begin_inline_vatomicptr_await_neq_rlx } true;vatomicptr_await_neq_rlx_#in~a#1.base, vatomicptr_await_neq_rlx_#in~a#1.offset, vatomicptr_await_neq_rlx_#in~v#1.base, vatomicptr_await_neq_rlx_#in~v#1.offset := mcslock_release_~node#1.base, mcslock_release_~node#1.offset, 0, 0; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5413-4: havoc vatomicptr_await_neq_rlx_#t~ret421#1.base, vatomicptr_await_neq_rlx_#t~ret421#1.offset, vatomicptr_await_neq_rlx_~a#1.base, vatomicptr_await_neq_rlx_~a#1.offset, vatomicptr_await_neq_rlx_~v#1.base, vatomicptr_await_neq_rlx_~v#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5413-5: havoc vatomicptr_await_neq_rlx_#res#1.base, vatomicptr_await_neq_rlx_#res#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3961-1: vatomicptr_cmpxchg_#res#1.base, vatomicptr_cmpxchg_#res#1.offset := vatomicptr_cmpxchg_~exp~5#1.base, vatomicptr_cmpxchg_~exp~5#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3697-1: vatomicptr_cmpxchg_rel_~e#1.base, vatomicptr_cmpxchg_rel_~e#1.offset := vatomicptr_cmpxchg_rel_#in~e#1.base, vatomicptr_cmpxchg_rel_#in~e#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3697: vatomicptr_cmpxchg_rel_~v#1.base, vatomicptr_cmpxchg_rel_~v#1.offset := vatomicptr_cmpxchg_rel_#in~v#1.base, vatomicptr_cmpxchg_rel_#in~v#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3697-2: vatomicptr_cmpxchg_rel_~a#1.base, vatomicptr_cmpxchg_rel_~a#1.offset := vatomicptr_cmpxchg_rel_#in~a#1.base, vatomicptr_cmpxchg_rel_#in~a#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5415: havoc mcslock_release_#t~ret807#1.base, mcslock_release_#t~ret807#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5415-1: assume { :end_inline_vatomicptr_read_acq } true;mcslock_release_~next~0#1.base, mcslock_release_~next~0#1.offset := mcslock_release_#t~ret807#1.base, mcslock_release_#t~ret807#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5415-4: mcslock_release_#t~ret807#1.base, mcslock_release_#t~ret807#1.offset := vatomicptr_read_acq_#res#1.base, vatomicptr_read_acq_#res#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5415-5: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset, vatomicptr_read_acq_~a#1.base, vatomicptr_read_acq_~a#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5415-2: havoc vatomicptr_read_acq_#in~a#1.base, vatomicptr_read_acq_#in~a#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5415-3: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset, vatomicptr_read_acq_~a#1.base, vatomicptr_read_acq_~a#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5415-6: havoc vatomicptr_read_acq_#res#1.base, vatomicptr_read_acq_#res#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5415-7: assume { :begin_inline_vatomicptr_read_acq } true;vatomicptr_read_acq_#in~a#1.base, vatomicptr_read_acq_#in~a#1.offset := mcslock_release_~node#1.base, mcslock_release_~node#1.offset; [2025-02-08 05:46:31,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5416-1: havoc vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5416-2: havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5416: assume { :end_inline_vatomic32_write_rel } true;havoc mcslock_release_#t~ret804#1.base, mcslock_release_#t~ret804#1.offset, mcslock_release_#t~ret805#1.base, mcslock_release_#t~ret805#1.offset, mcslock_release_#t~ret806#1.base, mcslock_release_#t~ret806#1.offset, mcslock_release_#t~ret807#1.base, mcslock_release_#t~ret807#1.offset, mcslock_release_~l#1.base, mcslock_release_~l#1.offset, mcslock_release_~node#1.base, mcslock_release_~node#1.offset, mcslock_release_~next~0#1.base, mcslock_release_~next~0#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5416-3: assume { :begin_inline_vatomic32_write_rel } true;vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1 := mcslock_release_~next~0#1.base, 4 + mcslock_release_~next~0#1.offset, 0; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3799-1: vatomicptr_read_~a#1.base, vatomicptr_read_~a#1.offset := vatomicptr_read_#in~a#1.base, vatomicptr_read_#in~a#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3799: vatomicptr_read_~a#1.base, vatomicptr_read_~a#1.offset := vatomicptr_read_#in~a#1.base, vatomicptr_read_#in~a#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700: havoc vatomicptr_cmpxchg_rel_#t~ret419#1.base, vatomicptr_cmpxchg_rel_#t~ret419#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700-2: havoc vatomicptr_cmpxchg_rel_#t~ret419#1.base, vatomicptr_cmpxchg_rel_#t~ret419#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3667-1: vatomicptr_write_rel_~a#1.base, vatomicptr_write_rel_~a#1.offset := vatomicptr_write_rel_#in~a#1.base, vatomicptr_write_rel_#in~a#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3667: vatomicptr_write_rel_~v#1.base, vatomicptr_write_rel_~v#1.offset := vatomicptr_write_rel_#in~v#1.base, vatomicptr_write_rel_#in~v#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700-4: havoc vatomicptr_cmpxchg_#in~a#1.base, vatomicptr_cmpxchg_#in~a#1.offset, vatomicptr_cmpxchg_#in~e#1.base, vatomicptr_cmpxchg_#in~e#1.offset, vatomicptr_cmpxchg_#in~v#1.base, vatomicptr_cmpxchg_#in~v#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700-3: assume { :end_inline_vatomicptr_cmpxchg } true;vatomicptr_cmpxchg_rel_#res#1.base, vatomicptr_cmpxchg_rel_#res#1.offset := vatomicptr_cmpxchg_rel_#t~ret419#1.base, vatomicptr_cmpxchg_rel_#t~ret419#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700-6: vatomicptr_cmpxchg_rel_#t~ret419#1.base, vatomicptr_cmpxchg_rel_#t~ret419#1.offset := vatomicptr_cmpxchg_#res#1.base, vatomicptr_cmpxchg_#res#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700-5: havoc vatomicptr_cmpxchg_#t~ret474#1, vatomicptr_cmpxchg_#t~mem475#1.base, vatomicptr_cmpxchg_#t~mem475#1.offset, vatomicptr_cmpxchg_#t~ret476#1.base, vatomicptr_cmpxchg_#t~ret476#1.offset, vatomicptr_cmpxchg_#t~nondet477#1, vatomicptr_cmpxchg_~a#1.base, vatomicptr_cmpxchg_~a#1.offset, vatomicptr_cmpxchg_~e#1.base, vatomicptr_cmpxchg_~e#1.offset, vatomicptr_cmpxchg_~v#1.base, vatomicptr_cmpxchg_~v#1.offset, vatomicptr_cmpxchg_~exp~5#1.base, vatomicptr_cmpxchg_~exp~5#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700-8: havoc vatomicptr_cmpxchg_#res#1.base, vatomicptr_cmpxchg_#res#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700-7: havoc vatomicptr_cmpxchg_#t~ret474#1, vatomicptr_cmpxchg_#t~mem475#1.base, vatomicptr_cmpxchg_#t~mem475#1.offset, vatomicptr_cmpxchg_#t~ret476#1.base, vatomicptr_cmpxchg_#t~ret476#1.offset, vatomicptr_cmpxchg_#t~nondet477#1, vatomicptr_cmpxchg_~a#1.base, vatomicptr_cmpxchg_~a#1.offset, vatomicptr_cmpxchg_~e#1.base, vatomicptr_cmpxchg_~e#1.offset, vatomicptr_cmpxchg_~v#1.base, vatomicptr_cmpxchg_~v#1.offset, vatomicptr_cmpxchg_~exp~5#1.base, vatomicptr_cmpxchg_~exp~5#1.offset; [2025-02-08 05:46:31,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700-9: assume { :begin_inline_vatomicptr_cmpxchg } true;vatomicptr_cmpxchg_#in~a#1.base, vatomicptr_cmpxchg_#in~a#1.offset, vatomicptr_cmpxchg_#in~e#1.base, vatomicptr_cmpxchg_#in~e#1.offset, vatomicptr_cmpxchg_#in~v#1.base, vatomicptr_cmpxchg_#in~v#1.offset := vatomicptr_cmpxchg_rel_~a#1.base, vatomicptr_cmpxchg_rel_~a#1.offset, vatomicptr_cmpxchg_rel_~e#1.base, vatomicptr_cmpxchg_rel_~e#1.offset, vatomicptr_cmpxchg_rel_~v#1.base, vatomicptr_cmpxchg_rel_~v#1.offset; [2025-02-08 05:46:31,559 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:46:31,559 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:46:31,664 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:46:31,665 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:46:31,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:31 BoogieIcfgContainer [2025-02-08 05:46:31,665 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:46:31,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:46:31,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:46:31,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:46:31,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:46:27" (1/3) ... [2025-02-08 05:46:31,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52789bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:31, skipping insertion in model container [2025-02-08 05:46:31,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:30" (2/3) ... [2025-02-08 05:46:31,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52789bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:31, skipping insertion in model container [2025-02-08 05:46:31,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:31" (3/3) ... [2025-02-08 05:46:31,676 INFO L128 eAbstractionObserver]: Analyzing ICFG mcslock.i [2025-02-08 05:46:31,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:46:31,690 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mcslock.i that has 2 procedures, 322 locations, 1 initial locations, 45 loop locations, and 25 error locations. [2025-02-08 05:46:31,690 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:46:31,840 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:46:31,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 363 transitions, 733 flow [2025-02-08 05:46:32,047 INFO L124 PetriNetUnfolderBase]: 55/441 cut-off events. [2025-02-08 05:46:32,049 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:46:32,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 441 events. 55/441 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1343 event pairs, 0 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 316. Up to 6 conditions per place. [2025-02-08 05:46:32,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 363 transitions, 733 flow [2025-02-08 05:46:32,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 363 transitions, 733 flow [2025-02-08 05:46:32,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:32,102 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;@386a34e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:32,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-08 05:46:32,119 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:32,123 INFO L124 PetriNetUnfolderBase]: 12/70 cut-off events. [2025-02-08 05:46:32,123 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:32,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:32,123 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] [2025-02-08 05:46:32,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-08 05:46:32,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1295256566, now seen corresponding path program 1 times [2025-02-08 05:46:32,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:32,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118490800] [2025-02-08 05:46:32,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:32,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:46:32,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:46:32,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:32,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:32,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118490800] [2025-02-08 05:46:32,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118490800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:32,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:32,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:32,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594468679] [2025-02-08 05:46:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:32,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:32,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:32,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:32,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 363 [2025-02-08 05:46:32,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 363 transitions, 733 flow. Second operand has 2 states, 2 states have (on average 306.5) internal successors, (613), 2 states have internal predecessors, (613), 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-02-08 05:46:32,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:32,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 363 [2025-02-08 05:46:32,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:32,571 INFO L124 PetriNetUnfolderBase]: 2/342 cut-off events. [2025-02-08 05:46:32,572 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:46:32,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 342 events. 2/342 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 854 event pairs, 0 based on Foata normal form. 151/471 useless extension candidates. Maximal degree in co-relation 248. Up to 10 conditions per place. [2025-02-08 05:46:32,577 INFO L140 encePairwiseOnDemand]: 315/363 looper letters, 9 selfloop transitions, 0 changer transitions 0/282 dead transitions. [2025-02-08 05:46:32,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 589 flow [2025-02-08 05:46:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 669 transitions. [2025-02-08 05:46:32,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214876033057852 [2025-02-08 05:46:32,594 INFO L175 Difference]: Start difference. First operand has 325 places, 363 transitions, 733 flow. Second operand 2 states and 669 transitions. [2025-02-08 05:46:32,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 589 flow [2025-02-08 05:46:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 282 transitions, 589 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:32,610 INFO L231 Difference]: Finished difference. Result has 284 places, 282 transitions, 571 flow [2025-02-08 05:46:32,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=571, PETRI_PLACES=284, PETRI_TRANSITIONS=282} [2025-02-08 05:46:32,617 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -41 predicate places. [2025-02-08 05:46:32,618 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 282 transitions, 571 flow [2025-02-08 05:46:32,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 306.5) internal successors, (613), 2 states have internal predecessors, (613), 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-02-08 05:46:32,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:32,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:32,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:46:32,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-08 05:46:32,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash -49754287, now seen corresponding path program 1 times [2025-02-08 05:46:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:32,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357006476] [2025-02-08 05:46:32,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:32,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:46:32,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:46:32,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:32,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357006476] [2025-02-08 05:46:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357006476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:33,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290295665] [2025-02-08 05:46:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:33,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:33,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:33,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:34,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 363 [2025-02-08 05:46:34,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 282 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 288.5) internal successors, (1731), 6 states have internal predecessors, (1731), 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-02-08 05:46:34,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:34,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 363 [2025-02-08 05:46:34,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:34,521 INFO L124 PetriNetUnfolderBase]: 124/1353 cut-off events. [2025-02-08 05:46:34,521 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:46:34,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 1353 events. 124/1353 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 10463 event pairs, 67 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1665. Up to 257 conditions per place. [2025-02-08 05:46:34,528 INFO L140 encePairwiseOnDemand]: 349/363 looper letters, 27 selfloop transitions, 34 changer transitions 0/315 dead transitions. [2025-02-08 05:46:34,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 315 transitions, 759 flow [2025-02-08 05:46:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1784 transitions. [2025-02-08 05:46:34,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8191000918273645 [2025-02-08 05:46:34,534 INFO L175 Difference]: Start difference. First operand has 284 places, 282 transitions, 571 flow. Second operand 6 states and 1784 transitions. [2025-02-08 05:46:34,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 315 transitions, 759 flow [2025-02-08 05:46:34,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 315 transitions, 759 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:34,542 INFO L231 Difference]: Finished difference. Result has 294 places, 315 transitions, 799 flow [2025-02-08 05:46:34,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=799, PETRI_PLACES=294, PETRI_TRANSITIONS=315} [2025-02-08 05:46:34,543 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -31 predicate places. [2025-02-08 05:46:34,543 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 315 transitions, 799 flow [2025-02-08 05:46:34,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 288.5) internal successors, (1731), 6 states have internal predecessors, (1731), 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-02-08 05:46:34,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:34,545 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-02-08 05:46:34,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:46:34,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-08 05:46:34,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash -627359968, now seen corresponding path program 1 times [2025-02-08 05:46:34,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10470535] [2025-02-08 05:46:34,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:34,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:46:34,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:46:34,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:34,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:34,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:34,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10470535] [2025-02-08 05:46:34,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10470535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:34,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:34,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:34,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286179957] [2025-02-08 05:46:34,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:34,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:34,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:34,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:34,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:34,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 363 [2025-02-08 05:46:34,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 315 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 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-02-08 05:46:34,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:34,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 363 [2025-02-08 05:46:34,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:34,849 INFO L124 PetriNetUnfolderBase]: 69/1059 cut-off events. [2025-02-08 05:46:34,849 INFO L125 PetriNetUnfolderBase]: For 219/316 co-relation queries the response was YES. [2025-02-08 05:46:34,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 1059 events. 69/1059 cut-off events. For 219/316 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7353 event pairs, 0 based on Foata normal form. 12/1017 useless extension candidates. Maximal degree in co-relation 1444. Up to 99 conditions per place. [2025-02-08 05:46:34,854 INFO L140 encePairwiseOnDemand]: 360/363 looper letters, 47 selfloop transitions, 1 changer transitions 0/320 dead transitions. [2025-02-08 05:46:34,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 320 transitions, 919 flow [2025-02-08 05:46:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-02-08 05:46:34,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8356290174471993 [2025-02-08 05:46:34,858 INFO L175 Difference]: Start difference. First operand has 294 places, 315 transitions, 799 flow. Second operand 3 states and 910 transitions. [2025-02-08 05:46:34,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 320 transitions, 919 flow [2025-02-08 05:46:34,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 320 transitions, 919 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:34,865 INFO L231 Difference]: Finished difference. Result has 294 places, 313 transitions, 797 flow [2025-02-08 05:46:34,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=294, PETRI_TRANSITIONS=313} [2025-02-08 05:46:34,866 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -31 predicate places. [2025-02-08 05:46:34,866 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 313 transitions, 797 flow [2025-02-08 05:46:34,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 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-02-08 05:46:34,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:34,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:34,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:46:34,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-08 05:46:34,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1597478540, now seen corresponding path program 1 times [2025-02-08 05:46:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:34,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462050751] [2025-02-08 05:46:34,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:34,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:46:34,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:46:34,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:34,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:34,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:34,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462050751] [2025-02-08 05:46:34,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462050751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:34,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:34,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888869168] [2025-02-08 05:46:34,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:34,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:34,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:34,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:34,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 363 [2025-02-08 05:46:34,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 313 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 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-02-08 05:46:34,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:34,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 363 [2025-02-08 05:46:34,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:35,115 INFO L124 PetriNetUnfolderBase]: 55/1090 cut-off events. [2025-02-08 05:46:35,115 INFO L125 PetriNetUnfolderBase]: For 205/272 co-relation queries the response was YES. [2025-02-08 05:46:35,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 1090 events. 55/1090 cut-off events. For 205/272 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 7430 event pairs, 7 based on Foata normal form. 12/1059 useless extension candidates. Maximal degree in co-relation 1431. Up to 85 conditions per place. [2025-02-08 05:46:35,122 INFO L140 encePairwiseOnDemand]: 361/363 looper letters, 38 selfloop transitions, 1 changer transitions 7/319 dead transitions. [2025-02-08 05:46:35,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 319 transitions, 915 flow [2025-02-08 05:46:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-02-08 05:46:35,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8411386593204775 [2025-02-08 05:46:35,125 INFO L175 Difference]: Start difference. First operand has 294 places, 313 transitions, 797 flow. Second operand 3 states and 916 transitions. [2025-02-08 05:46:35,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 319 transitions, 915 flow [2025-02-08 05:46:35,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 319 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:35,134 INFO L231 Difference]: Finished difference. Result has 294 places, 312 transitions, 796 flow [2025-02-08 05:46:35,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=294, PETRI_TRANSITIONS=312} [2025-02-08 05:46:35,135 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -31 predicate places. [2025-02-08 05:46:35,135 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 312 transitions, 796 flow [2025-02-08 05:46:35,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 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-02-08 05:46:35,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:35,137 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] [2025-02-08 05:46:35,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:46:35,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-08 05:46:35,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 83356043, now seen corresponding path program 1 times [2025-02-08 05:46:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:35,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971264946] [2025-02-08 05:46:35,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:35,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:46:35,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:46:35,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:35,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:35,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:35,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971264946] [2025-02-08 05:46:35,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971264946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:35,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:35,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640398509] [2025-02-08 05:46:35,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:35,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:35,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:35,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:35,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:35,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 363 [2025-02-08 05:46:35,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 312 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-02-08 05:46:35,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:35,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 363 [2025-02-08 05:46:35,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:35,520 INFO L124 PetriNetUnfolderBase]: 68/1279 cut-off events. [2025-02-08 05:46:35,520 INFO L125 PetriNetUnfolderBase]: For 205/340 co-relation queries the response was YES. [2025-02-08 05:46:35,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 1279 events. 68/1279 cut-off events. For 205/340 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9483 event pairs, 21 based on Foata normal form. 10/1225 useless extension candidates. Maximal degree in co-relation 1681. Up to 119 conditions per place. [2025-02-08 05:46:35,529 INFO L140 encePairwiseOnDemand]: 360/363 looper letters, 51 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2025-02-08 05:46:35,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 322 transitions, 948 flow [2025-02-08 05:46:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-02-08 05:46:35,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8475665748393021 [2025-02-08 05:46:35,533 INFO L175 Difference]: Start difference. First operand has 294 places, 312 transitions, 796 flow. Second operand 3 states and 923 transitions. [2025-02-08 05:46:35,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 322 transitions, 948 flow [2025-02-08 05:46:35,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 322 transitions, 947 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:35,543 INFO L231 Difference]: Finished difference. Result has 296 places, 312 transitions, 803 flow [2025-02-08 05:46:35,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=803, PETRI_PLACES=296, PETRI_TRANSITIONS=312} [2025-02-08 05:46:35,545 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -29 predicate places. [2025-02-08 05:46:35,545 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 312 transitions, 803 flow [2025-02-08 05:46:35,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-02-08 05:46:35,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:35,546 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:46:35,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:46:35,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-08 05:46:35,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1577430776, now seen corresponding path program 1 times [2025-02-08 05:46:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:35,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147332064] [2025-02-08 05:46:35,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:35,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:46:35,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:46:35,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:35,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:35,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:46:35,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:46:35,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:46:35,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:35,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:35,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:46:35,644 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:46:35,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-02-08 05:46:35,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2025-02-08 05:46:35,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2025-02-08 05:46:35,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2025-02-08 05:46:35,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2025-02-08 05:46:35,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2025-02-08 05:46:35,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining) [2025-02-08 05:46:35,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2025-02-08 05:46:35,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2025-02-08 05:46:35,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2025-02-08 05:46:35,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2025-02-08 05:46:35,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (20 of 32 remaining) [2025-02-08 05:46:35,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2025-02-08 05:46:35,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2025-02-08 05:46:35,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2025-02-08 05:46:35,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2025-02-08 05:46:35,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2025-02-08 05:46:35,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2025-02-08 05:46:35,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2025-02-08 05:46:35,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2025-02-08 05:46:35,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2025-02-08 05:46:35,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2025-02-08 05:46:35,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2025-02-08 05:46:35,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2025-02-08 05:46:35,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2025-02-08 05:46:35,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2025-02-08 05:46:35,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2025-02-08 05:46:35,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2025-02-08 05:46:35,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2025-02-08 05:46:35,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2025-02-08 05:46:35,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2025-02-08 05:46:35,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2025-02-08 05:46:35,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:46:35,651 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:46:35,653 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:46:35,653 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:46:35,820 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:46:35,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 540 places, 597 transitions, 1210 flow [2025-02-08 05:46:35,971 INFO L124 PetriNetUnfolderBase]: 99/816 cut-off events. [2025-02-08 05:46:35,971 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:46:35,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 816 events. 99/816 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3707 event pairs, 0 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 601. Up to 12 conditions per place. [2025-02-08 05:46:35,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 540 places, 597 transitions, 1210 flow [2025-02-08 05:46:36,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 540 places, 597 transitions, 1210 flow [2025-02-08 05:46:36,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:36,008 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;@386a34e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:36,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-02-08 05:46:36,015 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:36,015 INFO L124 PetriNetUnfolderBase]: 12/70 cut-off events. [2025-02-08 05:46:36,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:36,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:36,016 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] [2025-02-08 05:46:36,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-02-08 05:46:36,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:36,016 INFO L85 PathProgramCache]: Analyzing trace with hash -543066005, now seen corresponding path program 1 times [2025-02-08 05:46:36,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:36,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004954773] [2025-02-08 05:46:36,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:36,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:36,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:46:36,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:46:36,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:36,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004954773] [2025-02-08 05:46:36,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004954773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:36,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:36,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821042668] [2025-02-08 05:46:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:36,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:36,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:36,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:36,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 597 [2025-02-08 05:46:36,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 597 transitions, 1210 flow. Second operand has 2 states, 2 states have (on average 503.5) internal successors, (1007), 2 states have internal predecessors, (1007), 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-02-08 05:46:36,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:36,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 597 [2025-02-08 05:46:36,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:36,701 INFO L124 PetriNetUnfolderBase]: 82/2961 cut-off events. [2025-02-08 05:46:36,701 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-08 05:46:36,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3169 conditions, 2961 events. 82/2961 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 26307 event pairs, 70 based on Foata normal form. 1496/4221 useless extension candidates. Maximal degree in co-relation 746. Up to 161 conditions per place. [2025-02-08 05:46:36,732 INFO L140 encePairwiseOnDemand]: 521/597 looper letters, 18 selfloop transitions, 0 changer transitions 0/459 dead transitions. [2025-02-08 05:46:36,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 459 transitions, 970 flow [2025-02-08 05:46:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1100 transitions. [2025-02-08 05:46:36,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212730318257957 [2025-02-08 05:46:36,736 INFO L175 Difference]: Start difference. First operand has 540 places, 597 transitions, 1210 flow. Second operand 2 states and 1100 transitions. [2025-02-08 05:46:36,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 459 transitions, 970 flow [2025-02-08 05:46:36,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 459 transitions, 970 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:36,745 INFO L231 Difference]: Finished difference. Result has 461 places, 459 transitions, 934 flow [2025-02-08 05:46:36,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=934, PETRI_PLACES=461, PETRI_TRANSITIONS=459} [2025-02-08 05:46:36,746 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -79 predicate places. [2025-02-08 05:46:36,746 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 459 transitions, 934 flow [2025-02-08 05:46:36,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 503.5) internal successors, (1007), 2 states have internal predecessors, (1007), 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-02-08 05:46:36,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:36,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:36,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:46:36,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-02-08 05:46:36,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash 465248529, now seen corresponding path program 1 times [2025-02-08 05:46:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316714721] [2025-02-08 05:46:36,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:36,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:46:36,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:46:36,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:36,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:37,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:37,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316714721] [2025-02-08 05:46:37,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316714721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:37,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:37,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474105346] [2025-02-08 05:46:37,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:37,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:37,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:37,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:37,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:37,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 597 [2025-02-08 05:46:37,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 459 transitions, 934 flow. Second operand has 6 states, 6 states have (on average 485.5) internal successors, (2913), 6 states have internal predecessors, (2913), 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-02-08 05:46:37,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:37,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 597 [2025-02-08 05:46:37,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:40,431 INFO L124 PetriNetUnfolderBase]: 2538/13504 cut-off events. [2025-02-08 05:46:40,431 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-02-08 05:46:40,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17754 conditions, 13504 events. 2538/13504 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 167912 event pairs, 1573 based on Foata normal form. 0/12161 useless extension candidates. Maximal degree in co-relation 17749. Up to 3737 conditions per place. [2025-02-08 05:46:40,557 INFO L140 encePairwiseOnDemand]: 576/597 looper letters, 37 selfloop transitions, 62 changer transitions 0/521 dead transitions. [2025-02-08 05:46:40,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 521 transitions, 1261 flow [2025-02-08 05:46:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3004 transitions. [2025-02-08 05:46:40,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8386376326074818 [2025-02-08 05:46:40,566 INFO L175 Difference]: Start difference. First operand has 461 places, 459 transitions, 934 flow. Second operand 6 states and 3004 transitions. [2025-02-08 05:46:40,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 521 transitions, 1261 flow [2025-02-08 05:46:40,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 521 transitions, 1261 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:40,579 INFO L231 Difference]: Finished difference. Result has 471 places, 520 transitions, 1344 flow [2025-02-08 05:46:40,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1344, PETRI_PLACES=471, PETRI_TRANSITIONS=520} [2025-02-08 05:46:40,581 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -69 predicate places. [2025-02-08 05:46:40,581 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 520 transitions, 1344 flow [2025-02-08 05:46:40,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 485.5) internal successors, (2913), 6 states have internal predecessors, (2913), 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-02-08 05:46:40,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:40,584 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-02-08 05:46:40,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:46:40,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-02-08 05:46:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1149760672, now seen corresponding path program 1 times [2025-02-08 05:46:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234487321] [2025-02-08 05:46:40,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:40,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:46:40,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:46:40,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:40,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:40,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234487321] [2025-02-08 05:46:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234487321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:40,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:40,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283929118] [2025-02-08 05:46:40,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:40,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:40,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:40,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:40,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 489 out of 597 [2025-02-08 05:46:40,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 520 transitions, 1344 flow. Second operand has 3 states, 3 states have (on average 489.6666666666667) internal successors, (1469), 3 states have internal predecessors, (1469), 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-02-08 05:46:40,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:40,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 489 of 597 [2025-02-08 05:46:40,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:42,299 INFO L124 PetriNetUnfolderBase]: 1669/11434 cut-off events. [2025-02-08 05:46:42,300 INFO L125 PetriNetUnfolderBase]: For 3209/4529 co-relation queries the response was YES. [2025-02-08 05:46:42,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17325 conditions, 11434 events. 1669/11434 cut-off events. For 3209/4529 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 140752 event pairs, 357 based on Foata normal form. 108/10971 useless extension candidates. Maximal degree in co-relation 17315. Up to 1936 conditions per place. [2025-02-08 05:46:42,374 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 91 selfloop transitions, 1 changer transitions 0/532 dead transitions. [2025-02-08 05:46:42,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 532 transitions, 1580 flow [2025-02-08 05:46:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1505 transitions. [2025-02-08 05:46:42,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8403126744835288 [2025-02-08 05:46:42,379 INFO L175 Difference]: Start difference. First operand has 471 places, 520 transitions, 1344 flow. Second operand 3 states and 1505 transitions. [2025-02-08 05:46:42,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 532 transitions, 1580 flow [2025-02-08 05:46:42,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 532 transitions, 1580 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:42,393 INFO L231 Difference]: Finished difference. Result has 471 places, 518 transitions, 1342 flow [2025-02-08 05:46:42,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1342, PETRI_PLACES=471, PETRI_TRANSITIONS=518} [2025-02-08 05:46:42,395 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -69 predicate places. [2025-02-08 05:46:42,395 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 518 transitions, 1342 flow [2025-02-08 05:46:42,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 489.6666666666667) internal successors, (1469), 3 states have internal predecessors, (1469), 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-02-08 05:46:42,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:42,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:42,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:46:42,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-02-08 05:46:42,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:42,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1113362348, now seen corresponding path program 1 times [2025-02-08 05:46:42,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:42,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824090854] [2025-02-08 05:46:42,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:42,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:42,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:46:42,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:46:42,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:42,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:42,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824090854] [2025-02-08 05:46:42,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824090854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:42,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:42,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:42,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107084080] [2025-02-08 05:46:42,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:42,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:42,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:42,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:42,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 597 [2025-02-08 05:46:42,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 518 transitions, 1342 flow. Second operand has 3 states, 3 states have (on average 492.6666666666667) internal successors, (1478), 3 states have internal predecessors, (1478), 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-02-08 05:46:42,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:42,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 597 [2025-02-08 05:46:42,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:44,573 INFO L124 PetriNetUnfolderBase]: 1417/11331 cut-off events. [2025-02-08 05:46:44,573 INFO L125 PetriNetUnfolderBase]: For 2859/3589 co-relation queries the response was YES. [2025-02-08 05:46:44,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16582 conditions, 11331 events. 1417/11331 cut-off events. For 2859/3589 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 139902 event pairs, 532 based on Foata normal form. 24/11025 useless extension candidates. Maximal degree in co-relation 16571. Up to 1684 conditions per place. [2025-02-08 05:46:44,636 INFO L140 encePairwiseOnDemand]: 595/597 looper letters, 89 selfloop transitions, 1 changer transitions 0/531 dead transitions. [2025-02-08 05:46:44,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 531 transitions, 1576 flow [2025-02-08 05:46:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2025-02-08 05:46:44,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8436627582356225 [2025-02-08 05:46:44,641 INFO L175 Difference]: Start difference. First operand has 471 places, 518 transitions, 1342 flow. Second operand 3 states and 1511 transitions. [2025-02-08 05:46:44,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 531 transitions, 1576 flow [2025-02-08 05:46:44,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 531 transitions, 1575 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:44,656 INFO L231 Difference]: Finished difference. Result has 471 places, 517 transitions, 1341 flow [2025-02-08 05:46:44,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1341, PETRI_PLACES=471, PETRI_TRANSITIONS=517} [2025-02-08 05:46:44,659 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -69 predicate places. [2025-02-08 05:46:44,659 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 517 transitions, 1341 flow [2025-02-08 05:46:44,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 492.6666666666667) internal successors, (1478), 3 states have internal predecessors, (1478), 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-02-08 05:46:44,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:44,660 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] [2025-02-08 05:46:44,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:46:44,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-02-08 05:46:44,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:44,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2088910592, now seen corresponding path program 1 times [2025-02-08 05:46:44,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:44,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127108723] [2025-02-08 05:46:44,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:44,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:44,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:46:44,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:46:44,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:44,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:44,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:44,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127108723] [2025-02-08 05:46:44,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127108723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:44,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:44,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:44,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657601803] [2025-02-08 05:46:44,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:44,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:44,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:44,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:44,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:44,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 597 [2025-02-08 05:46:44,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 517 transitions, 1341 flow. Second operand has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 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-02-08 05:46:44,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:44,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 597 [2025-02-08 05:46:44,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:46,564 INFO L124 PetriNetUnfolderBase]: 1644/13213 cut-off events. [2025-02-08 05:46:46,564 INFO L125 PetriNetUnfolderBase]: For 3012/4731 co-relation queries the response was YES. [2025-02-08 05:46:46,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19190 conditions, 13213 events. 1644/13213 cut-off events. For 3012/4731 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 168119 event pairs, 833 based on Foata normal form. 10/12500 useless extension candidates. Maximal degree in co-relation 19179. Up to 2223 conditions per place. [2025-02-08 05:46:46,645 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 89 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-02-08 05:46:46,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 528 transitions, 1571 flow [2025-02-08 05:46:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1524 transitions. [2025-02-08 05:46:46,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509212730318257 [2025-02-08 05:46:46,649 INFO L175 Difference]: Start difference. First operand has 471 places, 517 transitions, 1341 flow. Second operand 3 states and 1524 transitions. [2025-02-08 05:46:46,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 528 transitions, 1571 flow [2025-02-08 05:46:46,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 528 transitions, 1570 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:46,664 INFO L231 Difference]: Finished difference. Result has 473 places, 518 transitions, 1352 flow [2025-02-08 05:46:46,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1352, PETRI_PLACES=473, PETRI_TRANSITIONS=518} [2025-02-08 05:46:46,667 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -67 predicate places. [2025-02-08 05:46:46,667 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 518 transitions, 1352 flow [2025-02-08 05:46:46,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 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-02-08 05:46:46,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:46,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:46,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:46:46,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-02-08 05:46:46,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:46,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1562741830, now seen corresponding path program 1 times [2025-02-08 05:46:46,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:46,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772561421] [2025-02-08 05:46:46,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:46,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:46,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:46:46,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:46:46,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:46,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:46,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:46,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772561421] [2025-02-08 05:46:46,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772561421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:46,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:46,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:46,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534200749] [2025-02-08 05:46:46,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:46,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:46:46,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:46,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:46:46,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:46:46,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 495 out of 597 [2025-02-08 05:46:46,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 518 transitions, 1352 flow. Second operand has 5 states, 5 states have (on average 496.6) internal successors, (2483), 5 states have internal predecessors, (2483), 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-02-08 05:46:46,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:46,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 495 of 597 [2025-02-08 05:46:46,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:48,677 INFO L124 PetriNetUnfolderBase]: 1862/13447 cut-off events. [2025-02-08 05:46:48,677 INFO L125 PetriNetUnfolderBase]: For 3251/5454 co-relation queries the response was YES. [2025-02-08 05:46:48,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20148 conditions, 13447 events. 1862/13447 cut-off events. For 3251/5454 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 172253 event pairs, 204 based on Foata normal form. 225/12941 useless extension candidates. Maximal degree in co-relation 20136. Up to 2139 conditions per place. [2025-02-08 05:46:48,759 INFO L140 encePairwiseOnDemand]: 592/597 looper letters, 149 selfloop transitions, 5 changer transitions 0/589 dead transitions. [2025-02-08 05:46:48,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 589 transitions, 2008 flow [2025-02-08 05:46:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3035 transitions. [2025-02-08 05:46:48,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8472920156337241 [2025-02-08 05:46:48,767 INFO L175 Difference]: Start difference. First operand has 473 places, 518 transitions, 1352 flow. Second operand 6 states and 3035 transitions. [2025-02-08 05:46:48,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 589 transitions, 2008 flow [2025-02-08 05:46:48,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 589 transitions, 2006 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:48,785 INFO L231 Difference]: Finished difference. Result has 480 places, 520 transitions, 1376 flow [2025-02-08 05:46:48,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1376, PETRI_PLACES=480, PETRI_TRANSITIONS=520} [2025-02-08 05:46:48,787 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -60 predicate places. [2025-02-08 05:46:48,787 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 520 transitions, 1376 flow [2025-02-08 05:46:48,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 496.6) internal successors, (2483), 5 states have internal predecessors, (2483), 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-02-08 05:46:48,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:48,789 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:46:48,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:46:48,789 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-02-08 05:46:48,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1798535299, now seen corresponding path program 1 times [2025-02-08 05:46:48,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:48,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043010821] [2025-02-08 05:46:48,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:48,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:48,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:46:48,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:46:48,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:48,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:48,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:46:48,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:46:48,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:46:48,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:48,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:48,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:46:48,912 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:46:48,912 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2025-02-08 05:46:48,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2025-02-08 05:46:48,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2025-02-08 05:46:48,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2025-02-08 05:46:48,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2025-02-08 05:46:48,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2025-02-08 05:46:48,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (38 of 45 remaining) [2025-02-08 05:46:48,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2025-02-08 05:46:48,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2025-02-08 05:46:48,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2025-02-08 05:46:48,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2025-02-08 05:46:48,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (33 of 45 remaining) [2025-02-08 05:46:48,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2025-02-08 05:46:48,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2025-02-08 05:46:48,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2025-02-08 05:46:48,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (28 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (22 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (20 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (19 of 45 remaining) [2025-02-08 05:46:48,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (18 of 45 remaining) [2025-02-08 05:46:48,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (17 of 45 remaining) [2025-02-08 05:46:48,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (16 of 45 remaining) [2025-02-08 05:46:48,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2025-02-08 05:46:48,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2025-02-08 05:46:48,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2025-02-08 05:46:48,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2025-02-08 05:46:48,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (11 of 45 remaining) [2025-02-08 05:46:48,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2025-02-08 05:46:48,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2025-02-08 05:46:48,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2025-02-08 05:46:48,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2025-02-08 05:46:48,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2025-02-08 05:46:48,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2025-02-08 05:46:48,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2025-02-08 05:46:48,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2025-02-08 05:46:48,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2025-02-08 05:46:48,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2025-02-08 05:46:48,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (0 of 45 remaining) [2025-02-08 05:46:48,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:46:48,918 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:48,919 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:46:48,919 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:46:49,122 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:46:49,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 755 places, 831 transitions, 1689 flow [2025-02-08 05:46:49,586 INFO L124 PetriNetUnfolderBase]: 162/1298 cut-off events. [2025-02-08 05:46:49,586 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:46:49,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 1298 events. 162/1298 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6967 event pairs, 1 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 941. Up to 24 conditions per place. [2025-02-08 05:46:49,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 755 places, 831 transitions, 1689 flow [2025-02-08 05:46:49,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 755 places, 831 transitions, 1689 flow [2025-02-08 05:46:49,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:49,643 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;@386a34e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:49,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-02-08 05:46:49,647 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:49,648 INFO L124 PetriNetUnfolderBase]: 12/70 cut-off events. [2025-02-08 05:46:49,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:49,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:49,648 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] [2025-02-08 05:46:49,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-02-08 05:46:49,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:49,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1288986102, now seen corresponding path program 1 times [2025-02-08 05:46:49,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:49,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270788898] [2025-02-08 05:46:49,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:49,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:46:49,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:46:49,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:49,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:49,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:49,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270788898] [2025-02-08 05:46:49,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270788898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:49,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:49,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:49,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743474569] [2025-02-08 05:46:49,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:49,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:49,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:49,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:49,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:49,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 831 [2025-02-08 05:46:49,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 755 places, 831 transitions, 1689 flow. Second operand has 2 states, 2 states have (on average 700.5) internal successors, (1401), 2 states have internal predecessors, (1401), 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-02-08 05:46:49,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:49,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 831 [2025-02-08 05:46:49,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:55,870 INFO L124 PetriNetUnfolderBase]: 1425/27496 cut-off events. [2025-02-08 05:46:55,870 INFO L125 PetriNetUnfolderBase]: For 1351/1351 co-relation queries the response was YES. [2025-02-08 05:46:56,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30176 conditions, 27496 events. 1425/27496 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 407294 event pairs, 1317 based on Foata normal form. 14671/39696 useless extension candidates. Maximal degree in co-relation 3181. Up to 2144 conditions per place. [2025-02-08 05:46:56,130 INFO L140 encePairwiseOnDemand]: 727/831 looper letters, 27 selfloop transitions, 0 changer transitions 0/636 dead transitions. [2025-02-08 05:46:56,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 636 transitions, 1353 flow [2025-02-08 05:46:56,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1531 transitions. [2025-02-08 05:46:56,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9211793020457281 [2025-02-08 05:46:56,134 INFO L175 Difference]: Start difference. First operand has 755 places, 831 transitions, 1689 flow. Second operand 2 states and 1531 transitions. [2025-02-08 05:46:56,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 636 transitions, 1353 flow [2025-02-08 05:46:56,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 636 transitions, 1353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:56,143 INFO L231 Difference]: Finished difference. Result has 638 places, 636 transitions, 1299 flow [2025-02-08 05:46:56,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=831, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1299, PETRI_PLACES=638, PETRI_TRANSITIONS=636} [2025-02-08 05:46:56,144 INFO L279 CegarLoopForPetriNet]: 755 programPoint places, -117 predicate places. [2025-02-08 05:46:56,144 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 636 transitions, 1299 flow [2025-02-08 05:46:56,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 700.5) internal successors, (1401), 2 states have internal predecessors, (1401), 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-02-08 05:46:56,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:56,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:56,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:46:56,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-02-08 05:46:56,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 599377489, now seen corresponding path program 1 times [2025-02-08 05:46:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590676952] [2025-02-08 05:46:56,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:56,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:46:56,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:46:56,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:56,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:56,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:56,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590676952] [2025-02-08 05:46:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590676952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:56,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:56,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791224673] [2025-02-08 05:46:56,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:56,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:56,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:56,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:56,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 681 out of 831 [2025-02-08 05:46:56,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 636 transitions, 1299 flow. Second operand has 6 states, 6 states have (on average 682.5) internal successors, (4095), 6 states have internal predecessors, (4095), 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-02-08 05:46:56,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:56,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 681 of 831 [2025-02-08 05:46:56,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand