./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 551b0097 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-?-551b009-m [2025-01-09 21:39:41,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:39:41,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:39:41,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:39:41,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:39:41,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:39:41,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:39:41,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:39:41,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:39:41,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:39:41,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:39:41,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:39:41,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:39:41,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:39:41,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:41,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:41,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:39:41,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:39:41,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:39:41,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:39:41,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:39:41,090 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-01-09 21:39:41,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:39:41,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:39:41,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:39:41,353 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:39:41,353 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:39:41,355 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-01-09 21:39:42,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43f14c51a/996715c758d44b139e15102056675910/FLAG108b81503 [2025-01-09 21:39:43,053 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:39:43,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_spsc.i [2025-01-09 21:39:43,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43f14c51a/996715c758d44b139e15102056675910/FLAG108b81503 [2025-01-09 21:39:43,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43f14c51a/996715c758d44b139e15102056675910 [2025-01-09 21:39:43,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:39:43,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:39:43,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:43,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:39:43,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:39:43,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:43" (1/1) ... [2025-01-09 21:39:43,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c36648a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:43, skipping insertion in model container [2025-01-09 21:39:43,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:43" (1/1) ... [2025-01-09 21:39:43,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:39:45,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:45,377 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:39:45,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4397] [2025-01-09 21:39:45,442 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4399] [2025-01-09 21:39:45,442 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4404] [2025-01-09 21:39:45,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4406] [2025-01-09 21:39:45,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4412] [2025-01-09 21:39:45,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-01-09 21:39:45,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4420] [2025-01-09 21:39:45,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4422] [2025-01-09 21:39:45,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4428] [2025-01-09 21:39:45,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4430] [2025-01-09 21:39:45,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4436] [2025-01-09 21:39:45,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4438] [2025-01-09 21:39:45,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-01-09 21:39:45,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4446] [2025-01-09 21:39:45,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4452] [2025-01-09 21:39:45,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4454] [2025-01-09 21:39:45,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4459] [2025-01-09 21:39:45,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4461] [2025-01-09 21:39:45,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4466] [2025-01-09 21:39:45,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4468] [2025-01-09 21:39:45,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-01-09 21:39:45,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4475] [2025-01-09 21:39:45,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-01-09 21:39:45,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4482] [2025-01-09 21:39:45,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4487] [2025-01-09 21:39:45,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4489] [2025-01-09 21:39:45,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4494] [2025-01-09 21:39:45,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4497] [2025-01-09 21:39:45,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-01-09 21:39:45,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4506] [2025-01-09 21:39:45,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4512] [2025-01-09 21:39:45,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4515] [2025-01-09 21:39:45,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4521] [2025-01-09 21:39:45,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4524] [2025-01-09 21:39:45,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4530] [2025-01-09 21:39:45,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4533] [2025-01-09 21:39:45,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4539] [2025-01-09 21:39:45,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4542] [2025-01-09 21:39:45,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-01-09 21:39:45,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4552] [2025-01-09 21:39:45,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4559] [2025-01-09 21:39:45,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4562] [2025-01-09 21:39:45,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4569] [2025-01-09 21:39:45,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4572] [2025-01-09 21:39:45,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4579] [2025-01-09 21:39:45,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-01-09 21:39:45,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4589] [2025-01-09 21:39:45,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4592] [2025-01-09 21:39:45,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4599] [2025-01-09 21:39:45,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4602] [2025-01-09 21:39:45,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4608] [2025-01-09 21:39:45,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4611] [2025-01-09 21:39:45,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4617] [2025-01-09 21:39:45,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4620] [2025-01-09 21:39:45,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4626] [2025-01-09 21:39:45,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4629] [2025-01-09 21:39:45,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4635] [2025-01-09 21:39:45,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4638] [2025-01-09 21:39:45,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4644] [2025-01-09 21:39:45,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4647] [2025-01-09 21:39:45,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4653] [2025-01-09 21:39:45,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-01-09 21:39:45,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-01-09 21:39:45,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4665] [2025-01-09 21:39:45,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4671] [2025-01-09 21:39:45,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4674] [2025-01-09 21:39:45,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-01-09 21:39:45,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4683] [2025-01-09 21:39:45,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4689] [2025-01-09 21:39:45,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4692] [2025-01-09 21:39:45,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4698] [2025-01-09 21:39:45,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4701] [2025-01-09 21:39:45,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4707] [2025-01-09 21:39:45,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-01-09 21:39:45,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4716] [2025-01-09 21:39:45,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4719] [2025-01-09 21:39:45,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4725] [2025-01-09 21:39:45,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-01-09 21:39:45,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4734] [2025-01-09 21:39:45,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4737] [2025-01-09 21:39:45,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4743] [2025-01-09 21:39:45,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4745] [2025-01-09 21:39:45,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4751] [2025-01-09 21:39:45,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4753] [2025-01-09 21:39:45,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4759] [2025-01-09 21:39:45,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4761] [2025-01-09 21:39:45,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4767] [2025-01-09 21:39:45,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4769] [2025-01-09 21:39:45,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4775] [2025-01-09 21:39:45,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4777] [2025-01-09 21:39:45,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4783] [2025-01-09 21:39:45,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4785] [2025-01-09 21:39:45,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4791] [2025-01-09 21:39:45,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4793] [2025-01-09 21:39:45,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4799] [2025-01-09 21:39:45,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4801] [2025-01-09 21:39:45,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4807] [2025-01-09 21:39:45,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4809] [2025-01-09 21:39:45,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4815] [2025-01-09 21:39:45,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4817] [2025-01-09 21:39:45,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:45,741 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:39:45,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45 WrapperNode [2025-01-09 21:39:45,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:45,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:45,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:39:45,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:39:45,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,831 INFO L138 Inliner]: procedures = 948, calls = 963, calls flagged for inlining = 823, calls inlined = 39, statements flattened = 571 [2025-01-09 21:39:45,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:45,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:39:45,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:39:45,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:39:45,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,871 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:39:45,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:39:45,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:39:45,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:39:45,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (1/1) ... [2025-01-09 21:39:45,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:45,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:39:45,925 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-01-09 21:39:45,927 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-01-09 21:39:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:39:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:39:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:39:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:39:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:39:45,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:39:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-01-09 21:39:45,952 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-01-09 21:39:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:39:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:39:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:39:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:39:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:39:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:39:45,954 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:39:46,075 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:39:46,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:39:46,792 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:39:46,792 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:39:46,863 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:39:46,866 INFO L312 CfgBuilder]: Removed 26 assume(true) statements. [2025-01-09 21:39:46,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:46 BoogieIcfgContainer [2025-01-09 21:39:46,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:39:46,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:39:46,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:39:46,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:39:46,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:43" (1/3) ... [2025-01-09 21:39:46,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9067bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:46, skipping insertion in model container [2025-01-09 21:39:46,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:45" (2/3) ... [2025-01-09 21:39:46,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9067bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:46, skipping insertion in model container [2025-01-09 21:39:46,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:46" (3/3) ... [2025-01-09 21:39:46,874 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_spsc.i [2025-01-09 21:39:46,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:39:46,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_spsc.i that has 2 procedures, 592 locations, 1 initial locations, 29 loop locations, and 29 error locations. [2025-01-09 21:39:46,888 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:39:47,079 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:39:47,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 595 places, 671 transitions, 1349 flow [2025-01-09 21:39:47,323 INFO L124 PetriNetUnfolderBase]: 79/701 cut-off events. [2025-01-09 21:39:47,324 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:39:47,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 701 events. 79/701 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1790 event pairs, 0 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 512. Up to 3 conditions per place. [2025-01-09 21:39:47,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 595 places, 671 transitions, 1349 flow [2025-01-09 21:39:47,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 595 places, 671 transitions, 1349 flow [2025-01-09 21:39:47,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:47,370 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;@635fdf2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:47,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-01-09 21:39:47,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:47,380 INFO L124 PetriNetUnfolderBase]: 8/65 cut-off events. [2025-01-09 21:39:47,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:47,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:47,381 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-01-09 21:39:47,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:39:47,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 622170948, now seen corresponding path program 1 times [2025-01-09 21:39:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:47,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980662048] [2025-01-09 21:39:47,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:47,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:39:47,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:39:47,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:47,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:47,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:47,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980662048] [2025-01-09 21:39:47,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980662048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:47,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:47,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:47,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001358437] [2025-01-09 21:39:47,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:47,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:39:47,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:47,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:39:47,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:39:47,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 671 [2025-01-09 21:39:47,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 671 transitions, 1349 flow. Second operand has 2 states, 2 states have (on average 586.0) internal successors, (1172), 2 states have internal predecessors, (1172), 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-01-09 21:39:47,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:47,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 671 [2025-01-09 21:39:47,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:47,725 INFO L124 PetriNetUnfolderBase]: 11/603 cut-off events. [2025-01-09 21:39:47,725 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:39:47,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 603 events. 11/603 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1495 event pairs, 0 based on Foata normal form. 60/616 useless extension candidates. Maximal degree in co-relation 442. Up to 11 conditions per place. [2025-01-09 21:39:47,729 INFO L140 encePairwiseOnDemand]: 597/671 looper letters, 10 selfloop transitions, 0 changer transitions 10/573 dead transitions. [2025-01-09 21:39:47,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 573 transitions, 1173 flow [2025-01-09 21:39:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:39:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:39:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1254 transitions. [2025-01-09 21:39:47,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344262295081968 [2025-01-09 21:39:47,748 INFO L175 Difference]: Start difference. First operand has 595 places, 671 transitions, 1349 flow. Second operand 2 states and 1254 transitions. [2025-01-09 21:39:47,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 573 transitions, 1173 flow [2025-01-09 21:39:47,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 573 transitions, 1173 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:47,798 INFO L231 Difference]: Finished difference. Result has 566 places, 563 transitions, 1133 flow [2025-01-09 21:39:47,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=671, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1133, PETRI_PLACES=566, PETRI_TRANSITIONS=563} [2025-01-09 21:39:47,806 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -29 predicate places. [2025-01-09 21:39:47,807 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 563 transitions, 1133 flow [2025-01-09 21:39:47,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 586.0) internal successors, (1172), 2 states have internal predecessors, (1172), 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-01-09 21:39:47,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:47,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:47,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:39:47,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:39:47,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash 583200685, now seen corresponding path program 1 times [2025-01-09 21:39:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:47,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748869735] [2025-01-09 21:39:47,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:47,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:39:47,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:39:47,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:47,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:48,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:48,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748869735] [2025-01-09 21:39:48,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748869735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:48,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046671861] [2025-01-09 21:39:48,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:48,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:48,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:48,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:48,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 671 [2025-01-09 21:39:48,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 563 transitions, 1133 flow. Second operand has 6 states, 6 states have (on average 499.3333333333333) internal successors, (2996), 6 states have internal predecessors, (2996), 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-01-09 21:39:48,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:48,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 671 [2025-01-09 21:39:48,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:49,407 INFO L124 PetriNetUnfolderBase]: 612/3906 cut-off events. [2025-01-09 21:39:49,407 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:39:49,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5099 conditions, 3906 events. 612/3906 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 31582 event pairs, 528 based on Foata normal form. 0/3581 useless extension candidates. Maximal degree in co-relation 5095. Up to 1181 conditions per place. [2025-01-09 21:39:49,420 INFO L140 encePairwiseOnDemand]: 665/671 looper letters, 91 selfloop transitions, 5 changer transitions 0/562 dead transitions. [2025-01-09 21:39:49,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 562 transitions, 1323 flow [2025-01-09 21:39:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3085 transitions. [2025-01-09 21:39:49,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7662692498758072 [2025-01-09 21:39:49,426 INFO L175 Difference]: Start difference. First operand has 566 places, 563 transitions, 1133 flow. Second operand 6 states and 3085 transitions. [2025-01-09 21:39:49,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 562 transitions, 1323 flow [2025-01-09 21:39:49,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 562 transitions, 1323 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:49,437 INFO L231 Difference]: Finished difference. Result has 560 places, 562 transitions, 1141 flow [2025-01-09 21:39:49,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=671, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1141, PETRI_PLACES=560, PETRI_TRANSITIONS=562} [2025-01-09 21:39:49,446 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -35 predicate places. [2025-01-09 21:39:49,446 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 562 transitions, 1141 flow [2025-01-09 21:39:49,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 499.3333333333333) internal successors, (2996), 6 states have internal predecessors, (2996), 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-01-09 21:39:49,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:49,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:49,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:39:49,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:39:49,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash -492069024, now seen corresponding path program 1 times [2025-01-09 21:39:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:49,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796027917] [2025-01-09 21:39:49,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:49,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:49,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:39:49,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:39:49,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:49,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796027917] [2025-01-09 21:39:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796027917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:49,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:49,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:49,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486245657] [2025-01-09 21:39:49,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:49,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:49,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:49,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:50,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 671 [2025-01-09 21:39:50,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 562 transitions, 1141 flow. Second operand has 6 states, 6 states have (on average 499.3333333333333) internal successors, (2996), 6 states have internal predecessors, (2996), 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-01-09 21:39:50,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:50,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 671 [2025-01-09 21:39:50,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:50,585 INFO L124 PetriNetUnfolderBase]: 612/3905 cut-off events. [2025-01-09 21:39:50,587 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:39:50,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5104 conditions, 3905 events. 612/3905 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 31503 event pairs, 528 based on Foata normal form. 0/3581 useless extension candidates. Maximal degree in co-relation 5099. Up to 1181 conditions per place. [2025-01-09 21:39:50,601 INFO L140 encePairwiseOnDemand]: 665/671 looper letters, 91 selfloop transitions, 5 changer transitions 0/561 dead transitions. [2025-01-09 21:39:50,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 561 transitions, 1331 flow [2025-01-09 21:39:50,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3085 transitions. [2025-01-09 21:39:50,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7662692498758072 [2025-01-09 21:39:50,608 INFO L175 Difference]: Start difference. First operand has 560 places, 562 transitions, 1141 flow. Second operand 6 states and 3085 transitions. [2025-01-09 21:39:50,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 561 transitions, 1331 flow [2025-01-09 21:39:50,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 561 transitions, 1321 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:39:50,617 INFO L231 Difference]: Finished difference. Result has 559 places, 561 transitions, 1139 flow [2025-01-09 21:39:50,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=671, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1139, PETRI_PLACES=559, PETRI_TRANSITIONS=561} [2025-01-09 21:39:50,620 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -36 predicate places. [2025-01-09 21:39:50,620 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 561 transitions, 1139 flow [2025-01-09 21:39:50,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 499.3333333333333) internal successors, (2996), 6 states have internal predecessors, (2996), 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-01-09 21:39:50,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:50,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:39:50,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:39:50,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash 98216176, now seen corresponding path program 1 times [2025-01-09 21:39:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:50,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166559737] [2025-01-09 21:39:50,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:50,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:39:50,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:39:50,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:50,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166559737] [2025-01-09 21:39:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166559737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214205050] [2025-01-09 21:39:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:51,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:51,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:51,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:51,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 671 [2025-01-09 21:39:51,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 561 transitions, 1139 flow. Second operand has 6 states, 6 states have (on average 493.1666666666667) internal successors, (2959), 6 states have internal predecessors, (2959), 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-01-09 21:39:51,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:51,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 671 [2025-01-09 21:39:51,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:52,381 INFO L124 PetriNetUnfolderBase]: 687/4320 cut-off events. [2025-01-09 21:39:52,382 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:39:52,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5663 conditions, 4320 events. 687/4320 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 36997 event pairs, 594 based on Foata normal form. 0/3961 useless extension candidates. Maximal degree in co-relation 5658. Up to 1325 conditions per place. [2025-01-09 21:39:52,398 INFO L140 encePairwiseOnDemand]: 665/671 looper letters, 99 selfloop transitions, 5 changer transitions 0/560 dead transitions. [2025-01-09 21:39:52,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 560 transitions, 1345 flow [2025-01-09 21:39:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3045 transitions. [2025-01-09 21:39:52,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7563338301043219 [2025-01-09 21:39:52,410 INFO L175 Difference]: Start difference. First operand has 559 places, 561 transitions, 1139 flow. Second operand 6 states and 3045 transitions. [2025-01-09 21:39:52,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 560 transitions, 1345 flow [2025-01-09 21:39:52,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 560 transitions, 1335 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:39:52,421 INFO L231 Difference]: Finished difference. Result has 558 places, 560 transitions, 1137 flow [2025-01-09 21:39:52,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=671, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1137, PETRI_PLACES=558, PETRI_TRANSITIONS=560} [2025-01-09 21:39:52,424 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -37 predicate places. [2025-01-09 21:39:52,424 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 560 transitions, 1137 flow [2025-01-09 21:39:52,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 493.1666666666667) internal successors, (2959), 6 states have internal predecessors, (2959), 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-01-09 21:39:52,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:52,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:39:52,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:39:52,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:39:52,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:52,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1441619623, now seen corresponding path program 1 times [2025-01-09 21:39:52,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:52,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536990168] [2025-01-09 21:39:52,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:52,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:39:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:39:52,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:52,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:39:52,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:52,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536990168] [2025-01-09 21:39:52,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536990168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:52,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:52,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:39:52,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106539724] [2025-01-09 21:39:52,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:52,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:52,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:52,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:52,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:52,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 671 [2025-01-09 21:39:52,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 560 transitions, 1137 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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-01-09 21:39:52,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:52,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 671 [2025-01-09 21:39:52,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:52,753 INFO L124 PetriNetUnfolderBase]: 17/630 cut-off events. [2025-01-09 21:39:52,753 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:39:52,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 630 events. 17/630 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1716 event pairs, 6 based on Foata normal form. 1/584 useless extension candidates. Maximal degree in co-relation 673. Up to 30 conditions per place. [2025-01-09 21:39:52,756 INFO L140 encePairwiseOnDemand]: 668/671 looper letters, 15 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2025-01-09 21:39:52,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 561 transitions, 1173 flow [2025-01-09 21:39:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1755 transitions. [2025-01-09 21:39:52,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8718330849478391 [2025-01-09 21:39:52,759 INFO L175 Difference]: Start difference. First operand has 558 places, 560 transitions, 1137 flow. Second operand 3 states and 1755 transitions. [2025-01-09 21:39:52,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 561 transitions, 1173 flow [2025-01-09 21:39:52,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 561 transitions, 1163 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:39:52,771 INFO L231 Difference]: Finished difference. Result has 556 places, 561 transitions, 1139 flow [2025-01-09 21:39:52,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=671, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=556, PETRI_TRANSITIONS=561} [2025-01-09 21:39:52,773 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -39 predicate places. [2025-01-09 21:39:52,773 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 561 transitions, 1139 flow [2025-01-09 21:39:52,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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-01-09 21:39:52,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:52,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:52,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:39:52,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:39:52,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash 463733376, now seen corresponding path program 1 times [2025-01-09 21:39:52,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:52,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187663061] [2025-01-09 21:39:52,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:52,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:52,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:39:52,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:39:52,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:52,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:39:53,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:53,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187663061] [2025-01-09 21:39:53,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187663061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:53,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:53,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:53,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184168859] [2025-01-09 21:39:53,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:53,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:53,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:53,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:53,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:54,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 540 out of 671 [2025-01-09 21:39:54,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 561 transitions, 1139 flow. Second operand has 6 states, 6 states have (on average 543.8333333333334) internal successors, (3263), 6 states have internal predecessors, (3263), 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-01-09 21:39:54,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:54,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 540 of 671 [2025-01-09 21:39:54,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:54,946 INFO L124 PetriNetUnfolderBase]: 161/2349 cut-off events. [2025-01-09 21:39:54,946 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:39:54,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 2349 events. 161/2349 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 15243 event pairs, 110 based on Foata normal form. 0/2151 useless extension candidates. Maximal degree in co-relation 2657. Up to 291 conditions per place. [2025-01-09 21:39:54,954 INFO L140 encePairwiseOnDemand]: 665/671 looper letters, 49 selfloop transitions, 6 changer transitions 0/560 dead transitions. [2025-01-09 21:39:54,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 560 transitions, 1247 flow [2025-01-09 21:39:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3295 transitions. [2025-01-09 21:39:54,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8184302036761053 [2025-01-09 21:39:54,960 INFO L175 Difference]: Start difference. First operand has 556 places, 561 transitions, 1139 flow. Second operand 6 states and 3295 transitions. [2025-01-09 21:39:54,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 560 transitions, 1247 flow [2025-01-09 21:39:54,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 560 transitions, 1245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:39:54,966 INFO L231 Difference]: Finished difference. Result has 559 places, 560 transitions, 1147 flow [2025-01-09 21:39:54,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=671, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1147, PETRI_PLACES=559, PETRI_TRANSITIONS=560} [2025-01-09 21:39:54,967 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -36 predicate places. [2025-01-09 21:39:54,968 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 560 transitions, 1147 flow [2025-01-09 21:39:54,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 543.8333333333334) internal successors, (3263), 6 states have internal predecessors, (3263), 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-01-09 21:39:54,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:54,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:54,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:39:54,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:39:54,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:54,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1051798820, now seen corresponding path program 1 times [2025-01-09 21:39:54,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:54,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103400435] [2025-01-09 21:39:54,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:54,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 21:39:54,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 21:39:55,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:55,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:39:55,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103400435] [2025-01-09 21:39:55,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103400435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:55,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:55,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:55,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769721085] [2025-01-09 21:39:55,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:55,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:55,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:55,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:55,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:56,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 540 out of 671 [2025-01-09 21:39:56,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 560 transitions, 1147 flow. Second operand has 6 states, 6 states have (on average 543.6666666666666) internal successors, (3262), 6 states have internal predecessors, (3262), 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-01-09 21:39:56,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:56,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 540 of 671 [2025-01-09 21:39:56,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:57,643 INFO L124 PetriNetUnfolderBase]: 535/6365 cut-off events. [2025-01-09 21:39:57,643 INFO L125 PetriNetUnfolderBase]: For 20/27 co-relation queries the response was YES. [2025-01-09 21:39:57,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7313 conditions, 6365 events. 535/6365 cut-off events. For 20/27 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 57235 event pairs, 196 based on Foata normal form. 5/5836 useless extension candidates. Maximal degree in co-relation 7307. Up to 748 conditions per place. [2025-01-09 21:39:57,665 INFO L140 encePairwiseOnDemand]: 646/671 looper letters, 68 selfloop transitions, 77 changer transitions 7/654 dead transitions. [2025-01-09 21:39:57,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 654 transitions, 1636 flow [2025-01-09 21:39:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3390 transitions. [2025-01-09 21:39:57,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.842026825633383 [2025-01-09 21:39:57,674 INFO L175 Difference]: Start difference. First operand has 559 places, 560 transitions, 1147 flow. Second operand 6 states and 3390 transitions. [2025-01-09 21:39:57,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 654 transitions, 1636 flow [2025-01-09 21:39:57,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 654 transitions, 1624 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:39:57,682 INFO L231 Difference]: Finished difference. Result has 564 places, 631 transitions, 1628 flow [2025-01-09 21:39:57,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=671, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1628, PETRI_PLACES=564, PETRI_TRANSITIONS=631} [2025-01-09 21:39:57,683 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -31 predicate places. [2025-01-09 21:39:57,683 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 631 transitions, 1628 flow [2025-01-09 21:39:57,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 543.6666666666666) internal successors, (3262), 6 states have internal predecessors, (3262), 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-01-09 21:39:57,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:57,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:57,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:39:57,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:39:57,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:57,686 INFO L85 PathProgramCache]: Analyzing trace with hash -111628988, now seen corresponding path program 1 times [2025-01-09 21:39:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:57,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905161528] [2025-01-09 21:39:57,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:57,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 21:39:57,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 21:39:57,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:39:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:58,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905161528] [2025-01-09 21:39:58,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905161528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:58,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:58,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788563085] [2025-01-09 21:39:58,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:58,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:58,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:58,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:59,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 671 [2025-01-09 21:39:59,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 631 transitions, 1628 flow. Second operand has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 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-01-09 21:39:59,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:59,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 671 [2025-01-09 21:39:59,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:00,554 INFO L124 PetriNetUnfolderBase]: 1742/9840 cut-off events. [2025-01-09 21:40:00,555 INFO L125 PetriNetUnfolderBase]: For 1070/1230 co-relation queries the response was YES. [2025-01-09 21:40:00,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14714 conditions, 9840 events. 1742/9840 cut-off events. For 1070/1230 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 93798 event pairs, 522 based on Foata normal form. 16/9043 useless extension candidates. Maximal degree in co-relation 14704. Up to 3034 conditions per place. [2025-01-09 21:40:00,591 INFO L140 encePairwiseOnDemand]: 598/671 looper letters, 178 selfloop transitions, 270 changer transitions 0/900 dead transitions. [2025-01-09 21:40:00,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 900 transitions, 3206 flow [2025-01-09 21:40:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:40:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:40:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3314 transitions. [2025-01-09 21:40:00,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8231495280675608 [2025-01-09 21:40:00,605 INFO L175 Difference]: Start difference. First operand has 564 places, 631 transitions, 1628 flow. Second operand 6 states and 3314 transitions. [2025-01-09 21:40:00,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 900 transitions, 3206 flow [2025-01-09 21:40:00,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 900 transitions, 3206 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:40:00,625 INFO L231 Difference]: Finished difference. Result has 570 places, 900 transitions, 3534 flow [2025-01-09 21:40:00,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=671, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3534, PETRI_PLACES=570, PETRI_TRANSITIONS=900} [2025-01-09 21:40:00,628 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -25 predicate places. [2025-01-09 21:40:00,629 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 900 transitions, 3534 flow [2025-01-09 21:40:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 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-01-09 21:40:00,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:00,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:00,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:40:00,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting runErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:40:00,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1140387605, now seen corresponding path program 1 times [2025-01-09 21:40:00,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877680115] [2025-01-09 21:40:00,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:00,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:40:00,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:40:00,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:00,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:40:00,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877680115] [2025-01-09 21:40:00,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877680115] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:40:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563094164] [2025-01-09 21:40:00,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:00,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:40:00,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:40:00,799 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-01-09 21:40:00,800 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-01-09 21:40:00,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:40:00,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:40:00,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:00,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:00,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 21:40:00,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:40:01,000 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-01-09 21:40:01,003 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-01-09 21:40:01,025 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-01-09 21:40:01,059 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-01-09 21:40:01,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:40:01,069 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-01-09 21:40:01,103 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:40:01,104 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:40:01,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 30 [2025-01-09 21:40:01,187 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-01-09 21:40:01,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:40:01,194 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-01-09 21:40:01,219 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:40:01,220 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:40:01,225 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:40:01,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 51 [2025-01-09 21:40:01,314 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-01-09 21:40:01,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:40:01,328 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-01-09 21:40:01,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:40:01,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 68 [2025-01-09 21:40:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:40:01,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:40:01,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563094164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:01,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:40:01,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-09 21:40:01,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332753418] [2025-01-09 21:40:01,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:01,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:40:01,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:01,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:40:01,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:40:02,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 671 [2025-01-09 21:40:02,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 900 transitions, 3534 flow. Second operand has 6 states, 6 states have (on average 547.3333333333334) internal successors, (3284), 6 states have internal predecessors, (3284), 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-01-09 21:40:02,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:02,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 671 [2025-01-09 21:40:02,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:03,214 INFO L124 PetriNetUnfolderBase]: 831/6340 cut-off events. [2025-01-09 21:40:03,214 INFO L125 PetriNetUnfolderBase]: For 1546/1813 co-relation queries the response was YES. [2025-01-09 21:40:03,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10727 conditions, 6340 events. 831/6340 cut-off events. For 1546/1813 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 55503 event pairs, 15 based on Foata normal form. 1/5951 useless extension candidates. Maximal degree in co-relation 10712. Up to 1162 conditions per place. [2025-01-09 21:40:03,252 INFO L140 encePairwiseOnDemand]: 660/671 looper letters, 221 selfloop transitions, 40 changer transitions 0/931 dead transitions. [2025-01-09 21:40:03,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 931 transitions, 4216 flow [2025-01-09 21:40:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:40:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:40:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3331 transitions. [2025-01-09 21:40:03,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8273720814704422 [2025-01-09 21:40:03,258 INFO L175 Difference]: Start difference. First operand has 570 places, 900 transitions, 3534 flow. Second operand 6 states and 3331 transitions. [2025-01-09 21:40:03,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 931 transitions, 4216 flow [2025-01-09 21:40:03,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 931 transitions, 4064 flow, removed 76 selfloop flow, removed 0 redundant places. [2025-01-09 21:40:03,343 INFO L231 Difference]: Finished difference. Result has 580 places, 931 transitions, 3742 flow [2025-01-09 21:40:03,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=671, PETRI_DIFFERENCE_MINUEND_FLOW=3390, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=872, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3742, PETRI_PLACES=580, PETRI_TRANSITIONS=931} [2025-01-09 21:40:03,345 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -15 predicate places. [2025-01-09 21:40:03,345 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 931 transitions, 3742 flow [2025-01-09 21:40:03,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 547.3333333333334) internal successors, (3284), 6 states have internal predecessors, (3284), 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-01-09 21:40:03,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:03,347 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:03,359 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-01-09 21:40:03,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:40:03,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:40:03,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash 841137771, now seen corresponding path program 1 times [2025-01-09 21:40:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:03,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454371941] [2025-01-09 21:40:03,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:03,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:03,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:40:03,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:40:03,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:03,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:40:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454371941] [2025-01-09 21:40:03,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454371941] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:40:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609215722] [2025-01-09 21:40:03,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:03,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:40:03,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:40:03,738 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-01-09 21:40:03,739 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-01-09 21:40:03,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:40:03,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:40:03,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:03,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:03,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 21:40:03,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:40:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:40:03,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:40:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:40:04,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609215722] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:40:04,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:40:04,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 21:40:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733040897] [2025-01-09 21:40:04,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:40:04,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 21:40:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:04,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 21:40:04,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:40:04,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 671 [2025-01-09 21:40:04,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 931 transitions, 3742 flow. Second operand has 9 states, 9 states have (on average 578.2222222222222) internal successors, (5204), 9 states have internal predecessors, (5204), 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-01-09 21:40:04,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:04,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 671 [2025-01-09 21:40:04,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:05,027 INFO L124 PetriNetUnfolderBase]: 794/6305 cut-off events. [2025-01-09 21:40:05,027 INFO L125 PetriNetUnfolderBase]: For 1410/1543 co-relation queries the response was YES. [2025-01-09 21:40:05,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10269 conditions, 6305 events. 794/6305 cut-off events. For 1410/1543 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 55328 event pairs, 9 based on Foata normal form. 3/5930 useless extension candidates. Maximal degree in co-relation 10249. Up to 1169 conditions per place. [2025-01-09 21:40:05,046 INFO L140 encePairwiseOnDemand]: 665/671 looper letters, 50 selfloop transitions, 9 changer transitions 0/939 dead transitions. [2025-01-09 21:40:05,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 939 transitions, 3878 flow [2025-01-09 21:40:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:40:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:40:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 5213 transitions. [2025-01-09 21:40:05,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8632223878125518 [2025-01-09 21:40:05,052 INFO L175 Difference]: Start difference. First operand has 580 places, 931 transitions, 3742 flow. Second operand 9 states and 5213 transitions. [2025-01-09 21:40:05,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 939 transitions, 3878 flow [2025-01-09 21:40:05,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 939 transitions, 3860 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:40:05,075 INFO L231 Difference]: Finished difference. Result has 591 places, 937 transitions, 3774 flow [2025-01-09 21:40:05,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=671, PETRI_DIFFERENCE_MINUEND_FLOW=3724, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3774, PETRI_PLACES=591, PETRI_TRANSITIONS=937} [2025-01-09 21:40:05,076 INFO L279 CegarLoopForPetriNet]: 595 programPoint places, -4 predicate places. [2025-01-09 21:40:05,076 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 937 transitions, 3774 flow [2025-01-09 21:40:05,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 578.2222222222222) internal successors, (5204), 9 states have internal predecessors, (5204), 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-01-09 21:40:05,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:05,079 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:05,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:40:05,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:40:05,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:40:05,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:05,280 INFO L85 PathProgramCache]: Analyzing trace with hash -326299855, now seen corresponding path program 2 times [2025-01-09 21:40:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:05,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396000757] [2025-01-09 21:40:05,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:40:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:05,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-01-09 21:40:05,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:40:05,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:40:05,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:05,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:40:05,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 21:40:05,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:40:05,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:05,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:05,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:40:05,481 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:40:05,482 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2025-01-09 21:40:05,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-01-09 21:40:05,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-01-09 21:40:05,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-01-09 21:40:05,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-01-09 21:40:05,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-01-09 21:40:05,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2025-01-09 21:40:05,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-01-09 21:40:05,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-01-09 21:40:05,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-01-09 21:40:05,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:40:05,487 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:05,491 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:40:05,491 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:40:05,614 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:40:05,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1010 places, 1149 transitions, 2314 flow [2025-01-09 21:40:05,837 INFO L124 PetriNetUnfolderBase]: 145/1241 cut-off events. [2025-01-09 21:40:05,837 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:40:05,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 1241 events. 145/1241 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4977 event pairs, 0 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 1010. Up to 6 conditions per place. [2025-01-09 21:40:05,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 1010 places, 1149 transitions, 2314 flow [2025-01-09 21:40:05,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1010 places, 1149 transitions, 2314 flow [2025-01-09 21:40:05,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:05,880 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;@635fdf2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:05,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-01-09 21:40:05,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:05,884 INFO L124 PetriNetUnfolderBase]: 8/65 cut-off events. [2025-01-09 21:40:05,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:05,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:05,884 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-01-09 21:40:05,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-01-09 21:40:05,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:05,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1806217892, now seen corresponding path program 1 times [2025-01-09 21:40:05,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:05,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916806426] [2025-01-09 21:40:05,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:05,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:05,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:40:05,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:40:05,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:05,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:05,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916806426] [2025-01-09 21:40:05,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916806426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:05,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:05,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:05,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727418366] [2025-01-09 21:40:05,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:05,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:40:05,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:05,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:40:05,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:40:05,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 994 out of 1149 [2025-01-09 21:40:05,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 1149 transitions, 2314 flow. Second operand has 2 states, 2 states have (on average 995.0) internal successors, (1990), 2 states have internal predecessors, (1990), 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-01-09 21:40:05,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:05,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 994 of 1149 [2025-01-09 21:40:05,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:06,474 INFO L124 PetriNetUnfolderBase]: 130/4001 cut-off events. [2025-01-09 21:40:06,474 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-09 21:40:06,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4172 conditions, 4001 events. 130/4001 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 31610 event pairs, 54 based on Foata normal form. 746/4416 useless extension candidates. Maximal degree in co-relation 737. Up to 129 conditions per place. [2025-01-09 21:40:06,515 INFO L140 encePairwiseOnDemand]: 1015/1149 looper letters, 18 selfloop transitions, 0 changer transitions 10/975 dead transitions. [2025-01-09 21:40:06,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 975 transitions, 2002 flow [2025-01-09 21:40:06,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:40:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:40:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2140 transitions. [2025-01-09 21:40:06,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9312445604873804 [2025-01-09 21:40:06,518 INFO L175 Difference]: Start difference. First operand has 1010 places, 1149 transitions, 2314 flow. Second operand 2 states and 2140 transitions. [2025-01-09 21:40:06,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 975 transitions, 2002 flow [2025-01-09 21:40:06,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 975 transitions, 2002 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:40:06,527 INFO L231 Difference]: Finished difference. Result has 960 places, 965 transitions, 1946 flow [2025-01-09 21:40:06,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1149, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=959, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=975, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1946, PETRI_PLACES=960, PETRI_TRANSITIONS=965} [2025-01-09 21:40:06,529 INFO L279 CegarLoopForPetriNet]: 1010 programPoint places, -50 predicate places. [2025-01-09 21:40:06,529 INFO L471 AbstractCegarLoop]: Abstraction has has 960 places, 965 transitions, 1946 flow [2025-01-09 21:40:06,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 995.0) internal successors, (1990), 2 states have internal predecessors, (1990), 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-01-09 21:40:06,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:06,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:06,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:40:06,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-01-09 21:40:06,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash 286017197, now seen corresponding path program 1 times [2025-01-09 21:40:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:06,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926578180] [2025-01-09 21:40:06,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:06,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:06,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:40:06,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:40:06,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:06,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:06,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:06,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926578180] [2025-01-09 21:40:06,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926578180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:06,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:06,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:40:06,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400702536] [2025-01-09 21:40:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:06,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:40:06,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:06,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:40:06,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:40:07,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 847 out of 1149 [2025-01-09 21:40:07,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 965 transitions, 1946 flow. Second operand has 6 states, 6 states have (on average 848.3333333333334) internal successors, (5090), 6 states have internal predecessors, (5090), 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-01-09 21:40:07,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:07,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 847 of 1149 [2025-01-09 21:40:07,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand