./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/mcslock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/mcslock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 185c5ecec118867d41d6d4e251a2153dc547f1cc961cdbc2b790292b6debb75b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:38:07,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:38:07,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:38:07,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:38:07,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:38:07,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:38:07,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:38:07,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:38:07,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:38:07,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:38:07,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:38:07,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:38:07,954 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:38:07,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:38:07,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:38:07,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:38:07,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:38:07,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:38:07,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:38:07,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:38:07,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:38:07,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:38:07,955 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:38:07,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:38:07,955 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:38:07,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:38:07,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:38:07,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:38:07,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:38:07,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:38:07,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:38:07,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:38:07,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:38:07,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:38:07,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:38:07,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:38:07,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:38:07,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:38:07,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:38:07,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:38:07,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:38:07,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:38:07,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 185c5ecec118867d41d6d4e251a2153dc547f1cc961cdbc2b790292b6debb75b [2025-02-06 09:38:08,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:38:08,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:38:08,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:38:08,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:38:08,194 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:38:08,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/mcslock.i [2025-02-06 09:38:09,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f43e28a36/6866a051d7b44dfa820c3abf945c37a6/FLAGd4f75e84d [2025-02-06 09:38:09,980 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:38:09,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/mcslock.i [2025-02-06 09:38:10,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f43e28a36/6866a051d7b44dfa820c3abf945c37a6/FLAGd4f75e84d [2025-02-06 09:38:10,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f43e28a36/6866a051d7b44dfa820c3abf945c37a6 [2025-02-06 09:38:10,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:38:10,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:38:10,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:38:10,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:38:10,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:38:10,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f80d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10, skipping insertion in model container [2025-02-06 09:38:10,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:38:11,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:38:11,778 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:38:11,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-06 09:38:11,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-06 09:38:11,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-06 09:38:11,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-06 09:38:11,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-06 09:38:11,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-06 09:38:11,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-06 09:38:11,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-06 09:38:11,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-06 09:38:11,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-06 09:38:11,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-06 09:38:11,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-06 09:38:11,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-06 09:38:11,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-06 09:38:11,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-06 09:38:11,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-06 09:38:11,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-06 09:38:11,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-06 09:38:11,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-06 09:38:11,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-06 09:38:11,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-06 09:38:11,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-06 09:38:11,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-06 09:38:11,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-06 09:38:11,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-06 09:38:11,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-06 09:38:11,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-06 09:38:11,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-06 09:38:11,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-06 09:38:11,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-06 09:38:11,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-06 09:38:11,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-06 09:38:11,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-06 09:38:11,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-06 09:38:11,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-06 09:38:11,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-06 09:38:11,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-06 09:38:11,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-06 09:38:11,885 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-06 09:38:11,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-06 09:38:11,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-06 09:38:11,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-06 09:38:11,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-06 09:38:11,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-06 09:38:11,889 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-06 09:38:11,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-06 09:38:11,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-06 09:38:11,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-06 09:38:11,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-06 09:38:11,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-06 09:38:11,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-06 09:38:11,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-06 09:38:11,894 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-06 09:38:11,895 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-06 09:38:11,895 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-06 09:38:11,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-06 09:38:11,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-06 09:38:11,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-06 09:38:11,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-06 09:38:11,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-06 09:38:11,899 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-06 09:38:11,899 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-06 09:38:11,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-06 09:38:11,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-06 09:38:11,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-06 09:38:11,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-06 09:38:11,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-06 09:38:11,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-06 09:38:11,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-06 09:38:11,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-06 09:38:11,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-06 09:38:11,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-06 09:38:11,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-06 09:38:11,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-06 09:38:11,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-06 09:38:11,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-06 09:38:11,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-06 09:38:11,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-06 09:38:11,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-06 09:38:11,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-06 09:38:11,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-06 09:38:11,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-06 09:38:11,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-06 09:38:11,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-06 09:38:11,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-06 09:38:11,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-06 09:38:11,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-06 09:38:11,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-06 09:38:11,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-06 09:38:11,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-06 09:38:11,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-06 09:38:11,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-06 09:38:11,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-06 09:38:11,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-06 09:38:11,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-06 09:38:11,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-06 09:38:11,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-06 09:38:11,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-06 09:38:11,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-06 09:38:11,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-06 09:38:12,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:38:12,196 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:38:12,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12 WrapperNode [2025-02-06 09:38:12,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:38:12,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:38:12,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:38:12,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:38:12,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,294 INFO L138 Inliner]: procedures = 919, calls = 935, calls flagged for inlining = 830, calls inlined = 57, statements flattened = 612 [2025-02-06 09:38:12,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:38:12,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:38:12,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:38:12,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:38:12,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,340 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:38:12,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:38:12,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:38:12,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:38:12,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (1/1) ... [2025-02-06 09:38:12,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:38:12,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:12,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:38:12,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:38:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:38:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:38:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:38:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:38:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:38:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-06 09:38:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-06 09:38:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:38:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:38:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:38:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:38:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:38:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:38:12,402 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:38:12,548 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:38:12,554 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:38:12,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-06 09:38:12,834 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-06 09:38:13,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-02-06 09:38:13,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710: havoc vatomicptr_await_neq_rlx_#t~ret421#1.base, vatomicptr_await_neq_rlx_#t~ret421#1.offset; [2025-02-06 09:38:13,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655: havoc vatomicptr_read_rlx_#t~ret412#1.base, vatomicptr_read_rlx_#t~ret412#1.offset; [2025-02-06 09:38:13,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-02-06 09:38:13,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700: havoc vatomicptr_cmpxchg_rel_#t~ret419#1.base, vatomicptr_cmpxchg_rel_#t~ret419#1.offset; [2025-02-06 09:38:13,260 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:38:13,260 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:38:13,377 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:38:13,377 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:38:13,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:38:13 BoogieIcfgContainer [2025-02-06 09:38:13,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:38:13,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:38:13,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:38:13,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:38:13,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:38:10" (1/3) ... [2025-02-06 09:38:13,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb0373d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:38:13, skipping insertion in model container [2025-02-06 09:38:13,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:12" (2/3) ... [2025-02-06 09:38:13,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb0373d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:38:13, skipping insertion in model container [2025-02-06 09:38:13,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:38:13" (3/3) ... [2025-02-06 09:38:13,383 INFO L128 eAbstractionObserver]: Analyzing ICFG mcslock.i [2025-02-06 09:38:13,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:38:13,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mcslock.i that has 2 procedures, 617 locations, 1 initial locations, 45 loop locations, and 25 error locations. [2025-02-06 09:38:13,393 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:38:13,552 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:38:13,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 620 places, 712 transitions, 1431 flow [2025-02-06 09:38:13,794 INFO L124 PetriNetUnfolderBase]: 109/791 cut-off events. [2025-02-06 09:38:13,797 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:38:13,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 791 events. 109/791 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2518 event pairs, 0 based on Foata normal form. 0/649 useless extension candidates. Maximal degree in co-relation 664. Up to 6 conditions per place. [2025-02-06 09:38:13,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 620 places, 712 transitions, 1431 flow [2025-02-06 09:38:13,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 620 places, 712 transitions, 1431 flow [2025-02-06 09:38:13,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:38:13,856 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;@8482b26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:38:13,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-06 09:38:13,871 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:38:13,871 INFO L124 PetriNetUnfolderBase]: 12/71 cut-off events. [2025-02-06 09:38:13,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:38:13,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:13,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:13,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-06 09:38:13,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1625097408, now seen corresponding path program 1 times [2025-02-06 09:38:13,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:13,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706505120] [2025-02-06 09:38:13,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:13,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:14,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:38:14,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:38:14,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:14,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706505120] [2025-02-06 09:38:14,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706505120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:14,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:14,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:14,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219375659] [2025-02-06 09:38:14,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:14,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:38:14,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:14,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:38:14,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:38:14,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 712 [2025-02-06 09:38:14,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 712 transitions, 1431 flow. Second operand has 2 states, 2 states have (on average 600.5) internal successors, (1201), 2 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:14,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:14,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 712 [2025-02-06 09:38:14,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:14,429 INFO L124 PetriNetUnfolderBase]: 14/672 cut-off events. [2025-02-06 09:38:14,429 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:38:14,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 672 events. 14/672 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2024 event pairs, 0 based on Foata normal form. 277/914 useless extension candidates. Maximal degree in co-relation 582. Up to 16 conditions per place. [2025-02-06 09:38:14,435 INFO L140 encePairwiseOnDemand]: 615/712 looper letters, 15 selfloop transitions, 0 changer transitions 0/611 dead transitions. [2025-02-06 09:38:14,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 611 transitions, 1259 flow [2025-02-06 09:38:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:38:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:38:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1312 transitions. [2025-02-06 09:38:14,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9213483146067416 [2025-02-06 09:38:14,446 INFO L175 Difference]: Start difference. First operand has 620 places, 712 transitions, 1431 flow. Second operand 2 states and 1312 transitions. [2025-02-06 09:38:14,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 611 transitions, 1259 flow [2025-02-06 09:38:14,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 611 transitions, 1259 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:14,459 INFO L231 Difference]: Finished difference. Result has 601 places, 611 transitions, 1229 flow [2025-02-06 09:38:14,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=712, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1229, PETRI_PLACES=601, PETRI_TRANSITIONS=611} [2025-02-06 09:38:14,463 INFO L279 CegarLoopForPetriNet]: 620 programPoint places, -19 predicate places. [2025-02-06 09:38:14,463 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 611 transitions, 1229 flow [2025-02-06 09:38:14,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 600.5) internal successors, (1201), 2 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:14,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:14,464 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] [2025-02-06 09:38:14,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:38:14,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-06 09:38:14,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash 118175567, now seen corresponding path program 1 times [2025-02-06 09:38:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:14,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80365086] [2025-02-06 09:38:14,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:14,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:14,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 09:38:14,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 09:38:14,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:14,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:15,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:15,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80365086] [2025-02-06 09:38:15,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80365086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:15,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:15,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:38:15,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972050700] [2025-02-06 09:38:15,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:15,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:15,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:15,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:15,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:38:15,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 712 [2025-02-06 09:38:15,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 611 transitions, 1229 flow. Second operand has 6 states, 6 states have (on average 582.5) internal successors, (3495), 6 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:15,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:15,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 712 [2025-02-06 09:38:15,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:16,123 INFO L124 PetriNetUnfolderBase]: 395/4827 cut-off events. [2025-02-06 09:38:16,124 INFO L125 PetriNetUnfolderBase]: For 20/34 co-relation queries the response was YES. [2025-02-06 09:38:16,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5463 conditions, 4827 events. 395/4827 cut-off events. For 20/34 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 47889 event pairs, 127 based on Foata normal form. 4/4445 useless extension candidates. Maximal degree in co-relation 5459. Up to 540 conditions per place. [2025-02-06 09:38:16,138 INFO L140 encePairwiseOnDemand]: 692/712 looper letters, 33 selfloop transitions, 58 changer transitions 0/668 dead transitions. [2025-02-06 09:38:16,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 668 transitions, 1525 flow [2025-02-06 09:38:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3578 transitions. [2025-02-06 09:38:16,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8375468164794008 [2025-02-06 09:38:16,144 INFO L175 Difference]: Start difference. First operand has 601 places, 611 transitions, 1229 flow. Second operand 6 states and 3578 transitions. [2025-02-06 09:38:16,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 668 transitions, 1525 flow [2025-02-06 09:38:16,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 668 transitions, 1525 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:16,155 INFO L231 Difference]: Finished difference. Result has 611 places, 668 transitions, 1613 flow [2025-02-06 09:38:16,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=712, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1613, PETRI_PLACES=611, PETRI_TRANSITIONS=668} [2025-02-06 09:38:16,156 INFO L279 CegarLoopForPetriNet]: 620 programPoint places, -9 predicate places. [2025-02-06 09:38:16,156 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 668 transitions, 1613 flow [2025-02-06 09:38:16,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 582.5) internal successors, (3495), 6 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:16,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:16,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:16,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:38:16,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-06 09:38:16,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash -102004753, now seen corresponding path program 1 times [2025-02-06 09:38:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:16,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60275523] [2025-02-06 09:38:16,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:16,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:16,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 09:38:16,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 09:38:16,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:16,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:16,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:16,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60275523] [2025-02-06 09:38:16,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60275523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:16,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:16,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:16,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559317898] [2025-02-06 09:38:16,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:16,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:16,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:16,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:16,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:16,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 712 [2025-02-06 09:38:16,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 668 transitions, 1613 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:16,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:16,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 712 [2025-02-06 09:38:16,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:16,945 INFO L124 PetriNetUnfolderBase]: 429/6841 cut-off events. [2025-02-06 09:38:16,946 INFO L125 PetriNetUnfolderBase]: For 623/859 co-relation queries the response was YES. [2025-02-06 09:38:16,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7981 conditions, 6841 events. 429/6841 cut-off events. For 623/859 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 62626 event pairs, 71 based on Foata normal form. 16/6479 useless extension candidates. Maximal degree in co-relation 7972. Up to 325 conditions per place. [2025-02-06 09:38:16,971 INFO L140 encePairwiseOnDemand]: 703/712 looper letters, 88 selfloop transitions, 6 changer transitions 0/685 dead transitions. [2025-02-06 09:38:16,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 685 transitions, 1861 flow [2025-02-06 09:38:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1815 transitions. [2025-02-06 09:38:16,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8497191011235955 [2025-02-06 09:38:16,977 INFO L175 Difference]: Start difference. First operand has 611 places, 668 transitions, 1613 flow. Second operand 3 states and 1815 transitions. [2025-02-06 09:38:16,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 685 transitions, 1861 flow [2025-02-06 09:38:16,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 685 transitions, 1861 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:16,990 INFO L231 Difference]: Finished difference. Result has 614 places, 672 transitions, 1659 flow [2025-02-06 09:38:16,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=712, PETRI_DIFFERENCE_MINUEND_FLOW=1611, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1659, PETRI_PLACES=614, PETRI_TRANSITIONS=672} [2025-02-06 09:38:16,992 INFO L279 CegarLoopForPetriNet]: 620 programPoint places, -6 predicate places. [2025-02-06 09:38:16,992 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 672 transitions, 1659 flow [2025-02-06 09:38:16,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:16,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:16,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:16,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:38:16,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-06 09:38:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash 757729763, now seen corresponding path program 1 times [2025-02-06 09:38:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124842405] [2025-02-06 09:38:16,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:17,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:38:17,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:38:17,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:17,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:17,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:17,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124842405] [2025-02-06 09:38:17,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124842405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:17,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:17,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:17,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024147686] [2025-02-06 09:38:17,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:17,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:17,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:17,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:17,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 712 [2025-02-06 09:38:17,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 672 transitions, 1659 flow. Second operand has 3 states, 3 states have (on average 593.6666666666666) internal successors, (1781), 3 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:17,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:17,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 712 [2025-02-06 09:38:17,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:17,956 INFO L124 PetriNetUnfolderBase]: 507/9354 cut-off events. [2025-02-06 09:38:17,956 INFO L125 PetriNetUnfolderBase]: For 724/872 co-relation queries the response was YES. [2025-02-06 09:38:17,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10763 conditions, 9354 events. 507/9354 cut-off events. For 724/872 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 91250 event pairs, 62 based on Foata normal form. 16/8935 useless extension candidates. Maximal degree in co-relation 10752. Up to 375 conditions per place. [2025-02-06 09:38:18,003 INFO L140 encePairwiseOnDemand]: 706/712 looper letters, 85 selfloop transitions, 4 changer transitions 0/687 dead transitions. [2025-02-06 09:38:18,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 687 transitions, 1893 flow [2025-02-06 09:38:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2025-02-06 09:38:18,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.851123595505618 [2025-02-06 09:38:18,007 INFO L175 Difference]: Start difference. First operand has 614 places, 672 transitions, 1659 flow. Second operand 3 states and 1818 transitions. [2025-02-06 09:38:18,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 687 transitions, 1893 flow [2025-02-06 09:38:18,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 687 transitions, 1881 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:38:18,022 INFO L231 Difference]: Finished difference. Result has 615 places, 674 transitions, 1675 flow [2025-02-06 09:38:18,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=712, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1675, PETRI_PLACES=615, PETRI_TRANSITIONS=674} [2025-02-06 09:38:18,025 INFO L279 CegarLoopForPetriNet]: 620 programPoint places, -5 predicate places. [2025-02-06 09:38:18,025 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 674 transitions, 1675 flow [2025-02-06 09:38:18,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.6666666666666) internal successors, (1781), 3 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:18,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:18,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:18,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:38:18,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-06 09:38:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash -453692480, now seen corresponding path program 1 times [2025-02-06 09:38:18,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:18,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121881220] [2025-02-06 09:38:18,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:18,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:18,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 09:38:18,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 09:38:18,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:18,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:18,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121881220] [2025-02-06 09:38:18,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121881220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:18,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:18,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:38:18,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702083269] [2025-02-06 09:38:18,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:18,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:18,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:18,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:18,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:18,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 712 [2025-02-06 09:38:18,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 674 transitions, 1675 flow. Second operand has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:18,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:18,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 712 [2025-02-06 09:38:18,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:18,853 INFO L124 PetriNetUnfolderBase]: 453/8757 cut-off events. [2025-02-06 09:38:18,853 INFO L125 PetriNetUnfolderBase]: For 707/1223 co-relation queries the response was YES. [2025-02-06 09:38:18,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10175 conditions, 8757 events. 453/8757 cut-off events. For 707/1223 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 85019 event pairs, 38 based on Foata normal form. 61/8429 useless extension candidates. Maximal degree in co-relation 10163. Up to 446 conditions per place. [2025-02-06 09:38:18,886 INFO L140 encePairwiseOnDemand]: 709/712 looper letters, 87 selfloop transitions, 2 changer transitions 0/690 dead transitions. [2025-02-06 09:38:18,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 690 transitions, 1923 flow [2025-02-06 09:38:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1817 transitions. [2025-02-06 09:38:18,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8506554307116105 [2025-02-06 09:38:18,889 INFO L175 Difference]: Start difference. First operand has 615 places, 674 transitions, 1675 flow. Second operand 3 states and 1817 transitions. [2025-02-06 09:38:18,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 690 transitions, 1923 flow [2025-02-06 09:38:18,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 690 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:38:18,899 INFO L231 Difference]: Finished difference. Result has 616 places, 674 transitions, 1675 flow [2025-02-06 09:38:18,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=712, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1675, PETRI_PLACES=616, PETRI_TRANSITIONS=674} [2025-02-06 09:38:18,900 INFO L279 CegarLoopForPetriNet]: 620 programPoint places, -4 predicate places. [2025-02-06 09:38:18,900 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 674 transitions, 1675 flow [2025-02-06 09:38:18,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:18,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:18,901 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:18,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:38:18,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-06 09:38:18,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:18,902 INFO L85 PathProgramCache]: Analyzing trace with hash -332059950, now seen corresponding path program 1 times [2025-02-06 09:38:18,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:18,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373699047] [2025-02-06 09:38:18,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:18,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 09:38:18,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 09:38:18,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:18,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:38:18,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:38:18,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 09:38:18,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 09:38:18,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:18,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:38:18,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:38:18,963 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:38:18,963 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2025-02-06 09:38:18,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-02-06 09:38:18,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-02-06 09:38:18,965 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-02-06 09:38:18,965 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-02-06 09:38:18,965 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-02-06 09:38:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-02-06 09:38:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-02-06 09:38:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-02-06 09:38:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-02-06 09:38:18,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:38:18,968 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:38:18,970 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:38:18,970 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:38:19,114 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:38:19,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1128 places, 1293 transitions, 2602 flow [2025-02-06 09:38:19,409 INFO L124 PetriNetUnfolderBase]: 207/1515 cut-off events. [2025-02-06 09:38:19,409 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:38:19,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 1515 events. 207/1515 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 7145 event pairs, 0 based on Foata normal form. 0/1245 useless extension candidates. Maximal degree in co-relation 1297. Up to 12 conditions per place. [2025-02-06 09:38:19,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 1128 places, 1293 transitions, 2602 flow [2025-02-06 09:38:19,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1128 places, 1293 transitions, 2602 flow [2025-02-06 09:38:19,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:38:19,485 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;@8482b26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:38:19,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-02-06 09:38:19,488 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:38:19,488 INFO L124 PetriNetUnfolderBase]: 12/71 cut-off events. [2025-02-06 09:38:19,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:38:19,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:19,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:19,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-02-06 09:38:19,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2135780288, now seen corresponding path program 1 times [2025-02-06 09:38:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:19,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526446595] [2025-02-06 09:38:19,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:19,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:38:19,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:38:19,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:19,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:19,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:19,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526446595] [2025-02-06 09:38:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526446595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:19,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:19,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785197272] [2025-02-06 09:38:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:19,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:38:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:19,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:38:19,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:38:19,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1089 out of 1293 [2025-02-06 09:38:19,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1128 places, 1293 transitions, 2602 flow. Second operand has 2 states, 2 states have (on average 1089.5) internal successors, (2179), 2 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:19,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:19,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1089 of 1293 [2025-02-06 09:38:19,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:21,246 INFO L124 PetriNetUnfolderBase]: 406/9986 cut-off events. [2025-02-06 09:38:21,247 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-02-06 09:38:21,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10512 conditions, 9986 events. 406/9986 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 109008 event pairs, 208 based on Foata normal form. 5028/14415 useless extension candidates. Maximal degree in co-relation 1396. Up to 449 conditions per place. [2025-02-06 09:38:21,387 INFO L140 encePairwiseOnDemand]: 1119/1293 looper letters, 30 selfloop transitions, 0 changer transitions 0/1115 dead transitions. [2025-02-06 09:38:21,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1093 places, 1115 transitions, 2306 flow [2025-02-06 09:38:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:38:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:38:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2382 transitions. [2025-02-06 09:38:21,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9211136890951276 [2025-02-06 09:38:21,394 INFO L175 Difference]: Start difference. First operand has 1128 places, 1293 transitions, 2602 flow. Second operand 2 states and 2382 transitions. [2025-02-06 09:38:21,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1093 places, 1115 transitions, 2306 flow [2025-02-06 09:38:21,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1093 places, 1115 transitions, 2306 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:21,405 INFO L231 Difference]: Finished difference. Result has 1093 places, 1115 transitions, 2246 flow [2025-02-06 09:38:21,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1293, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=1092, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2246, PETRI_PLACES=1093, PETRI_TRANSITIONS=1115} [2025-02-06 09:38:21,406 INFO L279 CegarLoopForPetriNet]: 1128 programPoint places, -35 predicate places. [2025-02-06 09:38:21,406 INFO L471 AbstractCegarLoop]: Abstraction has has 1093 places, 1115 transitions, 2246 flow [2025-02-06 09:38:21,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1089.5) internal successors, (2179), 2 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:21,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:21,407 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] [2025-02-06 09:38:21,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:38:21,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-02-06 09:38:21,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:21,408 INFO L85 PathProgramCache]: Analyzing trace with hash -203478884, now seen corresponding path program 1 times [2025-02-06 09:38:21,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:21,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833662005] [2025-02-06 09:38:21,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:21,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:21,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 09:38:21,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 09:38:21,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:21,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:21,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833662005] [2025-02-06 09:38:21,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833662005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:21,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:21,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:38:21,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575311807] [2025-02-06 09:38:21,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:21,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:21,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:21,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:38:21,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1293 [2025-02-06 09:38:21,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1093 places, 1115 transitions, 2246 flow. Second operand has 6 states, 6 states have (on average 1071.5) internal successors, (6429), 6 states have internal predecessors, (6429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:21,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:21,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1293 [2025-02-06 09:38:21,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:34,814 INFO L124 PetriNetUnfolderBase]: 11371/80995 cut-off events. [2025-02-06 09:38:34,814 INFO L125 PetriNetUnfolderBase]: For 625/846 co-relation queries the response was YES. [2025-02-06 09:38:35,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95890 conditions, 80995 events. 11371/80995 cut-off events. For 625/846 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 1294394 event pairs, 4983 based on Foata normal form. 60/74915 useless extension candidates. Maximal degree in co-relation 95885. Up to 13470 conditions per place. [2025-02-06 09:38:35,895 INFO L140 encePairwiseOnDemand]: 1260/1293 looper letters, 49 selfloop transitions, 110 changer transitions 0/1225 dead transitions. [2025-02-06 09:38:35,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1098 places, 1225 transitions, 2789 flow [2025-02-06 09:38:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6580 transitions. [2025-02-06 09:38:35,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481567414282032 [2025-02-06 09:38:35,908 INFO L175 Difference]: Start difference. First operand has 1093 places, 1115 transitions, 2246 flow. Second operand 6 states and 6580 transitions. [2025-02-06 09:38:35,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1098 places, 1225 transitions, 2789 flow [2025-02-06 09:38:35,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1098 places, 1225 transitions, 2789 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:35,924 INFO L231 Difference]: Finished difference. Result has 1103 places, 1224 transitions, 2968 flow [2025-02-06 09:38:35,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1293, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=1093, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1083, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2968, PETRI_PLACES=1103, PETRI_TRANSITIONS=1224} [2025-02-06 09:38:35,926 INFO L279 CegarLoopForPetriNet]: 1128 programPoint places, -25 predicate places. [2025-02-06 09:38:35,926 INFO L471 AbstractCegarLoop]: Abstraction has has 1103 places, 1224 transitions, 2968 flow [2025-02-06 09:38:35,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1071.5) internal successors, (6429), 6 states have internal predecessors, (6429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:35,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:35,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:35,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:38:35,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-02-06 09:38:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 737342140, now seen corresponding path program 1 times [2025-02-06 09:38:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800572027] [2025-02-06 09:38:35,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:35,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 09:38:35,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 09:38:35,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:35,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:35,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:35,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800572027] [2025-02-06 09:38:35,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800572027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:35,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185152194] [2025-02-06 09:38:35,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:35,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:35,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:35,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:35,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1293 [2025-02-06 09:38:35,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1103 places, 1224 transitions, 2968 flow. Second operand has 3 states, 3 states have (on average 1075.6666666666667) internal successors, (3227), 3 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:38:35,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:35,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1293 [2025-02-06 09:38:35,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand