./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/hclhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/hclhlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:51:26,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:51:26,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:51:26,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:51:26,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:51:26,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:51:26,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:51:26,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:51:26,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:51:26,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:51:26,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:51:26,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:51:26,492 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:51:26,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:51:26,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:51:26,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:51:26,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:51:26,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:51:26,494 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-03-14 01:51:26,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:51:26,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:51:26,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:51:26,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:51:26,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:51:26,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-03-14 01:51:27,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ba5bf85/f8b3a1e1f9a44a45b155ee34f408d611/FLAG721bca5f9 [2025-03-14 01:51:28,384 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:51:28,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-03-14 01:51:28,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ba5bf85/f8b3a1e1f9a44a45b155ee34f408d611/FLAG721bca5f9 [2025-03-14 01:51:28,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ba5bf85/f8b3a1e1f9a44a45b155ee34f408d611 [2025-03-14 01:51:28,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:51:28,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:51:28,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:51:28,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:51:28,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:51:28,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:51:28" (1/1) ... [2025-03-14 01:51:28,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17af8a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:28, skipping insertion in model container [2025-03-14 01:51:28,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:51:28" (1/1) ... [2025-03-14 01:51:28,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:51:31,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:51:31,051 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:51:31,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-14 01:51:31,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-14 01:51:31,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-14 01:51:31,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-14 01:51:31,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-14 01:51:31,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-14 01:51:31,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-14 01:51:31,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-14 01:51:31,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-14 01:51:31,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-14 01:51:31,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-14 01:51:31,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-14 01:51:31,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-14 01:51:31,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-14 01:51:31,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-14 01:51:31,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-14 01:51:31,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-14 01:51:31,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-14 01:51:31,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-14 01:51:31,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-14 01:51:31,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-14 01:51:31,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-14 01:51:31,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-14 01:51:31,158 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-14 01:51:31,158 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-14 01:51:31,158 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-14 01:51:31,158 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-14 01:51:31,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-14 01:51:31,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-14 01:51:31,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-14 01:51:31,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-14 01:51:31,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-14 01:51:31,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-14 01:51:31,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-14 01:51:31,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-14 01:51:31,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-14 01:51:31,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-14 01:51:31,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-14 01:51:31,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-14 01:51:31,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-14 01:51:31,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-14 01:51:31,165 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-14 01:51:31,165 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-14 01:51:31,166 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-14 01:51:31,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-14 01:51:31,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-14 01:51:31,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-14 01:51:31,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-14 01:51:31,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-14 01:51:31,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-14 01:51:31,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-14 01:51:31,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-14 01:51:31,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-14 01:51:31,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-14 01:51:31,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-14 01:51:31,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-14 01:51:31,174 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-14 01:51:31,174 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-14 01:51:31,174 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-14 01:51:31,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-14 01:51:31,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-14 01:51:31,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-14 01:51:31,176 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-14 01:51:31,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-14 01:51:31,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-14 01:51:31,178 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-14 01:51:31,178 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-14 01:51:31,179 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-14 01:51:31,180 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-14 01:51:31,181 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-14 01:51:31,181 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-14 01:51:31,181 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-14 01:51:31,182 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-14 01:51:31,183 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-14 01:51:31,184 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-14 01:51:31,184 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-14 01:51:31,185 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-14 01:51:31,186 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-14 01:51:31,187 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-14 01:51:31,188 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-14 01:51:31,189 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-14 01:51:31,189 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-14 01:51:31,190 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-14 01:51:31,191 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-14 01:51:31,191 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-14 01:51:31,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-14 01:51:31,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-14 01:51:31,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-14 01:51:31,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-14 01:51:31,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-14 01:51:31,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-14 01:51:31,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-14 01:51:31,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-14 01:51:31,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-14 01:51:31,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-14 01:51:31,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-14 01:51:31,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-14 01:51:31,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-14 01:51:31,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-14 01:51:31,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-14 01:51:31,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:51:31,447 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:51:31,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31 WrapperNode [2025-03-14 01:51:31,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:51:31,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:51:31,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:51:31,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:51:31,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,555 INFO L138 Inliner]: procedures = 921, calls = 972, calls flagged for inlining = 848, calls inlined = 84, statements flattened = 1082 [2025-03-14 01:51:31,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:51:31,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:51:31,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:51:31,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:51:31,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:51:31,626 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:51:31,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:51:31,627 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:51:31,627 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (1/1) ... [2025-03-14 01:51:31,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:51:31,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:31,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:51:31,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:51:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:51:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:51:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:51:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:51:31,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:51:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-14 01:51:31,678 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-14 01:51:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:51:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:51:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:51:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:51:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 01:51:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:51:31,679 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:51:31,833 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:51:31,834 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:51:32,329 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-14 01:51:32,330 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-14 01:51:33,103 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:51:33,104 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:51:33,104 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:51:33,104 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-27: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:51:33,104 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-14 01:51:33,104 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-9: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-14 01:51:33,104 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-14 01:51:33,104 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-9: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-14 01:51:33,104 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-14 01:51:33,105 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-03-14 01:51:33,106 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:51:33,107 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:51:33,108 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:51:33,325 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:51:33,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:51:33 BoogieIcfgContainer [2025-03-14 01:51:33,328 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:51:33,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:51:33,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:51:33,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:51:33,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:51:28" (1/3) ... [2025-03-14 01:51:33,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68113389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:51:33, skipping insertion in model container [2025-03-14 01:51:33,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:31" (2/3) ... [2025-03-14 01:51:33,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68113389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:51:33, skipping insertion in model container [2025-03-14 01:51:33,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:51:33" (3/3) ... [2025-03-14 01:51:33,337 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-03-14 01:51:33,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:51:33,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 1057 locations, 1 initial locations, 42 loop locations, and 42 error locations. [2025-03-14 01:51:33,352 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:51:33,630 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:51:33,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1060 places, 1226 transitions, 2459 flow [2025-03-14 01:51:34,081 INFO L124 PetriNetUnfolderBase]: 183/1302 cut-off events. [2025-03-14 01:51:34,085 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:51:34,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 1302 events. 183/1302 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4403 event pairs, 0 based on Foata normal form. 0/1069 useless extension candidates. Maximal degree in co-relation 987. Up to 8 conditions per place. [2025-03-14 01:51:34,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 1060 places, 1226 transitions, 2459 flow [2025-03-14 01:51:34,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1060 places, 1226 transitions, 2459 flow [2025-03-14 01:51:34,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:34,181 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;@26bb48aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:34,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-03-14 01:51:34,194 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:34,195 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-03-14 01:51:34,195 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:34,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:34,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:34,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:34,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:34,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1925326019, now seen corresponding path program 1 times [2025-03-14 01:51:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:34,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964140664] [2025-03-14 01:51:34,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:34,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:34,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-14 01:51:34,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-14 01:51:34,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:34,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:34,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964140664] [2025-03-14 01:51:34,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964140664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:34,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:51:34,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631201053] [2025-03-14 01:51:34,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:34,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:51:34,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:34,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:51:34,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:51:34,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1040 out of 1226 [2025-03-14 01:51:34,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1060 places, 1226 transitions, 2459 flow. Second operand has 2 states, 2 states have (on average 1040.5) internal successors, (2081), 2 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:34,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:34,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1040 of 1226 [2025-03-14 01:51:34,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:35,061 INFO L124 PetriNetUnfolderBase]: 33/1090 cut-off events. [2025-03-14 01:51:35,061 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:51:35,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 1090 events. 33/1090 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2901 event pairs, 0 based on Foata normal form. 272/1281 useless extension candidates. Maximal degree in co-relation 850. Up to 30 conditions per place. [2025-03-14 01:51:35,075 INFO L140 encePairwiseOnDemand]: 1069/1226 looper letters, 29 selfloop transitions, 0 changer transitions 12/1032 dead transitions. [2025-03-14 01:51:35,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1032 transitions, 2129 flow [2025-03-14 01:51:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:51:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:51:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2266 transitions. [2025-03-14 01:51:35,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241435562805873 [2025-03-14 01:51:35,095 INFO L175 Difference]: Start difference. First operand has 1060 places, 1226 transitions, 2459 flow. Second operand 2 states and 2266 transitions. [2025-03-14 01:51:35,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 1032 transitions, 2129 flow [2025-03-14 01:51:35,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1003 places, 1032 transitions, 2129 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:35,123 INFO L231 Difference]: Finished difference. Result has 1003 places, 1020 transitions, 2047 flow [2025-03-14 01:51:35,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1032, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2047, PETRI_PLACES=1003, PETRI_TRANSITIONS=1020} [2025-03-14 01:51:35,130 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -57 predicate places. [2025-03-14 01:51:35,131 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 1020 transitions, 2047 flow [2025-03-14 01:51:35,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1040.5) internal successors, (2081), 2 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:35,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:35,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:35,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:51:35,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:35,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:35,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1243511262, now seen corresponding path program 1 times [2025-03-14 01:51:35,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:35,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069666371] [2025-03-14 01:51:35,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:35,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:35,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-14 01:51:35,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-14 01:51:35,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:35,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:35,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:35,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069666371] [2025-03-14 01:51:35,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069666371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:35,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:35,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:51:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163952806] [2025-03-14 01:51:35,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:35,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:35,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:35,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:35,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:35,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1034 out of 1226 [2025-03-14 01:51:35,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 1020 transitions, 2047 flow. Second operand has 3 states, 3 states have (on average 1036.3333333333333) internal successors, (3109), 3 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:35,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:35,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1034 of 1226 [2025-03-14 01:51:35,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:35,692 INFO L124 PetriNetUnfolderBase]: 33/1096 cut-off events. [2025-03-14 01:51:35,692 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:51:35,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 1096 events. 33/1096 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2823 event pairs, 0 based on Foata normal form. 1/1021 useless extension candidates. Maximal degree in co-relation 1136. Up to 33 conditions per place. [2025-03-14 01:51:35,704 INFO L140 encePairwiseOnDemand]: 1223/1226 looper letters, 35 selfloop transitions, 2 changer transitions 0/1022 dead transitions. [2025-03-14 01:51:35,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1022 transitions, 2125 flow [2025-03-14 01:51:35,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3140 transitions. [2025-03-14 01:51:35,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8537248504622077 [2025-03-14 01:51:35,713 INFO L175 Difference]: Start difference. First operand has 1003 places, 1020 transitions, 2047 flow. Second operand 3 states and 3140 transitions. [2025-03-14 01:51:35,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1022 transitions, 2125 flow [2025-03-14 01:51:35,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1022 transitions, 2125 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:35,734 INFO L231 Difference]: Finished difference. Result has 994 places, 1021 transitions, 2059 flow [2025-03-14 01:51:35,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2047, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2059, PETRI_PLACES=994, PETRI_TRANSITIONS=1021} [2025-03-14 01:51:35,736 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -66 predicate places. [2025-03-14 01:51:35,736 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1021 transitions, 2059 flow [2025-03-14 01:51:35,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1036.3333333333333) internal successors, (3109), 3 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:35,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:35,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:35,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:51:35,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:35,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2084269247, now seen corresponding path program 1 times [2025-03-14 01:51:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:35,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132881624] [2025-03-14 01:51:35,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:35,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:35,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-14 01:51:35,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-14 01:51:35,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:35,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:35,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:35,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132881624] [2025-03-14 01:51:35,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132881624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:51:35,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957982920] [2025-03-14 01:51:35,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:35,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:35,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:35,984 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:51:35,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:51:36,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-14 01:51:36,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-14 01:51:36,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:36,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:36,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:51:36,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:51:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:36,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:51:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:51:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957982920] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:51:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:51:36,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-03-14 01:51:36,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6025688] [2025-03-14 01:51:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:36,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:36,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:36,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:51:36,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1033 out of 1226 [2025-03-14 01:51:36,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1021 transitions, 2059 flow. Second operand has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:36,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:36,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1033 of 1226 [2025-03-14 01:51:36,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:36,516 INFO L124 PetriNetUnfolderBase]: 33/1097 cut-off events. [2025-03-14 01:51:36,517 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:51:36,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 1097 events. 33/1097 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2377 event pairs, 0 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1143. Up to 33 conditions per place. [2025-03-14 01:51:36,528 INFO L140 encePairwiseOnDemand]: 1222/1226 looper letters, 34 selfloop transitions, 3 changer transitions 0/1022 dead transitions. [2025-03-14 01:51:36,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1022 transitions, 2135 flow [2025-03-14 01:51:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3137 transitions. [2025-03-14 01:51:36,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8529091897770528 [2025-03-14 01:51:36,537 INFO L175 Difference]: Start difference. First operand has 994 places, 1021 transitions, 2059 flow. Second operand 3 states and 3137 transitions. [2025-03-14 01:51:36,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1022 transitions, 2135 flow [2025-03-14 01:51:36,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 1022 transitions, 2133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:51:36,558 INFO L231 Difference]: Finished difference. Result has 997 places, 1022 transitions, 2075 flow [2025-03-14 01:51:36,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2075, PETRI_PLACES=997, PETRI_TRANSITIONS=1022} [2025-03-14 01:51:36,561 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -63 predicate places. [2025-03-14 01:51:36,561 INFO L471 AbstractCegarLoop]: Abstraction has has 997 places, 1022 transitions, 2075 flow [2025-03-14 01:51:36,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:36,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:36,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:36,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 01:51:36,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:36,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:36,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash 691774896, now seen corresponding path program 1 times [2025-03-14 01:51:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:36,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880479421] [2025-03-14 01:51:36,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:36,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-14 01:51:36,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-14 01:51:36,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:36,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:37,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880479421] [2025-03-14 01:51:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880479421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:51:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986658722] [2025-03-14 01:51:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:37,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:37,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:37,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:51:37,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:51:37,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-14 01:51:37,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-14 01:51:37,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:37,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:37,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-14 01:51:37,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:51:37,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-14 01:51:37,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-14 01:51:37,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:51:37,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-14 01:51:37,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:51:37,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-14 01:51:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:51:37,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:51:37,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986658722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:37,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:51:37,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-14 01:51:37,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229356802] [2025-03-14 01:51:37,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:37,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:37,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:37,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:37,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:51:37,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1226 [2025-03-14 01:51:37,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 997 places, 1022 transitions, 2075 flow. Second operand has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:37,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:37,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1226 [2025-03-14 01:51:37,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:39,184 INFO L124 PetriNetUnfolderBase]: 690/7587 cut-off events. [2025-03-14 01:51:39,184 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 01:51:39,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8643 conditions, 7587 events. 690/7587 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 64266 event pairs, 432 based on Foata normal form. 0/7077 useless extension candidates. Maximal degree in co-relation 8636. Up to 1029 conditions per place. [2025-03-14 01:51:39,226 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 82 selfloop transitions, 5 changer transitions 0/1021 dead transitions. [2025-03-14 01:51:39,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1021 transitions, 2247 flow [2025-03-14 01:51:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:51:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:51:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5974 transitions. [2025-03-14 01:51:39,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.812126155519304 [2025-03-14 01:51:39,236 INFO L175 Difference]: Start difference. First operand has 997 places, 1022 transitions, 2075 flow. Second operand 6 states and 5974 transitions. [2025-03-14 01:51:39,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1021 transitions, 2247 flow [2025-03-14 01:51:39,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 1021 transitions, 2241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:39,317 INFO L231 Difference]: Finished difference. Result has 999 places, 1021 transitions, 2077 flow [2025-03-14 01:51:39,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2077, PETRI_PLACES=999, PETRI_TRANSITIONS=1021} [2025-03-14 01:51:39,323 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -61 predicate places. [2025-03-14 01:51:39,323 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1021 transitions, 2077 flow [2025-03-14 01:51:39,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:39,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:39,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:39,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:51:39,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-14 01:51:39,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:39,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:39,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1632898928, now seen corresponding path program 1 times [2025-03-14 01:51:39,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:39,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114106594] [2025-03-14 01:51:39,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:39,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:39,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-14 01:51:39,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-14 01:51:39,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:39,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114106594] [2025-03-14 01:51:39,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114106594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:51:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433392597] [2025-03-14 01:51:39,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:39,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:39,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:39,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:51:39,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:51:39,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-14 01:51:39,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-14 01:51:39,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:39,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:39,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-14 01:51:39,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:51:39,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-14 01:51:39,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-14 01:51:39,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:51:39,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-14 01:51:39,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:51:39,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-14 01:51:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:51:39,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:51:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433392597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:51:39,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-14 01:51:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163537670] [2025-03-14 01:51:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:39,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:39,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:39,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:51:40,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1226 [2025-03-14 01:51:40,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1021 transitions, 2077 flow. Second operand has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:40,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:40,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1226 [2025-03-14 01:51:40,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:41,484 INFO L124 PetriNetUnfolderBase]: 690/7586 cut-off events. [2025-03-14 01:51:41,485 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:51:41,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8644 conditions, 7586 events. 690/7586 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 64149 event pairs, 432 based on Foata normal form. 0/7076 useless extension candidates. Maximal degree in co-relation 8637. Up to 1029 conditions per place. [2025-03-14 01:51:41,516 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 82 selfloop transitions, 5 changer transitions 0/1020 dead transitions. [2025-03-14 01:51:41,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1020 transitions, 2249 flow [2025-03-14 01:51:41,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:51:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:51:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5974 transitions. [2025-03-14 01:51:41,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.812126155519304 [2025-03-14 01:51:41,527 INFO L175 Difference]: Start difference. First operand has 999 places, 1021 transitions, 2077 flow. Second operand 6 states and 5974 transitions. [2025-03-14 01:51:41,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 1020 transitions, 2249 flow [2025-03-14 01:51:41,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1020 transitions, 2239 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:51:41,541 INFO L231 Difference]: Finished difference. Result has 998 places, 1020 transitions, 2075 flow [2025-03-14 01:51:41,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2075, PETRI_PLACES=998, PETRI_TRANSITIONS=1020} [2025-03-14 01:51:41,543 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -62 predicate places. [2025-03-14 01:51:41,543 INFO L471 AbstractCegarLoop]: Abstraction has has 998 places, 1020 transitions, 2075 flow [2025-03-14 01:51:41,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:41,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:41,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:41,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:51:41,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:41,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:41,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:41,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1866381674, now seen corresponding path program 1 times [2025-03-14 01:51:41,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:41,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755876921] [2025-03-14 01:51:41,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:41,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:41,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-14 01:51:41,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-14 01:51:41,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:41,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:51:41,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:41,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755876921] [2025-03-14 01:51:41,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755876921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:51:41,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636440507] [2025-03-14 01:51:41,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:41,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:41,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:41,990 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:51:41,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:51:42,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-14 01:51:42,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-14 01:51:42,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:42,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:42,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-14 01:51:42,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:51:42,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-14 01:51:42,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-14 01:51:42,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:51:42,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-14 01:51:42,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:51:42,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-14 01:51:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:51:43,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:51:43,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2025-03-14 01:51:43,508 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2025-03-14 01:51:43,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 1 [2025-03-14 01:51:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:51:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636440507] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:51:43,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:51:43,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 19] total 27 [2025-03-14 01:51:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352997726] [2025-03-14 01:51:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:43,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:43,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:43,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:43,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-03-14 01:51:44,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 973 out of 1226 [2025-03-14 01:51:44,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1020 transitions, 2075 flow. Second operand has 6 states, 6 states have (on average 976.5) internal successors, (5859), 6 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:44,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:44,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 973 of 1226 [2025-03-14 01:51:44,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:46,892 INFO L124 PetriNetUnfolderBase]: 1645/15129 cut-off events. [2025-03-14 01:51:46,893 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:51:46,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17727 conditions, 15129 events. 1645/15129 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 154556 event pairs, 545 based on Foata normal form. 0/14042 useless extension candidates. Maximal degree in co-relation 17720. Up to 2161 conditions per place. [2025-03-14 01:51:46,944 INFO L140 encePairwiseOnDemand]: 1165/1226 looper letters, 123 selfloop transitions, 222 changer transitions 0/1269 dead transitions. [2025-03-14 01:51:46,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1269 transitions, 3263 flow [2025-03-14 01:51:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:51:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:51:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6184 transitions. [2025-03-14 01:51:46,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8406742794997281 [2025-03-14 01:51:46,953 INFO L175 Difference]: Start difference. First operand has 998 places, 1020 transitions, 2075 flow. Second operand 6 states and 6184 transitions. [2025-03-14 01:51:46,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 1269 transitions, 3263 flow [2025-03-14 01:51:46,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1269 transitions, 3253 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:51:46,970 INFO L231 Difference]: Finished difference. Result has 1003 places, 1241 transitions, 3515 flow [2025-03-14 01:51:46,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=960, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3515, PETRI_PLACES=1003, PETRI_TRANSITIONS=1241} [2025-03-14 01:51:46,973 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -57 predicate places. [2025-03-14 01:51:46,973 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 1241 transitions, 3515 flow [2025-03-14 01:51:46,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 976.5) internal successors, (5859), 6 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:46,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:46,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:46,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:51:47,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:47,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash -125019229, now seen corresponding path program 1 times [2025-03-14 01:51:47,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:47,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053715157] [2025-03-14 01:51:47,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:47,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-14 01:51:47,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-14 01:51:47,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:47,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:51:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053715157] [2025-03-14 01:51:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053715157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:47,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048614882] [2025-03-14 01:51:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:47,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:47,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:47,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:47,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1030 out of 1226 [2025-03-14 01:51:47,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 1241 transitions, 3515 flow. Second operand has 3 states, 3 states have (on average 1032.0) internal successors, (3096), 3 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:47,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:47,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1030 of 1226 [2025-03-14 01:51:47,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:49,035 INFO L124 PetriNetUnfolderBase]: 889/10500 cut-off events. [2025-03-14 01:51:49,035 INFO L125 PetriNetUnfolderBase]: For 811/1149 co-relation queries the response was YES. [2025-03-14 01:51:49,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13153 conditions, 10500 events. 889/10500 cut-off events. For 811/1149 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 87007 event pairs, 55 based on Foata normal form. 43/9705 useless extension candidates. Maximal degree in co-relation 13142. Up to 1000 conditions per place. [2025-03-14 01:51:49,097 INFO L140 encePairwiseOnDemand]: 1217/1226 looper letters, 114 selfloop transitions, 6 changer transitions 0/1266 dead transitions. [2025-03-14 01:51:49,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1004 places, 1266 transitions, 3833 flow [2025-03-14 01:51:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3157 transitions. [2025-03-14 01:51:49,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.858346927678086 [2025-03-14 01:51:49,102 INFO L175 Difference]: Start difference. First operand has 1003 places, 1241 transitions, 3515 flow. Second operand 3 states and 3157 transitions. [2025-03-14 01:51:49,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1004 places, 1266 transitions, 3833 flow [2025-03-14 01:51:49,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 1266 transitions, 3833 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:49,215 INFO L231 Difference]: Finished difference. Result has 1006 places, 1245 transitions, 3561 flow [2025-03-14 01:51:49,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3513, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3561, PETRI_PLACES=1006, PETRI_TRANSITIONS=1245} [2025-03-14 01:51:49,218 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -54 predicate places. [2025-03-14 01:51:49,218 INFO L471 AbstractCegarLoop]: Abstraction has has 1006 places, 1245 transitions, 3561 flow [2025-03-14 01:51:49,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1032.0) internal successors, (3096), 3 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:49,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:49,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:49,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:51:49,220 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:49,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash 115675041, now seen corresponding path program 1 times [2025-03-14 01:51:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798896313] [2025-03-14 01:51:49,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:49,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-14 01:51:49,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-14 01:51:49,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:49,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:51:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:49,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798896313] [2025-03-14 01:51:49,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798896313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:49,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:49,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:49,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701522811] [2025-03-14 01:51:49,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:49,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:49,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:49,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:49,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:49,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1033 out of 1226 [2025-03-14 01:51:49,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 1245 transitions, 3561 flow. Second operand has 3 states, 3 states have (on average 1035.0) internal successors, (3105), 3 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:49,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:49,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1033 of 1226 [2025-03-14 01:51:49,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:51,326 INFO L124 PetriNetUnfolderBase]: 1043/13791 cut-off events. [2025-03-14 01:51:51,326 INFO L125 PetriNetUnfolderBase]: For 925/1173 co-relation queries the response was YES. [2025-03-14 01:51:51,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16961 conditions, 13791 events. 1043/13791 cut-off events. For 925/1173 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 120764 event pairs, 53 based on Foata normal form. 43/12803 useless extension candidates. Maximal degree in co-relation 16948. Up to 1222 conditions per place. [2025-03-14 01:51:51,389 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 111 selfloop transitions, 4 changer transitions 0/1268 dead transitions. [2025-03-14 01:51:51,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 1268 transitions, 3865 flow [2025-03-14 01:51:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3160 transitions. [2025-03-14 01:51:51,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8591625883632409 [2025-03-14 01:51:51,394 INFO L175 Difference]: Start difference. First operand has 1006 places, 1245 transitions, 3561 flow. Second operand 3 states and 3160 transitions. [2025-03-14 01:51:51,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 1268 transitions, 3865 flow [2025-03-14 01:51:51,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1268 transitions, 3853 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:51,413 INFO L231 Difference]: Finished difference. Result has 1007 places, 1247 transitions, 3577 flow [2025-03-14 01:51:51,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3547, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3577, PETRI_PLACES=1007, PETRI_TRANSITIONS=1247} [2025-03-14 01:51:51,417 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -53 predicate places. [2025-03-14 01:51:51,417 INFO L471 AbstractCegarLoop]: Abstraction has has 1007 places, 1247 transitions, 3577 flow [2025-03-14 01:51:51,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.0) internal successors, (3105), 3 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:51,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:51,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:51,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:51:51,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:51,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash -459943949, now seen corresponding path program 1 times [2025-03-14 01:51:51,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:51,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579340765] [2025-03-14 01:51:51,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:51,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:51,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-14 01:51:51,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-14 01:51:51,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:51,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:51:51,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:51,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579340765] [2025-03-14 01:51:51,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579340765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:51:51,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705758161] [2025-03-14 01:51:51,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:51,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:51,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:51,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:51:51,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:51:51,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-14 01:51:51,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-14 01:51:51,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:51,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:51,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:51:51,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:51:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:51:51,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:51:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:51:51,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705758161] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:51:51,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:51:51,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-03-14 01:51:51,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343111374] [2025-03-14 01:51:51,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:51,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:51,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:51,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:51,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:51:51,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1033 out of 1226 [2025-03-14 01:51:51,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 1247 transitions, 3577 flow. Second operand has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:51,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:51,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1033 of 1226 [2025-03-14 01:51:51,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:54,124 INFO L124 PetriNetUnfolderBase]: 1096/14601 cut-off events. [2025-03-14 01:51:54,124 INFO L125 PetriNetUnfolderBase]: For 1060/1509 co-relation queries the response was YES. [2025-03-14 01:51:54,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18054 conditions, 14601 events. 1096/14601 cut-off events. For 1060/1509 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 131216 event pairs, 73 based on Foata normal form. 47/13533 useless extension candidates. Maximal degree in co-relation 18040. Up to 1300 conditions per place. [2025-03-14 01:51:54,188 INFO L140 encePairwiseOnDemand]: 1222/1226 looper letters, 111 selfloop transitions, 3 changer transitions 0/1269 dead transitions. [2025-03-14 01:51:54,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1269 transitions, 3877 flow [2025-03-14 01:51:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3158 transitions. [2025-03-14 01:51:54,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8586188145731376 [2025-03-14 01:51:54,192 INFO L175 Difference]: Start difference. First operand has 1007 places, 1247 transitions, 3577 flow. Second operand 3 states and 3158 transitions. [2025-03-14 01:51:54,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 1269 transitions, 3877 flow [2025-03-14 01:51:54,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 1269 transitions, 3869 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:54,211 INFO L231 Difference]: Finished difference. Result has 1009 places, 1248 transitions, 3587 flow [2025-03-14 01:51:54,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3569, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3587, PETRI_PLACES=1009, PETRI_TRANSITIONS=1248} [2025-03-14 01:51:54,213 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -51 predicate places. [2025-03-14 01:51:54,213 INFO L471 AbstractCegarLoop]: Abstraction has has 1009 places, 1248 transitions, 3587 flow [2025-03-14 01:51:54,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:54,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:54,215 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:54,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 01:51:54,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:54,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:54,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash 728033290, now seen corresponding path program 1 times [2025-03-14 01:51:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:54,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668602429] [2025-03-14 01:51:54,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:54,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:54,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-14 01:51:54,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:51:54,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:54,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:51:54,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:54,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668602429] [2025-03-14 01:51:54,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668602429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:51:54,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169747712] [2025-03-14 01:51:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:54,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:54,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:54,663 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:51:54,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:51:54,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-14 01:51:54,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:51:54,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:54,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:54,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:51:54,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:51:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:51:54,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:51:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:51:54,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169747712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:51:54,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:51:54,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-14 01:51:54,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751007687] [2025-03-14 01:51:54,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:51:54,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:51:54,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:54,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:51:54,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:51:55,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1031 out of 1226 [2025-03-14 01:51:55,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1248 transitions, 3587 flow. Second operand has 9 states, 9 states have (on average 1033.6666666666667) internal successors, (9303), 9 states have internal predecessors, (9303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:55,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:55,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1031 of 1226 [2025-03-14 01:51:55,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:57,682 INFO L124 PetriNetUnfolderBase]: 825/12560 cut-off events. [2025-03-14 01:51:57,682 INFO L125 PetriNetUnfolderBase]: For 759/881 co-relation queries the response was YES. [2025-03-14 01:51:57,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15189 conditions, 12560 events. 825/12560 cut-off events. For 759/881 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 106776 event pairs, 12 based on Foata normal form. 1/11740 useless extension candidates. Maximal degree in co-relation 15174. Up to 1096 conditions per place. [2025-03-14 01:51:57,759 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 96 selfloop transitions, 7 changer transitions 0/1256 dead transitions. [2025-03-14 01:51:57,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1015 places, 1256 transitions, 3811 flow [2025-03-14 01:51:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:51:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:51:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7265 transitions. [2025-03-14 01:51:57,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8465392682358425 [2025-03-14 01:51:57,767 INFO L175 Difference]: Start difference. First operand has 1009 places, 1248 transitions, 3587 flow. Second operand 7 states and 7265 transitions. [2025-03-14 01:51:57,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1015 places, 1256 transitions, 3811 flow [2025-03-14 01:51:57,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 1256 transitions, 3805 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:57,786 INFO L231 Difference]: Finished difference. Result has 1017 places, 1252 transitions, 3623 flow [2025-03-14 01:51:57,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3581, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3623, PETRI_PLACES=1017, PETRI_TRANSITIONS=1252} [2025-03-14 01:51:57,788 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -43 predicate places. [2025-03-14 01:51:57,788 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1252 transitions, 3623 flow [2025-03-14 01:51:57,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1033.6666666666667) internal successors, (9303), 9 states have internal predecessors, (9303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:57,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:57,791 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:57,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 01:51:57,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:57,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:51:57,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:57,997 INFO L85 PathProgramCache]: Analyzing trace with hash -106139349, now seen corresponding path program 2 times [2025-03-14 01:51:57,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:57,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867224771] [2025-03-14 01:51:57,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:51:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:58,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 221 statements into 2 equivalence classes. [2025-03-14 01:51:58,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 221 of 221 statements. [2025-03-14 01:51:58,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:51:58,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 01:51:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867224771] [2025-03-14 01:51:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867224771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:51:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039122867] [2025-03-14 01:51:58,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:51:58,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:51:58,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:58,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:51:58,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 01:51:58,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 221 statements into 2 equivalence classes. [2025-03-14 01:51:58,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 221 of 221 statements. [2025-03-14 01:51:58,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:51:58,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:58,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:51:58,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:51:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 01:51:58,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:51:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 01:51:58,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039122867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:51:58,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:51:58,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-14 01:51:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325907706] [2025-03-14 01:51:58,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:51:58,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:51:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:58,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:51:58,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:51:59,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1031 out of 1226 [2025-03-14 01:51:59,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1252 transitions, 3623 flow. Second operand has 9 states, 9 states have (on average 1033.6666666666667) internal successors, (9303), 9 states have internal predecessors, (9303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:51:59,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:59,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1031 of 1226 [2025-03-14 01:51:59,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:52:01,669 INFO L124 PetriNetUnfolderBase]: 806/12697 cut-off events. [2025-03-14 01:52:01,669 INFO L125 PetriNetUnfolderBase]: For 767/889 co-relation queries the response was YES. [2025-03-14 01:52:01,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15331 conditions, 12697 events. 806/12697 cut-off events. For 767/889 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 106611 event pairs, 12 based on Foata normal form. 0/11869 useless extension candidates. Maximal degree in co-relation 15313. Up to 1096 conditions per place. [2025-03-14 01:52:01,739 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 100 selfloop transitions, 9 changer transitions 0/1266 dead transitions. [2025-03-14 01:52:01,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1266 transitions, 3877 flow [2025-03-14 01:52:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:52:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:52:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9334 transitions. [2025-03-14 01:52:01,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8459307594707268 [2025-03-14 01:52:01,748 INFO L175 Difference]: Start difference. First operand has 1017 places, 1252 transitions, 3623 flow. Second operand 9 states and 9334 transitions. [2025-03-14 01:52:01,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1266 transitions, 3877 flow [2025-03-14 01:52:01,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1266 transitions, 3871 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:52:01,768 INFO L231 Difference]: Finished difference. Result has 1027 places, 1259 transitions, 3673 flow [2025-03-14 01:52:01,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3617, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3673, PETRI_PLACES=1027, PETRI_TRANSITIONS=1259} [2025-03-14 01:52:01,769 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -33 predicate places. [2025-03-14 01:52:01,769 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1259 transitions, 3673 flow [2025-03-14 01:52:01,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1033.6666666666667) internal successors, (9303), 9 states have internal predecessors, (9303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:52:01,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:52:01,772 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:52:01,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 01:52:01,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:52:01,973 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-14 01:52:01,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:52:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1179896565, now seen corresponding path program 3 times [2025-03-14 01:52:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:52:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039442075] [2025-03-14 01:52:01,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:52:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:52:02,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 367 statements into 4 equivalence classes. [2025-03-14 01:52:02,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 367 of 367 statements. [2025-03-14 01:52:02,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 01:52:02,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:52:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 76 proven. 144 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-14 01:52:03,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:52:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039442075] [2025-03-14 01:52:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039442075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:52:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127724673] [2025-03-14 01:52:03,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:52:03,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:52:03,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:52:03,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:52:03,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 01:52:04,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 367 statements into 4 equivalence classes. [2025-03-14 01:52:52,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 367 of 367 statements. [2025-03-14 01:52:52,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 01:52:52,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:52:52,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-14 01:52:52,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:52:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 148 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-14 01:52:52,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:52:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 148 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-14 01:52:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127724673] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:52:52,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:52:52,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 13] total 40 [2025-03-14 01:52:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984983287] [2025-03-14 01:52:52,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:52:52,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-14 01:52:52,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:52:52,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-14 01:52:52,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2025-03-14 01:52:55,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1226 [2025-03-14 01:52:55,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1259 transitions, 3673 flow. Second operand has 40 states, 40 states have (on average 1006.1) internal successors, (40244), 40 states have internal predecessors, (40244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:52:55,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:52:55,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1226 [2025-03-14 01:52:55,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand