./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/ticketlock.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/ticketlock.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 8e9f7836ebdfb0849cf7f06257ab1fd414077ad21cfcb006a14459421df712fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:46:51,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:46:51,388 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:51,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:46:51,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:46:51,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:46:51,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:46:51,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:46:51,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:46:51,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:46:51,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:46:51,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:46:51,419 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:46:51,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:46:51,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:46:51,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:46:51,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:46:51,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:46:51,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:46:51,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:46:51,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:46:51,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:46:51,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:51,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:46:51,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:46:51,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:46:51,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:46:51,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:46:51,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:46:51,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:46:51,421 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 -> 8e9f7836ebdfb0849cf7f06257ab1fd414077ad21cfcb006a14459421df712fb [2025-02-08 05:46:51,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:46:51,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:46:51,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:46:51,657 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:46:51,659 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:46:51,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/ticketlock.i [2025-02-08 05:46:52,868 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76e8e2366/e1a6a401845445ed90369458cb4b4f0f/FLAG748bec050 [2025-02-08 05:46:53,271 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:46:53,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/ticketlock.i [2025-02-08 05:46:53,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76e8e2366/e1a6a401845445ed90369458cb4b4f0f/FLAG748bec050 [2025-02-08 05:46:53,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76e8e2366/e1a6a401845445ed90369458cb4b4f0f [2025-02-08 05:46:53,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:46:53,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:46:53,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:53,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:46:53,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:46:53,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:53" (1/1) ... [2025-02-08 05:46:53,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1351ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:53, skipping insertion in model container [2025-02-08 05:46:53,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:53" (1/1) ... [2025-02-08 05:46:53,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:46:55,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:55,059 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:46:55,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-08 05:46:55,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-08 05:46:55,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-08 05:46:55,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-08 05:46:55,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-08 05:46:55,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-08 05:46:55,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-08 05:46:55,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-08 05:46:55,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-08 05:46:55,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-08 05:46:55,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-08 05:46:55,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-08 05:46:55,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-08 05:46:55,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-08 05:46:55,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-08 05:46:55,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-08 05:46:55,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-08 05:46:55,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-08 05:46:55,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-08 05:46:55,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-08 05:46:55,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-08 05:46:55,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-08 05:46:55,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-08 05:46:55,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-08 05:46:55,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-08 05:46:55,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-08 05:46:55,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-08 05:46:55,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-08 05:46:55,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-08 05:46:55,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-08 05:46:55,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-08 05:46:55,158 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-08 05:46:55,158 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-08 05:46:55,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-08 05:46:55,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-08 05:46:55,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-08 05:46:55,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-08 05:46:55,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-08 05:46:55,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-08 05:46:55,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-08 05:46:55,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-08 05:46:55,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-08 05:46:55,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-08 05:46:55,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-08 05:46:55,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-08 05:46:55,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-08 05:46:55,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-08 05:46:55,166 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-08 05:46:55,166 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-08 05:46:55,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-08 05:46:55,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-08 05:46:55,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-08 05:46:55,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-08 05:46:55,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-08 05:46:55,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-08 05:46:55,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-08 05:46:55,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-08 05:46:55,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-08 05:46:55,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-08 05:46:55,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-08 05:46:55,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-08 05:46:55,176 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-08 05:46:55,176 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-08 05:46:55,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-08 05:46:55,178 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-08 05:46:55,180 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-08 05:46:55,180 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-08 05:46:55,181 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-08 05:46:55,182 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-08 05:46:55,182 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-08 05:46:55,183 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-08 05:46:55,183 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-08 05:46:55,184 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-08 05:46:55,184 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-08 05:46:55,186 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-08 05:46:55,187 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-08 05:46:55,187 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-08 05:46:55,188 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-08 05:46:55,189 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-08 05:46:55,189 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-08 05:46:55,190 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-08 05:46:55,190 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-08 05:46:55,191 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-08 05:46:55,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-08 05:46:55,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-08 05:46:55,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-08 05:46:55,194 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-08 05:46:55,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-08 05:46:55,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-08 05:46:55,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-08 05:46:55,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-08 05:46:55,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-08 05:46:55,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-08 05:46:55,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-08 05:46:55,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-08 05:46:55,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-08 05:46:55,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-08 05:46:55,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-08 05:46:55,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-08 05:46:55,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-08 05:46:55,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:55,426 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:46:55,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:55 WrapperNode [2025-02-08 05:46:55,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:55,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:55,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:46:55,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:46:55,434 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:55" (1/1) ... [2025-02-08 05:46:55,489 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:55" (1/1) ... [2025-02-08 05:46:55,533 INFO L138 Inliner]: procedures = 918, calls = 924, calls flagged for inlining = 825, calls inlined = 41, statements flattened = 436 [2025-02-08 05:46:55,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:55,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:46:55,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:46:55,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:46:55,541 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:55" (1/1) ... [2025-02-08 05:46:55,542 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:55" (1/1) ... [2025-02-08 05:46:55,544 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:55" (1/1) ... [2025-02-08 05:46:55,545 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:55" (1/1) ... [2025-02-08 05:46:55,565 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:55" (1/1) ... [2025-02-08 05:46:55,566 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:55" (1/1) ... [2025-02-08 05:46:55,568 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:55" (1/1) ... [2025-02-08 05:46:55,572 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:55" (1/1) ... [2025-02-08 05:46:55,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:46:55,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:46:55,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:46:55,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:46:55,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:55" (1/1) ... [2025-02-08 05:46:55,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:55,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:55,615 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:55,619 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:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:46:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:46:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:46:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:46:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-08 05:46:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-08 05:46:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:46:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:46:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:46:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:46:55,643 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:55,785 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:46:55,788 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:46:55,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6007: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 05:46:55,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6007-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 05:46:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-08 05:46:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-2: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-08 05:46:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-3: assume { :end_inline_vatomic32_read } true;vatomic32_read_rlx_#res#1 := vatomic32_read_rlx_#t~ret112#1; [2025-02-08 05:46:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-4: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-5: 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:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-6: vatomic32_read_rlx_#t~ret112#1 := vatomic32_read_#res#1; [2025-02-08 05:46:56,286 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:56,287 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:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:56,287 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:56,287 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:56,287 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:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-02-08 05:46:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920-2: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-02-08 05:46:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920-3: assume { :end_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_rlx_#res#1 := vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-02-08 05:46:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920-4: havoc vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1; [2025-02-08 05:46:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920-5: havoc vatomic32_cmpxchg_#t~ret462#1, vatomic32_cmpxchg_#t~mem463#1, vatomic32_cmpxchg_#t~ret464#1, vatomic32_cmpxchg_#t~nondet465#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920-6: vatomic32_cmpxchg_rlx_#t~ret117#1 := vatomic32_cmpxchg_#res#1; [2025-02-08 05:46:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920-7: havoc vatomic32_cmpxchg_#t~ret462#1, vatomic32_cmpxchg_#t~mem463#1, vatomic32_cmpxchg_#t~ret464#1, vatomic32_cmpxchg_#t~nondet465#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920-8: havoc vatomic32_cmpxchg_#res#1; [2025-02-08 05:46:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920-9: assume { :begin_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1 := vatomic32_cmpxchg_rlx_~a#1.base, vatomic32_cmpxchg_rlx_~a#1.offset, vatomic32_cmpxchg_rlx_~e#1, vatomic32_cmpxchg_rlx_~v#1; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5390: havoc ticketlock_tryacquire_#t~ret803#1; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5390-3: havoc vatomic32_read_acq_#t~ret113#1, vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5390-4: ticketlock_tryacquire_#t~ret803#1 := vatomic32_read_acq_#res#1; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5390-1: assume { :end_inline_vatomic32_read_acq } true;ticketlock_tryacquire_~o~8#1 := ticketlock_tryacquire_#t~ret803#1; [2025-02-08 05:46:56,288 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:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5390-2: havoc vatomic32_read_acq_#in~a#1.base, vatomic32_read_acq_#in~a#1.offset; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-2: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-02-08 05:46:56,288 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:56,288 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:56,288 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:56,288 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:56,288 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:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-8: havoc vatomic32_await_eq_#res#1; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume true; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume !true; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume false; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume !false; [2025-02-08 05:46:56,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume !true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume false; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume !false; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume !true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume false; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume !false; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume !true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume false; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume !false; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5391: havoc ticketlock_tryacquire_#t~ret804#1; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume !true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5391-1: assume { :end_inline_vatomic32_cmpxchg_rlx } true;ticketlock_tryacquire_~n~0#1 := ticketlock_tryacquire_#t~ret804#1; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume false; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume !false; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume !true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume false; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume !false; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5391-4: ticketlock_tryacquire_#t~ret804#1 := vatomic32_cmpxchg_rlx_#res#1; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5391-5: havoc vatomic32_cmpxchg_rlx_#t~ret117#1, vatomic32_cmpxchg_rlx_~a#1.base, vatomic32_cmpxchg_rlx_~a#1.offset, vatomic32_cmpxchg_rlx_~e#1, vatomic32_cmpxchg_rlx_~v#1; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-12: assume true; [2025-02-08 05:46:56,289 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-12: assume !true; [2025-02-08 05:46:56,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5391-2: havoc vatomic32_cmpxchg_rlx_#in~a#1.base, vatomic32_cmpxchg_rlx_#in~a#1.offset, vatomic32_cmpxchg_rlx_#in~e#1, vatomic32_cmpxchg_rlx_#in~v#1; [2025-02-08 05:46:56,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-13: assume false; [2025-02-08 05:46:56,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-13: assume !false; [2025-02-08 05:46:56,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5391-3: havoc vatomic32_cmpxchg_rlx_#t~ret117#1, vatomic32_cmpxchg_rlx_~a#1.base, vatomic32_cmpxchg_rlx_~a#1.offset, vatomic32_cmpxchg_rlx_~e#1, vatomic32_cmpxchg_rlx_~v#1; [2025-02-08 05:46:56,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-14: assume true; [2025-02-08 05:46:56,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-14: assume !true; [2025-02-08 05:46:56,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-15: assume false; [2025-02-08 05:46:56,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-15: assume !false; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-16: assume true; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-16: assume !true; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5391-6: havoc vatomic32_cmpxchg_rlx_#res#1; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-17: assume false; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-17: assume !false; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5391-7: assume { :begin_inline_vatomic32_cmpxchg_rlx } true;vatomic32_cmpxchg_rlx_#in~a#1.base, vatomic32_cmpxchg_rlx_#in~a#1.offset, vatomic32_cmpxchg_rlx_#in~e#1, vatomic32_cmpxchg_rlx_#in~v#1 := ticketlock_tryacquire_~l#1.base, ticketlock_tryacquire_~l#1.offset, ticketlock_tryacquire_~o~8#1, 1 + ticketlock_tryacquire_~o~8#1; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-18: assume true; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-18: assume !true; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-19: assume false; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-19: assume !false; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-20: assume true; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-20: assume !true; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-21: assume false; [2025-02-08 05:46:56,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-21: assume !false; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-22: assume true; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-22: assume !true; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-23: assume false; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-23: assume !false; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-2: havoc vatomic32_read_acq_#t~ret113#1; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-3: assume { :end_inline_vatomic32_read } true;vatomic32_read_acq_#res#1 := vatomic32_read_acq_#t~ret113#1; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-4: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-5: 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:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-6: vatomic32_read_acq_#t~ret113#1 := vatomic32_read_#res#1; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5392-1: ticketlock_tryacquire_#res#1 := (if 0 == (if ticketlock_tryacquire_~n~0#1 % 4294967296 == ticketlock_tryacquire_~o~8#1 % 4294967296 then 1 else 0) then 0 else 1); [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3775-2: 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:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4835: vatomic32_await_eq_~c#1 := vatomic32_await_eq_#in~c#1; [2025-02-08 05:46:56,292 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:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-2: havoc vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-3: havoc vatomic32_read_rlx_#t~ret112#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 05:46:56,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397: havoc ticketlock_release_#t~ret805#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-1: assume { :end_inline_vatomic32_read_rlx } true;ticketlock_release_~owner~0#1 := ticketlock_release_#t~ret805#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-4: ticketlock_release_#t~ret805#1 := vatomic32_read_rlx_#res#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398: assume { :end_inline_vatomic32_write_rel } true;havoc ticketlock_release_#t~ret805#1, ticketlock_release_~l#1.base, ticketlock_release_~l#1.offset, ticketlock_release_~owner~0#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-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 := ticketlock_release_~l#1.base, 4 + ticketlock_release_~l#1.offset, 1 + ticketlock_release_~owner~0#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-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:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-2: havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-19: vatomic32_read_~tmp~2#1 := vatomic32_read_#t~mem432#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-18: havoc vatomic32_read_#t~mem432#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-21: 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:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-20: [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-23: #race := #race[vatomic32_read_~a#1.base,3 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-22: 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:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-22: 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:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-25: #race := #race[vatomic32_read_~a#1.base,1 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-24: #race := #race[vatomic32_read_~a#1.base,2 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897: vatomic32_write_rel_~v#1 := vatomic32_write_rel_#in~v#1; [2025-02-08 05:46:56,293 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:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-26: #race := #race[vatomic32_read_~a#1.base,vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-5: havoc acquire_#t~ite826#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4838: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~c#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-8: havoc acquire_#t~ret825#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-9: havoc acquire_#t~ret825#1; [2025-02-08 05:46:56,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-6: havoc acquire_#t~ite826#1; [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-7: assume 0 != acquire_#t~ite826#1; [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-7: assume !(0 != acquire_#t~ite826#1); [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3781-5: vatomic32_read_#res#1 := vatomic32_read_~tmp~2#1; [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-10: assume { :end_inline_verification_spin_end } true;acquire_#t~ite826#1 := 0; [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-17: havoc ticketlock_tryacquire_#in~l#1.base, ticketlock_tryacquire_#in~l#1.offset;assume { :end_inline_ticketlock_tryacquire } true; [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-14: assume 0 == acquire_#t~ret825#1 % 256; [2025-02-08 05:46:56,294 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-14: assume !(0 == acquire_#t~ret825#1 % 256); [2025-02-08 05:46:56,295 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-15: acquire_#t~ite826#1 := 1; [2025-02-08 05:46:56,295 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-18: havoc ticketlock_tryacquire_#t~ret803#1, ticketlock_tryacquire_#t~ret804#1, ticketlock_tryacquire_~l#1.base, ticketlock_tryacquire_~l#1.offset, ticketlock_tryacquire_~o~8#1, ticketlock_tryacquire_~n~0#1; [2025-02-08 05:46:56,295 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027-19: acquire_#t~ret825#1 := ticketlock_tryacquire_#res#1; [2025-02-08 05:46:56,295 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:56,295 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:56,295 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:56,295 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6029: havoc ticketlock_acquire_#in~l#1.base, ticketlock_acquire_#in~l#1.offset;assume { :end_inline_ticketlock_acquire } true; [2025-02-08 05:46:56,295 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:56,295 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6029-1: havoc ticketlock_acquire_#t~ret801#1, ticketlock_acquire_#t~ret802#1, ticketlock_acquire_~l#1.base, ticketlock_acquire_~l#1.offset, ticketlock_acquire_~ticket~0#1; [2025-02-08 05:46:56,295 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:56,295 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:56,295 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:56,295 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:56,296 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:56,296 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840: assume !true; [2025-02-08 05:46:56,296 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-5: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:56,296 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-6: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:56,296 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:56,296 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:56,296 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-9: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:56,296 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:56,296 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume 0 != vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:56,296 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume !(0 != vatomic32_await_eq_#t~ite680#1); [2025-02-08 05:46:56,296 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-8: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:56,296 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:56,296 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:56,297 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:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:56,297 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:56,297 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:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-15: vatomic32_await_eq_#t~ite680#1 := 1; [2025-02-08 05:46:56,297 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:56,297 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:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-22: havoc vatomic32_read_#res#1; [2025-02-08 05:46:56,297 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:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-20: vatomic32_await_eq_#t~ret679#1 := vatomic32_read_#res#1; [2025-02-08 05:46:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume true; [2025-02-08 05:46:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume !true; [2025-02-08 05:46:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume false; [2025-02-08 05:46:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume !false; [2025-02-08 05:46:56,297 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:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5998-1: havoc #t~post817#1; [2025-02-08 05:46:56,297 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5998-2: ~j~1#1 := 1 + #t~post817#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5999: assume { :end_inline_release } true;#t~post817#1 := ~j~1#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5999-1: havoc release_#in~tid#1; [2025-02-08 05:46:56,298 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:56,298 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:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3821: vatomic32_write_~v#1 := vatomic32_write_#in~v#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516-2: havoc vatomic32_get_inc_#t~ret620#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516: havoc vatomic32_get_inc_#t~ret620#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516-5: havoc vatomic32_get_add_#t~mem527#1, vatomic32_get_add_#t~nondet528#1, vatomic32_get_add_~a#1.base, vatomic32_get_add_~a#1.offset, vatomic32_get_add_~v#1, vatomic32_get_add_~tmp~29#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516-6: vatomic32_get_inc_#t~ret620#1 := vatomic32_get_add_#res#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516-3: assume { :end_inline_vatomic32_get_add } true;vatomic32_get_inc_#res#1 := vatomic32_get_inc_#t~ret620#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516-4: havoc vatomic32_get_add_#in~a#1.base, vatomic32_get_add_#in~a#1.offset, vatomic32_get_add_#in~v#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036-1: havoc ticketlock_release_#in~l#1.base, ticketlock_release_#in~l#1.offset; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036: assume { :end_inline_ticketlock_release } true;havoc release_~tid#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3923-1: vatomic32_cmpxchg_~e#1 := vatomic32_cmpxchg_#in~e#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3923: vatomic32_cmpxchg_~v#1 := vatomic32_cmpxchg_#in~v#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3923-2: vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-1: havoc vatomic32_write_#t~nondet438#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825: havoc vatomic32_write_#t~nondet438#1; [2025-02-08 05:46:56,298 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:56,298 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:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-2: [2025-02-08 05:46:56,298 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:56,298 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:56,298 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:56,298 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:56,298 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:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-8: havoc vatomic32_write_#t~nondet438#1; [2025-02-08 05:46:56,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3825-10: [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3926: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_~e#1; [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928: havoc vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-2: havoc vatomic32_cmpxchg_#t~mem463#1; [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-1: havoc vatomic32_cmpxchg_#t~ret464#1; [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-4: havoc vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-3: havoc vatomic32_cmpxchg_#t~ret462#1; [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-6: havoc vatomic32_cmpxchg_#t~mem463#1; [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-5: havoc vatomic32_cmpxchg_#t~ret464#1; [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-8: [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-7: havoc vatomic32_cmpxchg_#t~ret462#1; [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-10: #race := #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:56,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-9: assume ((#race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1 && #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:56,300 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-9: assume !(((#race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1 && #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1); [2025-02-08 05:46:56,300 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-12: #race := #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:56,300 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-11: #race := #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:56,300 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-14: havoc vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:56,300 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-13: #race := #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:56,300 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-16: assume 0 != vatomic32_cmpxchg_#t~ret462#1 % 256; [2025-02-08 05:46:56,300 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-16: assume !(0 != vatomic32_cmpxchg_#t~ret462#1 % 256); [2025-02-08 05:46:56,300 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-15: SUMMARY for call write~int(vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:56,300 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-18: vatomic32_cmpxchg_#t~ret462#1 := (if vatomic32_cmpxchg_#t~mem463#1 == vatomic32_cmpxchg_#t~ret464#1 then 1 else 0); [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-17: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_#t~mem463#1; [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-20: SUMMARY for call vatomic32_cmpxchg_#t~mem463#1 := read~int(vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-19: vatomic32_cmpxchg_#t~ret464#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-22: #race := #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-21: assume ((0 == #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] && 0 == #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset]; [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-21: assume !(((0 == #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] && 0 == #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset]); [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-24: #race := #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-23: #race := #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-25: #race := #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-1: assume { :end_inline_vatomic32_get_inc_rlx } true;ticketlock_acquire_~ticket~0#1 := ticketlock_acquire_#t~ret801#1; [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-2: havoc vatomic32_get_inc_rlx_#in~a#1.base, vatomic32_get_inc_rlx_#in~a#1.offset; [2025-02-08 05:46:56,301 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384: havoc ticketlock_acquire_#t~ret801#1; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-3: havoc vatomic32_get_inc_rlx_#t~ret156#1, vatomic32_get_inc_rlx_~a#1.base, vatomic32_get_inc_rlx_~a#1.offset; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-4: ticketlock_acquire_#t~ret801#1 := vatomic32_get_inc_rlx_#res#1; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3931-1: vatomic32_cmpxchg_#res#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5385-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:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5385-3: ticketlock_acquire_#t~ret802#1 := vatomic32_await_eq_acq_#res#1; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5385: assume { :end_inline_vatomic32_await_eq_acq } true;havoc ticketlock_acquire_#t~ret802#1; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5385-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:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5385-6: 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 := ticketlock_acquire_~l#1.base, 4 + ticketlock_acquire_~l#1.offset, ticketlock_acquire_~ticket~0#1; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5385-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:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5385-5: havoc vatomic32_await_eq_acq_#res#1; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115: havoc vatomic32_get_inc_rlx_#t~ret156#1; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115-3: assume { :end_inline_vatomic32_get_inc } true;vatomic32_get_inc_rlx_#res#1 := vatomic32_get_inc_rlx_#t~ret156#1; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115-2: havoc vatomic32_get_inc_rlx_#t~ret156#1; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115-5: havoc vatomic32_get_inc_#t~ret620#1, vatomic32_get_inc_~a#1.base, vatomic32_get_inc_~a#1.offset; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115-4: havoc vatomic32_get_inc_#in~a#1.base, vatomic32_get_inc_#in~a#1.offset; [2025-02-08 05:46:56,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917: vatomic32_cmpxchg_rlx_~v#1 := vatomic32_cmpxchg_rlx_#in~v#1; [2025-02-08 05:46:56,303 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917-1: vatomic32_cmpxchg_rlx_~e#1 := vatomic32_cmpxchg_rlx_#in~e#1; [2025-02-08 05:46:56,303 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115-6: vatomic32_get_inc_rlx_#t~ret156#1 := vatomic32_get_inc_#res#1; [2025-02-08 05:46:56,303 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917-2: vatomic32_cmpxchg_rlx_~a#1.base, vatomic32_cmpxchg_rlx_~a#1.offset := vatomic32_cmpxchg_rlx_#in~a#1.base, vatomic32_cmpxchg_rlx_#in~a#1.offset; [2025-02-08 05:46:56,304 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:46:56,304 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:46:56,370 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:46:56,370 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:46:56,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:56 BoogieIcfgContainer [2025-02-08 05:46:56,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:46:56,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:46:56,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:46:56,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:46:56,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:46:53" (1/3) ... [2025-02-08 05:46:56,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131556c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:56, skipping insertion in model container [2025-02-08 05:46:56,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:55" (2/3) ... [2025-02-08 05:46:56,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131556c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:56, skipping insertion in model container [2025-02-08 05:46:56,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:56" (3/3) ... [2025-02-08 05:46:56,379 INFO L128 eAbstractionObserver]: Analyzing ICFG ticketlock.i [2025-02-08 05:46:56,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:46:56,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ticketlock.i that has 2 procedures, 253 locations, 1 initial locations, 40 loop locations, and 17 error locations. [2025-02-08 05:46:56,392 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:46:56,471 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:46:56,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 300 transitions, 607 flow [2025-02-08 05:46:56,595 INFO L124 PetriNetUnfolderBase]: 61/378 cut-off events. [2025-02-08 05:46:56,597 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:46:56,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 378 events. 61/378 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1261 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 260. Up to 6 conditions per place. [2025-02-08 05:46:56,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 300 transitions, 607 flow [2025-02-08 05:46:56,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 256 places, 300 transitions, 607 flow [2025-02-08 05:46:56,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:56,633 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;@5035bb1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:56,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-08 05:46:56,648 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:56,648 INFO L124 PetriNetUnfolderBase]: 12/63 cut-off events. [2025-02-08 05:46:56,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:56,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:56,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] [2025-02-08 05:46:56,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash -130909665, now seen corresponding path program 1 times [2025-02-08 05:46:56,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:56,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176193391] [2025-02-08 05:46:56,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:56,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:46:56,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:46:56,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:56,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:56,836 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,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:56,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176193391] [2025-02-08 05:46:56,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176193391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:56,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:56,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:56,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913397109] [2025-02-08 05:46:56,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:56,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:56,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:56,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:56,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:56,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 300 [2025-02-08 05:46:56,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 300 transitions, 607 flow. Second operand has 2 states, 2 states have (on average 246.5) internal successors, (493), 2 states have internal predecessors, (493), 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,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:56,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 300 [2025-02-08 05:46:56,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:56,962 INFO L124 PetriNetUnfolderBase]: 2/278 cut-off events. [2025-02-08 05:46:56,963 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:46:56,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 278 events. 2/278 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 747 event pairs, 0 based on Foata normal form. 101/357 useless extension candidates. Maximal degree in co-relation 187. Up to 6 conditions per place. [2025-02-08 05:46:56,965 INFO L140 encePairwiseOnDemand]: 251/300 looper letters, 5 selfloop transitions, 0 changer transitions 0/218 dead transitions. [2025-02-08 05:46:56,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 453 flow [2025-02-08 05:46:56,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 546 transitions. [2025-02-08 05:46:56,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91 [2025-02-08 05:46:56,980 INFO L175 Difference]: Start difference. First operand has 256 places, 300 transitions, 607 flow. Second operand 2 states and 546 transitions. [2025-02-08 05:46:56,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 218 transitions, 453 flow [2025-02-08 05:46:56,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 218 transitions, 453 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:56,989 INFO L231 Difference]: Finished difference. Result has 220 places, 218 transitions, 443 flow [2025-02-08 05:46:56,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=443, PETRI_PLACES=220, PETRI_TRANSITIONS=218} [2025-02-08 05:46:56,994 INFO L279 CegarLoopForPetriNet]: 256 programPoint places, -36 predicate places. [2025-02-08 05:46:56,994 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 443 flow [2025-02-08 05:46:56,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 246.5) internal successors, (493), 2 states have internal predecessors, (493), 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,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:56,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:56,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:46:56,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:56,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1542526392, now seen corresponding path program 1 times [2025-02-08 05:46:56,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:56,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574481083] [2025-02-08 05:46:56,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:57,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:46:57,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:46:57,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:57,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:57,920 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:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:57,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574481083] [2025-02-08 05:46:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574481083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:57,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:57,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707382311] [2025-02-08 05:46:57,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:57,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:57,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:57,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:57,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:58,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 300 [2025-02-08 05:46:58,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 218 transitions, 443 flow. Second operand has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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:58,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:58,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 300 [2025-02-08 05:46:58,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:58,212 INFO L124 PetriNetUnfolderBase]: 44/585 cut-off events. [2025-02-08 05:46:58,213 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:46:58,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 585 events. 44/585 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3215 event pairs, 27 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 729. Up to 113 conditions per place. [2025-02-08 05:46:58,218 INFO L140 encePairwiseOnDemand]: 290/300 looper letters, 23 selfloop transitions, 18 changer transitions 0/235 dead transitions. [2025-02-08 05:46:58,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 235 transitions, 559 flow [2025-02-08 05:46:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1404 transitions. [2025-02-08 05:46:58,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78 [2025-02-08 05:46:58,224 INFO L175 Difference]: Start difference. First operand has 220 places, 218 transitions, 443 flow. Second operand 6 states and 1404 transitions. [2025-02-08 05:46:58,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 235 transitions, 559 flow [2025-02-08 05:46:58,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 235 transitions, 559 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:58,232 INFO L231 Difference]: Finished difference. Result has 230 places, 235 transitions, 567 flow [2025-02-08 05:46:58,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=567, PETRI_PLACES=230, PETRI_TRANSITIONS=235} [2025-02-08 05:46:58,235 INFO L279 CegarLoopForPetriNet]: 256 programPoint places, -26 predicate places. [2025-02-08 05:46:58,235 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 235 transitions, 567 flow [2025-02-08 05:46:58,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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:58,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:58,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:58,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:46:58,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:58,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:58,237 INFO L85 PathProgramCache]: Analyzing trace with hash 671049331, now seen corresponding path program 1 times [2025-02-08 05:46:58,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:58,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404582420] [2025-02-08 05:46:58,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:58,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:46:58,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:46:58,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:58,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:58,271 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:58,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:58,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404582420] [2025-02-08 05:46:58,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404582420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:58,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:58,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:58,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928893508] [2025-02-08 05:46:58,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:58,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:58,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:58,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:58,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:58,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 300 [2025-02-08 05:46:58,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 235 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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:58,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:58,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 300 [2025-02-08 05:46:58,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:58,357 INFO L124 PetriNetUnfolderBase]: 29/477 cut-off events. [2025-02-08 05:46:58,357 INFO L125 PetriNetUnfolderBase]: For 124/295 co-relation queries the response was YES. [2025-02-08 05:46:58,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 477 events. 29/477 cut-off events. For 124/295 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2223 event pairs, 9 based on Foata normal form. 12/449 useless extension candidates. Maximal degree in co-relation 654. Up to 35 conditions per place. [2025-02-08 05:46:58,359 INFO L140 encePairwiseOnDemand]: 297/300 looper letters, 23 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2025-02-08 05:46:58,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 236 transitions, 623 flow [2025-02-08 05:46:58,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2025-02-08 05:46:58,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8022222222222222 [2025-02-08 05:46:58,361 INFO L175 Difference]: Start difference. First operand has 230 places, 235 transitions, 567 flow. Second operand 3 states and 722 transitions. [2025-02-08 05:46:58,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 236 transitions, 623 flow [2025-02-08 05:46:58,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 236 transitions, 623 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:58,365 INFO L231 Difference]: Finished difference. Result has 230 places, 233 transitions, 565 flow [2025-02-08 05:46:58,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=230, PETRI_TRANSITIONS=233} [2025-02-08 05:46:58,366 INFO L279 CegarLoopForPetriNet]: 256 programPoint places, -26 predicate places. [2025-02-08 05:46:58,366 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 233 transitions, 565 flow [2025-02-08 05:46:58,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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:58,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:58,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:58,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:46:58,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:58,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash 633339224, now seen corresponding path program 1 times [2025-02-08 05:46:58,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:58,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570320166] [2025-02-08 05:46:58,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:58,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:58,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:46:58,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:46:58,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:58,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:58,402 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:58,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:58,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570320166] [2025-02-08 05:46:58,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570320166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:58,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:58,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:58,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323926151] [2025-02-08 05:46:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:58,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:58,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:58,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:58,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:58,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 300 [2025-02-08 05:46:58,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 233 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:58,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:58,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 300 [2025-02-08 05:46:58,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:58,496 INFO L124 PetriNetUnfolderBase]: 23/460 cut-off events. [2025-02-08 05:46:58,497 INFO L125 PetriNetUnfolderBase]: For 118/217 co-relation queries the response was YES. [2025-02-08 05:46:58,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 460 events. 23/460 cut-off events. For 118/217 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1981 event pairs, 3 based on Foata normal form. 12/443 useless extension candidates. Maximal degree in co-relation 617. Up to 29 conditions per place. [2025-02-08 05:46:58,499 INFO L140 encePairwiseOnDemand]: 298/300 looper letters, 18 selfloop transitions, 1 changer transitions 3/235 dead transitions. [2025-02-08 05:46:58,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 235 transitions, 619 flow [2025-02-08 05:46:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2025-02-08 05:46:58,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8088888888888889 [2025-02-08 05:46:58,502 INFO L175 Difference]: Start difference. First operand has 230 places, 233 transitions, 565 flow. Second operand 3 states and 728 transitions. [2025-02-08 05:46:58,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 235 transitions, 619 flow [2025-02-08 05:46:58,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 235 transitions, 618 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:58,509 INFO L231 Difference]: Finished difference. Result has 230 places, 232 transitions, 564 flow [2025-02-08 05:46:58,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=230, PETRI_TRANSITIONS=232} [2025-02-08 05:46:58,510 INFO L279 CegarLoopForPetriNet]: 256 programPoint places, -26 predicate places. [2025-02-08 05:46:58,511 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 232 transitions, 564 flow [2025-02-08 05:46:58,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:58,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:58,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:58,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:46:58,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:58,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1086254120, now seen corresponding path program 1 times [2025-02-08 05:46:58,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:58,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602544702] [2025-02-08 05:46:58,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:58,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:46:58,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:46:58,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:58,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:58,564 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:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602544702] [2025-02-08 05:46:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602544702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:58,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:58,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322352917] [2025-02-08 05:46:58,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:58,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:58,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:58,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:58,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:58,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 300 [2025-02-08 05:46:58,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 232 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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:58,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:58,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 300 [2025-02-08 05:46:58,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:58,693 INFO L124 PetriNetUnfolderBase]: 28/533 cut-off events. [2025-02-08 05:46:58,694 INFO L125 PetriNetUnfolderBase]: For 106/277 co-relation queries the response was YES. [2025-02-08 05:46:58,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 533 events. 28/533 cut-off events. For 106/277 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2593 event pairs, 9 based on Foata normal form. 10/507 useless extension candidates. Maximal degree in co-relation 719. Up to 47 conditions per place. [2025-02-08 05:46:58,697 INFO L140 encePairwiseOnDemand]: 297/300 looper letters, 27 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-02-08 05:46:58,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 238 transitions, 652 flow [2025-02-08 05:46:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2025-02-08 05:46:58,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2025-02-08 05:46:58,699 INFO L175 Difference]: Start difference. First operand has 230 places, 232 transitions, 564 flow. Second operand 3 states and 735 transitions. [2025-02-08 05:46:58,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 238 transitions, 652 flow [2025-02-08 05:46:58,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 238 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:58,705 INFO L231 Difference]: Finished difference. Result has 232 places, 232 transitions, 571 flow [2025-02-08 05:46:58,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=232, PETRI_TRANSITIONS=232} [2025-02-08 05:46:58,706 INFO L279 CegarLoopForPetriNet]: 256 programPoint places, -24 predicate places. [2025-02-08 05:46:58,707 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 232 transitions, 571 flow [2025-02-08 05:46:58,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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:58,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:58,708 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] [2025-02-08 05:46:58,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:46:58,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:58,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1223713605, now seen corresponding path program 1 times [2025-02-08 05:46:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:58,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677475360] [2025-02-08 05:46:58,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:46:58,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:46:58,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:58,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:46:58,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:46:58,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:46:58,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:58,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:58,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:46:58,788 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:46:58,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-08 05:46:58,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-08 05:46:58,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:46:58,791 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:46:58,792 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:46:58,793 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:46:58,873 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:46:58,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 409 places, 478 transitions, 972 flow [2025-02-08 05:46:58,979 INFO L124 PetriNetUnfolderBase]: 111/697 cut-off events. [2025-02-08 05:46:58,980 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:46:58,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 697 events. 111/697 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3074 event pairs, 0 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 489. Up to 12 conditions per place. [2025-02-08 05:46:58,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 409 places, 478 transitions, 972 flow [2025-02-08 05:46:59,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 409 places, 478 transitions, 972 flow [2025-02-08 05:46:59,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:59,003 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;@5035bb1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:59,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-08 05:46:59,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:59,006 INFO L124 PetriNetUnfolderBase]: 12/63 cut-off events. [2025-02-08 05:46:59,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:59,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:59,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:59,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:46:59,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash 8238623, now seen corresponding path program 1 times [2025-02-08 05:46:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:59,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021234559] [2025-02-08 05:46:59,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:59,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:59,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:46:59,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:46:59,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:59,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:59,028 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:59,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:59,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021234559] [2025-02-08 05:46:59,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021234559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:59,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:59,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:59,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548115554] [2025-02-08 05:46:59,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:59,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:59,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:59,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:59,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:59,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 478 [2025-02-08 05:46:59,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 478 transitions, 972 flow. Second operand has 2 states, 2 states have (on average 390.5) internal successors, (781), 2 states have internal predecessors, (781), 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:59,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:59,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 478 [2025-02-08 05:46:59,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:59,244 INFO L124 PetriNetUnfolderBase]: 26/1325 cut-off events. [2025-02-08 05:46:59,244 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-08 05:46:59,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 1325 events. 26/1325 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8524 event pairs, 18 based on Foata normal form. 607/1803 useless extension candidates. Maximal degree in co-relation 490. Up to 49 conditions per place. [2025-02-08 05:46:59,254 INFO L140 encePairwiseOnDemand]: 400/478 looper letters, 10 selfloop transitions, 0 changer transitions 0/338 dead transitions. [2025-02-08 05:46:59,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 338 transitions, 712 flow [2025-02-08 05:46:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 868 transitions. [2025-02-08 05:46:59,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079497907949791 [2025-02-08 05:46:59,257 INFO L175 Difference]: Start difference. First operand has 409 places, 478 transitions, 972 flow. Second operand 2 states and 868 transitions. [2025-02-08 05:46:59,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 338 transitions, 712 flow [2025-02-08 05:46:59,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 338 transitions, 712 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:59,261 INFO L231 Difference]: Finished difference. Result has 340 places, 338 transitions, 692 flow [2025-02-08 05:46:59,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=692, PETRI_PLACES=340, PETRI_TRANSITIONS=338} [2025-02-08 05:46:59,263 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -69 predicate places. [2025-02-08 05:46:59,263 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 338 transitions, 692 flow [2025-02-08 05:46:59,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 390.5) internal successors, (781), 2 states have internal predecessors, (781), 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:59,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:59,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:59,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:46:59,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:46:59,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1216070678, now seen corresponding path program 1 times [2025-02-08 05:46:59,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:59,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381277600] [2025-02-08 05:46:59,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:59,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:46:59,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:46:59,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:59,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:59,694 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:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381277600] [2025-02-08 05:46:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381277600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894113403] [2025-02-08 05:46:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:59,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:59,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:59,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:59,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 478 [2025-02-08 05:46:59,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 338 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 372.5) internal successors, (2235), 6 states have internal predecessors, (2235), 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:59,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:59,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 478 [2025-02-08 05:46:59,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:00,460 INFO L124 PetriNetUnfolderBase]: 554/3152 cut-off events. [2025-02-08 05:47:00,460 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-02-08 05:47:00,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 3152 events. 554/3152 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 30884 event pairs, 359 based on Foata normal form. 0/2691 useless extension candidates. Maximal degree in co-relation 4209. Up to 897 conditions per place. [2025-02-08 05:47:00,479 INFO L140 encePairwiseOnDemand]: 465/478 looper letters, 29 selfloop transitions, 30 changer transitions 0/368 dead transitions. [2025-02-08 05:47:00,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 368 transitions, 875 flow [2025-02-08 05:47:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2286 transitions. [2025-02-08 05:47:00,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.797071129707113 [2025-02-08 05:47:00,484 INFO L175 Difference]: Start difference. First operand has 340 places, 338 transitions, 692 flow. Second operand 6 states and 2286 transitions. [2025-02-08 05:47:00,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 368 transitions, 875 flow [2025-02-08 05:47:00,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 368 transitions, 875 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:00,488 INFO L231 Difference]: Finished difference. Result has 350 places, 367 transitions, 894 flow [2025-02-08 05:47:00,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=894, PETRI_PLACES=350, PETRI_TRANSITIONS=367} [2025-02-08 05:47:00,489 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -59 predicate places. [2025-02-08 05:47:00,490 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 367 transitions, 894 flow [2025-02-08 05:47:00,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.5) internal successors, (2235), 6 states have internal predecessors, (2235), 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:47:00,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:00,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:00,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:47:00,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:00,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash -431086127, now seen corresponding path program 1 times [2025-02-08 05:47:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:00,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181651550] [2025-02-08 05:47:00,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:00,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:47:00,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:47:00,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:00,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:00,511 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:47:00,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:00,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181651550] [2025-02-08 05:47:00,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181651550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:00,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:00,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:00,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565950695] [2025-02-08 05:47:00,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:00,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:00,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:00,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:00,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:00,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 478 [2025-02-08 05:47:00,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 367 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 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:47:00,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:00,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 478 [2025-02-08 05:47:00,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:00,906 INFO L124 PetriNetUnfolderBase]: 389/2800 cut-off events. [2025-02-08 05:47:00,906 INFO L125 PetriNetUnfolderBase]: For 894/1893 co-relation queries the response was YES. [2025-02-08 05:47:00,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4261 conditions, 2800 events. 389/2800 cut-off events. For 894/1893 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 26390 event pairs, 166 based on Foata normal form. 24/2619 useless extension candidates. Maximal degree in co-relation 4251. Up to 420 conditions per place. [2025-02-08 05:47:00,923 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 43 selfloop transitions, 1 changer transitions 0/371 dead transitions. [2025-02-08 05:47:00,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 371 transitions, 1002 flow [2025-02-08 05:47:00,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2025-02-08 05:47:00,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8019525801952581 [2025-02-08 05:47:00,926 INFO L175 Difference]: Start difference. First operand has 350 places, 367 transitions, 894 flow. Second operand 3 states and 1150 transitions. [2025-02-08 05:47:00,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 371 transitions, 1002 flow [2025-02-08 05:47:00,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 371 transitions, 1002 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:00,931 INFO L231 Difference]: Finished difference. Result has 350 places, 365 transitions, 892 flow [2025-02-08 05:47:00,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=892, PETRI_PLACES=350, PETRI_TRANSITIONS=365} [2025-02-08 05:47:00,932 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -59 predicate places. [2025-02-08 05:47:00,932 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 365 transitions, 892 flow [2025-02-08 05:47:00,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 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:47:00,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:00,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:00,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:47:00,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:00,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1956865802, now seen corresponding path program 1 times [2025-02-08 05:47:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082414109] [2025-02-08 05:47:00,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:00,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:47:00,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:47:00,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:00,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:00,955 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:47:00,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:00,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082414109] [2025-02-08 05:47:00,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082414109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:00,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:00,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:00,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356005322] [2025-02-08 05:47:00,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:00,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:00,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:00,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:00,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:00,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 478 [2025-02-08 05:47:00,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 365 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 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:47:00,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:00,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 478 [2025-02-08 05:47:00,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:01,317 INFO L124 PetriNetUnfolderBase]: 329/2702 cut-off events. [2025-02-08 05:47:01,318 INFO L125 PetriNetUnfolderBase]: For 852/1749 co-relation queries the response was YES. [2025-02-08 05:47:01,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4007 conditions, 2702 events. 329/2702 cut-off events. For 852/1749 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 24116 event pairs, 67 based on Foata normal form. 60/2564 useless extension candidates. Maximal degree in co-relation 3996. Up to 360 conditions per place. [2025-02-08 05:47:01,333 INFO L140 encePairwiseOnDemand]: 476/478 looper letters, 41 selfloop transitions, 1 changer transitions 0/370 dead transitions. [2025-02-08 05:47:01,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 370 transitions, 998 flow [2025-02-08 05:47:01,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1156 transitions. [2025-02-08 05:47:01,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.806136680613668 [2025-02-08 05:47:01,337 INFO L175 Difference]: Start difference. First operand has 350 places, 365 transitions, 892 flow. Second operand 3 states and 1156 transitions. [2025-02-08 05:47:01,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 370 transitions, 998 flow [2025-02-08 05:47:01,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 370 transitions, 997 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:01,343 INFO L231 Difference]: Finished difference. Result has 350 places, 364 transitions, 891 flow [2025-02-08 05:47:01,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=350, PETRI_TRANSITIONS=364} [2025-02-08 05:47:01,344 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -59 predicate places. [2025-02-08 05:47:01,344 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 364 transitions, 891 flow [2025-02-08 05:47:01,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 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:47:01,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:01,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:01,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:47:01,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:01,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash 221769176, now seen corresponding path program 1 times [2025-02-08 05:47:01,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:01,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953085889] [2025-02-08 05:47:01,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:01,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:01,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:47:01,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:47:01,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:01,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:01,390 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:47:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953085889] [2025-02-08 05:47:01,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953085889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:01,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:01,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:47:01,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907114210] [2025-02-08 05:47:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:01,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:01,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:01,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:01,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:01,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 478 [2025-02-08 05:47:01,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 364 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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:47:01,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:01,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 478 [2025-02-08 05:47:01,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:01,807 INFO L124 PetriNetUnfolderBase]: 379/3195 cut-off events. [2025-02-08 05:47:01,807 INFO L125 PetriNetUnfolderBase]: For 795/2054 co-relation queries the response was YES. [2025-02-08 05:47:01,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4673 conditions, 3195 events. 379/3195 cut-off events. For 795/2054 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 30222 event pairs, 100 based on Foata normal form. 10/2948 useless extension candidates. Maximal degree in co-relation 4662. Up to 503 conditions per place. [2025-02-08 05:47:01,827 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 45 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-02-08 05:47:01,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 371 transitions, 1017 flow [2025-02-08 05:47:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1173 transitions. [2025-02-08 05:47:01,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8179916317991632 [2025-02-08 05:47:01,830 INFO L175 Difference]: Start difference. First operand has 350 places, 364 transitions, 891 flow. Second operand 3 states and 1173 transitions. [2025-02-08 05:47:01,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 371 transitions, 1017 flow [2025-02-08 05:47:01,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 371 transitions, 1016 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:01,838 INFO L231 Difference]: Finished difference. Result has 352 places, 365 transitions, 902 flow [2025-02-08 05:47:01,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=352, PETRI_TRANSITIONS=365} [2025-02-08 05:47:01,838 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -57 predicate places. [2025-02-08 05:47:01,838 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 365 transitions, 902 flow [2025-02-08 05:47:01,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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:47:01,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:01,839 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] [2025-02-08 05:47:01,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:47:01,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:01,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2127073972, now seen corresponding path program 1 times [2025-02-08 05:47:01,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:01,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91323980] [2025-02-08 05:47:01,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:01,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:01,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:47:01,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:47:01,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:01,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:01,989 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:47:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91323980] [2025-02-08 05:47:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91323980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303955737] [2025-02-08 05:47:01,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:01,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:47:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:01,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:47:01,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:47:02,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 478 [2025-02-08 05:47:02,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 365 transitions, 902 flow. Second operand has 5 states, 5 states have (on average 383.6) internal successors, (1918), 5 states have internal predecessors, (1918), 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:47:02,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:02,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 478 [2025-02-08 05:47:02,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:02,556 INFO L124 PetriNetUnfolderBase]: 423/2940 cut-off events. [2025-02-08 05:47:02,556 INFO L125 PetriNetUnfolderBase]: For 776/2172 co-relation queries the response was YES. [2025-02-08 05:47:02,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4570 conditions, 2940 events. 423/2940 cut-off events. For 776/2172 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 28465 event pairs, 178 based on Foata normal form. 46/2813 useless extension candidates. Maximal degree in co-relation 4558. Up to 459 conditions per place. [2025-02-08 05:47:02,588 INFO L140 encePairwiseOnDemand]: 473/478 looper letters, 73 selfloop transitions, 5 changer transitions 0/400 dead transitions. [2025-02-08 05:47:02,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 400 transitions, 1230 flow [2025-02-08 05:47:02,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2329 transitions. [2025-02-08 05:47:02,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8120641562064156 [2025-02-08 05:47:02,592 INFO L175 Difference]: Start difference. First operand has 352 places, 365 transitions, 902 flow. Second operand 6 states and 2329 transitions. [2025-02-08 05:47:02,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 400 transitions, 1230 flow [2025-02-08 05:47:02,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 400 transitions, 1228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:02,601 INFO L231 Difference]: Finished difference. Result has 359 places, 367 transitions, 926 flow [2025-02-08 05:47:02,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=926, PETRI_PLACES=359, PETRI_TRANSITIONS=367} [2025-02-08 05:47:02,603 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -50 predicate places. [2025-02-08 05:47:02,603 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 367 transitions, 926 flow [2025-02-08 05:47:02,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 383.6) internal successors, (1918), 5 states have internal predecessors, (1918), 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:47:02,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:02,604 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] [2025-02-08 05:47:02,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:47:02,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:02,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -629596658, now seen corresponding path program 1 times [2025-02-08 05:47:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039112091] [2025-02-08 05:47:02,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:02,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:47:02,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:47:02,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:02,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:02,639 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:02,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:47:02,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:47:02,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:02,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:02,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:02,669 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:02,669 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-02-08 05:47:02,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 30 remaining) [2025-02-08 05:47:02,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 30 remaining) [2025-02-08 05:47:02,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 30 remaining) [2025-02-08 05:47:02,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 30 remaining) [2025-02-08 05:47:02,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (23 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (22 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (21 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (20 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (19 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (18 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (17 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (16 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (15 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (14 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (13 of 30 remaining) [2025-02-08 05:47:02,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (12 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (11 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (10 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (9 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (8 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (7 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (6 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (5 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (4 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (3 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (2 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (1 of 30 remaining) [2025-02-08 05:47:02,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (0 of 30 remaining) [2025-02-08 05:47:02,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:47:02,672 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:02,673 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:02,673 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:47:02,760 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:47:02,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 562 places, 656 transitions, 1339 flow [2025-02-08 05:47:02,931 INFO L124 PetriNetUnfolderBase]: 180/1123 cut-off events. [2025-02-08 05:47:02,931 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:47:02,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 1123 events. 180/1123 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5602 event pairs, 1 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 773. Up to 24 conditions per place. [2025-02-08 05:47:02,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 562 places, 656 transitions, 1339 flow [2025-02-08 05:47:02,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 562 places, 656 transitions, 1339 flow [2025-02-08 05:47:02,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:02,973 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;@5035bb1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:02,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-08 05:47:02,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:02,975 INFO L124 PetriNetUnfolderBase]: 12/63 cut-off events. [2025-02-08 05:47:02,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:02,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:02,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:02,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:02,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash 648467999, now seen corresponding path program 1 times [2025-02-08 05:47:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:02,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769015459] [2025-02-08 05:47:02,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:02,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:47:02,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:47:02,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:02,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:02,990 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:47:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769015459] [2025-02-08 05:47:02,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769015459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:02,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:02,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:02,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915532527] [2025-02-08 05:47:02,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:02,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:47:02,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:02,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:47:02,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:47:02,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 534 out of 656 [2025-02-08 05:47:02,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 656 transitions, 1339 flow. Second operand has 2 states, 2 states have (on average 534.5) internal successors, (1069), 2 states have internal predecessors, (1069), 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:47:02,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:02,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 534 of 656 [2025-02-08 05:47:02,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:03,884 INFO L124 PetriNetUnfolderBase]: 233/6424 cut-off events. [2025-02-08 05:47:03,884 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2025-02-08 05:47:03,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6936 conditions, 6424 events. 233/6424 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 68143 event pairs, 193 based on Foata normal form. 3586/9302 useless extension candidates. Maximal degree in co-relation 1416. Up to 352 conditions per place. [2025-02-08 05:47:03,944 INFO L140 encePairwiseOnDemand]: 549/656 looper letters, 15 selfloop transitions, 0 changer transitions 0/458 dead transitions. [2025-02-08 05:47:03,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 458 transitions, 973 flow [2025-02-08 05:47:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:47:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:47:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1190 transitions. [2025-02-08 05:47:03,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9070121951219512 [2025-02-08 05:47:03,947 INFO L175 Difference]: Start difference. First operand has 562 places, 656 transitions, 1339 flow. Second operand 2 states and 1190 transitions. [2025-02-08 05:47:03,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 458 transitions, 973 flow [2025-02-08 05:47:03,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 458 transitions, 973 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:03,952 INFO L231 Difference]: Finished difference. Result has 460 places, 458 transitions, 943 flow [2025-02-08 05:47:03,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=943, PETRI_PLACES=460, PETRI_TRANSITIONS=458} [2025-02-08 05:47:03,953 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -102 predicate places. [2025-02-08 05:47:03,953 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 458 transitions, 943 flow [2025-02-08 05:47:03,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 534.5) internal successors, (1069), 2 states have internal predecessors, (1069), 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:47:03,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:03,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:03,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:47:03,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:03,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:03,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1414988454, now seen corresponding path program 1 times [2025-02-08 05:47:03,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:03,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716106168] [2025-02-08 05:47:03,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:03,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:03,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:47:03,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:47:03,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:03,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:04,358 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:47:04,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:04,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716106168] [2025-02-08 05:47:04,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716106168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:04,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:04,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:04,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094350478] [2025-02-08 05:47:04,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:04,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:47:04,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:04,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:47:04,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:47:04,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 656 [2025-02-08 05:47:04,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 458 transitions, 943 flow. Second operand has 6 states, 6 states have (on average 516.5) internal successors, (3099), 6 states have internal predecessors, (3099), 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:47:04,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:04,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 656 [2025-02-08 05:47:04,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:07,206 INFO L124 PetriNetUnfolderBase]: 4061/15768 cut-off events. [2025-02-08 05:47:07,206 INFO L125 PetriNetUnfolderBase]: For 568/568 co-relation queries the response was YES. [2025-02-08 05:47:07,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22180 conditions, 15768 events. 4061/15768 cut-off events. For 568/568 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 191713 event pairs, 2634 based on Foata normal form. 0/13573 useless extension candidates. Maximal degree in co-relation 22174. Up to 5658 conditions per place. [2025-02-08 05:47:07,367 INFO L140 encePairwiseOnDemand]: 640/656 looper letters, 35 selfloop transitions, 42 changer transitions 0/501 dead transitions. [2025-02-08 05:47:07,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 501 transitions, 1195 flow [2025-02-08 05:47:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3168 transitions. [2025-02-08 05:47:07,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8048780487804879 [2025-02-08 05:47:07,373 INFO L175 Difference]: Start difference. First operand has 460 places, 458 transitions, 943 flow. Second operand 6 states and 3168 transitions. [2025-02-08 05:47:07,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 501 transitions, 1195 flow [2025-02-08 05:47:07,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 501 transitions, 1195 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:07,380 INFO L231 Difference]: Finished difference. Result has 470 places, 499 transitions, 1223 flow [2025-02-08 05:47:07,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1223, PETRI_PLACES=470, PETRI_TRANSITIONS=499} [2025-02-08 05:47:07,382 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -92 predicate places. [2025-02-08 05:47:07,382 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 499 transitions, 1223 flow [2025-02-08 05:47:07,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 516.5) internal successors, (3099), 6 states have internal predecessors, (3099), 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:47:07,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:07,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:07,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:47:07,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:07,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash 608181345, now seen corresponding path program 1 times [2025-02-08 05:47:07,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:07,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701356141] [2025-02-08 05:47:07,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:07,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:07,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:47:07,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:47:07,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:07,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:07,402 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:47:07,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:07,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701356141] [2025-02-08 05:47:07,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701356141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:07,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:07,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:07,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076379545] [2025-02-08 05:47:07,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:07,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:07,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:07,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:07,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:07,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 656 [2025-02-08 05:47:07,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 499 transitions, 1223 flow. Second operand has 3 states, 3 states have (on average 516.6666666666666) internal successors, (1550), 3 states have internal predecessors, (1550), 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:47:07,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:07,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 656 [2025-02-08 05:47:07,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:09,966 INFO L124 PetriNetUnfolderBase]: 2910/13468 cut-off events. [2025-02-08 05:47:09,966 INFO L125 PetriNetUnfolderBase]: For 5435/12090 co-relation queries the response was YES. [2025-02-08 05:47:10,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22638 conditions, 13468 events. 2910/13468 cut-off events. For 5435/12090 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 160972 event pairs, 733 based on Foata normal form. 252/12458 useless extension candidates. Maximal degree in co-relation 22627. Up to 3037 conditions per place. [2025-02-08 05:47:10,161 INFO L140 encePairwiseOnDemand]: 653/656 looper letters, 63 selfloop transitions, 1 changer transitions 0/506 dead transitions. [2025-02-08 05:47:10,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 506 transitions, 1383 flow [2025-02-08 05:47:10,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1578 transitions. [2025-02-08 05:47:10,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.801829268292683 [2025-02-08 05:47:10,165 INFO L175 Difference]: Start difference. First operand has 470 places, 499 transitions, 1223 flow. Second operand 3 states and 1578 transitions. [2025-02-08 05:47:10,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 506 transitions, 1383 flow [2025-02-08 05:47:10,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 506 transitions, 1383 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:10,177 INFO L231 Difference]: Finished difference. Result has 470 places, 497 transitions, 1221 flow [2025-02-08 05:47:10,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1221, PETRI_PLACES=470, PETRI_TRANSITIONS=497} [2025-02-08 05:47:10,178 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -92 predicate places. [2025-02-08 05:47:10,178 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 497 transitions, 1221 flow [2025-02-08 05:47:10,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 516.6666666666666) internal successors, (1550), 3 states have internal predecessors, (1550), 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:47:10,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:10,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:10,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:47:10,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:10,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:10,181 INFO L85 PathProgramCache]: Analyzing trace with hash 346783110, now seen corresponding path program 1 times [2025-02-08 05:47:10,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:10,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515868217] [2025-02-08 05:47:10,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:10,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:10,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:47:10,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:47:10,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:10,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:10,205 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:47:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515868217] [2025-02-08 05:47:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515868217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:10,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:10,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:10,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281656019] [2025-02-08 05:47:10,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:10,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:10,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:10,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:10,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:10,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 519 out of 656 [2025-02-08 05:47:10,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 497 transitions, 1221 flow. Second operand has 3 states, 3 states have (on average 519.6666666666666) internal successors, (1559), 3 states have internal predecessors, (1559), 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:47:10,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:10,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 519 of 656 [2025-02-08 05:47:10,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:12,396 INFO L124 PetriNetUnfolderBase]: 2460/11868 cut-off events. [2025-02-08 05:47:12,397 INFO L125 PetriNetUnfolderBase]: For 4688/7921 co-relation queries the response was YES. [2025-02-08 05:47:12,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19966 conditions, 11868 events. 2460/11868 cut-off events. For 4688/7921 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 135962 event pairs, 1066 based on Foata normal form. 36/11195 useless extension candidates. Maximal degree in co-relation 19954. Up to 2587 conditions per place. [2025-02-08 05:47:12,536 INFO L140 encePairwiseOnDemand]: 654/656 looper letters, 61 selfloop transitions, 1 changer transitions 0/505 dead transitions. [2025-02-08 05:47:12,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 505 transitions, 1379 flow [2025-02-08 05:47:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1584 transitions. [2025-02-08 05:47:12,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8048780487804879 [2025-02-08 05:47:12,539 INFO L175 Difference]: Start difference. First operand has 470 places, 497 transitions, 1221 flow. Second operand 3 states and 1584 transitions. [2025-02-08 05:47:12,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 505 transitions, 1379 flow [2025-02-08 05:47:12,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 505 transitions, 1378 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:12,549 INFO L231 Difference]: Finished difference. Result has 470 places, 496 transitions, 1220 flow [2025-02-08 05:47:12,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1220, PETRI_PLACES=470, PETRI_TRANSITIONS=496} [2025-02-08 05:47:12,550 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -92 predicate places. [2025-02-08 05:47:12,550 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 496 transitions, 1220 flow [2025-02-08 05:47:12,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 519.6666666666666) internal successors, (1559), 3 states have internal predecessors, (1559), 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:47:12,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:12,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:12,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:47:12,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:12,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:12,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1379557928, now seen corresponding path program 1 times [2025-02-08 05:47:12,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:12,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985582602] [2025-02-08 05:47:12,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:12,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:12,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:47:12,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:47:12,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:12,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:12,584 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:47:12,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:12,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985582602] [2025-02-08 05:47:12,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985582602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:12,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:12,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:47:12,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615905496] [2025-02-08 05:47:12,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:12,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:12,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:12,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:12,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:12,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 656 [2025-02-08 05:47:12,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 496 transitions, 1220 flow. Second operand has 3 states, 3 states have (on average 529.3333333333334) internal successors, (1588), 3 states have internal predecessors, (1588), 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:47:12,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:12,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 656 [2025-02-08 05:47:12,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:15,237 INFO L124 PetriNetUnfolderBase]: 2744/14952 cut-off events. [2025-02-08 05:47:15,237 INFO L125 PetriNetUnfolderBase]: For 4786/11012 co-relation queries the response was YES. [2025-02-08 05:47:15,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23907 conditions, 14952 events. 2744/14952 cut-off events. For 4786/11012 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 181673 event pairs, 1068 based on Foata normal form. 10/13723 useless extension candidates. Maximal degree in co-relation 23895. Up to 3339 conditions per place. [2025-02-08 05:47:15,407 INFO L140 encePairwiseOnDemand]: 653/656 looper letters, 62 selfloop transitions, 2 changer transitions 0/503 dead transitions. [2025-02-08 05:47:15,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 503 transitions, 1380 flow [2025-02-08 05:47:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1610 transitions. [2025-02-08 05:47:15,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.818089430894309 [2025-02-08 05:47:15,410 INFO L175 Difference]: Start difference. First operand has 470 places, 496 transitions, 1220 flow. Second operand 3 states and 1610 transitions. [2025-02-08 05:47:15,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 503 transitions, 1380 flow [2025-02-08 05:47:15,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 503 transitions, 1379 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:15,424 INFO L231 Difference]: Finished difference. Result has 472 places, 497 transitions, 1231 flow [2025-02-08 05:47:15,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1231, PETRI_PLACES=472, PETRI_TRANSITIONS=497} [2025-02-08 05:47:15,425 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -90 predicate places. [2025-02-08 05:47:15,425 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 497 transitions, 1231 flow [2025-02-08 05:47:15,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 529.3333333333334) internal successors, (1588), 3 states have internal predecessors, (1588), 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:47:15,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:15,426 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] [2025-02-08 05:47:15,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:47:15,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:15,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:15,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1419624148, now seen corresponding path program 1 times [2025-02-08 05:47:15,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:15,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706442335] [2025-02-08 05:47:15,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:15,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:47:15,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:47:15,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:15,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:15,535 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:47:15,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:15,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706442335] [2025-02-08 05:47:15,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706442335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:15,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:15,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8750320] [2025-02-08 05:47:15,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:15,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:47:15,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:15,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:47:15,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:47:15,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 526 out of 656 [2025-02-08 05:47:15,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 497 transitions, 1231 flow. Second operand has 5 states, 5 states have (on average 527.6) internal successors, (2638), 5 states have internal predecessors, (2638), 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:47:15,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:15,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 526 of 656 [2025-02-08 05:47:15,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:18,222 INFO L124 PetriNetUnfolderBase]: 3046/14022 cut-off events. [2025-02-08 05:47:18,222 INFO L125 PetriNetUnfolderBase]: For 4778/12449 co-relation queries the response was YES. [2025-02-08 05:47:18,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23868 conditions, 14022 events. 3046/14022 cut-off events. For 4778/12449 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 170006 event pairs, 1772 based on Foata normal form. 46/13185 useless extension candidates. Maximal degree in co-relation 23855. Up to 3695 conditions per place. [2025-02-08 05:47:18,402 INFO L140 encePairwiseOnDemand]: 651/656 looper letters, 92 selfloop transitions, 5 changer transitions 0/534 dead transitions. [2025-02-08 05:47:18,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 534 transitions, 1603 flow [2025-02-08 05:47:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3200 transitions. [2025-02-08 05:47:18,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8130081300813008 [2025-02-08 05:47:18,406 INFO L175 Difference]: Start difference. First operand has 472 places, 497 transitions, 1231 flow. Second operand 6 states and 3200 transitions. [2025-02-08 05:47:18,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 534 transitions, 1603 flow [2025-02-08 05:47:18,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 534 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:18,418 INFO L231 Difference]: Finished difference. Result has 479 places, 500 transitions, 1261 flow [2025-02-08 05:47:18,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1261, PETRI_PLACES=479, PETRI_TRANSITIONS=500} [2025-02-08 05:47:18,419 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -83 predicate places. [2025-02-08 05:47:18,419 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 500 transitions, 1261 flow [2025-02-08 05:47:18,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 527.6) internal successors, (2638), 5 states have internal predecessors, (2638), 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:47:18,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:18,420 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:18,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:47:18,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:18,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:18,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1827616695, now seen corresponding path program 1 times [2025-02-08 05:47:18,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:18,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128023676] [2025-02-08 05:47:18,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:18,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:47:18,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:47:18,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:18,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:18,581 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:47:18,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:18,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128023676] [2025-02-08 05:47:18,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128023676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:18,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:18,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:47:18,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056037730] [2025-02-08 05:47:18,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:18,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:47:18,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:18,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:47:18,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:47:18,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 526 out of 656 [2025-02-08 05:47:18,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 500 transitions, 1261 flow. Second operand has 7 states, 7 states have (on average 527.7142857142857) internal successors, (3694), 7 states have internal predecessors, (3694), 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:47:18,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:18,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 526 of 656 [2025-02-08 05:47:18,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:21,526 INFO L124 PetriNetUnfolderBase]: 3012/15109 cut-off events. [2025-02-08 05:47:21,526 INFO L125 PetriNetUnfolderBase]: For 5312/11935 co-relation queries the response was YES. [2025-02-08 05:47:21,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25262 conditions, 15109 events. 3012/15109 cut-off events. For 5312/11935 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 186981 event pairs, 83 based on Foata normal form. 324/14357 useless extension candidates. Maximal degree in co-relation 25246. Up to 3163 conditions per place. [2025-02-08 05:47:21,793 INFO L140 encePairwiseOnDemand]: 651/656 looper letters, 138 selfloop transitions, 8 changer transitions 0/583 dead transitions. [2025-02-08 05:47:21,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 583 transitions, 1975 flow [2025-02-08 05:47:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:47:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:47:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4800 transitions. [2025-02-08 05:47:21,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8130081300813008 [2025-02-08 05:47:21,800 INFO L175 Difference]: Start difference. First operand has 479 places, 500 transitions, 1261 flow. Second operand 9 states and 4800 transitions. [2025-02-08 05:47:21,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 583 transitions, 1975 flow [2025-02-08 05:47:21,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 583 transitions, 1969 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 05:47:21,818 INFO L231 Difference]: Finished difference. Result has 488 places, 502 transitions, 1291 flow [2025-02-08 05:47:21,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1291, PETRI_PLACES=488, PETRI_TRANSITIONS=502} [2025-02-08 05:47:21,819 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -74 predicate places. [2025-02-08 05:47:21,819 INFO L471 AbstractCegarLoop]: Abstraction has has 488 places, 502 transitions, 1291 flow [2025-02-08 05:47:21,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 527.7142857142857) internal successors, (3694), 7 states have internal predecessors, (3694), 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:47:21,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:21,820 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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:47:21,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:47:21,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:21,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1225229838, now seen corresponding path program 1 times [2025-02-08 05:47:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:21,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543735413] [2025-02-08 05:47:21,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:21,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:47:21,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:47:21,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:21,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:22,075 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:47:22,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:22,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543735413] [2025-02-08 05:47:22,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543735413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:22,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:22,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:47:22,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596028809] [2025-02-08 05:47:22,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:22,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:47:22,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:22,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:47:22,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:47:22,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 656 [2025-02-08 05:47:22,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 502 transitions, 1291 flow. Second operand has 9 states, 9 states have (on average 527.0) internal successors, (4743), 9 states have internal predecessors, (4743), 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:47:22,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:22,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 656 [2025-02-08 05:47:22,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:24,417 INFO L124 PetriNetUnfolderBase]: 1707/11809 cut-off events. [2025-02-08 05:47:24,417 INFO L125 PetriNetUnfolderBase]: For 3341/6099 co-relation queries the response was YES. [2025-02-08 05:47:24,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17956 conditions, 11809 events. 1707/11809 cut-off events. For 3341/6099 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 145981 event pairs, 32 based on Foata normal form. 685/11652 useless extension candidates. Maximal degree in co-relation 17937. Up to 1795 conditions per place. [2025-02-08 05:47:24,563 INFO L140 encePairwiseOnDemand]: 650/656 looper letters, 129 selfloop transitions, 11 changer transitions 0/575 dead transitions. [2025-02-08 05:47:24,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 575 transitions, 1876 flow [2025-02-08 05:47:24,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:47:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:47:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6396 transitions. [2025-02-08 05:47:24,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8125 [2025-02-08 05:47:24,569 INFO L175 Difference]: Start difference. First operand has 488 places, 502 transitions, 1291 flow. Second operand 12 states and 6396 transitions. [2025-02-08 05:47:24,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 575 transitions, 1876 flow [2025-02-08 05:47:24,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 575 transitions, 1854 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-02-08 05:47:24,578 INFO L231 Difference]: Finished difference. Result has 492 places, 492 transitions, 1236 flow [2025-02-08 05:47:24,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1236, PETRI_PLACES=492, PETRI_TRANSITIONS=492} [2025-02-08 05:47:24,579 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -70 predicate places. [2025-02-08 05:47:24,579 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 492 transitions, 1236 flow [2025-02-08 05:47:24,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 527.0) internal successors, (4743), 9 states have internal predecessors, (4743), 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:47:24,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:24,581 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:24,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:47:24,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:24,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:24,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1345572843, now seen corresponding path program 1 times [2025-02-08 05:47:24,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:24,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843520453] [2025-02-08 05:47:24,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:24,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:24,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:47:24,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:47:24,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:24,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:25,213 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:47:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:25,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843520453] [2025-02-08 05:47:25,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843520453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:25,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374396732] [2025-02-08 05:47:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:25,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:47:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:25,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:47:25,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:47:25,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 517 out of 656 [2025-02-08 05:47:25,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 492 transitions, 1236 flow. Second operand has 6 states, 6 states have (on average 519.5) internal successors, (3117), 6 states have internal predecessors, (3117), 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:47:25,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:25,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 517 of 656 [2025-02-08 05:47:25,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:28,009 INFO L124 PetriNetUnfolderBase]: 3149/14077 cut-off events. [2025-02-08 05:47:28,010 INFO L125 PetriNetUnfolderBase]: For 3417/6548 co-relation queries the response was YES. [2025-02-08 05:47:28,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23622 conditions, 14077 events. 3149/14077 cut-off events. For 3417/6548 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 180476 event pairs, 1423 based on Foata normal form. 358/13487 useless extension candidates. Maximal degree in co-relation 23603. Up to 3420 conditions per place. [2025-02-08 05:47:28,153 INFO L140 encePairwiseOnDemand]: 646/656 looper letters, 88 selfloop transitions, 18 changer transitions 0/536 dead transitions. [2025-02-08 05:47:28,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 536 transitions, 1615 flow [2025-02-08 05:47:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3179 transitions. [2025-02-08 05:47:28,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8076727642276422 [2025-02-08 05:47:28,156 INFO L175 Difference]: Start difference. First operand has 492 places, 492 transitions, 1236 flow. Second operand 6 states and 3179 transitions. [2025-02-08 05:47:28,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 536 transitions, 1615 flow [2025-02-08 05:47:28,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 536 transitions, 1569 flow, removed 4 selfloop flow, removed 15 redundant places. [2025-02-08 05:47:28,164 INFO L231 Difference]: Finished difference. Result has 487 places, 509 transitions, 1338 flow [2025-02-08 05:47:28,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1338, PETRI_PLACES=487, PETRI_TRANSITIONS=509} [2025-02-08 05:47:28,165 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -75 predicate places. [2025-02-08 05:47:28,165 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 509 transitions, 1338 flow [2025-02-08 05:47:28,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 519.5) internal successors, (3117), 6 states have internal predecessors, (3117), 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:47:28,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:28,166 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:28,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:47:28,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:28,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:28,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2010446510, now seen corresponding path program 1 times [2025-02-08 05:47:28,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:28,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105541541] [2025-02-08 05:47:28,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:28,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:47:28,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:47:28,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:28,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:29,703 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:47:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105541541] [2025-02-08 05:47:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105541541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:29,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 05:47:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551611995] [2025-02-08 05:47:29,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:29,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 05:47:29,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:29,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 05:47:29,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-08 05:47:31,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 656 [2025-02-08 05:47:31,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 509 transitions, 1338 flow. Second operand has 17 states, 17 states have (on average 498.8235294117647) internal successors, (8480), 17 states have internal predecessors, (8480), 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:47:31,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:31,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 656 [2025-02-08 05:47:31,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:41,590 INFO L124 PetriNetUnfolderBase]: 14644/54819 cut-off events. [2025-02-08 05:47:41,590 INFO L125 PetriNetUnfolderBase]: For 25188/241929 co-relation queries the response was YES. [2025-02-08 05:47:41,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101346 conditions, 54819 events. 14644/54819 cut-off events. For 25188/241929 co-relation queries the response was YES. Maximal size of possible extension queue 3195. Compared 802834 event pairs, 8222 based on Foata normal form. 1016/50792 useless extension candidates. Maximal degree in co-relation 101327. Up to 16965 conditions per place. [2025-02-08 05:47:42,028 INFO L140 encePairwiseOnDemand]: 628/656 looper letters, 191 selfloop transitions, 157 changer transitions 0/757 dead transitions. [2025-02-08 05:47:42,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 757 transitions, 3140 flow [2025-02-08 05:47:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 05:47:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 05:47:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 11251 transitions. [2025-02-08 05:47:42,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7795870288248337 [2025-02-08 05:47:42,038 INFO L175 Difference]: Start difference. First operand has 487 places, 509 transitions, 1338 flow. Second operand 22 states and 11251 transitions. [2025-02-08 05:47:42,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 757 transitions, 3140 flow [2025-02-08 05:47:42,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 757 transitions, 3140 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:42,097 INFO L231 Difference]: Finished difference. Result has 523 places, 631 transitions, 2654 flow [2025-02-08 05:47:42,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2654, PETRI_PLACES=523, PETRI_TRANSITIONS=631} [2025-02-08 05:47:42,098 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -39 predicate places. [2025-02-08 05:47:42,099 INFO L471 AbstractCegarLoop]: Abstraction has has 523 places, 631 transitions, 2654 flow [2025-02-08 05:47:42,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 498.8235294117647) internal successors, (8480), 17 states have internal predecessors, (8480), 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:47:42,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:42,101 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:42,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:47:42,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:42,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1910943186, now seen corresponding path program 2 times [2025-02-08 05:47:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:42,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005717003] [2025-02-08 05:47:42,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:47:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:42,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-08 05:47:42,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 99 statements. [2025-02-08 05:47:42,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:47:42,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:47:43,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:43,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005717003] [2025-02-08 05:47:43,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005717003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:43,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:43,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 05:47:43,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652164006] [2025-02-08 05:47:43,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:43,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 05:47:43,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:43,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 05:47:43,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-02-08 05:47:44,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 656 [2025-02-08 05:47:44,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 631 transitions, 2654 flow. Second operand has 16 states, 16 states have (on average 501.8125) internal successors, (8029), 16 states have internal predecessors, (8029), 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:47:44,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:44,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 656 [2025-02-08 05:47:44,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:55,305 INFO L124 PetriNetUnfolderBase]: 14161/52500 cut-off events. [2025-02-08 05:47:55,305 INFO L125 PetriNetUnfolderBase]: For 87920/274501 co-relation queries the response was YES. [2025-02-08 05:47:55,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122634 conditions, 52500 events. 14161/52500 cut-off events. For 87920/274501 co-relation queries the response was YES. Maximal size of possible extension queue 3159. Compared 760579 event pairs, 7702 based on Foata normal form. 3733/51234 useless extension candidates. Maximal degree in co-relation 122599. Up to 16481 conditions per place. [2025-02-08 05:47:55,934 INFO L140 encePairwiseOnDemand]: 630/656 looper letters, 159 selfloop transitions, 353 changer transitions 0/925 dead transitions. [2025-02-08 05:47:55,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 925 transitions, 5979 flow [2025-02-08 05:47:55,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:47:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:47:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 10750 transitions. [2025-02-08 05:47:55,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78034262485482 [2025-02-08 05:47:55,943 INFO L175 Difference]: Start difference. First operand has 523 places, 631 transitions, 2654 flow. Second operand 21 states and 10750 transitions. [2025-02-08 05:47:55,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 925 transitions, 5979 flow [2025-02-08 05:47:56,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 925 transitions, 5876 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 05:47:56,073 INFO L231 Difference]: Finished difference. Result has 552 places, 837 transitions, 5566 flow [2025-02-08 05:47:56,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=656, PETRI_DIFFERENCE_MINUEND_FLOW=2616, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5566, PETRI_PLACES=552, PETRI_TRANSITIONS=837} [2025-02-08 05:47:56,074 INFO L279 CegarLoopForPetriNet]: 562 programPoint places, -10 predicate places. [2025-02-08 05:47:56,074 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 837 transitions, 5566 flow [2025-02-08 05:47:56,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 501.8125) internal successors, (8029), 16 states have internal predecessors, (8029), 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:47:56,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:56,075 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:47:56,075 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:56,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1262381980, now seen corresponding path program 3 times [2025-02-08 05:47:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:56,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410957717] [2025-02-08 05:47:56,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:47:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:56,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 2 equivalence classes. [2025-02-08 05:47:56,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 98 of 99 statements. [2025-02-08 05:47:56,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:47:56,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:47:56,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:56,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410957717] [2025-02-08 05:47:56,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410957717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:56,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:56,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 05:47:56,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835306731] [2025-02-08 05:47:56,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:56,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 05:47:56,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:56,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 05:47:56,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-08 05:47:57,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 656 [2025-02-08 05:47:57,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 837 transitions, 5566 flow. Second operand has 16 states, 16 states have (on average 501.875) internal successors, (8030), 16 states have internal predecessors, (8030), 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:47:57,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:57,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 656 [2025-02-08 05:47:57,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand