./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/rec_ticketlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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/rec_ticketlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26fb157b5325eaa996338c8b5885df439eefd4a5361a0a1d7cce4088ff8240ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:51:41,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:51:41,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:51:41,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:51:41,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:51:41,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:51:41,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:51:41,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:51:41,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:51:41,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:51:41,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:51:41,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:51:41,305 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:51:41,306 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:51:41,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:51:41,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:51:41,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:51:41,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:51:41,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:51:41,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:51:41,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:51:41,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:51:41,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:51:41,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:51:41,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:51:41,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:51:41,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:51:41,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:51:41,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:51:41,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:51:41,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:51:41,308 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 -> 26fb157b5325eaa996338c8b5885df439eefd4a5361a0a1d7cce4088ff8240ef [2025-03-14 01:51:41,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:51:41,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:51:41,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:51:41,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:51:41,538 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:51:41,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/rec_ticketlock.i [2025-03-14 01:51:42,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa05e8a3/700cf68a63df4c0cb842d740cd52336d/FLAG81d920343 [2025-03-14 01:51:43,149 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:51:43,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/rec_ticketlock.i [2025-03-14 01:51:43,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa05e8a3/700cf68a63df4c0cb842d740cd52336d/FLAG81d920343 [2025-03-14 01:51:43,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa05e8a3/700cf68a63df4c0cb842d740cd52336d [2025-03-14 01:51:43,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:51:43,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:51:43,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:51:43,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:51:43,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:51:43,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:51:43" (1/1) ... [2025-03-14 01:51:43,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dab7d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:43, skipping insertion in model container [2025-03-14 01:51:43,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:51:43" (1/1) ... [2025-03-14 01:51:43,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:51:44,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:51:44,763 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:51:44,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-14 01:51:44,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-14 01:51:44,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-14 01:51:44,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-14 01:51:44,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-14 01:51:44,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-14 01:51:44,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-14 01:51:44,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-14 01:51:44,846 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-14 01:51:44,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-14 01:51:44,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-14 01:51:44,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-14 01:51:44,848 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-14 01:51:44,849 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-14 01:51:44,849 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-14 01:51:44,849 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-14 01:51:44,850 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-14 01:51:44,850 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-14 01:51:44,851 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-14 01:51:44,851 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-14 01:51:44,851 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-14 01:51:44,852 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-14 01:51:44,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-14 01:51:44,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-14 01:51:44,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-14 01:51:44,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-14 01:51:44,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-14 01:51:44,854 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-14 01:51:44,854 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-14 01:51:44,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-14 01:51:44,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-14 01:51:44,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-14 01:51:44,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-14 01:51:44,858 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-14 01:51:44,859 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-14 01:51:44,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-14 01:51:44,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-14 01:51:44,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-14 01:51:44,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-14 01:51:44,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-14 01:51:44,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-14 01:51:44,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-14 01:51:44,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-14 01:51:44,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-14 01:51:44,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-14 01:51:44,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-14 01:51:44,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-14 01:51:44,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-14 01:51:44,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-14 01:51:44,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-14 01:51:44,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-14 01:51:44,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-14 01:51:44,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-14 01:51:44,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-14 01:51:44,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-14 01:51:44,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-14 01:51:44,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-14 01:51:44,872 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-14 01:51:44,872 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-14 01:51:44,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-14 01:51:44,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-14 01:51:44,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-14 01:51:44,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-14 01:51:44,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-14 01:51:44,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-14 01:51:44,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-14 01:51:44,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-14 01:51:44,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-14 01:51:44,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-14 01:51:44,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-14 01:51:44,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-14 01:51:44,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-14 01:51:44,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-14 01:51:44,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-14 01:51:44,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-14 01:51:44,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-14 01:51:44,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-14 01:51:44,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-14 01:51:44,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-14 01:51:44,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-14 01:51:44,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-14 01:51:44,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-14 01:51:44,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-14 01:51:44,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-14 01:51:44,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-14 01:51:44,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-14 01:51:44,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-14 01:51:44,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-14 01:51:44,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-14 01:51:44,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-14 01:51:44,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-14 01:51:44,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-14 01:51:44,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-14 01:51:44,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-14 01:51:44,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-14 01:51:44,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-14 01:51:44,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-14 01:51:44,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-14 01:51:44,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-14 01:51:44,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-14 01:51:44,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:51:45,135 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:51:45,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45 WrapperNode [2025-03-14 01:51:45,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:51:45,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:51:45,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:51:45,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:51:45,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,242 INFO L138 Inliner]: procedures = 923, calls = 949, calls flagged for inlining = 838, calls inlined = 57, statements flattened = 634 [2025-03-14 01:51:45,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:51:45,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:51:45,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:51:45,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:51:45,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,267 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:51:45,276 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:51:45,276 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:51:45,276 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:51:45,278 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (1/1) ... [2025-03-14 01:51:45,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:51:45,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:45,303 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-14 01:51:45,305 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-14 01:51:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:51:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:51:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:51:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:51:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-14 01:51:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-14 01:51:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:51:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:51:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:51:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:51:45,337 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:51:45,455 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:51:45,457 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:51:45,670 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6013: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-14 01:51:45,670 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6013-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-14 01:51:46,197 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:51:46,197 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:51:46,197 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:51:46,197 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-14 01:51:46,197 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-03-14 01:51:46,197 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-14 01:51:46,197 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516: havoc vatomic32_get_inc_#t~ret620#1; [2025-03-14 01:51:46,197 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115: havoc vatomic32_get_inc_rlx_#t~ret156#1; [2025-03-14 01:51:46,198 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:51:46,199 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:51:46,199 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:51:46,352 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:51:46,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:51:46 BoogieIcfgContainer [2025-03-14 01:51:46,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:51:46,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:51:46,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:51:46,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:51:46,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:51:43" (1/3) ... [2025-03-14 01:51:46,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d449b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:51:46, skipping insertion in model container [2025-03-14 01:51:46,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:45" (2/3) ... [2025-03-14 01:51:46,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d449b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:51:46, skipping insertion in model container [2025-03-14 01:51:46,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:51:46" (3/3) ... [2025-03-14 01:51:46,362 INFO L128 eAbstractionObserver]: Analyzing ICFG rec_ticketlock.i [2025-03-14 01:51:46,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:51:46,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rec_ticketlock.i that has 2 procedures, 639 locations, 1 initial locations, 22 loop locations, and 29 error locations. [2025-03-14 01:51:46,375 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:51:46,543 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:51:46,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 642 places, 733 transitions, 1473 flow [2025-03-14 01:51:46,772 INFO L124 PetriNetUnfolderBase]: 108/809 cut-off events. [2025-03-14 01:51:46,774 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:51:46,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 809 events. 108/809 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2597 event pairs, 0 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 691. Up to 8 conditions per place. [2025-03-14 01:51:46,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 642 places, 733 transitions, 1473 flow [2025-03-14 01:51:46,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 642 places, 733 transitions, 1473 flow [2025-03-14 01:51:46,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:46,827 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;@47234748, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:46,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-03-14 01:51:46,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:46,839 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-03-14 01:51:46,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:46,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:46,840 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] [2025-03-14 01:51:46,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-03-14 01:51:46,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1939696470, now seen corresponding path program 1 times [2025-03-14 01:51:46,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:46,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686002322] [2025-03-14 01:51:46,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:46,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:46,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:51:46,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:51:46,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:46,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:47,034 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-14 01:51:47,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:47,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686002322] [2025-03-14 01:51:47,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686002322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:47,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:47,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:47,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580660577] [2025-03-14 01:51:47,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:47,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:51:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:47,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:51:47,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:51:47,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 733 [2025-03-14 01:51:47,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 733 transitions, 1473 flow. Second operand has 2 states, 2 states have (on average 627.5) internal successors, (1255), 2 states have internal predecessors, (1255), 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-14 01:51:47,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:47,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 733 [2025-03-14 01:51:47,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:47,316 INFO L124 PetriNetUnfolderBase]: 14/690 cut-off events. [2025-03-14 01:51:47,316 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:51:47,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 690 events. 14/690 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2222 event pairs, 0 based on Foata normal form. 181/827 useless extension candidates. Maximal degree in co-relation 607. Up to 14 conditions per place. [2025-03-14 01:51:47,321 INFO L140 encePairwiseOnDemand]: 640/733 looper letters, 13 selfloop transitions, 0 changer transitions 0/632 dead transitions. [2025-03-14 01:51:47,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 632 transitions, 1297 flow [2025-03-14 01:51:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:51:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:51:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1360 transitions. [2025-03-14 01:51:47,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927694406548431 [2025-03-14 01:51:47,338 INFO L175 Difference]: Start difference. First operand has 642 places, 733 transitions, 1473 flow. Second operand 2 states and 1360 transitions. [2025-03-14 01:51:47,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 632 transitions, 1297 flow [2025-03-14 01:51:47,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 632 transitions, 1297 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:47,355 INFO L231 Difference]: Finished difference. Result has 622 places, 632 transitions, 1271 flow [2025-03-14 01:51:47,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=733, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1271, PETRI_PLACES=622, PETRI_TRANSITIONS=632} [2025-03-14 01:51:47,362 INFO L279 CegarLoopForPetriNet]: 642 programPoint places, -20 predicate places. [2025-03-14 01:51:47,362 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 632 transitions, 1271 flow [2025-03-14 01:51:47,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 627.5) internal successors, (1255), 2 states have internal predecessors, (1255), 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-14 01:51:47,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:47,364 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-14 01:51:47,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:51:47,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-03-14 01:51:47,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1686832582, now seen corresponding path program 1 times [2025-03-14 01:51:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:47,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252564327] [2025-03-14 01:51:47,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:47,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:47,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:51:47,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:51:47,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:47,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:48,188 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-14 01:51:48,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:48,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252564327] [2025-03-14 01:51:48,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252564327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:48,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:48,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:51:48,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538092081] [2025-03-14 01:51:48,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:48,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:48,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:48,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:48,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:51:48,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 733 [2025-03-14 01:51:48,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 632 transitions, 1271 flow. Second operand has 6 states, 6 states have (on average 581.5) internal successors, (3489), 6 states have internal predecessors, (3489), 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-14 01:51:48,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:48,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 733 [2025-03-14 01:51:48,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:49,679 INFO L124 PetriNetUnfolderBase]: 989/8170 cut-off events. [2025-03-14 01:51:49,679 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:51:49,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9913 conditions, 8170 events. 989/8170 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 87886 event pairs, 387 based on Foata normal form. 0/7471 useless extension candidates. Maximal degree in co-relation 9909. Up to 1491 conditions per place. [2025-03-14 01:51:49,756 INFO L140 encePairwiseOnDemand]: 687/733 looper letters, 59 selfloop transitions, 162 changer transitions 0/793 dead transitions. [2025-03-14 01:51:49,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 793 transitions, 2035 flow [2025-03-14 01:51:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:51:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:51:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3702 transitions. [2025-03-14 01:51:49,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8417462482946794 [2025-03-14 01:51:49,767 INFO L175 Difference]: Start difference. First operand has 622 places, 632 transitions, 1271 flow. Second operand 6 states and 3702 transitions. [2025-03-14 01:51:49,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 793 transitions, 2035 flow [2025-03-14 01:51:49,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 793 transitions, 2035 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:49,782 INFO L231 Difference]: Finished difference. Result has 632 places, 793 transitions, 2331 flow [2025-03-14 01:51:49,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=733, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2331, PETRI_PLACES=632, PETRI_TRANSITIONS=793} [2025-03-14 01:51:49,783 INFO L279 CegarLoopForPetriNet]: 642 programPoint places, -10 predicate places. [2025-03-14 01:51:49,783 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 793 transitions, 2331 flow [2025-03-14 01:51:49,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 581.5) internal successors, (3489), 6 states have internal predecessors, (3489), 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-14 01:51:49,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:49,785 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] [2025-03-14 01:51:49,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:51:49,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-03-14 01:51:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash -84673330, now seen corresponding path program 1 times [2025-03-14 01:51:49,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:49,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317822342] [2025-03-14 01:51:49,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:49,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:49,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-14 01:51:49,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-14 01:51:49,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:49,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:49,819 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-14 01:51:49,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:49,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317822342] [2025-03-14 01:51:49,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317822342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:49,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:49,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343421725] [2025-03-14 01:51:49,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:49,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:49,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:49,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:49,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:49,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 617 out of 733 [2025-03-14 01:51:49,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 793 transitions, 2331 flow. Second operand has 3 states, 3 states have (on average 617.6666666666666) internal successors, (1853), 3 states have internal predecessors, (1853), 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-14 01:51:49,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:49,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 617 of 733 [2025-03-14 01:51:49,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:50,517 INFO L124 PetriNetUnfolderBase]: 540/6961 cut-off events. [2025-03-14 01:51:50,517 INFO L125 PetriNetUnfolderBase]: For 644/970 co-relation queries the response was YES. [2025-03-14 01:51:50,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8832 conditions, 6961 events. 540/6961 cut-off events. For 644/970 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 65742 event pairs, 28 based on Foata normal form. 47/6572 useless extension candidates. Maximal degree in co-relation 8823. Up to 721 conditions per place. [2025-03-14 01:51:50,547 INFO L140 encePairwiseOnDemand]: 724/733 looper letters, 76 selfloop transitions, 6 changer transitions 0/808 dead transitions. [2025-03-14 01:51:50,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 808 transitions, 2547 flow [2025-03-14 01:51:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2025-03-14 01:51:50,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8603910868576625 [2025-03-14 01:51:50,552 INFO L175 Difference]: Start difference. First operand has 632 places, 793 transitions, 2331 flow. Second operand 3 states and 1892 transitions. [2025-03-14 01:51:50,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 808 transitions, 2547 flow [2025-03-14 01:51:50,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 808 transitions, 2547 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:50,571 INFO L231 Difference]: Finished difference. Result has 635 places, 797 transitions, 2377 flow [2025-03-14 01:51:50,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=733, PETRI_DIFFERENCE_MINUEND_FLOW=2329, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2377, PETRI_PLACES=635, PETRI_TRANSITIONS=797} [2025-03-14 01:51:50,573 INFO L279 CegarLoopForPetriNet]: 642 programPoint places, -7 predicate places. [2025-03-14 01:51:50,573 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 797 transitions, 2377 flow [2025-03-14 01:51:50,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.6666666666666) internal successors, (1853), 3 states have internal predecessors, (1853), 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-14 01:51:50,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:50,574 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-14 01:51:50,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:51:50,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-03-14 01:51:50,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash 233339828, now seen corresponding path program 1 times [2025-03-14 01:51:50,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:50,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376985127] [2025-03-14 01:51:50,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:50,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:50,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:51:50,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:51:50,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:50,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:50,599 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-14 01:51:50,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376985127] [2025-03-14 01:51:50,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376985127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:50,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:50,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:50,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731130546] [2025-03-14 01:51:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:50,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:50,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:50,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:50,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:50,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 733 [2025-03-14 01:51:50,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 797 transitions, 2377 flow. Second operand has 3 states, 3 states have (on average 620.6666666666666) internal successors, (1862), 3 states have internal predecessors, (1862), 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-14 01:51:50,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:50,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 733 [2025-03-14 01:51:50,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:51,549 INFO L124 PetriNetUnfolderBase]: 623/9807 cut-off events. [2025-03-14 01:51:51,549 INFO L125 PetriNetUnfolderBase]: For 733/875 co-relation queries the response was YES. [2025-03-14 01:51:51,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12069 conditions, 9807 events. 623/9807 cut-off events. For 733/875 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 98825 event pairs, 48 based on Foata normal form. 19/9276 useless extension candidates. Maximal degree in co-relation 12058. Up to 907 conditions per place. [2025-03-14 01:51:51,586 INFO L140 encePairwiseOnDemand]: 727/733 looper letters, 73 selfloop transitions, 4 changer transitions 0/810 dead transitions. [2025-03-14 01:51:51,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 810 transitions, 2579 flow [2025-03-14 01:51:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1895 transitions. [2025-03-14 01:51:51,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8617553433378808 [2025-03-14 01:51:51,590 INFO L175 Difference]: Start difference. First operand has 635 places, 797 transitions, 2377 flow. Second operand 3 states and 1895 transitions. [2025-03-14 01:51:51,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 810 transitions, 2579 flow [2025-03-14 01:51:51,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 810 transitions, 2567 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:51,604 INFO L231 Difference]: Finished difference. Result has 636 places, 799 transitions, 2393 flow [2025-03-14 01:51:51,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=733, PETRI_DIFFERENCE_MINUEND_FLOW=2363, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2393, PETRI_PLACES=636, PETRI_TRANSITIONS=799} [2025-03-14 01:51:51,605 INFO L279 CegarLoopForPetriNet]: 642 programPoint places, -6 predicate places. [2025-03-14 01:51:51,605 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 799 transitions, 2393 flow [2025-03-14 01:51:51,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.6666666666666) internal successors, (1862), 3 states have internal predecessors, (1862), 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-14 01:51:51,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:51,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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:51,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:51:51,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-03-14 01:51:51,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1347274915, now seen corresponding path program 1 times [2025-03-14 01:51:51,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:51,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795343603] [2025-03-14 01:51:51,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:51,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:51:51,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:51:51,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:51,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:51,663 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-14 01:51:51,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:51,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795343603] [2025-03-14 01:51:51,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795343603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:51,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:51,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:51:51,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982663962] [2025-03-14 01:51:51,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:51,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:51,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:51,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:51,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:51,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 733 [2025-03-14 01:51:51,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 799 transitions, 2393 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-14 01:51:51,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:51,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 733 [2025-03-14 01:51:51,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:52,775 INFO L124 PetriNetUnfolderBase]: 583/9383 cut-off events. [2025-03-14 01:51:52,775 INFO L125 PetriNetUnfolderBase]: For 725/1066 co-relation queries the response was YES. [2025-03-14 01:51:52,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11631 conditions, 9383 events. 583/9383 cut-off events. For 725/1066 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 94596 event pairs, 34 based on Foata normal form. 50/8911 useless extension candidates. Maximal degree in co-relation 11619. Up to 880 conditions per place. [2025-03-14 01:51:52,821 INFO L140 encePairwiseOnDemand]: 730/733 looper letters, 74 selfloop transitions, 2 changer transitions 0/812 dead transitions. [2025-03-14 01:51:52,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 812 transitions, 2601 flow [2025-03-14 01:51:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2025-03-14 01:51:52,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8613005911778081 [2025-03-14 01:51:52,825 INFO L175 Difference]: Start difference. First operand has 636 places, 799 transitions, 2393 flow. Second operand 3 states and 1894 transitions. [2025-03-14 01:51:52,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 812 transitions, 2601 flow [2025-03-14 01:51:52,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 812 transitions, 2593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:52,838 INFO L231 Difference]: Finished difference. Result has 637 places, 799 transitions, 2393 flow [2025-03-14 01:51:52,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=733, PETRI_DIFFERENCE_MINUEND_FLOW=2385, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2393, PETRI_PLACES=637, PETRI_TRANSITIONS=799} [2025-03-14 01:51:52,839 INFO L279 CegarLoopForPetriNet]: 642 programPoint places, -5 predicate places. [2025-03-14 01:51:52,840 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 799 transitions, 2393 flow [2025-03-14 01:51:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-14 01:51:52,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:52,841 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] [2025-03-14 01:51:52,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:51:52,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-03-14 01:51:52,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1678595767, now seen corresponding path program 1 times [2025-03-14 01:51:52,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288375663] [2025-03-14 01:51:52,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:52,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:51:52,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:51:52,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:52,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:52,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:51:52,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:51:52,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:51:52,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:52,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:52,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:51:52,901 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:51:52,902 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 54 remaining) [2025-03-14 01:51:52,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2025-03-14 01:51:52,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2025-03-14 01:51:52,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2025-03-14 01:51:52,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2025-03-14 01:51:52,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2025-03-14 01:51:52,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (47 of 54 remaining) [2025-03-14 01:51:52,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (46 of 54 remaining) [2025-03-14 01:51:52,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2025-03-14 01:51:52,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2025-03-14 01:51:52,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2025-03-14 01:51:52,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2025-03-14 01:51:52,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2025-03-14 01:51:52,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2025-03-14 01:51:52,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2025-03-14 01:51:52,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2025-03-14 01:51:52,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2025-03-14 01:51:52,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2025-03-14 01:51:52,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2025-03-14 01:51:52,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2025-03-14 01:51:52,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2025-03-14 01:51:52,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2025-03-14 01:51:52,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2025-03-14 01:51:52,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2025-03-14 01:51:52,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2025-03-14 01:51:52,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2025-03-14 01:51:52,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2025-03-14 01:51:52,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2025-03-14 01:51:52,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:51:52,908 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-14 01:51:52,910 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:51:52,911 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:51:53,093 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:51:53,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1181 places, 1344 transitions, 2704 flow [2025-03-14 01:51:53,443 INFO L124 PetriNetUnfolderBase]: 205/1560 cut-off events. [2025-03-14 01:51:53,443 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:51:53,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 1560 events. 205/1560 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7659 event pairs, 0 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 1354. Up to 12 conditions per place. [2025-03-14 01:51:53,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 1181 places, 1344 transitions, 2704 flow [2025-03-14 01:51:53,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1181 places, 1344 transitions, 2704 flow [2025-03-14 01:51:53,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:53,526 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;@47234748, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:53,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2025-03-14 01:51:53,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:53,529 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-03-14 01:51:53,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:53,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:53,529 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] [2025-03-14 01:51:53,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-14 01:51:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 356884630, now seen corresponding path program 1 times [2025-03-14 01:51:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646208645] [2025-03-14 01:51:53,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:53,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:51:53,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:51:53,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:53,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:53,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646208645] [2025-03-14 01:51:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646208645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:53,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:53,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:53,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983055256] [2025-03-14 01:51:53,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:53,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:51:53,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:53,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:51:53,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:51:53,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1152 out of 1344 [2025-03-14 01:51:53,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1181 places, 1344 transitions, 2704 flow. Second operand has 2 states, 2 states have (on average 1152.5) internal successors, (2305), 2 states have internal predecessors, (2305), 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-14 01:51:53,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:53,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1152 of 1344 [2025-03-14 01:51:53,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:55,143 INFO L124 PetriNetUnfolderBase]: 326/8968 cut-off events. [2025-03-14 01:51:55,143 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-14 01:51:55,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9372 conditions, 8968 events. 326/8968 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 94007 event pairs, 154 based on Foata normal form. 2837/11164 useless extension candidates. Maximal degree in co-relation 1351. Up to 337 conditions per place. [2025-03-14 01:51:55,238 INFO L140 encePairwiseOnDemand]: 1178/1344 looper letters, 26 selfloop transitions, 0 changer transitions 0/1166 dead transitions. [2025-03-14 01:51:55,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1144 places, 1166 transitions, 2400 flow [2025-03-14 01:51:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:51:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:51:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2496 transitions. [2025-03-14 01:51:55,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2025-03-14 01:51:55,243 INFO L175 Difference]: Start difference. First operand has 1181 places, 1344 transitions, 2704 flow. Second operand 2 states and 2496 transitions. [2025-03-14 01:51:55,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1144 places, 1166 transitions, 2400 flow [2025-03-14 01:51:55,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1144 places, 1166 transitions, 2400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:55,255 INFO L231 Difference]: Finished difference. Result has 1144 places, 1166 transitions, 2348 flow [2025-03-14 01:51:55,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1344, PETRI_DIFFERENCE_MINUEND_FLOW=2348, PETRI_DIFFERENCE_MINUEND_PLACES=1143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2348, PETRI_PLACES=1144, PETRI_TRANSITIONS=1166} [2025-03-14 01:51:55,257 INFO L279 CegarLoopForPetriNet]: 1181 programPoint places, -37 predicate places. [2025-03-14 01:51:55,257 INFO L471 AbstractCegarLoop]: Abstraction has has 1144 places, 1166 transitions, 2348 flow [2025-03-14 01:51:55,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1152.5) internal successors, (2305), 2 states have internal predecessors, (2305), 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-14 01:51:55,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:55,259 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-14 01:51:55,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:51:55,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-14 01:51:55,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1944422266, now seen corresponding path program 1 times [2025-03-14 01:51:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:55,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926700975] [2025-03-14 01:51:55,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:55,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:55,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:51:55,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:51:55,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:55,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:55,697 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-14 01:51:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:55,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926700975] [2025-03-14 01:51:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926700975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:55,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:51:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562855826] [2025-03-14 01:51:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:55,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:55,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:55,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:51:56,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1077 out of 1344 [2025-03-14 01:51:56,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1144 places, 1166 transitions, 2348 flow. Second operand has 6 states, 6 states have (on average 1078.5) internal successors, (6471), 6 states have internal predecessors, (6471), 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-14 01:51:56,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:56,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1077 of 1344 [2025-03-14 01:51:56,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:52:30,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3795] L3779-26-->L3779-19: Formula: (let ((.cse1 (+ 3 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse3 (+ 2 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse0 (select |v_#race_569| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|)) (.cse2 (+ |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15| 1))) (and (= 0 (select .cse0 .cse1)) (= (store |v_#race_570| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15| (store (store (store (store (select |v_#race_570| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15| 0) .cse2 0) .cse3 0) .cse1 0)) |v_#race_569|) (= (select .cse0 .cse3) 0) (= (select .cse0 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|) 0) (= (select (select |v_#memory_int_243| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|) |v_runThread1of2ForFork0_vatomic32_read_#t~mem432#1_9|) (= (select .cse0 .cse2) 0))) InVars {#race=|v_#race_570|, #memory_int=|v_#memory_int_243|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|} OutVars{#race=|v_#race_569|, #memory_int=|v_#memory_int_243|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|, runThread1of2ForFork0_vatomic32_read_#t~mem432#1=|v_runThread1of2ForFork0_vatomic32_read_#t~mem432#1_9|} AuxVars[] AssignedVars[#race, runThread1of2ForFork0_vatomic32_read_#t~mem432#1][225], [1186#true, 1140#L3779-19true, 1182#true, 1058#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 1184#true, 550#L5420-26true, 1180#true]) [2025-03-14 01:52:30,228 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-03-14 01:52:30,228 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 01:52:30,228 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-14 01:52:30,228 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event