./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/mcslock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/mcslock.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 185c5ecec118867d41d6d4e251a2153dc547f1cc961cdbc2b790292b6debb75b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:20:09,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:20:09,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:20:09,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:20:09,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:20:09,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:20:09,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:20:09,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:20:09,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:20:09,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:20:09,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:20:09,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:20:09,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:20:09,593 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:20:09,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:20:09,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:20:09,594 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 -> 185c5ecec118867d41d6d4e251a2153dc547f1cc961cdbc2b790292b6debb75b [2025-03-17 11:20:09,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:20:09,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:20:09,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:20:09,850 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:20:09,850 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:20:09,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/mcslock.i [2025-03-17 11:20:11,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41764df04/175f2a0226a84bab8637024df5b00dc6/FLAG87a8e62bc [2025-03-17 11:20:11,417 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:20:11,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/mcslock.i [2025-03-17 11:20:11,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41764df04/175f2a0226a84bab8637024df5b00dc6/FLAG87a8e62bc [2025-03-17 11:20:11,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41764df04/175f2a0226a84bab8637024df5b00dc6 [2025-03-17 11:20:11,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:20:11,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:20:11,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:20:11,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:20:11,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:20:11,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:20:11" (1/1) ... [2025-03-17 11:20:11,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58686f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:11, skipping insertion in model container [2025-03-17 11:20:11,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:20:11" (1/1) ... [2025-03-17 11:20:11,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:20:13,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:20:13,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:20:13,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-17 11:20:13,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-17 11:20:13,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-17 11:20:13,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-17 11:20:13,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-17 11:20:13,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-17 11:20:13,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-17 11:20:13,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-17 11:20:13,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-17 11:20:13,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-17 11:20:13,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-17 11:20:13,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-17 11:20:13,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-17 11:20:13,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-17 11:20:13,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-17 11:20:13,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-17 11:20:13,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-17 11:20:13,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-17 11:20:13,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-17 11:20:13,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-17 11:20:13,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-17 11:20:13,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-17 11:20:13,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-17 11:20:13,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-17 11:20:13,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-17 11:20:13,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-17 11:20:13,529 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-17 11:20:13,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-17 11:20:13,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-17 11:20:13,531 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-17 11:20:13,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-17 11:20:13,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-17 11:20:13,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-17 11:20:13,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-17 11:20:13,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-17 11:20:13,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-17 11:20:13,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-17 11:20:13,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-17 11:20:13,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-17 11:20:13,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-17 11:20:13,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-17 11:20:13,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-17 11:20:13,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-17 11:20:13,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-17 11:20:13,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-17 11:20:13,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-17 11:20:13,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-17 11:20:13,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-17 11:20:13,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-17 11:20:13,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-17 11:20:13,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-17 11:20:13,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-17 11:20:13,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-17 11:20:13,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-17 11:20:13,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-17 11:20:13,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-17 11:20:13,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-17 11:20:13,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-17 11:20:13,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-17 11:20:13,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-17 11:20:13,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-17 11:20:13,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-17 11:20:13,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-17 11:20:13,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-17 11:20:13,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-17 11:20:13,551 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-17 11:20:13,551 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-17 11:20:13,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-17 11:20:13,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-17 11:20:13,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-17 11:20:13,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-17 11:20:13,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-17 11:20:13,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-17 11:20:13,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-17 11:20:13,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-17 11:20:13,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-17 11:20:13,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-17 11:20:13,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-17 11:20:13,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-17 11:20:13,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-17 11:20:13,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-17 11:20:13,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-17 11:20:13,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-17 11:20:13,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-17 11:20:13,557 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-17 11:20:13,557 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-17 11:20:13,557 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-17 11:20:13,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-17 11:20:13,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-17 11:20:13,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-17 11:20:13,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-17 11:20:13,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-17 11:20:13,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-17 11:20:13,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-17 11:20:13,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-17 11:20:13,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-17 11:20:13,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-17 11:20:13,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-17 11:20:13,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-17 11:20:13,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-17 11:20:13,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:20:13,783 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:20:13,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13 WrapperNode [2025-03-17 11:20:13,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:20:13,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:20:13,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:20:13,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:20:13,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,892 INFO L138 Inliner]: procedures = 919, calls = 935, calls flagged for inlining = 830, calls inlined = 57, statements flattened = 612 [2025-03-17 11:20:13,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:20:13,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:20:13,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:20:13,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:20:13,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:20:13,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:20:13,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:20:13,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:20:13,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (1/1) ... [2025-03-17 11:20:13,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:20:13,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:20:13,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:20:13,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:20:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:20:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:20:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:20:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:20:14,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:20:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-17 11:20:14,017 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-17 11:20:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:20:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:20:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:20:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:20:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 11:20:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:20:14,019 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:20:14,171 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:20:14,172 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:20:14,401 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-17 11:20:14,401 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-17 11:20:14,888 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-03-17 11:20:14,888 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710: havoc vatomicptr_await_neq_rlx_#t~ret421#1.base, vatomicptr_await_neq_rlx_#t~ret421#1.offset; [2025-03-17 11:20:14,888 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655: havoc vatomicptr_read_rlx_#t~ret412#1.base, vatomicptr_read_rlx_#t~ret412#1.offset; [2025-03-17 11:20:14,888 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-03-17 11:20:14,889 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700: havoc vatomicptr_cmpxchg_rel_#t~ret419#1.base, vatomicptr_cmpxchg_rel_#t~ret419#1.offset; [2025-03-17 11:20:14,890 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:20:14,890 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:20:15,069 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:20:15,070 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:20:15,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:20:15 BoogieIcfgContainer [2025-03-17 11:20:15,070 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:20:15,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:20:15,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:20:15,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:20:15,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:20:11" (1/3) ... [2025-03-17 11:20:15,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d43466f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:20:15, skipping insertion in model container [2025-03-17 11:20:15,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:20:13" (2/3) ... [2025-03-17 11:20:15,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d43466f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:20:15, skipping insertion in model container [2025-03-17 11:20:15,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:20:15" (3/3) ... [2025-03-17 11:20:15,078 INFO L128 eAbstractionObserver]: Analyzing ICFG mcslock.i [2025-03-17 11:20:15,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:20:15,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mcslock.i that has 2 procedures, 574 locations, 1 initial locations, 23 loop locations, and 25 error locations. [2025-03-17 11:20:15,092 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:20:15,278 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:20:15,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 577 places, 669 transitions, 1345 flow [2025-03-17 11:20:15,539 INFO L124 PetriNetUnfolderBase]: 109/744 cut-off events. [2025-03-17 11:20:15,541 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:20:15,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 744 events. 109/744 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2237 event pairs, 0 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 625. Up to 8 conditions per place. [2025-03-17 11:20:15,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 577 places, 669 transitions, 1345 flow [2025-03-17 11:20:15,576 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 669 transitions, 1345 flow [2025-03-17 11:20:15,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:20:15,596 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;@74fed84b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:20:15,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-17 11:20:15,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:20:15,606 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events. [2025-03-17 11:20:15,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:20:15,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:15,607 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] [2025-03-17 11:20:15,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-17 11:20:15,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1832606703, now seen corresponding path program 1 times [2025-03-17 11:20:15,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:15,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255647262] [2025-03-17 11:20:15,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:15,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:15,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:20:15,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:20:15,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:15,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:15,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:15,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255647262] [2025-03-17 11:20:15,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255647262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:15,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:15,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:20:15,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418730508] [2025-03-17 11:20:15,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:15,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:20:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:15,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:20:15,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:20:15,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 669 [2025-03-17 11:20:15,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 669 transitions, 1345 flow. Second operand has 2 states, 2 states have (on average 557.5) internal successors, (1115), 2 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:15,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:15,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 669 [2025-03-17 11:20:15,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:16,018 INFO L124 PetriNetUnfolderBase]: 14/625 cut-off events. [2025-03-17 11:20:16,018 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:20:16,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 625 events. 14/625 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1908 event pairs, 0 based on Foata normal form. 200/790 useless extension candidates. Maximal degree in co-relation 543. Up to 16 conditions per place. [2025-03-17 11:20:16,023 INFO L140 encePairwiseOnDemand]: 572/669 looper letters, 15 selfloop transitions, 0 changer transitions 0/568 dead transitions. [2025-03-17 11:20:16,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 568 transitions, 1173 flow [2025-03-17 11:20:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:20:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:20:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1226 transitions. [2025-03-17 11:20:16,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9162929745889388 [2025-03-17 11:20:16,043 INFO L175 Difference]: Start difference. First operand has 577 places, 669 transitions, 1345 flow. Second operand 2 states and 1226 transitions. [2025-03-17 11:20:16,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 568 transitions, 1173 flow [2025-03-17 11:20:16,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 568 transitions, 1173 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:16,063 INFO L231 Difference]: Finished difference. Result has 558 places, 568 transitions, 1143 flow [2025-03-17 11:20:16,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=669, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1143, PETRI_PLACES=558, PETRI_TRANSITIONS=568} [2025-03-17 11:20:16,069 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -19 predicate places. [2025-03-17 11:20:16,069 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 568 transitions, 1143 flow [2025-03-17 11:20:16,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 557.5) internal successors, (1115), 2 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:16,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:16,070 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] [2025-03-17 11:20:16,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:20:16,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-17 11:20:16,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1691922545, now seen corresponding path program 1 times [2025-03-17 11:20:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:16,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839455266] [2025-03-17 11:20:16,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:16,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 11:20:16,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 11:20:16,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:16,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:16,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:16,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839455266] [2025-03-17 11:20:16,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839455266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:16,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:16,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:20:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540880533] [2025-03-17 11:20:16,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:16,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:20:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:16,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:20:16,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:20:17,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 538 out of 669 [2025-03-17 11:20:17,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 568 transitions, 1143 flow. Second operand has 6 states, 6 states have (on average 539.5) internal successors, (3237), 6 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:17,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:17,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 538 of 669 [2025-03-17 11:20:17,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:18,023 INFO L124 PetriNetUnfolderBase]: 395/4528 cut-off events. [2025-03-17 11:20:18,025 INFO L125 PetriNetUnfolderBase]: For 20/34 co-relation queries the response was YES. [2025-03-17 11:20:18,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5164 conditions, 4528 events. 395/4528 cut-off events. For 20/34 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 44331 event pairs, 117 based on Foata normal form. 4/4139 useless extension candidates. Maximal degree in co-relation 5160. Up to 540 conditions per place. [2025-03-17 11:20:18,050 INFO L140 encePairwiseOnDemand]: 649/669 looper letters, 33 selfloop transitions, 58 changer transitions 0/625 dead transitions. [2025-03-17 11:20:18,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 625 transitions, 1439 flow [2025-03-17 11:20:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:20:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:20:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3320 transitions. [2025-03-17 11:20:18,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8271051320378675 [2025-03-17 11:20:18,061 INFO L175 Difference]: Start difference. First operand has 558 places, 568 transitions, 1143 flow. Second operand 6 states and 3320 transitions. [2025-03-17 11:20:18,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 625 transitions, 1439 flow [2025-03-17 11:20:18,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 625 transitions, 1439 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:18,074 INFO L231 Difference]: Finished difference. Result has 568 places, 625 transitions, 1527 flow [2025-03-17 11:20:18,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=669, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1527, PETRI_PLACES=568, PETRI_TRANSITIONS=625} [2025-03-17 11:20:18,075 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -9 predicate places. [2025-03-17 11:20:18,075 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 625 transitions, 1527 flow [2025-03-17 11:20:18,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 539.5) internal successors, (3237), 6 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:18,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:18,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:18,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:20:18,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-17 11:20:18,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2062910536, now seen corresponding path program 1 times [2025-03-17 11:20:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:18,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706624261] [2025-03-17 11:20:18,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:18,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:18,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:20:18,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:20:18,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:18,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:18,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706624261] [2025-03-17 11:20:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706624261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:18,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:18,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:20:18,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192544017] [2025-03-17 11:20:18,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:18,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:20:18,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:18,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:20:18,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:20:18,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 547 out of 669 [2025-03-17 11:20:18,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 625 transitions, 1527 flow. Second operand has 3 states, 3 states have (on average 547.6666666666666) internal successors, (1643), 3 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:18,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:18,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 547 of 669 [2025-03-17 11:20:18,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:18,741 INFO L124 PetriNetUnfolderBase]: 418/6002 cut-off events. [2025-03-17 11:20:18,742 INFO L125 PetriNetUnfolderBase]: For 623/1047 co-relation queries the response was YES. [2025-03-17 11:20:18,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 6002 events. 418/6002 cut-off events. For 623/1047 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 53827 event pairs, 32 based on Foata normal form. 49/5713 useless extension candidates. Maximal degree in co-relation 7129. Up to 321 conditions per place. [2025-03-17 11:20:18,767 INFO L140 encePairwiseOnDemand]: 660/669 looper letters, 88 selfloop transitions, 6 changer transitions 0/642 dead transitions. [2025-03-17 11:20:18,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 642 transitions, 1775 flow [2025-03-17 11:20:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:20:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:20:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1686 transitions. [2025-03-17 11:20:18,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8400597907324364 [2025-03-17 11:20:18,772 INFO L175 Difference]: Start difference. First operand has 568 places, 625 transitions, 1527 flow. Second operand 3 states and 1686 transitions. [2025-03-17 11:20:18,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 642 transitions, 1775 flow [2025-03-17 11:20:18,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 642 transitions, 1775 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:18,782 INFO L231 Difference]: Finished difference. Result has 571 places, 629 transitions, 1573 flow [2025-03-17 11:20:18,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=669, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1573, PETRI_PLACES=571, PETRI_TRANSITIONS=629} [2025-03-17 11:20:18,783 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -6 predicate places. [2025-03-17 11:20:18,783 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 629 transitions, 1573 flow [2025-03-17 11:20:18,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 547.6666666666666) internal successors, (1643), 3 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:18,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:18,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:18,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:20:18,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-17 11:20:18,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1817826012, now seen corresponding path program 1 times [2025-03-17 11:20:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849777572] [2025-03-17 11:20:18,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:18,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:20:18,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:20:18,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:18,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:18,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:18,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849777572] [2025-03-17 11:20:18,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849777572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:18,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:18,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:20:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10759335] [2025-03-17 11:20:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:18,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:20:18,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:18,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:20:18,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:20:18,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 669 [2025-03-17 11:20:18,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 629 transitions, 1573 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:18,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:18,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 669 [2025-03-17 11:20:18,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:19,826 INFO L124 PetriNetUnfolderBase]: 479/7925 cut-off events. [2025-03-17 11:20:19,826 INFO L125 PetriNetUnfolderBase]: For 716/978 co-relation queries the response was YES. [2025-03-17 11:20:19,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9318 conditions, 7925 events. 479/7925 cut-off events. For 716/978 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 74881 event pairs, 40 based on Foata normal form. 45/7573 useless extension candidates. Maximal degree in co-relation 9307. Up to 367 conditions per place. [2025-03-17 11:20:19,868 INFO L140 encePairwiseOnDemand]: 663/669 looper letters, 85 selfloop transitions, 4 changer transitions 0/644 dead transitions. [2025-03-17 11:20:19,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 644 transitions, 1807 flow [2025-03-17 11:20:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:20:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:20:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2025-03-17 11:20:19,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8415545590433483 [2025-03-17 11:20:19,873 INFO L175 Difference]: Start difference. First operand has 571 places, 629 transitions, 1573 flow. Second operand 3 states and 1689 transitions. [2025-03-17 11:20:19,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 644 transitions, 1807 flow [2025-03-17 11:20:19,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 644 transitions, 1795 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:20:19,884 INFO L231 Difference]: Finished difference. Result has 572 places, 631 transitions, 1589 flow [2025-03-17 11:20:19,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=669, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1589, PETRI_PLACES=572, PETRI_TRANSITIONS=631} [2025-03-17 11:20:19,886 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2025-03-17 11:20:19,886 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 631 transitions, 1589 flow [2025-03-17 11:20:19,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:19,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:19,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:19,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:20:19,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-17 11:20:19,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1189788659, now seen corresponding path program 1 times [2025-03-17 11:20:19,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:19,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972050700] [2025-03-17 11:20:19,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:19,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:20:19,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:20:19,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:19,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:19,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:19,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972050700] [2025-03-17 11:20:19,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972050700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:19,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:19,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:20:19,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042899565] [2025-03-17 11:20:19,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:19,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:20:19,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:19,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:20:19,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:20:19,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 669 [2025-03-17 11:20:19,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 631 transitions, 1589 flow. Second operand has 3 states, 3 states have (on average 552.3333333333334) internal successors, (1657), 3 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:19,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:19,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 669 [2025-03-17 11:20:19,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:20,881 INFO L124 PetriNetUnfolderBase]: 457/8561 cut-off events. [2025-03-17 11:20:20,881 INFO L125 PetriNetUnfolderBase]: For 725/1176 co-relation queries the response was YES. [2025-03-17 11:20:20,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9978 conditions, 8561 events. 457/8561 cut-off events. For 725/1176 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 83604 event pairs, 77 based on Foata normal form. 10/8158 useless extension candidates. Maximal degree in co-relation 9966. Up to 448 conditions per place. [2025-03-17 11:20:20,916 INFO L140 encePairwiseOnDemand]: 666/669 looper letters, 87 selfloop transitions, 2 changer transitions 0/647 dead transitions. [2025-03-17 11:20:20,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 647 transitions, 1837 flow [2025-03-17 11:20:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:20:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:20:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1688 transitions. [2025-03-17 11:20:20,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.841056302939711 [2025-03-17 11:20:20,921 INFO L175 Difference]: Start difference. First operand has 572 places, 631 transitions, 1589 flow. Second operand 3 states and 1688 transitions. [2025-03-17 11:20:20,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 647 transitions, 1837 flow [2025-03-17 11:20:20,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 647 transitions, 1829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:20:20,933 INFO L231 Difference]: Finished difference. Result has 573 places, 631 transitions, 1589 flow [2025-03-17 11:20:20,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=669, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1589, PETRI_PLACES=573, PETRI_TRANSITIONS=631} [2025-03-17 11:20:20,937 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -4 predicate places. [2025-03-17 11:20:20,937 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 631 transitions, 1589 flow [2025-03-17 11:20:20,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 552.3333333333334) internal successors, (1657), 3 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:20,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:20,939 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:20,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:20:20,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-17 11:20:20,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash 945374276, now seen corresponding path program 1 times [2025-03-17 11:20:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:20,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280715308] [2025-03-17 11:20:20,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:20,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:20:20,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:20:20,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:20,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:20:20,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:20:20,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:20:20,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:20:20,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:20,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:20:21,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:20:21,028 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:20:21,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2025-03-17 11:20:21,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-03-17 11:20:21,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-03-17 11:20:21,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-03-17 11:20:21,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-03-17 11:20:21,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-03-17 11:20:21,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-03-17 11:20:21,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-03-17 11:20:21,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-03-17 11:20:21,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-03-17 11:20:21,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-03-17 11:20:21,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-03-17 11:20:21,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-03-17 11:20:21,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-03-17 11:20:21,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-03-17 11:20:21,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-03-17 11:20:21,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-03-17 11:20:21,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-03-17 11:20:21,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-03-17 11:20:21,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-03-17 11:20:21,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-03-17 11:20:21,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-03-17 11:20:21,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-03-17 11:20:21,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-03-17 11:20:21,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-03-17 11:20:21,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-03-17 11:20:21,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-03-17 11:20:21,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-03-17 11:20:21,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:20:21,033 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 11:20:21,035 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:20:21,035 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:20:21,184 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:20:21,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1050 places, 1215 transitions, 2446 flow [2025-03-17 11:20:21,522 INFO L124 PetriNetUnfolderBase]: 207/1428 cut-off events. [2025-03-17 11:20:21,522 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:20:21,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 1428 events. 207/1428 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 6573 event pairs, 0 based on Foata normal form. 0/1158 useless extension candidates. Maximal degree in co-relation 1222. Up to 12 conditions per place. [2025-03-17 11:20:21,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 1050 places, 1215 transitions, 2446 flow [2025-03-17 11:20:21,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1050 places, 1215 transitions, 2446 flow [2025-03-17 11:20:21,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:20:21,582 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;@74fed84b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:20:21,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-03-17 11:20:21,585 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:20:21,585 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events. [2025-03-17 11:20:21,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:20:21,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:21,585 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] [2025-03-17 11:20:21,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-17 11:20:21,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash 897054478, now seen corresponding path program 1 times [2025-03-17 11:20:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214664978] [2025-03-17 11:20:21,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:21,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:20:21,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:20:21,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:21,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214664978] [2025-03-17 11:20:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214664978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:21,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:21,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:20:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170135721] [2025-03-17 11:20:21,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:21,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:20:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:21,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:20:21,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:20:21,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1011 out of 1215 [2025-03-17 11:20:21,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1050 places, 1215 transitions, 2446 flow. Second operand has 2 states, 2 states have (on average 1011.5) internal successors, (2023), 2 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:21,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:21,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1011 of 1215 [2025-03-17 11:20:21,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:23,533 INFO L124 PetriNetUnfolderBase]: 406/9366 cut-off events. [2025-03-17 11:20:23,533 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-03-17 11:20:23,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9892 conditions, 9366 events. 406/9366 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 101938 event pairs, 208 based on Foata normal form. 3514/12281 useless extension candidates. Maximal degree in co-relation 1332. Up to 449 conditions per place. [2025-03-17 11:20:23,630 INFO L140 encePairwiseOnDemand]: 1041/1215 looper letters, 30 selfloop transitions, 0 changer transitions 0/1037 dead transitions. [2025-03-17 11:20:23,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1015 places, 1037 transitions, 2150 flow [2025-03-17 11:20:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:20:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:20:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2226 transitions. [2025-03-17 11:20:23,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9160493827160494 [2025-03-17 11:20:23,634 INFO L175 Difference]: Start difference. First operand has 1050 places, 1215 transitions, 2446 flow. Second operand 2 states and 2226 transitions. [2025-03-17 11:20:23,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1015 places, 1037 transitions, 2150 flow [2025-03-17 11:20:23,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1037 transitions, 2150 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:23,644 INFO L231 Difference]: Finished difference. Result has 1015 places, 1037 transitions, 2090 flow [2025-03-17 11:20:23,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1215, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1037, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1037, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2090, PETRI_PLACES=1015, PETRI_TRANSITIONS=1037} [2025-03-17 11:20:23,646 INFO L279 CegarLoopForPetriNet]: 1050 programPoint places, -35 predicate places. [2025-03-17 11:20:23,646 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1037 transitions, 2090 flow [2025-03-17 11:20:23,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1011.5) internal successors, (2023), 2 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:23,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:23,647 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] [2025-03-17 11:20:23,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:20:23,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-17 11:20:23,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1185560270, now seen corresponding path program 1 times [2025-03-17 11:20:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518855656] [2025-03-17 11:20:23,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:23,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:23,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 11:20:23,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 11:20:23,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:23,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:24,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:24,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518855656] [2025-03-17 11:20:24,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518855656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:24,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:24,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:20:24,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115448052] [2025-03-17 11:20:24,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:24,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:20:24,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:24,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:20:24,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:20:24,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 992 out of 1215 [2025-03-17 11:20:24,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1037 transitions, 2090 flow. Second operand has 6 states, 6 states have (on average 993.5) internal successors, (5961), 6 states have internal predecessors, (5961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:24,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:24,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 992 of 1215 [2025-03-17 11:20:24,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:20:38,031 INFO L124 PetriNetUnfolderBase]: 11905/85110 cut-off events. [2025-03-17 11:20:38,031 INFO L125 PetriNetUnfolderBase]: For 455/714 co-relation queries the response was YES. [2025-03-17 11:20:38,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100361 conditions, 85110 events. 11905/85110 cut-off events. For 455/714 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 1348869 event pairs, 4885 based on Foata normal form. 60/78172 useless extension candidates. Maximal degree in co-relation 100356. Up to 13826 conditions per place. [2025-03-17 11:20:38,869 INFO L140 encePairwiseOnDemand]: 1182/1215 looper letters, 49 selfloop transitions, 110 changer transitions 0/1147 dead transitions. [2025-03-17 11:20:38,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1147 transitions, 2633 flow [2025-03-17 11:20:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:20:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:20:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6112 transitions. [2025-03-17 11:20:38,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83840877914952 [2025-03-17 11:20:38,879 INFO L175 Difference]: Start difference. First operand has 1015 places, 1037 transitions, 2090 flow. Second operand 6 states and 6112 transitions. [2025-03-17 11:20:38,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1147 transitions, 2633 flow [2025-03-17 11:20:38,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1147 transitions, 2633 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:20:38,892 INFO L231 Difference]: Finished difference. Result has 1025 places, 1146 transitions, 2812 flow [2025-03-17 11:20:38,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1215, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1037, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1005, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2812, PETRI_PLACES=1025, PETRI_TRANSITIONS=1146} [2025-03-17 11:20:38,894 INFO L279 CegarLoopForPetriNet]: 1050 programPoint places, -25 predicate places. [2025-03-17 11:20:38,894 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1146 transitions, 2812 flow [2025-03-17 11:20:38,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 993.5) internal successors, (5961), 6 states have internal predecessors, (5961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:38,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:20:38,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:20:38,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:20:38,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-17 11:20:38,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:20:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1865903768, now seen corresponding path program 1 times [2025-03-17 11:20:38,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:20:38,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578124583] [2025-03-17 11:20:38,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:20:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:20:38,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:20:38,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:20:38,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:20:38,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:20:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:20:38,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:20:38,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578124583] [2025-03-17 11:20:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578124583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:20:38,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:20:38,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:20:38,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014360849] [2025-03-17 11:20:38,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:20:38,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:20:38,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:20:38,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:20:38,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:20:38,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 997 out of 1215 [2025-03-17 11:20:38,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1146 transitions, 2812 flow. Second operand has 3 states, 3 states have (on average 997.6666666666666) internal successors, (2993), 3 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:20:38,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:20:38,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 997 of 1215 [2025-03-17 11:20:38,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:02,649 INFO L124 PetriNetUnfolderBase]: 17307/140402 cut-off events. [2025-03-17 11:21:02,649 INFO L125 PetriNetUnfolderBase]: For 20164/27909 co-relation queries the response was YES. [2025-03-17 11:21:03,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181727 conditions, 140402 events. 17307/140402 cut-off events. For 20164/27909 co-relation queries the response was YES. Maximal size of possible extension queue 1632. Compared 2355590 event pairs, 3795 based on Foata normal form. 801/132394 useless extension candidates. Maximal degree in co-relation 181717. Up to 14105 conditions per place. [2025-03-17 11:21:04,315 INFO L140 encePairwiseOnDemand]: 1201/1215 looper letters, 281 selfloop transitions, 10 changer transitions 0/1289 dead transitions. [2025-03-17 11:21:04,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 1289 transitions, 4159 flow [2025-03-17 11:21:04,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3078 transitions. [2025-03-17 11:21:04,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2025-03-17 11:21:04,319 INFO L175 Difference]: Start difference. First operand has 1025 places, 1146 transitions, 2812 flow. Second operand 3 states and 3078 transitions. [2025-03-17 11:21:04,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 1289 transitions, 4159 flow [2025-03-17 11:21:04,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1289 transitions, 4159 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:21:04,346 INFO L231 Difference]: Finished difference. Result has 1029 places, 1156 transitions, 2900 flow [2025-03-17 11:21:04,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1215, PETRI_DIFFERENCE_MINUEND_FLOW=2812, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2900, PETRI_PLACES=1029, PETRI_TRANSITIONS=1156} [2025-03-17 11:21:04,348 INFO L279 CegarLoopForPetriNet]: 1050 programPoint places, -21 predicate places. [2025-03-17 11:21:04,348 INFO L471 AbstractCegarLoop]: Abstraction has has 1029 places, 1156 transitions, 2900 flow [2025-03-17 11:21:04,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 997.6666666666666) internal successors, (2993), 3 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:04,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:04,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:04,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:21:04,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-17 11:21:04,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2132080092, now seen corresponding path program 1 times [2025-03-17 11:21:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:04,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109526900] [2025-03-17 11:21:04,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:04,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:21:04,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:21:04,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:04,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:04,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:04,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109526900] [2025-03-17 11:21:04,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109526900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:04,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:04,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:04,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254131767] [2025-03-17 11:21:04,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:04,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:04,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:04,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:04,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:04,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1000 out of 1215 [2025-03-17 11:21:04,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1156 transitions, 2900 flow. Second operand has 3 states, 3 states have (on average 1000.6666666666666) internal successors, (3002), 3 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:04,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:04,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1000 of 1215 [2025-03-17 11:21:04,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand