./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/bounded_spsc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93808a150a8803e907bade039c6d51db8f9a81931409074d169ee410e6e3b34e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:38:05,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:38:05,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:38:05,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:38:05,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:38:05,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:38:05,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:38:05,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:38:05,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:38:05,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:38:05,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:38:05,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:38:05,474 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:38:05,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:38:05,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:38:05,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:38:05,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:38:05,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:38:05,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:38:05,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:38:05,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:38:05,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:38:05,475 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:38:05,475 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:38:05,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:38:05,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:38:05,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:38:05,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:38:05,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:38:05,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:38:05,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:38:05,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:38:05,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:38:05,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:38:05,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:38:05,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:38:05,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:38:05,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:38:05,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:38:05,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:38:05,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:38:05,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:38:05,477 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93808a150a8803e907bade039c6d51db8f9a81931409074d169ee410e6e3b34e [2025-02-06 09:38:05,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:38:05,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:38:05,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:38:05,750 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:38:05,750 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:38:05,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_spsc.i [2025-02-06 09:38:06,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a76ca4385/210a0ffda778481abe8ab225c4d78eb5/FLAG910a7e6fb [2025-02-06 09:38:07,328 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:38:07,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_spsc.i [2025-02-06 09:38:07,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a76ca4385/210a0ffda778481abe8ab225c4d78eb5/FLAG910a7e6fb [2025-02-06 09:38:07,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a76ca4385/210a0ffda778481abe8ab225c4d78eb5 [2025-02-06 09:38:07,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:38:07,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:38:07,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:38:07,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:38:07,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:38:07,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:38:07" (1/1) ... [2025-02-06 09:38:07,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c922ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:07, skipping insertion in model container [2025-02-06 09:38:07,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:38:07" (1/1) ... [2025-02-06 09:38:07,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:38:10,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:38:10,759 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:38:10,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4397] [2025-02-06 09:38:10,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4399] [2025-02-06 09:38:10,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4404] [2025-02-06 09:38:10,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4406] [2025-02-06 09:38:10,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4412] [2025-02-06 09:38:10,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-02-06 09:38:10,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4420] [2025-02-06 09:38:10,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4422] [2025-02-06 09:38:10,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4428] [2025-02-06 09:38:10,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4430] [2025-02-06 09:38:10,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4436] [2025-02-06 09:38:10,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4438] [2025-02-06 09:38:10,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-02-06 09:38:10,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4446] [2025-02-06 09:38:10,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4452] [2025-02-06 09:38:10,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4454] [2025-02-06 09:38:10,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4459] [2025-02-06 09:38:10,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4461] [2025-02-06 09:38:10,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4466] [2025-02-06 09:38:10,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4468] [2025-02-06 09:38:10,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-02-06 09:38:10,889 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4475] [2025-02-06 09:38:10,889 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-02-06 09:38:10,889 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4482] [2025-02-06 09:38:10,889 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4487] [2025-02-06 09:38:10,889 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4489] [2025-02-06 09:38:10,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4494] [2025-02-06 09:38:10,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4497] [2025-02-06 09:38:10,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-02-06 09:38:10,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4506] [2025-02-06 09:38:10,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4512] [2025-02-06 09:38:10,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4515] [2025-02-06 09:38:10,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4521] [2025-02-06 09:38:10,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4524] [2025-02-06 09:38:10,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4530] [2025-02-06 09:38:10,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4533] [2025-02-06 09:38:10,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4539] [2025-02-06 09:38:10,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4542] [2025-02-06 09:38:10,894 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-02-06 09:38:10,894 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4552] [2025-02-06 09:38:10,894 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4559] [2025-02-06 09:38:10,895 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4562] [2025-02-06 09:38:10,895 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4569] [2025-02-06 09:38:10,895 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4572] [2025-02-06 09:38:10,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4579] [2025-02-06 09:38:10,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-02-06 09:38:10,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4589] [2025-02-06 09:38:10,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4592] [2025-02-06 09:38:10,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4599] [2025-02-06 09:38:10,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4602] [2025-02-06 09:38:10,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4608] [2025-02-06 09:38:10,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4611] [2025-02-06 09:38:10,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4617] [2025-02-06 09:38:10,899 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4620] [2025-02-06 09:38:10,899 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4626] [2025-02-06 09:38:10,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4629] [2025-02-06 09:38:10,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4635] [2025-02-06 09:38:10,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4638] [2025-02-06 09:38:10,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4644] [2025-02-06 09:38:10,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4647] [2025-02-06 09:38:10,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4653] [2025-02-06 09:38:10,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-02-06 09:38:10,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-02-06 09:38:10,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4665] [2025-02-06 09:38:10,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4671] [2025-02-06 09:38:10,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4674] [2025-02-06 09:38:10,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-02-06 09:38:10,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4683] [2025-02-06 09:38:10,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4689] [2025-02-06 09:38:10,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4692] [2025-02-06 09:38:10,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4698] [2025-02-06 09:38:10,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4701] [2025-02-06 09:38:10,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4707] [2025-02-06 09:38:10,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-02-06 09:38:10,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4716] [2025-02-06 09:38:10,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4719] [2025-02-06 09:38:10,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4725] [2025-02-06 09:38:10,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-02-06 09:38:10,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4734] [2025-02-06 09:38:10,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4737] [2025-02-06 09:38:10,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4743] [2025-02-06 09:38:10,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4745] [2025-02-06 09:38:10,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4751] [2025-02-06 09:38:10,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4753] [2025-02-06 09:38:10,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4759] [2025-02-06 09:38:10,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4761] [2025-02-06 09:38:10,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4767] [2025-02-06 09:38:10,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4769] [2025-02-06 09:38:10,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4775] [2025-02-06 09:38:10,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4777] [2025-02-06 09:38:10,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4783] [2025-02-06 09:38:10,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4785] [2025-02-06 09:38:10,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4791] [2025-02-06 09:38:10,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4793] [2025-02-06 09:38:10,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4799] [2025-02-06 09:38:10,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4801] [2025-02-06 09:38:10,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4807] [2025-02-06 09:38:10,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4809] [2025-02-06 09:38:10,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4815] [2025-02-06 09:38:10,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4817] [2025-02-06 09:38:10,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:38:11,174 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:38:11,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11 WrapperNode [2025-02-06 09:38:11,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:38:11,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:38:11,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:38:11,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:38:11,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,313 INFO L138 Inliner]: procedures = 948, calls = 963, calls flagged for inlining = 823, calls inlined = 39, statements flattened = 571 [2025-02-06 09:38:11,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:38:11,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:38:11,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:38:11,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:38:11,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:38:11,388 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:38:11,388 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:38:11,388 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:38:11,389 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (1/1) ... [2025-02-06 09:38:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:38:11,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:11,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:38:11,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:38:11,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-06 09:38:11,435 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:38:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:38:11,436 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:38:11,578 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:38:11,579 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:38:11,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6110: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-06 09:38:11,863 INFO L1309 $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-02-06 09:38:12,255 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-06 09:38:12,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-9: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-06 09:38:12,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-18: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-06 09:38:12,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 09:38:12,257 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:38:12,257 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:38:12,304 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:38:12,304 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:38:12,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:38:12 BoogieIcfgContainer [2025-02-06 09:38:12,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:38:12,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:38:12,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:38:12,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:38:12,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:38:07" (1/3) ... [2025-02-06 09:38:12,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b2f7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:38:12, skipping insertion in model container [2025-02-06 09:38:12,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:11" (2/3) ... [2025-02-06 09:38:12,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b2f7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:38:12, skipping insertion in model container [2025-02-06 09:38:12,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:38:12" (3/3) ... [2025-02-06 09:38:12,311 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_spsc.i [2025-02-06 09:38:12,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:38:12,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_spsc.i that has 2 procedures, 606 locations, 1 initial locations, 29 loop locations, and 29 error locations. [2025-02-06 09:38:12,323 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:38:12,475 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:38:12,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 609 places, 685 transitions, 1377 flow [2025-02-06 09:38:12,652 INFO L124 PetriNetUnfolderBase]: 79/715 cut-off events. [2025-02-06 09:38:12,654 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:38:12,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 715 events. 79/715 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1897 event pairs, 0 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 523. Up to 3 conditions per place. [2025-02-06 09:38:12,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 609 places, 685 transitions, 1377 flow [2025-02-06 09:38:12,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 609 places, 685 transitions, 1377 flow [2025-02-06 09:38:12,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:38:12,680 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;@758e6660, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:38:12,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-02-06 09:38:12,689 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:38:12,690 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2025-02-06 09:38:12,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:38:12,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:12,690 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-02-06 09:38:12,691 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-02-06 09:38:12,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2097244513, now seen corresponding path program 1 times [2025-02-06 09:38:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:12,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011068575] [2025-02-06 09:38:12,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:12,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 09:38:12,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 09:38:12,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:12,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:12,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:12,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011068575] [2025-02-06 09:38:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011068575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:12,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:12,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916559695] [2025-02-06 09:38:12,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:12,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:38:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:13,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:38:13,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:38:13,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 685 [2025-02-06 09:38:13,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 685 transitions, 1377 flow. Second operand has 2 states, 2 states have (on average 600.0) internal successors, (1200), 2 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:13,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:13,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 685 [2025-02-06 09:38:13,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:13,190 INFO L124 PetriNetUnfolderBase]: 11/617 cut-off events. [2025-02-06 09:38:13,190 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:38:13,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 617 events. 11/617 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1531 event pairs, 0 based on Foata normal form. 66/636 useless extension candidates. Maximal degree in co-relation 453. Up to 11 conditions per place. [2025-02-06 09:38:13,195 INFO L140 encePairwiseOnDemand]: 611/685 looper letters, 10 selfloop transitions, 0 changer transitions 11/587 dead transitions. [2025-02-06 09:38:13,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 587 transitions, 1201 flow [2025-02-06 09:38:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:38:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:38:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1282 transitions. [2025-02-06 09:38:13,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357664233576642 [2025-02-06 09:38:13,213 INFO L175 Difference]: Start difference. First operand has 609 places, 685 transitions, 1377 flow. Second operand 2 states and 1282 transitions. [2025-02-06 09:38:13,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 587 transitions, 1201 flow [2025-02-06 09:38:13,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 587 transitions, 1201 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:13,245 INFO L231 Difference]: Finished difference. Result has 580 places, 576 transitions, 1159 flow [2025-02-06 09:38:13,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1159, PETRI_PLACES=580, PETRI_TRANSITIONS=576} [2025-02-06 09:38:13,261 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -29 predicate places. [2025-02-06 09:38:13,262 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 576 transitions, 1159 flow [2025-02-06 09:38:13,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 600.0) internal successors, (1200), 2 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:13,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:13,263 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] [2025-02-06 09:38:13,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:38:13,263 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-02-06 09:38:13,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:13,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1850348325, now seen corresponding path program 1 times [2025-02-06 09:38:13,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:13,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016942824] [2025-02-06 09:38:13,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:13,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:38:13,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:38:13,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:13,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:13,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:13,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016942824] [2025-02-06 09:38:13,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016942824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:13,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:13,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:38:13,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427963908] [2025-02-06 09:38:13,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:13,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:13,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:13,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:13,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:38:14,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 685 [2025-02-06 09:38:14,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 576 transitions, 1159 flow. Second operand has 6 states, 6 states have (on average 513.3333333333334) internal successors, (3080), 6 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:14,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:14,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 685 [2025-02-06 09:38:14,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:15,322 INFO L124 PetriNetUnfolderBase]: 612/4007 cut-off events. [2025-02-06 09:38:15,322 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:38:15,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5200 conditions, 4007 events. 612/4007 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32399 event pairs, 528 based on Foata normal form. 0/3682 useless extension candidates. Maximal degree in co-relation 5196. Up to 1181 conditions per place. [2025-02-06 09:38:15,335 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 91 selfloop transitions, 5 changer transitions 0/575 dead transitions. [2025-02-06 09:38:15,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 575 transitions, 1349 flow [2025-02-06 09:38:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3169 transitions. [2025-02-06 09:38:15,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7710462287104622 [2025-02-06 09:38:15,342 INFO L175 Difference]: Start difference. First operand has 580 places, 576 transitions, 1159 flow. Second operand 6 states and 3169 transitions. [2025-02-06 09:38:15,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 575 transitions, 1349 flow [2025-02-06 09:38:15,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 575 transitions, 1349 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:15,348 INFO L231 Difference]: Finished difference. Result has 573 places, 575 transitions, 1167 flow [2025-02-06 09:38:15,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1167, PETRI_PLACES=573, PETRI_TRANSITIONS=575} [2025-02-06 09:38:15,350 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -36 predicate places. [2025-02-06 09:38:15,350 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 575 transitions, 1167 flow [2025-02-06 09:38:15,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 513.3333333333334) internal successors, (3080), 6 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:15,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:15,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:15,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:38:15,352 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-02-06 09:38:15,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1953357299, now seen corresponding path program 1 times [2025-02-06 09:38:15,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723480055] [2025-02-06 09:38:15,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:15,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:38:15,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:38:15,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:15,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:15,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:15,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723480055] [2025-02-06 09:38:15,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723480055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:15,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:15,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:38:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324503140] [2025-02-06 09:38:15,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:15,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:15,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:15,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:15,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:38:16,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 685 [2025-02-06 09:38:16,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 575 transitions, 1167 flow. Second operand has 6 states, 6 states have (on average 513.3333333333334) internal successors, (3080), 6 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:16,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:16,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 685 [2025-02-06 09:38:16,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:16,496 INFO L124 PetriNetUnfolderBase]: 612/4006 cut-off events. [2025-02-06 09:38:16,497 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:38:16,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5205 conditions, 4006 events. 612/4006 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32410 event pairs, 528 based on Foata normal form. 0/3682 useless extension candidates. Maximal degree in co-relation 5200. Up to 1181 conditions per place. [2025-02-06 09:38:16,514 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 91 selfloop transitions, 5 changer transitions 0/574 dead transitions. [2025-02-06 09:38:16,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 574 transitions, 1357 flow [2025-02-06 09:38:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3169 transitions. [2025-02-06 09:38:16,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7710462287104622 [2025-02-06 09:38:16,520 INFO L175 Difference]: Start difference. First operand has 573 places, 575 transitions, 1167 flow. Second operand 6 states and 3169 transitions. [2025-02-06 09:38:16,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 574 transitions, 1357 flow [2025-02-06 09:38:16,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 574 transitions, 1347 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:38:16,528 INFO L231 Difference]: Finished difference. Result has 572 places, 574 transitions, 1165 flow [2025-02-06 09:38:16,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1165, PETRI_PLACES=572, PETRI_TRANSITIONS=574} [2025-02-06 09:38:16,529 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -37 predicate places. [2025-02-06 09:38:16,529 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 574 transitions, 1165 flow [2025-02-06 09:38:16,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 513.3333333333334) internal successors, (3080), 6 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:16,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:16,531 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] [2025-02-06 09:38:16,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:38:16,531 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-02-06 09:38:16,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash 71398287, now seen corresponding path program 1 times [2025-02-06 09:38:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:16,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433387064] [2025-02-06 09:38:16,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:16,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:38:16,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:38:16,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:16,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:17,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:17,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433387064] [2025-02-06 09:38:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433387064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:38:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328336175] [2025-02-06 09:38:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:17,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:17,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:17,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:38:17,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 685 [2025-02-06 09:38:17,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 574 transitions, 1165 flow. Second operand has 6 states, 6 states have (on average 507.1666666666667) internal successors, (3043), 6 states have internal predecessors, (3043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:17,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:17,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 685 [2025-02-06 09:38:17,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:18,532 INFO L124 PetriNetUnfolderBase]: 687/4432 cut-off events. [2025-02-06 09:38:18,533 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 09:38:18,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5775 conditions, 4432 events. 687/4432 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 37900 event pairs, 594 based on Foata normal form. 0/4073 useless extension candidates. Maximal degree in co-relation 5770. Up to 1325 conditions per place. [2025-02-06 09:38:18,551 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 99 selfloop transitions, 5 changer transitions 0/573 dead transitions. [2025-02-06 09:38:18,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 573 transitions, 1371 flow [2025-02-06 09:38:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3129 transitions. [2025-02-06 09:38:18,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7613138686131387 [2025-02-06 09:38:18,557 INFO L175 Difference]: Start difference. First operand has 572 places, 574 transitions, 1165 flow. Second operand 6 states and 3129 transitions. [2025-02-06 09:38:18,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 573 transitions, 1371 flow [2025-02-06 09:38:18,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 573 transitions, 1361 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:38:18,563 INFO L231 Difference]: Finished difference. Result has 571 places, 573 transitions, 1163 flow [2025-02-06 09:38:18,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=571, PETRI_TRANSITIONS=573} [2025-02-06 09:38:18,565 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -38 predicate places. [2025-02-06 09:38:18,565 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 573 transitions, 1163 flow [2025-02-06 09:38:18,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 507.1666666666667) internal successors, (3043), 6 states have internal predecessors, (3043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:18,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:18,567 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] [2025-02-06 09:38:18,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:38:18,567 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-02-06 09:38:18,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:18,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1385232279, now seen corresponding path program 1 times [2025-02-06 09:38:18,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:18,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725669072] [2025-02-06 09:38:18,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:18,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 09:38:18,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 09:38:18,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:18,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:38:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725669072] [2025-02-06 09:38:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725669072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:18,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:18,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:38:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803313322] [2025-02-06 09:38:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:18,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:18,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:18,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:18,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 685 [2025-02-06 09:38:18,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 573 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 595.0) internal successors, (1785), 3 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:18,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:18,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 685 [2025-02-06 09:38:18,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:18,754 INFO L124 PetriNetUnfolderBase]: 17/643 cut-off events. [2025-02-06 09:38:18,754 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:38:18,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 643 events. 17/643 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1748 event pairs, 6 based on Foata normal form. 1/597 useless extension candidates. Maximal degree in co-relation 686. Up to 30 conditions per place. [2025-02-06 09:38:18,757 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 15 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2025-02-06 09:38:18,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 574 transitions, 1199 flow [2025-02-06 09:38:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1797 transitions. [2025-02-06 09:38:18,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8744525547445255 [2025-02-06 09:38:18,760 INFO L175 Difference]: Start difference. First operand has 571 places, 573 transitions, 1163 flow. Second operand 3 states and 1797 transitions. [2025-02-06 09:38:18,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 574 transitions, 1199 flow [2025-02-06 09:38:18,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 574 transitions, 1189 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:38:18,769 INFO L231 Difference]: Finished difference. Result has 569 places, 574 transitions, 1165 flow [2025-02-06 09:38:18,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1165, PETRI_PLACES=569, PETRI_TRANSITIONS=574} [2025-02-06 09:38:18,771 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -40 predicate places. [2025-02-06 09:38:18,771 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 574 transitions, 1165 flow [2025-02-06 09:38:18,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.0) internal successors, (1785), 3 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:18,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:18,772 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] [2025-02-06 09:38:18,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:38:18,772 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-02-06 09:38:18,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1751571256, now seen corresponding path program 1 times [2025-02-06 09:38:18,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:18,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567676603] [2025-02-06 09:38:18,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:18,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 09:38:18,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 09:38:18,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:18,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:38:19,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567676603] [2025-02-06 09:38:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567676603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:19,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:19,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:38:19,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748635976] [2025-02-06 09:38:19,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:19,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:19,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:19,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:19,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:38:20,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 685 [2025-02-06 09:38:20,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 574 transitions, 1165 flow. Second operand has 6 states, 6 states have (on average 557.8333333333334) internal successors, (3347), 6 states have internal predecessors, (3347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:20,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:20,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 685 [2025-02-06 09:38:20,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:20,728 INFO L124 PetriNetUnfolderBase]: 161/2417 cut-off events. [2025-02-06 09:38:20,728 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:38:20,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 2417 events. 161/2417 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 15806 event pairs, 110 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 2725. Up to 291 conditions per place. [2025-02-06 09:38:20,739 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 49 selfloop transitions, 6 changer transitions 0/573 dead transitions. [2025-02-06 09:38:20,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 573 transitions, 1273 flow [2025-02-06 09:38:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3379 transitions. [2025-02-06 09:38:20,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8221411192214112 [2025-02-06 09:38:20,745 INFO L175 Difference]: Start difference. First operand has 569 places, 574 transitions, 1165 flow. Second operand 6 states and 3379 transitions. [2025-02-06 09:38:20,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 573 transitions, 1273 flow [2025-02-06 09:38:20,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 573 transitions, 1271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:38:20,752 INFO L231 Difference]: Finished difference. Result has 572 places, 573 transitions, 1173 flow [2025-02-06 09:38:20,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1173, PETRI_PLACES=572, PETRI_TRANSITIONS=573} [2025-02-06 09:38:20,753 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -37 predicate places. [2025-02-06 09:38:20,754 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 573 transitions, 1173 flow [2025-02-06 09:38:20,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 557.8333333333334) internal successors, (3347), 6 states have internal predecessors, (3347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:20,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:20,756 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] [2025-02-06 09:38:20,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:38:20,756 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-02-06 09:38:20,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash 227514154, now seen corresponding path program 1 times [2025-02-06 09:38:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:20,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604469156] [2025-02-06 09:38:20,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:20,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:38:20,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:38:20,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:20,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:38:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604469156] [2025-02-06 09:38:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604469156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113446421] [2025-02-06 09:38:20,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:20,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:20,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:20,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:20,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:38:21,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:38:21,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:38:21,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:21,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:21,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 09:38:21,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:21,148 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-02-06 09:38:21,158 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-02-06 09:38:21,164 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-02-06 09:38:21,194 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-02-06 09:38:21,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:21,202 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-02-06 09:38:21,250 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:21,251 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 94 treesize of output 27 [2025-02-06 09:38:21,301 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-02-06 09:38:21,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:21,307 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-02-06 09:38:21,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 21 [2025-02-06 09:38:21,434 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-02-06 09:38:21,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:21,441 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-02-06 09:38:21,535 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:21,536 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:21,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 78 [2025-02-06 09:38:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 09:38:21,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:38:21,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113446421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:21,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:38:21,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-06 09:38:21,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154285011] [2025-02-06 09:38:21,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:21,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:21,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:21,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:21,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:38:22,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 685 [2025-02-06 09:38:22,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 573 transitions, 1173 flow. Second operand has 6 states, 6 states have (on average 508.5) internal successors, (3051), 6 states have internal predecessors, (3051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:22,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:22,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 685 [2025-02-06 09:38:22,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:24,044 INFO L124 PetriNetUnfolderBase]: 1495/8490 cut-off events. [2025-02-06 09:38:24,044 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:38:24,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11408 conditions, 8490 events. 1495/8490 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 81053 event pairs, 658 based on Foata normal form. 0/7799 useless extension candidates. Maximal degree in co-relation 11402. Up to 2488 conditions per place. [2025-02-06 09:38:24,084 INFO L140 encePairwiseOnDemand]: 612/685 looper letters, 104 selfloop transitions, 270 changer transitions 0/842 dead transitions. [2025-02-06 09:38:24,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 842 transitions, 2459 flow [2025-02-06 09:38:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3399 transitions. [2025-02-06 09:38:24,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.827007299270073 [2025-02-06 09:38:24,091 INFO L175 Difference]: Start difference. First operand has 572 places, 573 transitions, 1173 flow. Second operand 6 states and 3399 transitions. [2025-02-06 09:38:24,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 842 transitions, 2459 flow [2025-02-06 09:38:24,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 842 transitions, 2447 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:38:24,103 INFO L231 Difference]: Finished difference. Result has 577 places, 842 transitions, 2923 flow [2025-02-06 09:38:24,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2923, PETRI_PLACES=577, PETRI_TRANSITIONS=842} [2025-02-06 09:38:24,104 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -32 predicate places. [2025-02-06 09:38:24,104 INFO L471 AbstractCegarLoop]: Abstraction has has 577 places, 842 transitions, 2923 flow [2025-02-06 09:38:24,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 508.5) internal successors, (3051), 6 states have internal predecessors, (3051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:24,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:24,106 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] [2025-02-06 09:38:24,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:38:24,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:24,307 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-02-06 09:38:24,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:24,308 INFO L85 PathProgramCache]: Analyzing trace with hash 935053389, now seen corresponding path program 1 times [2025-02-06 09:38:24,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:24,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495669993] [2025-02-06 09:38:24,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:24,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:24,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:38:24,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:38:24,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:24,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:38:24,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:24,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495669993] [2025-02-06 09:38:24,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495669993] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:24,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312913498] [2025-02-06 09:38:24,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:24,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:24,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:24,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:24,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:38:24,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:38:24,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:38:24,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:24,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:24,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:38:24,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 09:38:24,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:38:24,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312913498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:24,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:38:24,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-06 09:38:24,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099540271] [2025-02-06 09:38:24,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:24,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:24,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:24,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:24,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:38:24,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 685 [2025-02-06 09:38:24,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 842 transitions, 2923 flow. Second operand has 3 states, 3 states have (on average 595.0) internal successors, (1785), 3 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:24,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:24,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 685 [2025-02-06 09:38:24,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:25,075 INFO L124 PetriNetUnfolderBase]: 593/4408 cut-off events. [2025-02-06 09:38:25,075 INFO L125 PetriNetUnfolderBase]: For 574/819 co-relation queries the response was YES. [2025-02-06 09:38:25,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6656 conditions, 4408 events. 593/4408 cut-off events. For 574/819 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 37170 event pairs, 9 based on Foata normal form. 16/4144 useless extension candidates. Maximal degree in co-relation 6646. Up to 868 conditions per place. [2025-02-06 09:38:25,094 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 45 selfloop transitions, 2 changer transitions 0/849 dead transitions. [2025-02-06 09:38:25,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 849 transitions, 3047 flow [2025-02-06 09:38:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2025-02-06 09:38:25,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8768856447688564 [2025-02-06 09:38:25,097 INFO L175 Difference]: Start difference. First operand has 577 places, 842 transitions, 2923 flow. Second operand 3 states and 1802 transitions. [2025-02-06 09:38:25,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 849 transitions, 3047 flow [2025-02-06 09:38:25,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 849 transitions, 3047 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:25,118 INFO L231 Difference]: Finished difference. Result has 580 places, 842 transitions, 2931 flow [2025-02-06 09:38:25,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=2923, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=840, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2931, PETRI_PLACES=580, PETRI_TRANSITIONS=842} [2025-02-06 09:38:25,120 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -29 predicate places. [2025-02-06 09:38:25,121 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 842 transitions, 2931 flow [2025-02-06 09:38:25,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.0) internal successors, (1785), 3 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:25,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:25,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:25,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 09:38:25,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:25,327 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-02-06 09:38:25,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:25,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1350504079, now seen corresponding path program 1 times [2025-02-06 09:38:25,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:25,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80712940] [2025-02-06 09:38:25,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:25,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:25,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 09:38:25,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 09:38:25,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:25,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:38:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80712940] [2025-02-06 09:38:25,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80712940] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092111492] [2025-02-06 09:38:25,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:25,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:25,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:25,525 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:25,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:38:25,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 09:38:25,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 09:38:25,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:25,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:25,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 09:38:25,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:25,705 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-02-06 09:38:25,708 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-02-06 09:38:25,719 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-02-06 09:38:25,745 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-02-06 09:38:25,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:25,750 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-02-06 09:38:25,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:25,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 34 [2025-02-06 09:38:25,841 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-02-06 09:38:25,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:25,848 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-02-06 09:38:25,899 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:25,902 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:25,903 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:25,904 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 110 treesize of output 57 [2025-02-06 09:38:25,971 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-02-06 09:38:25,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:25,979 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-02-06 09:38:26,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 69 [2025-02-06 09:38:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 09:38:26,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:38:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092111492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:38:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-06 09:38:26,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753054247] [2025-02-06 09:38:26,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:26,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:26,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:26,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:38:27,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 685 [2025-02-06 09:38:27,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 842 transitions, 2931 flow. Second operand has 6 states, 6 states have (on average 561.3333333333334) internal successors, (3368), 6 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:27,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:27,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 685 [2025-02-06 09:38:27,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:27,668 INFO L124 PetriNetUnfolderBase]: 663/4219 cut-off events. [2025-02-06 09:38:27,669 INFO L125 PetriNetUnfolderBase]: For 940/1244 co-relation queries the response was YES. [2025-02-06 09:38:27,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7320 conditions, 4219 events. 663/4219 cut-off events. For 940/1244 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 34192 event pairs, 15 based on Foata normal form. 5/3983 useless extension candidates. Maximal degree in co-relation 7308. Up to 833 conditions per place. [2025-02-06 09:38:27,681 INFO L140 encePairwiseOnDemand]: 674/685 looper letters, 154 selfloop transitions, 36 changer transitions 0/873 dead transitions. [2025-02-06 09:38:27,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 873 transitions, 3461 flow [2025-02-06 09:38:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3416 transitions. [2025-02-06 09:38:27,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8311435523114356 [2025-02-06 09:38:27,686 INFO L175 Difference]: Start difference. First operand has 580 places, 842 transitions, 2931 flow. Second operand 6 states and 3416 transitions. [2025-02-06 09:38:27,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 873 transitions, 3461 flow [2025-02-06 09:38:27,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 873 transitions, 3457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:38:27,702 INFO L231 Difference]: Finished difference. Result has 588 places, 873 transitions, 3261 flow [2025-02-06 09:38:27,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=2927, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3261, PETRI_PLACES=588, PETRI_TRANSITIONS=873} [2025-02-06 09:38:27,703 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -21 predicate places. [2025-02-06 09:38:27,703 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 873 transitions, 3261 flow [2025-02-06 09:38:27,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 561.3333333333334) internal successors, (3368), 6 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:27,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:27,705 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:27,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 09:38:27,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:27,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-06 09:38:27,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash 957484159, now seen corresponding path program 1 times [2025-02-06 09:38:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:27,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563136674] [2025-02-06 09:38:27,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:27,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 09:38:27,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 09:38:27,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:27,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:38:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563136674] [2025-02-06 09:38:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563136674] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175063930] [2025-02-06 09:38:28,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:28,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:28,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:28,057 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:28,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:38:28,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 09:38:28,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 09:38:28,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:28,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:28,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 09:38:28,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:28,213 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-02-06 09:38:28,216 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-02-06 09:38:28,233 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-02-06 09:38:28,254 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-02-06 09:38:28,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:28,257 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-02-06 09:38:28,277 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:28,279 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:28,279 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 76 treesize of output 30 [2025-02-06 09:38:28,328 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-02-06 09:38:28,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:28,333 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-02-06 09:38:28,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:28,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 51 [2025-02-06 09:38:28,425 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-02-06 09:38:28,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:28,430 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-02-06 09:38:28,480 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:28,483 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:28,484 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:28,488 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 09:38:28,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 84 [2025-02-06 09:38:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 09:38:28,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:38:28,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175063930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:38:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-06 09:38:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762673253] [2025-02-06 09:38:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:28,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:28,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:28,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:38:29,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 685 [2025-02-06 09:38:29,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 873 transitions, 3261 flow. Second operand has 6 states, 6 states have (on average 558.5) internal successors, (3351), 6 states have internal predecessors, (3351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:29,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:29,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 685 [2025-02-06 09:38:29,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:30,553 INFO L124 PetriNetUnfolderBase]: 1032/8003 cut-off events. [2025-02-06 09:38:30,553 INFO L125 PetriNetUnfolderBase]: For 2753/3581 co-relation queries the response was YES. [2025-02-06 09:38:30,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13075 conditions, 8003 events. 1032/8003 cut-off events. For 2753/3581 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 74440 event pairs, 95 based on Foata normal form. 169/7630 useless extension candidates. Maximal degree in co-relation 13059. Up to 1537 conditions per place. [2025-02-06 09:38:30,600 INFO L140 encePairwiseOnDemand]: 660/685 looper letters, 183 selfloop transitions, 77 changer transitions 7/967 dead transitions. [2025-02-06 09:38:30,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 967 transitions, 4172 flow [2025-02-06 09:38:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3474 transitions. [2025-02-06 09:38:30,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8452554744525548 [2025-02-06 09:38:30,616 INFO L175 Difference]: Start difference. First operand has 588 places, 873 transitions, 3261 flow. Second operand 6 states and 3474 transitions. [2025-02-06 09:38:30,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 967 transitions, 4172 flow [2025-02-06 09:38:30,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 967 transitions, 4154 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:30,665 INFO L231 Difference]: Finished difference. Result has 598 places, 944 transitions, 3896 flow [2025-02-06 09:38:30,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=3243, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=850, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3896, PETRI_PLACES=598, PETRI_TRANSITIONS=944} [2025-02-06 09:38:30,669 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -11 predicate places. [2025-02-06 09:38:30,669 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 944 transitions, 3896 flow [2025-02-06 09:38:30,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 558.5) internal successors, (3351), 6 states have internal predecessors, (3351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:30,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:30,674 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, 1, 1] [2025-02-06 09:38:30,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 09:38:30,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 09:38:30,875 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-02-06 09:38:30,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash -841639985, now seen corresponding path program 1 times [2025-02-06 09:38:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856417370] [2025-02-06 09:38:30,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:30,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:30,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 09:38:30,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 09:38:30,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:30,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:38:31,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856417370] [2025-02-06 09:38:31,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856417370] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367126584] [2025-02-06 09:38:31,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:31,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:31,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:31,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:31,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 09:38:31,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 09:38:31,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 09:38:31,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:31,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:31,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 09:38:31,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:38:31,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:38:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:38:31,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367126584] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:38:31,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:38:31,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 09:38:31,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804822301] [2025-02-06 09:38:31,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:38:31,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:38:31,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:31,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:38:31,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:38:31,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 685 [2025-02-06 09:38:31,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 944 transitions, 3896 flow. Second operand has 9 states, 9 states have (on average 592.2222222222222) internal successors, (5330), 9 states have internal predecessors, (5330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:31,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:31,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 685 [2025-02-06 09:38:31,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:32,378 INFO L124 PetriNetUnfolderBase]: 828/6457 cut-off events. [2025-02-06 09:38:32,379 INFO L125 PetriNetUnfolderBase]: For 1667/1822 co-relation queries the response was YES. [2025-02-06 09:38:32,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10560 conditions, 6457 events. 828/6457 cut-off events. For 1667/1822 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 56656 event pairs, 9 based on Foata normal form. 3/6085 useless extension candidates. Maximal degree in co-relation 10539. Up to 1259 conditions per place. [2025-02-06 09:38:32,407 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 50 selfloop transitions, 9 changer transitions 0/952 dead transitions. [2025-02-06 09:38:32,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 952 transitions, 4032 flow [2025-02-06 09:38:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:38:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:38:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 5339 transitions. [2025-02-06 09:38:32,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8660178426601784 [2025-02-06 09:38:32,413 INFO L175 Difference]: Start difference. First operand has 598 places, 944 transitions, 3896 flow. Second operand 9 states and 5339 transitions. [2025-02-06 09:38:32,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 952 transitions, 4032 flow [2025-02-06 09:38:32,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 952 transitions, 4032 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:32,436 INFO L231 Difference]: Finished difference. Result has 605 places, 950 transitions, 3946 flow [2025-02-06 09:38:32,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=3896, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=938, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3946, PETRI_PLACES=605, PETRI_TRANSITIONS=950} [2025-02-06 09:38:32,437 INFO L279 CegarLoopForPetriNet]: 609 programPoint places, -4 predicate places. [2025-02-06 09:38:32,438 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 950 transitions, 3946 flow [2025-02-06 09:38:32,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 592.2222222222222) internal successors, (5330), 9 states have internal predecessors, (5330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:32,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:32,444 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, 1, 1] [2025-02-06 09:38:32,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 09:38:32,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 09:38:32,645 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-06 09:38:32,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash -561170251, now seen corresponding path program 2 times [2025-02-06 09:38:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:32,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657863017] [2025-02-06 09:38:32,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:38:32,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:32,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 190 statements into 2 equivalence classes. [2025-02-06 09:38:32,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 09:38:32,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:38:32,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:38:32,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:38:32,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 09:38:32,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 09:38:32,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:32,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:38:32,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:38:32,826 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:38:32,827 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2025-02-06 09:38:32,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-02-06 09:38:32,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-02-06 09:38:32,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-02-06 09:38:32,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-02-06 09:38:32,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-02-06 09:38:32,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-02-06 09:38:32,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-02-06 09:38:32,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-02-06 09:38:32,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-02-06 09:38:32,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-02-06 09:38:32,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-02-06 09:38:32,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:38:32,832 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:32,834 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:38:32,834 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:38:32,938 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:38:32,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1035 places, 1174 transitions, 2364 flow [2025-02-06 09:38:33,242 INFO L124 PetriNetUnfolderBase]: 145/1266 cut-off events. [2025-02-06 09:38:33,243 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:38:33,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 1266 events. 145/1266 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5204 event pairs, 0 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 1032. Up to 6 conditions per place. [2025-02-06 09:38:33,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 1035 places, 1174 transitions, 2364 flow [2025-02-06 09:38:33,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1035 places, 1174 transitions, 2364 flow [2025-02-06 09:38:33,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:38:33,289 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;@758e6660, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:38:33,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-02-06 09:38:33,292 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:38:33,292 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2025-02-06 09:38:33,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:38:33,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:33,293 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-02-06 09:38:33,293 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-02-06 09:38:33,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash 13424095, now seen corresponding path program 1 times [2025-02-06 09:38:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:33,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470998342] [2025-02-06 09:38:33,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:33,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 09:38:33,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 09:38:33,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:33,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:33,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470998342] [2025-02-06 09:38:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470998342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:33,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:33,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:33,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536712205] [2025-02-06 09:38:33,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:33,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:38:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:33,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:38:33,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:38:33,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1019 out of 1174 [2025-02-06 09:38:33,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1035 places, 1174 transitions, 2364 flow. Second operand has 2 states, 2 states have (on average 1020.0) internal successors, (2040), 2 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:33,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:33,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1019 of 1174 [2025-02-06 09:38:33,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:34,018 INFO L124 PetriNetUnfolderBase]: 130/4092 cut-off events. [2025-02-06 09:38:34,018 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-06 09:38:34,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4263 conditions, 4092 events. 130/4092 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 32403 event pairs, 54 based on Foata normal form. 819/4580 useless extension candidates. Maximal degree in co-relation 752. Up to 129 conditions per place. [2025-02-06 09:38:34,052 INFO L140 encePairwiseOnDemand]: 1040/1174 looper letters, 18 selfloop transitions, 0 changer transitions 11/1000 dead transitions. [2025-02-06 09:38:34,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 1000 transitions, 2052 flow [2025-02-06 09:38:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:38:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:38:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2190 transitions. [2025-02-06 09:38:34,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9327086882453152 [2025-02-06 09:38:34,055 INFO L175 Difference]: Start difference. First operand has 1035 places, 1174 transitions, 2364 flow. Second operand 2 states and 2190 transitions. [2025-02-06 09:38:34,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 1000 transitions, 2052 flow [2025-02-06 09:38:34,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 985 places, 1000 transitions, 2052 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:34,065 INFO L231 Difference]: Finished difference. Result has 985 places, 989 transitions, 1994 flow [2025-02-06 09:38:34,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1174, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1994, PETRI_PLACES=985, PETRI_TRANSITIONS=989} [2025-02-06 09:38:34,066 INFO L279 CegarLoopForPetriNet]: 1035 programPoint places, -50 predicate places. [2025-02-06 09:38:34,066 INFO L471 AbstractCegarLoop]: Abstraction has has 985 places, 989 transitions, 1994 flow [2025-02-06 09:38:34,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1020.0) internal successors, (2040), 2 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:34,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:34,068 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] [2025-02-06 09:38:34,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:38:34,068 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-02-06 09:38:34,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash -762435611, now seen corresponding path program 1 times [2025-02-06 09:38:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353337945] [2025-02-06 09:38:34,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:34,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:38:34,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:38:34,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:34,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:34,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:34,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353337945] [2025-02-06 09:38:34,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353337945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:34,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:34,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:38:34,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782519560] [2025-02-06 09:38:34,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:34,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:34,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:34,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:34,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:38:34,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 872 out of 1174 [2025-02-06 09:38:34,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 985 places, 989 transitions, 1994 flow. Second operand has 6 states, 6 states have (on average 873.3333333333334) internal successors, (5240), 6 states have internal predecessors, (5240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:34,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:34,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 872 of 1174 [2025-02-06 09:38:34,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand