./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/bounded_spsc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/bounded_spsc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93808a150a8803e907bade039c6d51db8f9a81931409074d169ee410e6e3b34e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:20:06,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:20:06,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:20:06,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:20:06,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:20:06,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:20:06,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:20:06,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:20:06,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:20:06,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:20:06,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:20:06,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:20:06,638 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:20:06,638 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:20:06,638 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:20:06,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:20:06,638 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:20:06,638 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:20:06,638 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:20:06,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:20:06,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:20:06,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:20:06,639 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93808a150a8803e907bade039c6d51db8f9a81931409074d169ee410e6e3b34e [2025-03-17 11:20:06,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:20:06,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:20:06,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:20:06,864 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:20:06,865 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:20:06,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_spsc.i [2025-03-17 11:20:07,969 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cbd9d0d/e7b9da9f934a4555bb7930d300402477/FLAGaad933e5e [2025-03-17 11:20:08,420 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:20:08,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_spsc.i [2025-03-17 11:20:08,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cbd9d0d/e7b9da9f934a4555bb7930d300402477/FLAGaad933e5e [2025-03-17 11:20:08,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cbd9d0d/e7b9da9f934a4555bb7930d300402477 [2025-03-17 11:20:08,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:20:08,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:20:08,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:20:08,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:20:08,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:20:08,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:20:08" (1/1) ... [2025-03-17 11:20:08,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4060bf19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:08, skipping insertion in model container [2025-03-17 11:20:08,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:20:08" (1/1) ... [2025-03-17 11:20:08,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:20:10,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:20:10,099 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:20:10,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4397] [2025-03-17 11:20:10,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4399] [2025-03-17 11:20:10,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4404] [2025-03-17 11:20:10,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4406] [2025-03-17 11:20:10,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4412] [2025-03-17 11:20:10,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-03-17 11:20:10,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4420] [2025-03-17 11:20:10,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4422] [2025-03-17 11:20:10,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4428] [2025-03-17 11:20:10,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4430] [2025-03-17 11:20:10,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4436] [2025-03-17 11:20:10,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4438] [2025-03-17 11:20:10,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-03-17 11:20:10,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4446] [2025-03-17 11:20:10,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4452] [2025-03-17 11:20:10,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4454] [2025-03-17 11:20:10,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4459] [2025-03-17 11:20:10,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4461] [2025-03-17 11:20:10,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4466] [2025-03-17 11:20:10,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4468] [2025-03-17 11:20:10,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-03-17 11:20:10,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4475] [2025-03-17 11:20:10,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-03-17 11:20:10,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4482] [2025-03-17 11:20:10,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4487] [2025-03-17 11:20:10,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4489] [2025-03-17 11:20:10,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4494] [2025-03-17 11:20:10,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4497] [2025-03-17 11:20:10,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-03-17 11:20:10,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4506] [2025-03-17 11:20:10,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4512] [2025-03-17 11:20:10,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4515] [2025-03-17 11:20:10,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4521] [2025-03-17 11:20:10,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4524] [2025-03-17 11:20:10,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4530] [2025-03-17 11:20:10,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4533] [2025-03-17 11:20:10,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4539] [2025-03-17 11:20:10,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4542] [2025-03-17 11:20:10,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-03-17 11:20:10,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4552] [2025-03-17 11:20:10,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4559] [2025-03-17 11:20:10,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4562] [2025-03-17 11:20:10,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4569] [2025-03-17 11:20:10,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4572] [2025-03-17 11:20:10,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4579] [2025-03-17 11:20:10,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-03-17 11:20:10,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4589] [2025-03-17 11:20:10,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4592] [2025-03-17 11:20:10,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4599] [2025-03-17 11:20:10,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4602] [2025-03-17 11:20:10,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4608] [2025-03-17 11:20:10,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4611] [2025-03-17 11:20:10,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4617] [2025-03-17 11:20:10,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4620] [2025-03-17 11:20:10,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4626] [2025-03-17 11:20:10,262 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4629] [2025-03-17 11:20:10,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4635] [2025-03-17 11:20:10,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4638] [2025-03-17 11:20:10,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4644] [2025-03-17 11:20:10,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4647] [2025-03-17 11:20:10,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4653] [2025-03-17 11:20:10,266 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-03-17 11:20:10,266 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-03-17 11:20:10,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4665] [2025-03-17 11:20:10,268 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4671] [2025-03-17 11:20:10,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4674] [2025-03-17 11:20:10,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-03-17 11:20:10,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4683] [2025-03-17 11:20:10,271 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4689] [2025-03-17 11:20:10,271 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4692] [2025-03-17 11:20:10,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4698] [2025-03-17 11:20:10,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4701] [2025-03-17 11:20:10,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4707] [2025-03-17 11:20:10,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-03-17 11:20:10,274 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4716] [2025-03-17 11:20:10,274 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4719] [2025-03-17 11:20:10,275 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4725] [2025-03-17 11:20:10,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-03-17 11:20:10,277 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4734] [2025-03-17 11:20:10,277 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4737] [2025-03-17 11:20:10,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4743] [2025-03-17 11:20:10,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4745] [2025-03-17 11:20:10,279 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4751] [2025-03-17 11:20:10,279 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4753] [2025-03-17 11:20:10,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4759] [2025-03-17 11:20:10,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4761] [2025-03-17 11:20:10,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4767] [2025-03-17 11:20:10,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4769] [2025-03-17 11:20:10,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4775] [2025-03-17 11:20:10,282 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4777] [2025-03-17 11:20:10,282 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4783] [2025-03-17 11:20:10,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4785] [2025-03-17 11:20:10,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4791] [2025-03-17 11:20:10,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4793] [2025-03-17 11:20:10,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4799] [2025-03-17 11:20:10,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4801] [2025-03-17 11:20:10,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4807] [2025-03-17 11:20:10,285 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4809] [2025-03-17 11:20:10,285 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4815] [2025-03-17 11:20:10,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4817] [2025-03-17 11:20:10,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:20:10,512 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:20:10,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10 WrapperNode [2025-03-17 11:20:10,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:20:10,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:20:10,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:20:10,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:20:10,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,626 INFO L138 Inliner]: procedures = 948, calls = 963, calls flagged for inlining = 823, calls inlined = 39, statements flattened = 571 [2025-03-17 11:20:10,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:20:10,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:20:10,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:20:10,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:20:10,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,667 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:20:10,687 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:20:10,687 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:20:10,687 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:20:10,688 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (1/1) ... [2025-03-17 11:20:10,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:20:10,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:20:10,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:20:10,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:20:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:20:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:20:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:20:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:20:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:20:10,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:20:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-17 11:20:10,735 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-17 11:20:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:20:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:20:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:20:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:20:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 11:20:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:20:10,736 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:20:10,861 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:20:10,863 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:20:11,212 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6110: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-17 11:20:11,213 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6110-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-17 11:20:11,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-17 11:20:11,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-10: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-17 11:20:11,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-20: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-17 11:20:11,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-17 11:20:11,597 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:20:11,598 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:20:11,662 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:20:11,662 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:20:11,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:20:11 BoogieIcfgContainer [2025-03-17 11:20:11,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:20:11,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:20:11,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:20:11,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:20:11,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:20:08" (1/3) ... [2025-03-17 11:20:11,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fbf636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:20:11, skipping insertion in model container [2025-03-17 11:20:11,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:10" (2/3) ... [2025-03-17 11:20:11,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fbf636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:20:11, skipping insertion in model container [2025-03-17 11:20:11,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:20:11" (3/3) ... [2025-03-17 11:20:11,669 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_spsc.i [2025-03-17 11:20:11,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:20:11,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_spsc.i that has 2 procedures, 580 locations, 1 initial locations, 21 loop locations, and 29 error locations. [2025-03-17 11:20:11,681 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:20:11,840 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:20:11,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 583 places, 659 transitions, 1325 flow [2025-03-17 11:20:12,070 INFO L124 PetriNetUnfolderBase]: 79/689 cut-off events. [2025-03-17 11:20:12,073 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:20:12,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 689 events. 79/689 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1780 event pairs, 0 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 500. Up to 4 conditions per place. [2025-03-17 11:20:12,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 583 places, 659 transitions, 1325 flow [2025-03-17 11:20:12,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 583 places, 659 transitions, 1325 flow [2025-03-17 11:20:12,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:20:12,114 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;@65dd9ed3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:20:12,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-03-17 11:20:12,128 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:20:12,128 INFO L124 PetriNetUnfolderBase]: 8/66 cut-off events. [2025-03-17 11:20:12,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:20:12,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:12,129 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] [2025-03-17 11:20:12,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:12,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1056558798, now seen corresponding path program 1 times [2025-03-17 11:20:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:12,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083891177] [2025-03-17 11:20:12,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:12,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:12,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:20:12,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:20:12,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:12,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:12,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083891177] [2025-03-17 11:20:12,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083891177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:12,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:12,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:20:12,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855613163] [2025-03-17 11:20:12,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:12,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:20:12,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:12,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:20:12,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:20:12,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 573 out of 659 [2025-03-17 11:20:12,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 659 transitions, 1325 flow. Second operand has 2 states, 2 states have (on average 574.0) internal successors, (1148), 2 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:12,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:12,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 573 of 659 [2025-03-17 11:20:12,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:12,509 INFO L124 PetriNetUnfolderBase]: 11/591 cut-off events. [2025-03-17 11:20:12,509 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:20:12,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 591 events. 11/591 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1445 event pairs, 0 based on Foata normal form. 52/596 useless extension candidates. Maximal degree in co-relation 430. Up to 11 conditions per place. [2025-03-17 11:20:12,515 INFO L140 encePairwiseOnDemand]: 585/659 looper letters, 10 selfloop transitions, 0 changer transitions 10/561 dead transitions. [2025-03-17 11:20:12,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 561 transitions, 1149 flow [2025-03-17 11:20:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:20:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:20:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1230 transitions. [2025-03-17 11:20:12,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9332321699544764 [2025-03-17 11:20:12,534 INFO L175 Difference]: Start difference. First operand has 583 places, 659 transitions, 1325 flow. Second operand 2 states and 1230 transitions. [2025-03-17 11:20:12,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 561 transitions, 1149 flow [2025-03-17 11:20:12,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 561 transitions, 1149 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:12,557 INFO L231 Difference]: Finished difference. Result has 554 places, 551 transitions, 1109 flow [2025-03-17 11:20:12,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=659, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1109, PETRI_PLACES=554, PETRI_TRANSITIONS=551} [2025-03-17 11:20:12,563 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -29 predicate places. [2025-03-17 11:20:12,563 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 551 transitions, 1109 flow [2025-03-17 11:20:12,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 574.0) internal successors, (1148), 2 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:12,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:12,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:12,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:20:12,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:12,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1419627994, now seen corresponding path program 1 times [2025-03-17 11:20:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:12,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706529303] [2025-03-17 11:20:12,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:12,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:20:12,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:20:12,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:12,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:13,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706529303] [2025-03-17 11:20:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706529303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:13,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:13,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:20:13,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178490184] [2025-03-17 11:20:13,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:13,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:20:13,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:13,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:20:13,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:20:13,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 486 out of 659 [2025-03-17 11:20:13,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 551 transitions, 1109 flow. Second operand has 6 states, 6 states have (on average 487.3333333333333) internal successors, (2924), 6 states have internal predecessors, (2924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:13,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:13,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 486 of 659 [2025-03-17 11:20:13,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:14,185 INFO L124 PetriNetUnfolderBase]: 612/3798 cut-off events. [2025-03-17 11:20:14,185 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:20:14,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4991 conditions, 3798 events. 612/3798 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 30501 event pairs, 528 based on Foata normal form. 0/3473 useless extension candidates. Maximal degree in co-relation 4987. Up to 1181 conditions per place. [2025-03-17 11:20:14,206 INFO L140 encePairwiseOnDemand]: 653/659 looper letters, 91 selfloop transitions, 5 changer transitions 0/550 dead transitions. [2025-03-17 11:20:14,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 550 transitions, 1299 flow [2025-03-17 11:20:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:20:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:20:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3013 transitions. [2025-03-17 11:20:14,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7620131512392514 [2025-03-17 11:20:14,216 INFO L175 Difference]: Start difference. First operand has 554 places, 551 transitions, 1109 flow. Second operand 6 states and 3013 transitions. [2025-03-17 11:20:14,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 550 transitions, 1299 flow [2025-03-17 11:20:14,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 550 transitions, 1299 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:14,224 INFO L231 Difference]: Finished difference. Result has 548 places, 550 transitions, 1117 flow [2025-03-17 11:20:14,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=659, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1117, PETRI_PLACES=548, PETRI_TRANSITIONS=550} [2025-03-17 11:20:14,226 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -35 predicate places. [2025-03-17 11:20:14,227 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 550 transitions, 1117 flow [2025-03-17 11:20:14,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 487.3333333333333) internal successors, (2924), 6 states have internal predecessors, (2924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:14,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:14,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:14,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:20:14,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:14,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1760811951, now seen corresponding path program 1 times [2025-03-17 11:20:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:14,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185116567] [2025-03-17 11:20:14,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:14,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:20:14,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:20:14,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:14,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185116567] [2025-03-17 11:20:14,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185116567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:14,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:14,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:20:14,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721096377] [2025-03-17 11:20:14,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:14,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:20:14,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:14,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:20:14,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:20:14,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 486 out of 659 [2025-03-17 11:20:14,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 550 transitions, 1117 flow. Second operand has 6 states, 6 states have (on average 487.3333333333333) internal successors, (2924), 6 states have internal predecessors, (2924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:14,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:14,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 486 of 659 [2025-03-17 11:20:14,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:15,589 INFO L124 PetriNetUnfolderBase]: 612/3797 cut-off events. [2025-03-17 11:20:15,590 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:20:15,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4996 conditions, 3797 events. 612/3797 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 30596 event pairs, 528 based on Foata normal form. 0/3473 useless extension candidates. Maximal degree in co-relation 4991. Up to 1181 conditions per place. [2025-03-17 11:20:15,605 INFO L140 encePairwiseOnDemand]: 653/659 looper letters, 91 selfloop transitions, 5 changer transitions 0/549 dead transitions. [2025-03-17 11:20:15,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 549 transitions, 1307 flow [2025-03-17 11:20:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:20:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:20:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3013 transitions. [2025-03-17 11:20:15,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7620131512392514 [2025-03-17 11:20:15,613 INFO L175 Difference]: Start difference. First operand has 548 places, 550 transitions, 1117 flow. Second operand 6 states and 3013 transitions. [2025-03-17 11:20:15,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 549 transitions, 1307 flow [2025-03-17 11:20:15,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 549 transitions, 1297 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:20:15,621 INFO L231 Difference]: Finished difference. Result has 547 places, 549 transitions, 1115 flow [2025-03-17 11:20:15,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=659, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1115, PETRI_PLACES=547, PETRI_TRANSITIONS=549} [2025-03-17 11:20:15,623 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -36 predicate places. [2025-03-17 11:20:15,623 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 549 transitions, 1115 flow [2025-03-17 11:20:15,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 487.3333333333333) internal successors, (2924), 6 states have internal predecessors, (2924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:15,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:15,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:15,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:20:15,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:15,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash 829771667, now seen corresponding path program 1 times [2025-03-17 11:20:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51375219] [2025-03-17 11:20:15,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:15,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 11:20:15,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 11:20:15,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:15,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:16,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51375219] [2025-03-17 11:20:16,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51375219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:16,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:20:16,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229497764] [2025-03-17 11:20:16,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:16,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:20:16,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:16,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:20:16,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:20:16,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 659 [2025-03-17 11:20:16,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 549 transitions, 1115 flow. Second operand has 6 states, 6 states have (on average 481.1666666666667) internal successors, (2887), 6 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:16,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:16,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 659 [2025-03-17 11:20:16,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:17,463 INFO L124 PetriNetUnfolderBase]: 687/4200 cut-off events. [2025-03-17 11:20:17,464 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 11:20:17,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5543 conditions, 4200 events. 687/4200 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 35682 event pairs, 594 based on Foata normal form. 0/3841 useless extension candidates. Maximal degree in co-relation 5538. Up to 1325 conditions per place. [2025-03-17 11:20:17,479 INFO L140 encePairwiseOnDemand]: 653/659 looper letters, 99 selfloop transitions, 5 changer transitions 0/548 dead transitions. [2025-03-17 11:20:17,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 548 transitions, 1321 flow [2025-03-17 11:20:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:20:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:20:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2973 transitions. [2025-03-17 11:20:17,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7518968133535661 [2025-03-17 11:20:17,486 INFO L175 Difference]: Start difference. First operand has 547 places, 549 transitions, 1115 flow. Second operand 6 states and 2973 transitions. [2025-03-17 11:20:17,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 548 transitions, 1321 flow [2025-03-17 11:20:17,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 548 transitions, 1311 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:20:17,495 INFO L231 Difference]: Finished difference. Result has 546 places, 548 transitions, 1113 flow [2025-03-17 11:20:17,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=659, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1113, PETRI_PLACES=546, PETRI_TRANSITIONS=548} [2025-03-17 11:20:17,496 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -37 predicate places. [2025-03-17 11:20:17,496 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 548 transitions, 1113 flow [2025-03-17 11:20:17,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 481.1666666666667) internal successors, (2887), 6 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:17,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:17,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:17,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:20:17,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:17,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1001243967, now seen corresponding path program 1 times [2025-03-17 11:20:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911883741] [2025-03-17 11:20:17,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:17,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 11:20:17,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 11:20:17,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:17,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:20:17,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:17,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911883741] [2025-03-17 11:20:17,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911883741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:17,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:17,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:20:17,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379438106] [2025-03-17 11:20:17,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:17,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:20:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:17,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:20:17,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:20:17,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 659 [2025-03-17 11:20:17,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 548 transitions, 1113 flow. Second operand has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:17,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:17,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 659 [2025-03-17 11:20:17,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:17,750 INFO L124 PetriNetUnfolderBase]: 17/618 cut-off events. [2025-03-17 11:20:17,751 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:20:17,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 618 events. 17/618 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1676 event pairs, 6 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 661. Up to 30 conditions per place. [2025-03-17 11:20:17,754 INFO L140 encePairwiseOnDemand]: 656/659 looper letters, 15 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2025-03-17 11:20:17,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 549 transitions, 1149 flow [2025-03-17 11:20:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:20:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:20:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2025-03-17 11:20:17,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8694992412746586 [2025-03-17 11:20:17,759 INFO L175 Difference]: Start difference. First operand has 546 places, 548 transitions, 1113 flow. Second operand 3 states and 1719 transitions. [2025-03-17 11:20:17,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 549 transitions, 1149 flow [2025-03-17 11:20:17,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 549 transitions, 1139 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:20:17,770 INFO L231 Difference]: Finished difference. Result has 544 places, 549 transitions, 1115 flow [2025-03-17 11:20:17,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=659, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1115, PETRI_PLACES=544, PETRI_TRANSITIONS=549} [2025-03-17 11:20:17,771 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -39 predicate places. [2025-03-17 11:20:17,771 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 549 transitions, 1115 flow [2025-03-17 11:20:17,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:17,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:17,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:17,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:20:17,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:17,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash -610665112, now seen corresponding path program 1 times [2025-03-17 11:20:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054767402] [2025-03-17 11:20:17,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:17,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 11:20:17,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 11:20:17,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:17,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:20:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:18,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054767402] [2025-03-17 11:20:18,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054767402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:18,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:18,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:20:18,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886497447] [2025-03-17 11:20:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:18,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:20:18,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:18,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:20:18,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:20:19,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 659 [2025-03-17 11:20:19,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 549 transitions, 1115 flow. Second operand has 6 states, 6 states have (on average 531.8333333333334) internal successors, (3191), 6 states have internal predecessors, (3191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:19,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:19,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 659 [2025-03-17 11:20:19,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:19,925 INFO L124 PetriNetUnfolderBase]: 161/2277 cut-off events. [2025-03-17 11:20:19,925 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:20:19,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 2277 events. 161/2277 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 14665 event pairs, 110 based on Foata normal form. 0/2079 useless extension candidates. Maximal degree in co-relation 2585. Up to 291 conditions per place. [2025-03-17 11:20:19,932 INFO L140 encePairwiseOnDemand]: 653/659 looper letters, 49 selfloop transitions, 6 changer transitions 0/548 dead transitions. [2025-03-17 11:20:19,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 548 transitions, 1223 flow [2025-03-17 11:20:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:20:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:20:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3223 transitions. [2025-03-17 11:20:19,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8151239251390996 [2025-03-17 11:20:19,938 INFO L175 Difference]: Start difference. First operand has 544 places, 549 transitions, 1115 flow. Second operand 6 states and 3223 transitions. [2025-03-17 11:20:19,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 548 transitions, 1223 flow [2025-03-17 11:20:19,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 548 transitions, 1221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:20:19,943 INFO L231 Difference]: Finished difference. Result has 547 places, 548 transitions, 1123 flow [2025-03-17 11:20:19,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=659, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1123, PETRI_PLACES=547, PETRI_TRANSITIONS=548} [2025-03-17 11:20:19,945 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -36 predicate places. [2025-03-17 11:20:19,945 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 548 transitions, 1123 flow [2025-03-17 11:20:19,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 531.8333333333334) internal successors, (3191), 6 states have internal predecessors, (3191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:19,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:19,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:19,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:20:19,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 309190152, now seen corresponding path program 1 times [2025-03-17 11:20:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:19,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191318016] [2025-03-17 11:20:19,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:19,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 11:20:19,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 11:20:19,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:19,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 11:20:20,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:20,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191318016] [2025-03-17 11:20:20,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191318016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:20,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:20,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:20:20,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734717612] [2025-03-17 11:20:20,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:20,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:20:20,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:20,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:20:20,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:20:21,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 659 [2025-03-17 11:20:21,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 548 transitions, 1123 flow. Second operand has 6 states, 6 states have (on average 482.5) internal successors, (2895), 6 states have internal predecessors, (2895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:21,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:21,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 659 [2025-03-17 11:20:21,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:22,945 INFO L124 PetriNetUnfolderBase]: 1487/7838 cut-off events. [2025-03-17 11:20:22,945 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 11:20:22,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10754 conditions, 7838 events. 1487/7838 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 73094 event pairs, 594 based on Foata normal form. 0/7160 useless extension candidates. Maximal degree in co-relation 10748. Up to 2486 conditions per place. [2025-03-17 11:20:22,972 INFO L140 encePairwiseOnDemand]: 586/659 looper letters, 104 selfloop transitions, 270 changer transitions 0/817 dead transitions. [2025-03-17 11:20:22,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 817 transitions, 2409 flow [2025-03-17 11:20:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:20:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:20:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3243 transitions. [2025-03-17 11:20:22,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8201820940819423 [2025-03-17 11:20:22,979 INFO L175 Difference]: Start difference. First operand has 547 places, 548 transitions, 1123 flow. Second operand 6 states and 3243 transitions. [2025-03-17 11:20:22,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 817 transitions, 2409 flow [2025-03-17 11:20:22,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 817 transitions, 2397 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:20:22,991 INFO L231 Difference]: Finished difference. Result has 552 places, 817 transitions, 2873 flow [2025-03-17 11:20:22,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=659, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2873, PETRI_PLACES=552, PETRI_TRANSITIONS=817} [2025-03-17 11:20:22,992 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -31 predicate places. [2025-03-17 11:20:22,992 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 817 transitions, 2873 flow [2025-03-17 11:20:22,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 482.5) internal successors, (2895), 6 states have internal predecessors, (2895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:22,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:22,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:22,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:20:22,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:22,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1672314805, now seen corresponding path program 1 times [2025-03-17 11:20:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:22,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868227167] [2025-03-17 11:20:22,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:23,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 11:20:23,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 11:20:23,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:23,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 11:20:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868227167] [2025-03-17 11:20:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868227167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:23,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:23,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:20:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558998185] [2025-03-17 11:20:23,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:23,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:20:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:23,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:20:23,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:20:24,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 659 [2025-03-17 11:20:24,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 817 transitions, 2873 flow. Second operand has 6 states, 6 states have (on average 531.6666666666666) internal successors, (3190), 6 states have internal predecessors, (3190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:24,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:24,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 659 [2025-03-17 11:20:24,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:25,706 INFO L124 PetriNetUnfolderBase]: 1036/7918 cut-off events. [2025-03-17 11:20:25,706 INFO L125 PetriNetUnfolderBase]: For 1129/1919 co-relation queries the response was YES. [2025-03-17 11:20:25,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12200 conditions, 7918 events. 1036/7918 cut-off events. For 1129/1919 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 73445 event pairs, 98 based on Foata normal form. 140/7472 useless extension candidates. Maximal degree in co-relation 12190. Up to 1545 conditions per place. [2025-03-17 11:20:25,731 INFO L140 encePairwiseOnDemand]: 634/659 looper letters, 159 selfloop transitions, 77 changer transitions 7/911 dead transitions. [2025-03-17 11:20:25,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 911 transitions, 3720 flow [2025-03-17 11:20:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:20:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:20:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3318 transitions. [2025-03-17 11:20:25,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8391502276176024 [2025-03-17 11:20:25,737 INFO L175 Difference]: Start difference. First operand has 552 places, 817 transitions, 2873 flow. Second operand 6 states and 3318 transitions. [2025-03-17 11:20:25,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 911 transitions, 3720 flow [2025-03-17 11:20:25,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 911 transitions, 3720 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:25,754 INFO L231 Difference]: Finished difference. Result has 562 places, 888 transitions, 3510 flow [2025-03-17 11:20:25,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=659, PETRI_DIFFERENCE_MINUEND_FLOW=2873, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3510, PETRI_PLACES=562, PETRI_TRANSITIONS=888} [2025-03-17 11:20:25,755 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -21 predicate places. [2025-03-17 11:20:25,755 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 888 transitions, 3510 flow [2025-03-17 11:20:25,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 531.6666666666666) internal successors, (3190), 6 states have internal predecessors, (3190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:25,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:25,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:25,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:20:25,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting runErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:25,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:25,758 INFO L85 PathProgramCache]: Analyzing trace with hash 579089156, now seen corresponding path program 1 times [2025-03-17 11:20:25,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:25,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523923289] [2025-03-17 11:20:25,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:25,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 11:20:25,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 11:20:25,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:25,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 11:20:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523923289] [2025-03-17 11:20:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523923289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:20:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037644104] [2025-03-17 11:20:25,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:25,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:20:25,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:20:25,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:20:25,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:20:26,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 11:20:26,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 11:20:26,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:26,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:26,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 11:20:26,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:20:26,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-03-17 11:20:26,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 11:20:26,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2025-03-17 11:20:26,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2025-03-17 11:20:26,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:20:26,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 154 [2025-03-17 11:20:26,203 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:20:26,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:20:26,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 30 [2025-03-17 11:20:26,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2025-03-17 11:20:26,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:20:26,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 208 [2025-03-17 11:20:26,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:20:26,326 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:20:26,330 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:20:26,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 51 [2025-03-17 11:20:26,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2025-03-17 11:20:26,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:20:26,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 262 [2025-03-17 11:20:26,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:20:26,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 68 [2025-03-17 11:20:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:20:26,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:20:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037644104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:20:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-17 11:20:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418216026] [2025-03-17 11:20:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:26,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:20:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:26,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:20:26,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:20:27,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 659 [2025-03-17 11:20:27,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 888 transitions, 3510 flow. Second operand has 6 states, 6 states have (on average 535.3333333333334) internal successors, (3212), 6 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:27,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:27,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 659 [2025-03-17 11:20:27,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:28,280 INFO L124 PetriNetUnfolderBase]: 887/6258 cut-off events. [2025-03-17 11:20:28,280 INFO L125 PetriNetUnfolderBase]: For 1740/2110 co-relation queries the response was YES. [2025-03-17 11:20:28,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10760 conditions, 6258 events. 887/6258 cut-off events. For 1740/2110 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 54017 event pairs, 15 based on Foata normal form. 1/5869 useless extension candidates. Maximal degree in co-relation 10745. Up to 1252 conditions per place. [2025-03-17 11:20:28,309 INFO L140 encePairwiseOnDemand]: 648/659 looper letters, 221 selfloop transitions, 40 changer transitions 0/919 dead transitions. [2025-03-17 11:20:28,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 919 transitions, 4184 flow [2025-03-17 11:20:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:20:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:20:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3259 transitions. [2025-03-17 11:20:28,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8242286292362165 [2025-03-17 11:20:28,315 INFO L175 Difference]: Start difference. First operand has 562 places, 888 transitions, 3510 flow. Second operand 6 states and 3259 transitions. [2025-03-17 11:20:28,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 919 transitions, 4184 flow [2025-03-17 11:20:28,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 919 transitions, 4184 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:28,335 INFO L231 Difference]: Finished difference. Result has 568 places, 919 transitions, 3862 flow [2025-03-17 11:20:28,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=659, PETRI_DIFFERENCE_MINUEND_FLOW=3510, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=860, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3862, PETRI_PLACES=568, PETRI_TRANSITIONS=919} [2025-03-17 11:20:28,336 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -15 predicate places. [2025-03-17 11:20:28,336 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 919 transitions, 3862 flow [2025-03-17 11:20:28,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 535.3333333333334) internal successors, (3212), 6 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:28,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:28,338 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:28,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:20:28,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:20:28,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:28,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash -482730739, now seen corresponding path program 1 times [2025-03-17 11:20:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:28,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63244863] [2025-03-17 11:20:28,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:28,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 11:20:28,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 11:20:28,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:28,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 11:20:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63244863] [2025-03-17 11:20:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63244863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:20:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101439135] [2025-03-17 11:20:28,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:28,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:20:28,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:20:28,694 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:20:28,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:20:28,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 11:20:28,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 11:20:28,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:28,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:28,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:20:28,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:20:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 11:20:28,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:20:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 11:20:28,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101439135] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:20:28,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:20:28,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 11:20:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698955226] [2025-03-17 11:20:28,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:20:28,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:20:28,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:28,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:20:28,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:20:29,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 659 [2025-03-17 11:20:29,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 919 transitions, 3862 flow. Second operand has 9 states, 9 states have (on average 566.2222222222222) internal successors, (5096), 9 states have internal predecessors, (5096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:29,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:29,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 659 [2025-03-17 11:20:29,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:29,820 INFO L124 PetriNetUnfolderBase]: 862/6235 cut-off events. [2025-03-17 11:20:29,821 INFO L125 PetriNetUnfolderBase]: For 1681/1835 co-relation queries the response was YES. [2025-03-17 11:20:29,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10433 conditions, 6235 events. 862/6235 cut-off events. For 1681/1835 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 53719 event pairs, 9 based on Foata normal form. 3/5860 useless extension candidates. Maximal degree in co-relation 10413. Up to 1259 conditions per place. [2025-03-17 11:20:29,837 INFO L140 encePairwiseOnDemand]: 653/659 looper letters, 50 selfloop transitions, 9 changer transitions 0/927 dead transitions. [2025-03-17 11:20:29,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 927 transitions, 3998 flow [2025-03-17 11:20:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:20:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:20:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 5105 transitions. [2025-03-17 11:20:29,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8607317484403979 [2025-03-17 11:20:29,843 INFO L175 Difference]: Start difference. First operand has 568 places, 919 transitions, 3862 flow. Second operand 9 states and 5105 transitions. [2025-03-17 11:20:29,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 927 transitions, 3998 flow [2025-03-17 11:20:29,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 927 transitions, 3980 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:29,865 INFO L231 Difference]: Finished difference. Result has 579 places, 925 transitions, 3894 flow [2025-03-17 11:20:29,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=659, PETRI_DIFFERENCE_MINUEND_FLOW=3844, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3894, PETRI_PLACES=579, PETRI_TRANSITIONS=925} [2025-03-17 11:20:29,867 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -4 predicate places. [2025-03-17 11:20:29,867 INFO L471 AbstractCegarLoop]: Abstraction has has 579 places, 925 transitions, 3894 flow [2025-03-17 11:20:29,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 566.2222222222222) internal successors, (5096), 9 states have internal predecessors, (5096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:29,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:29,869 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:29,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:20:30,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 11:20:30,073 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-17 11:20:30,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1634146337, now seen corresponding path program 2 times [2025-03-17 11:20:30,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:30,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597088991] [2025-03-17 11:20:30,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:20:30,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:30,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-17 11:20:30,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:20:30,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:20:30,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:20:30,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:20:30,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 11:20:30,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:20:30,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:30,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:20:30,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:20:30,277 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:20:30,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2025-03-17 11:20:30,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-03-17 11:20:30,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-03-17 11:20:30,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-03-17 11:20:30,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-03-17 11:20:30,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-03-17 11:20:30,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2025-03-17 11:20:30,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-03-17 11:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-03-17 11:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-03-17 11:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-03-17 11:20:30,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-03-17 11:20:30,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-03-17 11:20:30,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-03-17 11:20:30,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-03-17 11:20:30,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-03-17 11:20:30,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:20:30,283 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:30,285 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:20:30,285 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:20:30,385 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:20:30,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 986 places, 1125 transitions, 2266 flow [2025-03-17 11:20:30,605 INFO L124 PetriNetUnfolderBase]: 145/1217 cut-off events. [2025-03-17 11:20:30,606 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:20:30,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 1217 events. 145/1217 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4871 event pairs, 0 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 986. Up to 6 conditions per place. [2025-03-17 11:20:30,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 986 places, 1125 transitions, 2266 flow [2025-03-17 11:20:30,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 986 places, 1125 transitions, 2266 flow [2025-03-17 11:20:30,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:20:30,647 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;@65dd9ed3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:20:30,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-17 11:20:30,650 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:20:30,650 INFO L124 PetriNetUnfolderBase]: 8/66 cut-off events. [2025-03-17 11:20:30,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:20:30,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:30,650 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] [2025-03-17 11:20:30,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-03-17 11:20:30,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1986710418, now seen corresponding path program 1 times [2025-03-17 11:20:30,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:30,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826764210] [2025-03-17 11:20:30,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:30,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:20:30,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:20:30,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:30,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:30,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826764210] [2025-03-17 11:20:30,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826764210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:30,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:30,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:20:30,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595525621] [2025-03-17 11:20:30,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:30,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:20:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:30,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:20:30,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:20:30,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1125 [2025-03-17 11:20:30,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 986 places, 1125 transitions, 2266 flow. Second operand has 2 states, 2 states have (on average 971.0) internal successors, (1942), 2 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:30,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:30,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1125 [2025-03-17 11:20:30,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:31,246 INFO L124 PetriNetUnfolderBase]: 130/3905 cut-off events. [2025-03-17 11:20:31,246 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-17 11:20:31,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4076 conditions, 3905 events. 130/3905 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 30776 event pairs, 54 based on Foata normal form. 630/4204 useless extension candidates. Maximal degree in co-relation 721. Up to 129 conditions per place. [2025-03-17 11:20:31,295 INFO L140 encePairwiseOnDemand]: 991/1125 looper letters, 18 selfloop transitions, 0 changer transitions 10/951 dead transitions. [2025-03-17 11:20:31,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 951 transitions, 1954 flow [2025-03-17 11:20:31,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:20:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:20:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2092 transitions. [2025-03-17 11:20:31,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9297777777777778 [2025-03-17 11:20:31,299 INFO L175 Difference]: Start difference. First operand has 986 places, 1125 transitions, 2266 flow. Second operand 2 states and 2092 transitions. [2025-03-17 11:20:31,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 951 transitions, 1954 flow [2025-03-17 11:20:31,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 951 transitions, 1954 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:31,308 INFO L231 Difference]: Finished difference. Result has 936 places, 941 transitions, 1898 flow [2025-03-17 11:20:31,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1125, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=951, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1898, PETRI_PLACES=936, PETRI_TRANSITIONS=941} [2025-03-17 11:20:31,310 INFO L279 CegarLoopForPetriNet]: 986 programPoint places, -50 predicate places. [2025-03-17 11:20:31,310 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 941 transitions, 1898 flow [2025-03-17 11:20:31,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 971.0) internal successors, (1942), 2 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:31,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:31,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:31,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:20:31,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-03-17 11:20:31,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:31,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1710603994, now seen corresponding path program 1 times [2025-03-17 11:20:31,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:31,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703470291] [2025-03-17 11:20:31,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:31,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:31,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:20:31,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:20:31,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:31,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:31,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703470291] [2025-03-17 11:20:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703470291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:31,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:20:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872045272] [2025-03-17 11:20:31,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:31,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:20:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:31,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:20:31,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:20:31,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 823 out of 1125 [2025-03-17 11:20:31,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 941 transitions, 1898 flow. Second operand has 6 states, 6 states have (on average 824.3333333333334) internal successors, (4946), 6 states have internal predecessors, (4946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:31,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:31,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 823 of 1125 [2025-03-17 11:20:31,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand