./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/ticketlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/ticketlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e9f7836ebdfb0849cf7f06257ab1fd414077ad21cfcb006a14459421df712fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:01:56,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:01:56,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 07:01:56,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:01:56,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:01:56,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:01:56,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:01:56,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:01:56,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:01:56,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:01:56,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:01:56,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:01:56,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:01:56,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:01:56,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:01:56,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:01:56,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:01:56,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:01:56,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:01:56,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:01:56,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:01:56,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:01:56,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:01:56,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:01:56,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:01:56,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:01:56,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:01:56,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:01:56,770 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e9f7836ebdfb0849cf7f06257ab1fd414077ad21cfcb006a14459421df712fb [2025-03-04 07:01:56,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:01:56,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:01:56,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:01:56,990 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:01:56,991 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:01:56,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/ticketlock.i [2025-03-04 07:01:58,106 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c86bd1b/351882f10f9344328e008e6d9a4e48cb/FLAG0671531a9 [2025-03-04 07:01:58,495 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:01:58,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/ticketlock.i [2025-03-04 07:01:58,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c86bd1b/351882f10f9344328e008e6d9a4e48cb/FLAG0671531a9 [2025-03-04 07:01:58,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c86bd1b/351882f10f9344328e008e6d9a4e48cb [2025-03-04 07:01:58,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:01:58,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:01:58,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:01:58,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:01:58,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:01:58,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:01:58" (1/1) ... [2025-03-04 07:01:58,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57aca075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:58, skipping insertion in model container [2025-03-04 07:01:58,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:01:58" (1/1) ... [2025-03-04 07:01:58,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:02:00,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:02:00,246 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:02:00,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-04 07:02:00,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-04 07:02:00,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-04 07:02:00,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-04 07:02:00,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-04 07:02:00,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-04 07:02:00,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-04 07:02:00,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-04 07:02:00,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-04 07:02:00,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-04 07:02:00,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-04 07:02:00,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-04 07:02:00,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-04 07:02:00,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-04 07:02:00,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-04 07:02:00,358 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-04 07:02:00,358 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-04 07:02:00,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-04 07:02:00,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-04 07:02:00,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-04 07:02:00,360 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-04 07:02:00,360 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-04 07:02:00,360 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-04 07:02:00,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-04 07:02:00,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-04 07:02:00,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-04 07:02:00,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-04 07:02:00,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-04 07:02:00,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-04 07:02:00,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-04 07:02:00,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-04 07:02:00,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-04 07:02:00,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-04 07:02:00,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-04 07:02:00,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-04 07:02:00,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-04 07:02:00,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-04 07:02:00,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-04 07:02:00,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-04 07:02:00,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-04 07:02:00,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-04 07:02:00,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-04 07:02:00,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-04 07:02:00,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-04 07:02:00,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-04 07:02:00,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-04 07:02:00,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-04 07:02:00,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-04 07:02:00,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-04 07:02:00,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-04 07:02:00,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-04 07:02:00,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-04 07:02:00,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-04 07:02:00,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-04 07:02:00,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-04 07:02:00,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-04 07:02:00,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-04 07:02:00,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-04 07:02:00,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-04 07:02:00,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-04 07:02:00,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-04 07:02:00,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-04 07:02:00,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-04 07:02:00,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-04 07:02:00,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-04 07:02:00,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-04 07:02:00,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-04 07:02:00,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-04 07:02:00,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-04 07:02:00,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-04 07:02:00,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-04 07:02:00,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-04 07:02:00,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-04 07:02:00,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-04 07:02:00,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-04 07:02:00,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-04 07:02:00,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-04 07:02:00,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-04 07:02:00,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-04 07:02:00,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-04 07:02:00,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-04 07:02:00,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-04 07:02:00,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-04 07:02:00,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-04 07:02:00,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-04 07:02:00,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-04 07:02:00,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-04 07:02:00,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-04 07:02:00,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-04 07:02:00,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-04 07:02:00,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-04 07:02:00,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-04 07:02:00,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-04 07:02:00,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-04 07:02:00,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-04 07:02:00,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-04 07:02:00,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-04 07:02:00,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-04 07:02:00,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-04 07:02:00,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-04 07:02:00,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:02:00,635 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:02:00,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00 WrapperNode [2025-03-04 07:02:00,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:02:00,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:02:00,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:02:00,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:02:00,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,746 INFO L138 Inliner]: procedures = 918, calls = 924, calls flagged for inlining = 825, calls inlined = 41, statements flattened = 436 [2025-03-04 07:02:00,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:02:00,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:02:00,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:02:00,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:02:00,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:02:00,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:02:00,781 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:02:00,781 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:02:00,784 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (1/1) ... [2025-03-04 07:02:00,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:02:00,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:02:00,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:02:00,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:02:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 07:02:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:02:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:02:00,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:02:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-04 07:02:00,831 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-04 07:02:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:02:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 07:02:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:02:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 07:02:00,834 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 07:02:00,952 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:02:00,954 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:02:01,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6007: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-04 07:02:01,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6007-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-04 07:02:01,470 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-04 07:02:01,471 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-04 07:02:01,471 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-03-04 07:02:01,471 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-04 07:02:01,471 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516: havoc vatomic32_get_inc_#t~ret620#1; [2025-03-04 07:02:01,471 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115: havoc vatomic32_get_inc_rlx_#t~ret156#1; [2025-03-04 07:02:01,472 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 07:02:01,472 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:02:01,569 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:02:01,570 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:02:01,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:02:01 BoogieIcfgContainer [2025-03-04 07:02:01,570 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:02:01,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:02:01,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:02:01,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:02:01,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:01:58" (1/3) ... [2025-03-04 07:02:01,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e27a0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:02:01, skipping insertion in model container [2025-03-04 07:02:01,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:02:00" (2/3) ... [2025-03-04 07:02:01,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e27a0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:02:01, skipping insertion in model container [2025-03-04 07:02:01,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:02:01" (3/3) ... [2025-03-04 07:02:01,577 INFO L128 eAbstractionObserver]: Analyzing ICFG ticketlock.i [2025-03-04 07:02:01,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:02:01,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ticketlock.i that has 2 procedures, 422 locations, 1 initial locations, 20 loop locations, and 17 error locations. [2025-03-04 07:02:01,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 07:02:01,746 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 07:02:01,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 425 places, 503 transitions, 1013 flow [2025-03-04 07:02:01,928 INFO L124 PetriNetUnfolderBase]: 95/579 cut-off events. [2025-03-04 07:02:01,934 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 07:02:01,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 579 events. 95/579 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1666 event pairs, 0 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 465. Up to 8 conditions per place. [2025-03-04 07:02:01,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 425 places, 503 transitions, 1013 flow [2025-03-04 07:02:01,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 425 places, 503 transitions, 1013 flow [2025-03-04 07:02:01,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:02:01,978 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;@6fa1cb29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:02:01,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-04 07:02:01,989 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 07:02:01,989 INFO L124 PetriNetUnfolderBase]: 12/58 cut-off events. [2025-03-04 07:02:01,989 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:02:01,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:01,992 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] [2025-03-04 07:02:01,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 07:02:01,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash -491716413, now seen corresponding path program 1 times [2025-03-04 07:02:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:02,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138587201] [2025-03-04 07:02:02,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:02,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:02:02,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:02:02,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:02,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:02,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:02,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138587201] [2025-03-04 07:02:02,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138587201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:02,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:02,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:02:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546950576] [2025-03-04 07:02:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:02,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:02:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:02,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:02:02,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:02:02,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 503 [2025-03-04 07:02:02,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 503 transitions, 1013 flow. Second operand has 2 states, 2 states have (on average 415.5) internal successors, (831), 2 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:02,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:02,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 503 [2025-03-04 07:02:02,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:02,323 INFO L124 PetriNetUnfolderBase]: 9/477 cut-off events. [2025-03-04 07:02:02,323 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 07:02:02,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 477 events. 9/477 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1282 event pairs, 0 based on Foata normal form. 118/565 useless extension candidates. Maximal degree in co-relation 393. Up to 9 conditions per place. [2025-03-04 07:02:02,328 INFO L140 encePairwiseOnDemand]: 423/503 looper letters, 8 selfloop transitions, 0 changer transitions 0/419 dead transitions. [2025-03-04 07:02:02,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 419 transitions, 861 flow [2025-03-04 07:02:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:02:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 07:02:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 918 transitions. [2025-03-04 07:02:02,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9125248508946322 [2025-03-04 07:02:02,347 INFO L175 Difference]: Start difference. First operand has 425 places, 503 transitions, 1013 flow. Second operand 2 states and 918 transitions. [2025-03-04 07:02:02,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 419 transitions, 861 flow [2025-03-04 07:02:02,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 419 transitions, 861 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:02:02,363 INFO L231 Difference]: Finished difference. Result has 414 places, 419 transitions, 845 flow [2025-03-04 07:02:02,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=845, PETRI_PLACES=414, PETRI_TRANSITIONS=419} [2025-03-04 07:02:02,368 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2025-03-04 07:02:02,369 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 419 transitions, 845 flow [2025-03-04 07:02:02,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 415.5) internal successors, (831), 2 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:02,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:02,370 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] [2025-03-04 07:02:02,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:02:02,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 07:02:02,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:02,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1178017677, now seen corresponding path program 1 times [2025-03-04 07:02:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526683664] [2025-03-04 07:02:02,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:02,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:02,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:02:02,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:02:02,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:02,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:03,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:03,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526683664] [2025-03-04 07:02:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526683664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:03,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:02:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520503236] [2025-03-04 07:02:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:03,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:02:03,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:03,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:02:03,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:02:03,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 503 [2025-03-04 07:02:03,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 419 transitions, 845 flow. Second operand has 6 states, 6 states have (on average 397.5) internal successors, (2385), 6 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:03,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:03,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 503 [2025-03-04 07:02:03,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:03,841 INFO L124 PetriNetUnfolderBase]: 220/2966 cut-off events. [2025-03-04 07:02:03,842 INFO L125 PetriNetUnfolderBase]: For 6/18 co-relation queries the response was YES. [2025-03-04 07:02:03,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3308 conditions, 2966 events. 220/2966 cut-off events. For 6/18 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 25930 event pairs, 57 based on Foata normal form. 4/2718 useless extension candidates. Maximal degree in co-relation 3304. Up to 288 conditions per place. [2025-03-04 07:02:03,853 INFO L140 encePairwiseOnDemand]: 490/503 looper letters, 26 selfloop transitions, 30 changer transitions 0/448 dead transitions. [2025-03-04 07:02:03,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 448 transitions, 1015 flow [2025-03-04 07:02:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:02:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 07:02:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2433 transitions. [2025-03-04 07:02:03,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8061630218687873 [2025-03-04 07:02:03,862 INFO L175 Difference]: Start difference. First operand has 414 places, 419 transitions, 845 flow. Second operand 6 states and 2433 transitions. [2025-03-04 07:02:03,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 448 transitions, 1015 flow [2025-03-04 07:02:03,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 448 transitions, 1015 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:02:03,869 INFO L231 Difference]: Finished difference. Result has 424 places, 448 transitions, 1047 flow [2025-03-04 07:02:03,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1047, PETRI_PLACES=424, PETRI_TRANSITIONS=448} [2025-03-04 07:02:03,871 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -1 predicate places. [2025-03-04 07:02:03,871 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 448 transitions, 1047 flow [2025-03-04 07:02:03,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 397.5) internal successors, (2385), 6 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:03,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:03,873 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] [2025-03-04 07:02:03,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:02:03,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 07:02:03,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:03,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1738393959, now seen corresponding path program 1 times [2025-03-04 07:02:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:03,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579788152] [2025-03-04 07:02:03,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:03,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:03,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:02:03,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:02:03,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:03,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:03,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:03,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579788152] [2025-03-04 07:02:03,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579788152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:03,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:03,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:02:03,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860989189] [2025-03-04 07:02:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:03,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:02:03,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:03,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:02:03,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:02:03,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 503 [2025-03-04 07:02:03,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 448 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:03,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:03,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 503 [2025-03-04 07:02:03,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:04,346 INFO L124 PetriNetUnfolderBase]: 244/4355 cut-off events. [2025-03-04 07:02:04,347 INFO L125 PetriNetUnfolderBase]: For 348/515 co-relation queries the response was YES. [2025-03-04 07:02:04,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 4355 events. 244/4355 cut-off events. For 348/515 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 35218 event pairs, 36 based on Foata normal form. 12/4127 useless extension candidates. Maximal degree in co-relation 4970. Up to 167 conditions per place. [2025-03-04 07:02:04,370 INFO L140 encePairwiseOnDemand]: 494/503 looper letters, 46 selfloop transitions, 6 changer transitions 0/458 dead transitions. [2025-03-04 07:02:04,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 458 transitions, 1183 flow [2025-03-04 07:02:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:02:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:02:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2025-03-04 07:02:04,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8257123923127899 [2025-03-04 07:02:04,374 INFO L175 Difference]: Start difference. First operand has 424 places, 448 transitions, 1047 flow. Second operand 3 states and 1246 transitions. [2025-03-04 07:02:04,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 458 transitions, 1183 flow [2025-03-04 07:02:04,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 458 transitions, 1183 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:02:04,387 INFO L231 Difference]: Finished difference. Result has 427 places, 452 transitions, 1093 flow [2025-03-04 07:02:04,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=427, PETRI_TRANSITIONS=452} [2025-03-04 07:02:04,388 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, 2 predicate places. [2025-03-04 07:02:04,388 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 452 transitions, 1093 flow [2025-03-04 07:02:04,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:04,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:04,389 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] [2025-03-04 07:02:04,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:02:04,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 07:02:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash 145706257, now seen corresponding path program 1 times [2025-03-04 07:02:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951562998] [2025-03-04 07:02:04,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:04,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:02:04,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:02:04,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:04,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:04,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:04,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951562998] [2025-03-04 07:02:04,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951562998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:04,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:04,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:02:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867124254] [2025-03-04 07:02:04,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:04,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:02:04,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:04,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:02:04,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:02:04,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 503 [2025-03-04 07:02:04,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 452 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 408.6666666666667) internal successors, (1226), 3 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:04,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:04,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 503 [2025-03-04 07:02:04,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:04,976 INFO L124 PetriNetUnfolderBase]: 299/5969 cut-off events. [2025-03-04 07:02:04,976 INFO L125 PetriNetUnfolderBase]: For 416/523 co-relation queries the response was YES. [2025-03-04 07:02:04,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6789 conditions, 5969 events. 299/5969 cut-off events. For 416/523 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 51443 event pairs, 34 based on Foata normal form. 12/5700 useless extension candidates. Maximal degree in co-relation 6778. Up to 191 conditions per place. [2025-03-04 07:02:05,001 INFO L140 encePairwiseOnDemand]: 497/503 looper letters, 43 selfloop transitions, 4 changer transitions 0/460 dead transitions. [2025-03-04 07:02:05,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 460 transitions, 1215 flow [2025-03-04 07:02:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:02:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:02:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2025-03-04 07:02:05,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8277004638833665 [2025-03-04 07:02:05,004 INFO L175 Difference]: Start difference. First operand has 427 places, 452 transitions, 1093 flow. Second operand 3 states and 1249 transitions. [2025-03-04 07:02:05,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 460 transitions, 1215 flow [2025-03-04 07:02:05,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 460 transitions, 1203 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:02:05,012 INFO L231 Difference]: Finished difference. Result has 428 places, 454 transitions, 1109 flow [2025-03-04 07:02:05,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=428, PETRI_TRANSITIONS=454} [2025-03-04 07:02:05,014 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, 3 predicate places. [2025-03-04 07:02:05,014 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 454 transitions, 1109 flow [2025-03-04 07:02:05,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.6666666666667) internal successors, (1226), 3 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:05,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:05,015 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] [2025-03-04 07:02:05,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:02:05,015 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 07:02:05,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash 520484794, now seen corresponding path program 1 times [2025-03-04 07:02:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076871211] [2025-03-04 07:02:05,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:05,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:02:05,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:02:05,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:05,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:05,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076871211] [2025-03-04 07:02:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076871211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:05,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:05,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:02:05,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582885972] [2025-03-04 07:02:05,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:05,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:02:05,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:05,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:02:05,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:02:05,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 503 [2025-03-04 07:02:05,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 454 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:05,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:05,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 503 [2025-03-04 07:02:05,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:05,605 INFO L124 PetriNetUnfolderBase]: 278/5794 cut-off events. [2025-03-04 07:02:05,606 INFO L125 PetriNetUnfolderBase]: For 400/683 co-relation queries the response was YES. [2025-03-04 07:02:05,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6624 conditions, 5794 events. 278/5794 cut-off events. For 400/683 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 50480 event pairs, 42 based on Foata normal form. 10/5530 useless extension candidates. Maximal degree in co-relation 6612. Up to 231 conditions per place. [2025-03-04 07:02:05,624 INFO L140 encePairwiseOnDemand]: 500/503 looper letters, 45 selfloop transitions, 2 changer transitions 0/463 dead transitions. [2025-03-04 07:02:05,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 463 transitions, 1245 flow [2025-03-04 07:02:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:02:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:02:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1248 transitions. [2025-03-04 07:02:05,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.827037773359841 [2025-03-04 07:02:05,627 INFO L175 Difference]: Start difference. First operand has 428 places, 454 transitions, 1109 flow. Second operand 3 states and 1248 transitions. [2025-03-04 07:02:05,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 463 transitions, 1245 flow [2025-03-04 07:02:05,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 463 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:02:05,638 INFO L231 Difference]: Finished difference. Result has 429 places, 454 transitions, 1109 flow [2025-03-04 07:02:05,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=503, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=429, PETRI_TRANSITIONS=454} [2025-03-04 07:02:05,639 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, 4 predicate places. [2025-03-04 07:02:05,640 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 454 transitions, 1109 flow [2025-03-04 07:02:05,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:05,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:05,641 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] [2025-03-04 07:02:05,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:02:05,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 07:02:05,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2011529907, now seen corresponding path program 1 times [2025-03-04 07:02:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482180681] [2025-03-04 07:02:05,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:05,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:02:05,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:02:05,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:05,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:02:05,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:02:05,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:02:05,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:02:05,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:05,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:02:05,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:02:05,706 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:02:05,707 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-03-04 07:02:05,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 30 remaining) [2025-03-04 07:02:05,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 30 remaining) [2025-03-04 07:02:05,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 30 remaining) [2025-03-04 07:02:05,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 30 remaining) [2025-03-04 07:02:05,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 30 remaining) [2025-03-04 07:02:05,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (23 of 30 remaining) [2025-03-04 07:02:05,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (22 of 30 remaining) [2025-03-04 07:02:05,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (21 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (20 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (19 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (18 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (17 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (16 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (15 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (14 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (13 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (12 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (11 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (10 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (9 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (8 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (7 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (6 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (5 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (4 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (3 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (2 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (1 of 30 remaining) [2025-03-04 07:02:05,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (0 of 30 remaining) [2025-03-04 07:02:05,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:02:05,709 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 07:02:05,711 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 07:02:05,711 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 07:02:05,827 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 07:02:05,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 751 places, 888 transitions, 1792 flow [2025-03-04 07:02:06,038 INFO L124 PetriNetUnfolderBase]: 179/1104 cut-off events. [2025-03-04 07:02:06,038 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 07:02:06,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1104 events. 179/1104 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4862 event pairs, 0 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 902. Up to 12 conditions per place. [2025-03-04 07:02:06,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 751 places, 888 transitions, 1792 flow [2025-03-04 07:02:06,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 751 places, 888 transitions, 1792 flow [2025-03-04 07:02:06,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:02:06,066 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;@6fa1cb29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:02:06,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-03-04 07:02:06,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 07:02:06,068 INFO L124 PetriNetUnfolderBase]: 12/58 cut-off events. [2025-03-04 07:02:06,068 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:02:06,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:06,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:02:06,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-03-04 07:02:06,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash 657069115, now seen corresponding path program 1 times [2025-03-04 07:02:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:06,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131597664] [2025-03-04 07:02:06,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:06,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:06,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:02:06,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:02:06,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:06,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:06,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:06,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131597664] [2025-03-04 07:02:06,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131597664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:06,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:06,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:02:06,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958353483] [2025-03-04 07:02:06,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:06,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:02:06,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:06,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:02:06,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:02:06,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 888 [2025-03-04 07:02:06,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 888 transitions, 1792 flow. Second operand has 2 states, 2 states have (on average 732.5) internal successors, (1465), 2 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:06,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:06,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 888 [2025-03-04 07:02:06,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:06,720 INFO L124 PetriNetUnfolderBase]: 121/3792 cut-off events. [2025-03-04 07:02:06,721 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-04 07:02:06,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3961 conditions, 3792 events. 121/3792 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 32884 event pairs, 54 based on Foata normal form. 1175/4690 useless extension candidates. Maximal degree in co-relation 843. Up to 127 conditions per place. [2025-03-04 07:02:06,765 INFO L140 encePairwiseOnDemand]: 748/888 looper letters, 16 selfloop transitions, 0 changer transitions 0/744 dead transitions. [2025-03-04 07:02:06,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 744 transitions, 1536 flow [2025-03-04 07:02:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:02:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 07:02:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1620 transitions. [2025-03-04 07:02:06,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9121621621621622 [2025-03-04 07:02:06,769 INFO L175 Difference]: Start difference. First operand has 751 places, 888 transitions, 1792 flow. Second operand 2 states and 1620 transitions. [2025-03-04 07:02:06,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 744 transitions, 1536 flow [2025-03-04 07:02:06,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 744 transitions, 1536 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:02:06,779 INFO L231 Difference]: Finished difference. Result has 732 places, 744 transitions, 1504 flow [2025-03-04 07:02:06,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=888, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=731, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1504, PETRI_PLACES=732, PETRI_TRANSITIONS=744} [2025-03-04 07:02:06,781 INFO L279 CegarLoopForPetriNet]: 751 programPoint places, -19 predicate places. [2025-03-04 07:02:06,781 INFO L471 AbstractCegarLoop]: Abstraction has has 732 places, 744 transitions, 1504 flow [2025-03-04 07:02:06,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 732.5) internal successors, (1465), 2 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:06,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:06,782 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] [2025-03-04 07:02:06,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:02:06,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-03-04 07:02:06,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1001691925, now seen corresponding path program 1 times [2025-03-04 07:02:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:06,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335908229] [2025-03-04 07:02:06,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:06,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:02:06,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:02:06,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:06,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:07,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335908229] [2025-03-04 07:02:07,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335908229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:07,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:07,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:02:07,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137180525] [2025-03-04 07:02:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:07,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:02:07,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:07,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:02:07,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:02:07,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 713 out of 888 [2025-03-04 07:02:07,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 744 transitions, 1504 flow. Second operand has 6 states, 6 states have (on average 714.5) internal successors, (4287), 6 states have internal predecessors, (4287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:07,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:07,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 713 of 888 [2025-03-04 07:02:07,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:11,750 INFO L124 PetriNetUnfolderBase]: 3473/28699 cut-off events. [2025-03-04 07:02:11,751 INFO L125 PetriNetUnfolderBase]: For 269/384 co-relation queries the response was YES. [2025-03-04 07:02:11,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33039 conditions, 28699 events. 3473/28699 cut-off events. For 269/384 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 395034 event pairs, 1182 based on Foata normal form. 32/26322 useless extension candidates. Maximal degree in co-relation 33034. Up to 3916 conditions per place. [2025-03-04 07:02:12,011 INFO L140 encePairwiseOnDemand]: 869/888 looper letters, 35 selfloop transitions, 54 changer transitions 0/798 dead transitions. [2025-03-04 07:02:12,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 737 places, 798 transitions, 1795 flow [2025-03-04 07:02:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:02:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 07:02:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4368 transitions. [2025-03-04 07:02:12,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8198198198198198 [2025-03-04 07:02:12,019 INFO L175 Difference]: Start difference. First operand has 732 places, 744 transitions, 1504 flow. Second operand 6 states and 4368 transitions. [2025-03-04 07:02:12,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 737 places, 798 transitions, 1795 flow [2025-03-04 07:02:12,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 798 transitions, 1795 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:02:12,027 INFO L231 Difference]: Finished difference. Result has 742 places, 797 transitions, 1862 flow [2025-03-04 07:02:12,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=888, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=732, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1862, PETRI_PLACES=742, PETRI_TRANSITIONS=797} [2025-03-04 07:02:12,029 INFO L279 CegarLoopForPetriNet]: 751 programPoint places, -9 predicate places. [2025-03-04 07:02:12,029 INFO L471 AbstractCegarLoop]: Abstraction has has 742 places, 797 transitions, 1862 flow [2025-03-04 07:02:12,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 714.5) internal successors, (4287), 6 states have internal predecessors, (4287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:12,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:12,031 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] [2025-03-04 07:02:12,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:02:12,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-03-04 07:02:12,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:12,032 INFO L85 PathProgramCache]: Analyzing trace with hash 236610201, now seen corresponding path program 1 times [2025-03-04 07:02:12,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:12,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245909216] [2025-03-04 07:02:12,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:12,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:12,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:02:12,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:02:12,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:12,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245909216] [2025-03-04 07:02:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245909216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:12,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:12,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:02:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513333388] [2025-03-04 07:02:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:12,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:02:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:12,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:02:12,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:02:12,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 718 out of 888 [2025-03-04 07:02:12,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 797 transitions, 1862 flow. Second operand has 3 states, 3 states have (on average 718.6666666666666) internal successors, (2156), 3 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:12,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:12,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 718 of 888 [2025-03-04 07:02:12,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:22,024 INFO L124 PetriNetUnfolderBase]: 6711/63478 cut-off events. [2025-03-04 07:02:22,024 INFO L125 PetriNetUnfolderBase]: For 8032/12986 co-relation queries the response was YES. [2025-03-04 07:02:22,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78717 conditions, 63478 events. 6711/63478 cut-off events. For 8032/12986 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 930212 event pairs, 1211 based on Foata normal form. 359/59780 useless extension candidates. Maximal degree in co-relation 78707. Up to 4969 conditions per place. [2025-03-04 07:02:22,555 INFO L140 encePairwiseOnDemand]: 874/888 looper letters, 141 selfloop transitions, 10 changer transitions 0/870 dead transitions. [2025-03-04 07:02:22,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 870 transitions, 2537 flow [2025-03-04 07:02:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:02:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:02:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2213 transitions. [2025-03-04 07:02:22,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8307057057057057 [2025-03-04 07:02:22,559 INFO L175 Difference]: Start difference. First operand has 742 places, 797 transitions, 1862 flow. Second operand 3 states and 2213 transitions. [2025-03-04 07:02:22,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 744 places, 870 transitions, 2537 flow [2025-03-04 07:02:22,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 870 transitions, 2537 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:02:22,575 INFO L231 Difference]: Finished difference. Result has 746 places, 807 transitions, 1950 flow [2025-03-04 07:02:22,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=888, PETRI_DIFFERENCE_MINUEND_FLOW=1862, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1950, PETRI_PLACES=746, PETRI_TRANSITIONS=807} [2025-03-04 07:02:22,576 INFO L279 CegarLoopForPetriNet]: 751 programPoint places, -5 predicate places. [2025-03-04 07:02:22,577 INFO L471 AbstractCegarLoop]: Abstraction has has 746 places, 807 transitions, 1950 flow [2025-03-04 07:02:22,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 718.6666666666666) internal successors, (2156), 3 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:22,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:22,578 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] [2025-03-04 07:02:22,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:02:22,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-03-04 07:02:22,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash -250812399, now seen corresponding path program 1 times [2025-03-04 07:02:22,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:22,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059895127] [2025-03-04 07:02:22,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:22,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:02:22,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:02:22,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:22,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:22,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:22,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059895127] [2025-03-04 07:02:22,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059895127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:22,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:02:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809906625] [2025-03-04 07:02:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:22,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:02:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:22,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:02:22,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:02:22,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 721 out of 888 [2025-03-04 07:02:22,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 746 places, 807 transitions, 1950 flow. Second operand has 3 states, 3 states have (on average 721.6666666666666) internal successors, (2165), 3 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:22,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:22,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 721 of 888 [2025-03-04 07:02:22,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:41,068 INFO L124 PetriNetUnfolderBase]: 10085/111421 cut-off events. [2025-03-04 07:02:41,069 INFO L125 PetriNetUnfolderBase]: For 10957/14797 co-relation queries the response was YES. [2025-03-04 07:02:41,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135742 conditions, 111421 events. 10085/111421 cut-off events. For 10957/14797 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 1795150 event pairs, 1955 based on Foata normal form. 455/105746 useless extension candidates. Maximal degree in co-relation 135730. Up to 6772 conditions per place. [2025-03-04 07:02:41,879 INFO L140 encePairwiseOnDemand]: 877/888 looper letters, 138 selfloop transitions, 8 changer transitions 0/878 dead transitions. [2025-03-04 07:02:41,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 878 transitions, 2611 flow [2025-03-04 07:02:41,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:02:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:02:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2216 transitions. [2025-03-04 07:02:41,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8318318318318318 [2025-03-04 07:02:41,883 INFO L175 Difference]: Start difference. First operand has 746 places, 807 transitions, 1950 flow. Second operand 3 states and 2216 transitions. [2025-03-04 07:02:41,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 878 transitions, 2611 flow [2025-03-04 07:02:41,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 746 places, 878 transitions, 2591 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:02:41,904 INFO L231 Difference]: Finished difference. Result has 748 places, 815 transitions, 2000 flow [2025-03-04 07:02:41,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=888, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=744, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2000, PETRI_PLACES=748, PETRI_TRANSITIONS=815} [2025-03-04 07:02:41,906 INFO L279 CegarLoopForPetriNet]: 751 programPoint places, -3 predicate places. [2025-03-04 07:02:41,906 INFO L471 AbstractCegarLoop]: Abstraction has has 748 places, 815 transitions, 2000 flow [2025-03-04 07:02:41,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 721.6666666666666) internal successors, (2165), 3 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:41,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:41,907 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] [2025-03-04 07:02:41,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:02:41,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-03-04 07:02:41,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1113309234, now seen corresponding path program 1 times [2025-03-04 07:02:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:41,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774964143] [2025-03-04 07:02:41,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:41,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:02:41,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:02:41,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:41,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:41,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:41,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774964143] [2025-03-04 07:02:41,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774964143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:41,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:41,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:02:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317077003] [2025-03-04 07:02:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:41,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:02:41,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:41,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:02:41,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:02:41,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 888 [2025-03-04 07:02:41,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 815 transitions, 2000 flow. Second operand has 3 states, 3 states have (on average 727.3333333333334) internal successors, (2182), 3 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:41,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:41,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 888 [2025-03-04 07:02:41,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand