./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/bounded_mpmc_check_empty.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/libvsync/bounded_mpmc_check_empty.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d32fe1c21688ba35bf4df709c44c653627e880728901b145cb85c74d8074e0d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:45:44,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:45:44,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:45:44,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:45:44,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:45:44,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:45:44,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:45:44,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:45:44,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:45:44,263 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:45:44,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:45:44,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:45:44,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:45:44,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:45:44,266 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:45:44,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:45:44,266 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:45:44,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:45:44,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:45:44,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:45:44,267 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:45:44,267 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:45:44,267 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:45:44,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:44,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:45:44,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:45:44,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:45:44,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:45:44,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:45:44,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:45:44,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:45:44,269 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> d32fe1c21688ba35bf4df709c44c653627e880728901b145cb85c74d8074e0d5 [2025-02-08 08:45:44,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:45:44,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:45:44,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:45:44,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:45:44,528 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:45:44,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_empty.i [2025-02-08 08:45:45,796 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1004da718/3b6d73b817394872860b57af7850e5a4/FLAG6ad3de79c [2025-02-08 08:45:46,252 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:45:46,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_empty.i [2025-02-08 08:45:46,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1004da718/3b6d73b817394872860b57af7850e5a4/FLAG6ad3de79c [2025-02-08 08:45:46,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1004da718/3b6d73b817394872860b57af7850e5a4 [2025-02-08 08:45:46,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:45:46,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:45:46,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:46,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:45:46,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:45:46,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:46" (1/1) ... [2025-02-08 08:45:46,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1298cda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:46, skipping insertion in model container [2025-02-08 08:45:46,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:46" (1/1) ... [2025-02-08 08:45:46,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:45:47,720 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:47,725 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:47,726 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:47,729 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:47,730 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:47,895 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:47,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:47,914 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:45:47,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-02-08 08:45:47,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-02-08 08:45:47,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-02-08 08:45:47,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-02-08 08:45:47,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-02-08 08:45:47,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-02-08 08:45:47,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-02-08 08:45:47,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-02-08 08:45:47,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-02-08 08:45:47,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-02-08 08:45:47,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-02-08 08:45:47,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-02-08 08:45:47,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-02-08 08:45:47,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-02-08 08:45:47,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-02-08 08:45:47,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-02-08 08:45:47,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-02-08 08:45:47,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-02-08 08:45:47,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-02-08 08:45:47,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-02-08 08:45:47,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-02-08 08:45:47,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-02-08 08:45:47,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-02-08 08:45:47,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-02-08 08:45:47,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-02-08 08:45:47,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-02-08 08:45:47,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-02-08 08:45:47,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-02-08 08:45:47,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-02-08 08:45:47,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-02-08 08:45:47,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-02-08 08:45:47,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-02-08 08:45:47,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-02-08 08:45:47,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-02-08 08:45:47,993 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-02-08 08:45:47,993 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-02-08 08:45:47,993 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-02-08 08:45:47,993 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-02-08 08:45:47,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-02-08 08:45:47,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-02-08 08:45:47,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-02-08 08:45:47,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-02-08 08:45:47,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-02-08 08:45:47,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-02-08 08:45:47,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-02-08 08:45:47,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-02-08 08:45:47,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-02-08 08:45:47,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-02-08 08:45:47,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-02-08 08:45:47,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-02-08 08:45:47,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-02-08 08:45:47,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-02-08 08:45:47,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-02-08 08:45:47,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-02-08 08:45:47,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-02-08 08:45:47,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-02-08 08:45:47,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-02-08 08:45:47,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-02-08 08:45:48,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-02-08 08:45:48,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-02-08 08:45:48,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-02-08 08:45:48,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-02-08 08:45:48,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-02-08 08:45:48,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-02-08 08:45:48,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-02-08 08:45:48,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-02-08 08:45:48,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-02-08 08:45:48,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-02-08 08:45:48,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-02-08 08:45:48,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-02-08 08:45:48,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-02-08 08:45:48,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-02-08 08:45:48,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-02-08 08:45:48,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-02-08 08:45:48,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-02-08 08:45:48,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-02-08 08:45:48,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-02-08 08:45:48,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-02-08 08:45:48,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-02-08 08:45:48,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-02-08 08:45:48,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-02-08 08:45:48,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-02-08 08:45:48,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-02-08 08:45:48,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-02-08 08:45:48,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-02-08 08:45:48,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-02-08 08:45:48,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-02-08 08:45:48,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-02-08 08:45:48,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-02-08 08:45:48,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-02-08 08:45:48,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-02-08 08:45:48,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-02-08 08:45:48,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-02-08 08:45:48,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-02-08 08:45:48,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-02-08 08:45:48,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-02-08 08:45:48,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-02-08 08:45:48,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-02-08 08:45:48,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-02-08 08:45:48,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-02-08 08:45:48,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:48,275 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:45:48,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48 WrapperNode [2025-02-08 08:45:48,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:48,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:48,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:45:48,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:45:48,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,371 INFO L138 Inliner]: procedures = 915, calls = 983, calls flagged for inlining = 827, calls inlined = 71, statements flattened = 751 [2025-02-08 08:45:48,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:48,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:45:48,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:45:48,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:45:48,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,406 INFO L175 MemorySlicer]: Split 74 memory accesses to 8 slices as follows [2, 41, 7, 3, 3, 8, 7, 3]. 55 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 7, 4, 1, 1, 4, 4, 0]. The 21 writes are split as follows [0, 13, 1, 1, 1, 2, 1, 2]. [2025-02-08 08:45:48,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,421 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:45:48,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:45:48,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:45:48,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:45:48,435 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (1/1) ... [2025-02-08 08:45:48,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:48,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:48,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:45:48,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:45:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-02-08 08:45:48,487 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:45:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:45:48,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 08:45:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-02-08 08:45:48,489 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 08:45:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:45:48,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:45:48,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:45:48,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 08:45:48,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 08:45:48,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 08:45:48,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 08:45:48,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 08:45:48,491 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:45:48,644 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:45:48,646 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:45:49,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: vatomic32_cmpxchg_rel_~v#1 := vatomic32_cmpxchg_rel_#in~v#1; [2025-02-08 08:45:49,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480-2: vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset := vatomic32_cmpxchg_rel_#in~a#1.base, vatomic32_cmpxchg_rel_#in~a#1.offset; [2025-02-08 08:45:49,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480-1: vatomic32_cmpxchg_rel_~e#1 := vatomic32_cmpxchg_rel_#in~e#1; [2025-02-08 08:45:49,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5388-1: vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset := vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset; [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5388: vatomic32_await_eq_~c#1 := vatomic32_await_eq_#in~c#1; [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-1: vatomic32_read_~tmp~2#1 := vatomic32_read_#t~mem436#1; [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-2: [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332: havoc vatomic32_read_#t~mem436#1; [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-5: havoc vatomic32_read_#t~mem436#1; [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-6: vatomic32_read_~tmp~2#1 := vatomic32_read_#t~mem436#1; [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-3: SUMMARY for call vatomic32_read_#t~mem436#1 := read~int#1(vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-3: assume !(1 == #valid[vatomic32_read_~a#1.base]); [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-3: assume !(4 + vatomic32_read_~a#1.offset <= #length[vatomic32_read_~a#1.base] && 0 <= vatomic32_read_~a#1.offset); [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-4: [2025-02-08 08:45:49,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-9: [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6050: havoc xbo_reset_#in~xbo#1.base, xbo_reset_#in~xbo#1.offset;assume { :end_inline_xbo_reset } true; [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-10: havoc vatomic32_read_#t~mem436#1; [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-7: [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-8: SUMMARY for call vatomic32_read_#t~mem436#1 := read~int#1(vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-8: assume !(1 == #valid[vatomic32_read_~a#1.base]); [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-8: assume !(4 + vatomic32_read_~a#1.offset <= #length[vatomic32_read_~a#1.base] && 0 <= vatomic32_read_~a#1.offset); [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6050-3: assume { :begin_inline_xbo_reset } true;xbo_reset_#in~xbo#1.base, xbo_reset_#in~xbo#1.offset := ~#xbo~1#1.base, ~#xbo~1#1.offset; [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-13: SUMMARY for call vatomic32_read_#t~mem436#1 := read~int#1(vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-13: assume !(1 == #valid[vatomic32_read_~a#1.base]); [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-13: assume !(4 + vatomic32_read_~a#1.offset <= #length[vatomic32_read_~a#1.base] && 0 <= vatomic32_read_~a#1.offset); [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-14: [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6050-1: havoc xbo_reset_~xbo#1.base, xbo_reset_~xbo#1.offset; [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-11: vatomic32_read_~tmp~2#1 := vatomic32_read_#t~mem436#1; [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6050-2: havoc xbo_reset_~xbo#1.base, xbo_reset_~xbo#1.offset; [2025-02-08 08:45:49,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-12: [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2450: vatomic32_write_rel_~v#1 := vatomic32_write_rel_#in~v#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-3: assume { :end_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_rel_#res#1 := vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2450-1: vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset := vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-2: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-5: havoc vatomic32_cmpxchg_#t~ret452#1, vatomic32_cmpxchg_#t~mem453#1, vatomic32_cmpxchg_#t~ret454#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-4: havoc vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-7: havoc vatomic32_cmpxchg_#t~ret452#1, vatomic32_cmpxchg_#t~mem453#1, vatomic32_cmpxchg_#t~ret454#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-6: vatomic32_cmpxchg_rel_#t~ret123#1 := vatomic32_cmpxchg_#res#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-9: assume { :begin_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1 := vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset, vatomic32_cmpxchg_rel_~e#1, vatomic32_cmpxchg_rel_~v#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-8: havoc vatomic32_cmpxchg_#res#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6051: havoc #t~ret782#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6051-1: havoc #t~ret782#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6051-4: #t~ret782#1 := vatomic32_read_rlx_#res#1; [2025-02-08 08:45:49,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6051-5: havoc vatomic32_read_rlx_#t~ret116#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6051-2: havoc vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset;assume { :end_inline_vatomic32_read_rlx } true; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6051-3: havoc vatomic32_read_rlx_#t~ret116#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6051-6: havoc vatomic32_read_rlx_#res#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6051-7: assume { :begin_inline_vatomic32_read_rlx } true;vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset := ~#g_cs_x~0.base, ~#g_cs_x~0.offset; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5391: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~c#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4334-3: vatomic32_read_#res#1 := vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4334-1: vatomic32_read_#res#1 := vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4334-5: vatomic32_read_#res#1 := vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5392: vatomic32_await_eq_~o~5#1 := 0;assume { :begin_inline_verification_loop_begin } true;assume { :end_inline_verification_loop_begin } true; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-1: havoc vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453: assume { :end_inline_vatomic32_write } true;havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-3: havoc vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-2: havoc vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-2: havoc verification_spin_end_~v#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-4: assume { :begin_inline_vatomic32_write } true;vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1 := vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-3: havoc verification_spin_end_~v#1; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393: assume true;assume { :begin_inline_verification_spin_start } true;assume { :end_inline_verification_spin_start } true;assume { :begin_inline_vatomic32_read } true;vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset := vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset; [2025-02-08 08:45:49,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393: assume !true; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-6: havoc vatomic32_await_eq_#t~ite641#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-7: assume 0 != vatomic32_await_eq_#t~ite641#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-7: assume !(0 != vatomic32_await_eq_#t~ite641#1); [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-5: havoc vatomic32_await_eq_#t~ite641#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_eq_#t~ite641#1 := 0; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-11: havoc verification_spin_end_#in~v#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-8: havoc vatomic32_await_eq_#t~ret640#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-9: havoc vatomic32_await_eq_#t~ret640#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-14: assume vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-14: assume !(vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296); [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-15: vatomic32_await_eq_#t~ite641#1 := 1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-12: havoc verification_spin_end_~v#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-13: havoc verification_spin_end_~v#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-19: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_eq_~o~5#1 := vatomic32_await_eq_#t~ret640#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4667: vatomic32_get_add_~v#1 := vatomic32_get_add_#in~v#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-22: havoc vatomic32_read_#res#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4667-1: vatomic32_get_add_~a#1.base, vatomic32_get_add_~a#1.offset := vatomic32_get_add_#in~a#1.base, vatomic32_get_add_#in~a#1.offset; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-20: vatomic32_await_eq_#t~ret640#1 := vatomic32_read_#res#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-21: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394: assume true; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394: assume !true; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394-1: assume false; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394-1: assume !false; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5395: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~o~5#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5066: vatomic32_get_inc_~a#1.base, vatomic32_get_inc_~a#1.offset := vatomic32_get_inc_#in~a#1.base, vatomic32_get_inc_#in~a#1.offset; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-1: vatomic32_await_eq_#res#1 := vatomic32_await_eq_~ret~0#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671: havoc vatomic32_get_add_#t~mem496#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671-1: vatomic32_get_add_~tmp~29#1 := vatomic32_get_add_#t~mem496#1; [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671-4: SUMMARY for call vatomic32_get_add_#t~mem496#1 := read~int#1(vatomic32_get_add_~a#1.base, vatomic32_get_add_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671-4: assume !(1 == #valid[vatomic32_get_add_~a#1.base]); [2025-02-08 08:45:49,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671-4: assume !(4 + vatomic32_get_add_~a#1.offset <= #length[vatomic32_get_add_~a#1.base] && 0 <= vatomic32_get_add_~a#1.offset); [2025-02-08 08:45:49,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671-5: [2025-02-08 08:45:49,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671-2: [2025-02-08 08:45:49,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671-3: SUMMARY for call write~int#1(vatomic32_get_add_#t~mem496#1 + vatomic32_get_add_~v#1, vatomic32_get_add_~a#1.base, vatomic32_get_add_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671-3: assume !(1 == #valid[vatomic32_get_add_~a#1.base]); [2025-02-08 08:45:49,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671-3: assume !(4 + vatomic32_get_add_~a#1.offset <= #length[vatomic32_get_add_~a#1.base] && 0 <= vatomic32_get_add_~a#1.offset); [2025-02-08 08:45:49,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374: vatomic32_write_~v#1 := vatomic32_write_#in~v#1; [2025-02-08 08:45:49,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374-1: vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset := vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset; [2025-02-08 08:45:49,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: assume false; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: assume !false; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-2: assume false; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-2: assume !false; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-3: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-4: assume false; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-4: assume !false; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-5: assume false; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-5: assume !false; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5069-2: havoc vatomic32_get_inc_#t~ret581#1; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5069-3: assume { :end_inline_vatomic32_get_add } true;vatomic32_get_inc_#res#1 := vatomic32_get_inc_#t~ret581#1; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5069: havoc vatomic32_get_inc_#t~ret581#1; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5069-6: vatomic32_get_inc_#t~ret581#1 := vatomic32_get_add_#res#1; [2025-02-08 08:45:49,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5069-7: havoc vatomic32_get_add_#t~mem496#1, vatomic32_get_add_~a#1.base, vatomic32_get_add_~a#1.offset, vatomic32_get_add_~v#1, vatomic32_get_add_~tmp~29#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5069-4: havoc vatomic32_get_add_#in~a#1.base, vatomic32_get_add_#in~a#1.offset, vatomic32_get_add_#in~v#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5069-5: havoc vatomic32_get_add_#t~mem496#1, vatomic32_get_add_~a#1.base, vatomic32_get_add_~a#1.offset, vatomic32_get_add_~v#1, vatomic32_get_add_~tmp~29#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5069-8: havoc vatomic32_get_add_#res#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5069-9: assume { :begin_inline_vatomic32_get_add } true;vatomic32_get_add_#in~a#1.base, vatomic32_get_add_#in~a#1.offset, vatomic32_get_add_#in~v#1 := vatomic32_get_inc_~a#1.base, vatomic32_get_inc_~a#1.offset, 1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4673-1: vatomic32_get_add_#res#1 := vatomic32_get_add_~tmp~29#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476-1: vatomic32_cmpxchg_~e#1 := vatomic32_cmpxchg_#in~e#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476-2: vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476: vatomic32_cmpxchg_~v#1 := vatomic32_cmpxchg_#in~v#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378: [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-1: SUMMARY for call write~int#1(vatomic32_write_~v#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-1: assume !(1 == #valid[vatomic32_write_~a#1.base]); [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-1: assume !(4 + vatomic32_write_~a#1.offset <= #length[vatomic32_write_~a#1.base] && 0 <= vatomic32_write_~a#1.offset); [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-2: [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5997: xbo_reset_~xbo#1.base, xbo_reset_~xbo#1.offset := xbo_reset_#in~xbo#1.base, xbo_reset_#in~xbo#1.offset; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4479: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_~e#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-2: havoc vatomic32_cmpxchg_#t~ret452#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-3: havoc vatomic32_cmpxchg_#t~ret454#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc vatomic32_cmpxchg_#t~ret454#1; [2025-02-08 08:45:49,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-1: havoc vatomic32_cmpxchg_#t~mem453#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-6: [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-7: SUMMARY for call write~int#1(vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-7: assume !(1 == #valid[vatomic32_cmpxchg_~a#1.base]); [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-7: assume !(4 + vatomic32_cmpxchg_~a#1.offset <= #length[vatomic32_cmpxchg_~a#1.base] && 0 <= vatomic32_cmpxchg_~a#1.offset); [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-4: havoc vatomic32_cmpxchg_#t~mem453#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-5: havoc vatomic32_cmpxchg_#t~ret452#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-10: vatomic32_cmpxchg_#t~ret452#1 := (if vatomic32_cmpxchg_#t~mem453#1 == vatomic32_cmpxchg_#t~ret454#1 then 1 else 0); [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-11: vatomic32_cmpxchg_#t~ret454#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-8: assume 0 != vatomic32_cmpxchg_#t~ret452#1 % 256; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-8: assume !(0 != vatomic32_cmpxchg_#t~ret452#1 % 256); [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-9: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_#t~mem453#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-12: SUMMARY for call vatomic32_cmpxchg_#t~mem453#1 := read~int#1(vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-12: assume !(1 == #valid[vatomic32_cmpxchg_~a#1.base]); [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-12: assume !(4 + vatomic32_cmpxchg_~a#1.offset <= #length[vatomic32_cmpxchg_~a#1.base] && 0 <= vatomic32_cmpxchg_~a#1.offset); [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-13: [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2665: vatomic32_get_inc_rlx_~a#1.base, vatomic32_get_inc_rlx_~a#1.offset := vatomic32_get_inc_rlx_#in~a#1.base, vatomic32_get_inc_rlx_#in~a#1.offset; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2435: vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset := vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5970: havoc bounded_mpmc_deq_#t~ret768#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5970-3: havoc vatomic32_read_acq_#t~ret117#1, vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5970-4: bounded_mpmc_deq_#t~ret768#1 := vatomic32_read_acq_#res#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5970-1: assume { :end_inline_vatomic32_read_acq } true;bounded_mpmc_deq_~curr~1#1 := bounded_mpmc_deq_#t~ret768#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5970-2: havoc vatomic32_read_acq_#in~a#1.base, vatomic32_read_acq_#in~a#1.offset; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4484-1: vatomic32_cmpxchg_#res#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5971: bounded_mpmc_deq_~next~1#1 := 1 + bounded_mpmc_deq_~curr~1#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2668: havoc vatomic32_get_inc_rlx_#t~ret160#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2668-2: havoc vatomic32_get_inc_rlx_#t~ret160#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2668-4: havoc vatomic32_get_inc_#in~a#1.base, vatomic32_get_inc_#in~a#1.offset; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2668-3: assume { :end_inline_vatomic32_get_inc } true;vatomic32_get_inc_rlx_#res#1 := vatomic32_get_inc_rlx_#t~ret160#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2668-6: vatomic32_get_inc_rlx_#t~ret160#1 := vatomic32_get_inc_#res#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2668-5: havoc vatomic32_get_inc_#t~ret581#1, vatomic32_get_inc_~a#1.base, vatomic32_get_inc_~a#1.offset; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2668-8: havoc vatomic32_get_inc_#res#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2668-7: havoc vatomic32_get_inc_#t~ret581#1, vatomic32_get_inc_~a#1.base, vatomic32_get_inc_~a#1.offset; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2668-9: assume { :begin_inline_vatomic32_get_inc } true;vatomic32_get_inc_#in~a#1.base, vatomic32_get_inc_#in~a#1.offset := vatomic32_get_inc_rlx_~a#1.base, vatomic32_get_inc_rlx_~a#1.offset; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6038: havoc ~#xbo~1#1.base, ~#xbo~1#1.offset; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5972-1: havoc bounded_mpmc_deq_#t~ret769#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5972-2: havoc bounded_mpmc_deq_#t~ret769#1; [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6038-1: SUMMARY for call ULTIMATE.dealloc(~#xbo~1#1.base, ~#xbo~1#1.offset); srcloc: null [2025-02-08 08:45:49,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5972: assume bounded_mpmc_deq_~curr~1#1 == bounded_mpmc_deq_#t~ret769#1; [2025-02-08 08:45:49,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5972: assume !(bounded_mpmc_deq_~curr~1#1 == bounded_mpmc_deq_#t~ret769#1); [2025-02-08 08:45:49,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5972-5: bounded_mpmc_deq_#t~ret769#1 := vatomic32_read_acq_#res#1; [2025-02-08 08:45:49,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5972-6: havoc vatomic32_read_acq_#t~ret117#1, vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset; [2025-02-08 08:45:49,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5972-3: havoc vatomic32_read_acq_#in~a#1.base, vatomic32_read_acq_#in~a#1.offset;assume { :end_inline_vatomic32_read_acq } true; [2025-02-08 08:45:49,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5972-4: havoc vatomic32_read_acq_#t~ret117#1, vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset; [2025-02-08 08:45:49,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5972-7: havoc vatomic32_read_acq_#res#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5972-8: assume { :begin_inline_vatomic32_read_acq } true;vatomic32_read_acq_#in~a#1.base, vatomic32_read_acq_#in~a#1.offset := bounded_mpmc_deq_~q#1.base, 4 + bounded_mpmc_deq_~q#1.offset; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-2: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-4: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-3: assume { :end_inline_vatomic32_read } true;vatomic32_read_rlx_#res#1 := vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-6: vatomic32_read_rlx_#t~ret116#1 := vatomic32_read_#res#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-5: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-8: havoc vatomic32_read_#res#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-7: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-9: assume { :begin_inline_vatomic32_read } true;vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset := vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5973-1: bounded_mpmc_deq_#res#1 := 2; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1118: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1118-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6040-1: assume 4 != #t~ret782#1; [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6040-1: assume !(4 != #t~ret782#1); [2025-02-08 08:45:49,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6040-2: havoc ~#r~0#1.base, ~#r~0#1.offset; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset := vatomic32_read_acq_#in~a#1.base, vatomic32_read_acq_#in~a#1.offset; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975: assume bounded_mpmc_deq_#t~ret770#1 != bounded_mpmc_deq_~curr~1#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975: assume !(bounded_mpmc_deq_#t~ret770#1 != bounded_mpmc_deq_~curr~1#1); [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975-1: havoc bounded_mpmc_deq_#t~ret770#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6041: havoc ~#r~0#1.base, ~#r~0#1.offset; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6041-1: SUMMARY for call ULTIMATE.dealloc(~#r~0#1.base, ~#r~0#1.offset); srcloc: null [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975-4: havoc vatomic32_cmpxchg_rel_#t~ret123#1, vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset, vatomic32_cmpxchg_rel_~e#1, vatomic32_cmpxchg_rel_~v#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975-5: bounded_mpmc_deq_#t~ret770#1 := vatomic32_cmpxchg_rel_#res#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975-2: havoc bounded_mpmc_deq_#t~ret770#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975-3: havoc vatomic32_cmpxchg_rel_#in~a#1.base, vatomic32_cmpxchg_rel_#in~a#1.offset, vatomic32_cmpxchg_rel_#in~e#1, vatomic32_cmpxchg_rel_#in~v#1;assume { :end_inline_vatomic32_cmpxchg_rel } true; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975-8: assume { :begin_inline_vatomic32_cmpxchg_rel } true;vatomic32_cmpxchg_rel_#in~a#1.base, vatomic32_cmpxchg_rel_#in~a#1.offset, vatomic32_cmpxchg_rel_#in~e#1, vatomic32_cmpxchg_rel_#in~v#1 := bounded_mpmc_deq_~q#1.base, 8 + bounded_mpmc_deq_~q#1.offset, bounded_mpmc_deq_~curr~1#1, bounded_mpmc_deq_~next~1#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975-6: havoc vatomic32_cmpxchg_rel_#t~ret123#1, vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset, vatomic32_cmpxchg_rel_~e#1, vatomic32_cmpxchg_rel_~v#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975-7: havoc vatomic32_cmpxchg_rel_#res#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042: havoc ~idx~1#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-3: havoc #t~ret777#1;assume { :begin_inline_verification_ignore } true;assume { :end_inline_verification_ignore } true; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5976-1: bounded_mpmc_deq_#res#1 := 3; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-4: assume { :end_inline_bounded_mpmc_deq } true;assume -2147483648 <= #t~ret777#1 && #t~ret777#1 <= 2147483647; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-1: assume 0 == #t~ret777#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-1: assume !(0 == #t~ret777#1); [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-2: havoc #t~ret777#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-7: #t~ret777#1 := bounded_mpmc_deq_#res#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2805-1: vatomic32_await_eq_rlx_~a#1.base, vatomic32_await_eq_rlx_~a#1.offset := vatomic32_await_eq_rlx_#in~a#1.base, vatomic32_await_eq_rlx_#in~a#1.offset; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2805: vatomic32_await_eq_rlx_~v#1 := vatomic32_await_eq_rlx_#in~v#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-5: havoc bounded_mpmc_deq_#in~q#1.base, bounded_mpmc_deq_#in~q#1.offset, bounded_mpmc_deq_#in~v#1.base, bounded_mpmc_deq_#in~v#1.offset; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-6: havoc bounded_mpmc_deq_#t~ret768#1, bounded_mpmc_deq_#t~ret769#1, bounded_mpmc_deq_#t~ret770#1, bounded_mpmc_deq_#t~mem772#1.base, bounded_mpmc_deq_#t~mem772#1.offset, bounded_mpmc_deq_#t~mem771#1, bounded_mpmc_deq_#t~mem773#1.base, bounded_mpmc_deq_#t~mem773#1.offset, bounded_mpmc_deq_#t~ret774#1, bounded_mpmc_deq_~q#1.base, bounded_mpmc_deq_~q#1.offset, bounded_mpmc_deq_~v#1.base, bounded_mpmc_deq_~v#1.offset, bounded_mpmc_deq_~curr~1#1, bounded_mpmc_deq_~next~1#1; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121: assume true; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121: assume !true; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-1: assume false; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-1: assume !false; [2025-02-08 08:45:49,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-2: assume true; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-2: assume !true; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-3: assume false; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-3: assume !false; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043: havoc #t~ret778#1; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-4: assume true; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-4: assume !true; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-1: assume { :end_inline_vatomic32_get_inc_rlx } true;~idx~1#1 := #t~ret778#1; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-5: assume false; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-5: assume !false; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-6: assume true; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-6: assume !true; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-7: assume false; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-7: assume !false; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-4: #t~ret778#1 := vatomic32_get_inc_rlx_#res#1; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-8: assume true; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-8: assume !true; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-5: havoc vatomic32_get_inc_rlx_#t~ret160#1, vatomic32_get_inc_rlx_~a#1.base, vatomic32_get_inc_rlx_~a#1.offset; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-9: assume false; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-9: assume !false; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-2: havoc vatomic32_get_inc_rlx_#in~a#1.base, vatomic32_get_inc_rlx_#in~a#1.offset; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-10: assume true; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-10: assume !true; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-3: havoc vatomic32_get_inc_rlx_#t~ret160#1, vatomic32_get_inc_rlx_~a#1.base, vatomic32_get_inc_rlx_~a#1.offset; [2025-02-08 08:45:49,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-11: assume false; [2025-02-08 08:45:49,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-11: assume !false; [2025-02-08 08:45:49,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-6: havoc vatomic32_get_inc_rlx_#res#1; [2025-02-08 08:45:49,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-7: assume { :begin_inline_vatomic32_get_inc_rlx } true;vatomic32_get_inc_rlx_#in~a#1.base, vatomic32_get_inc_rlx_#in~a#1.offset := ~#g_cs_x~0.base, ~#g_cs_x~0.offset; [2025-02-08 08:45:49,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-3: assume { :end_inline_vatomic32_read } true;vatomic32_read_acq_#res#1 := vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-2: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-5: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-4: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-7: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-6: vatomic32_read_acq_#t~ret117#1 := vatomic32_read_#res#1; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-9: assume { :begin_inline_vatomic32_read } true;vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset := vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-8: havoc vatomic32_read_#res#1; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-10: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-13: assume { :end_inline_vatomic32_read } true;vatomic32_read_acq_#res#1 := vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-12: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6044-1: assume false; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6044-1: assume !false; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-15: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6044-2: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978: havoc bounded_mpmc_deq_#t~mem773#1.base, bounded_mpmc_deq_#t~mem773#1.offset; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-14: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6044: assume true; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6044: assume !true; [2025-02-08 08:45:49,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-16: vatomic32_read_acq_#t~ret117#1 := vatomic32_read_#res#1; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-3: SUMMARY for call write~$Pointer$#3(bounded_mpmc_deq_#t~mem773#1.base, bounded_mpmc_deq_#t~mem773#1.offset, bounded_mpmc_deq_~v#1.base, bounded_mpmc_deq_~v#1.offset, 4); srcloc: null [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-3: assume !(1 == #valid[bounded_mpmc_deq_~v#1.base]); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-3: assume !(4 + bounded_mpmc_deq_~v#1.offset <= #length[bounded_mpmc_deq_~v#1.base] && 0 <= bounded_mpmc_deq_~v#1.offset); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-4: SUMMARY for call bounded_mpmc_deq_#t~mem773#1.base, bounded_mpmc_deq_#t~mem773#1.offset := read~$Pointer$#2(bounded_mpmc_deq_#t~mem772#1.base, bounded_mpmc_deq_#t~mem772#1.offset + 4 * (if bounded_mpmc_deq_~curr~1#1 % 4294967296 % (bounded_mpmc_deq_#t~mem771#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_mpmc_deq_~curr~1#1 % 4294967296 % (bounded_mpmc_deq_#t~mem771#1 % 4294967296) % 4294967296 % 4294967296 else bounded_mpmc_deq_~curr~1#1 % 4294967296 % (bounded_mpmc_deq_#t~mem771#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296), 4); srcloc: null [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-4: assume !(1 == #valid[bounded_mpmc_deq_#t~mem772#1.base]); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-4: assume !(4 + (bounded_mpmc_deq_#t~mem772#1.offset + 4 * (if bounded_mpmc_deq_~curr~1#1 % 4294967296 % (bounded_mpmc_deq_#t~mem771#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_mpmc_deq_~curr~1#1 % 4294967296 % (bounded_mpmc_deq_#t~mem771#1 % 4294967296) % 4294967296 % 4294967296 else bounded_mpmc_deq_~curr~1#1 % 4294967296 % (bounded_mpmc_deq_#t~mem771#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)) <= #length[bounded_mpmc_deq_#t~mem772#1.base] && 0 <= bounded_mpmc_deq_#t~mem772#1.offset + 4 * (if bounded_mpmc_deq_~curr~1#1 % 4294967296 % (bounded_mpmc_deq_#t~mem771#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_mpmc_deq_~curr~1#1 % 4294967296 % (bounded_mpmc_deq_#t~mem771#1 % 4294967296) % 4294967296 % 4294967296 else bounded_mpmc_deq_~curr~1#1 % 4294967296 % (bounded_mpmc_deq_#t~mem771#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6044-3: assume !(~idx~1#1 % 4294967296 < 4); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6044-3: assume !!(~idx~1#1 % 4294967296 < 4); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-1: havoc bounded_mpmc_deq_#t~mem771#1; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6044-4: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-2: havoc bounded_mpmc_deq_#t~mem772#1.base, bounded_mpmc_deq_#t~mem772#1.offset; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-5: SUMMARY for call bounded_mpmc_deq_#t~mem771#1 := read~int#1(bounded_mpmc_deq_~q#1.base, 20 + bounded_mpmc_deq_~q#1.offset, 4); srcloc: null [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-5: assume !(1 == #valid[bounded_mpmc_deq_~q#1.base]); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-5: assume !(4 + (20 + bounded_mpmc_deq_~q#1.offset) <= #length[bounded_mpmc_deq_~q#1.base] && 0 <= 20 + bounded_mpmc_deq_~q#1.offset); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-6: SUMMARY for call bounded_mpmc_deq_#t~mem772#1.base, bounded_mpmc_deq_#t~mem772#1.offset := read~$Pointer$#1(bounded_mpmc_deq_~q#1.base, 16 + bounded_mpmc_deq_~q#1.offset, 4); srcloc: null [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-6: assume !(1 == #valid[bounded_mpmc_deq_~q#1.base]); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978-6: assume !(4 + (16 + bounded_mpmc_deq_~q#1.offset) <= #length[bounded_mpmc_deq_~q#1.base] && 0 <= 16 + bounded_mpmc_deq_~q#1.offset); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-2: SUMMARY for call write~int#6(#t~mem780#1, ~#g_ret~0.base, ~#g_ret~0.offset + 4 * (if ~idx~1#1 % 4294967296 % 4294967296 <= 2147483647 then ~idx~1#1 % 4294967296 % 4294967296 else ~idx~1#1 % 4294967296 % 4294967296 - 4294967296), 4); srcloc: null [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-2: assume !(1 == #valid[~#g_ret~0.base]); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-2: assume !(4 + (~#g_ret~0.offset + 4 * (if ~idx~1#1 % 4294967296 % 4294967296 <= 2147483647 then ~idx~1#1 % 4294967296 % 4294967296 else ~idx~1#1 % 4294967296 % 4294967296 - 4294967296)) <= #length[~#g_ret~0.base] && 0 <= ~#g_ret~0.offset + 4 * (if ~idx~1#1 % 4294967296 % 4294967296 <= 2147483647 then ~idx~1#1 % 4294967296 % 4294967296 else ~idx~1#1 % 4294967296 % 4294967296 - 4294967296)); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5979: assume { :end_inline_vatomic32_await_eq_rlx } true;havoc bounded_mpmc_deq_#t~ret774#1; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-3: SUMMARY for call #t~mem780#1 := read~int#5(#t~mem779#1.base, #t~mem779#1.offset, 4); srcloc: null [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-3: assume !(1 == #valid[#t~mem779#1.base]); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-3: assume !(4 + #t~mem779#1.offset <= #length[#t~mem779#1.base] && 0 <= #t~mem779#1.offset); [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5979-1: havoc vatomic32_await_eq_rlx_#in~a#1.base, vatomic32_await_eq_rlx_#in~a#1.offset, vatomic32_await_eq_rlx_#in~v#1; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045: havoc #t~mem780#1; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-1: havoc #t~mem779#1.base, #t~mem779#1.offset; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808: havoc vatomic32_await_eq_rlx_#t~ret172#1; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5979-4: havoc vatomic32_await_eq_rlx_#t~ret172#1, vatomic32_await_eq_rlx_~a#1.base, vatomic32_await_eq_rlx_~a#1.offset, vatomic32_await_eq_rlx_~v#1; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5979-5: havoc vatomic32_await_eq_rlx_#res#1; [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-4: SUMMARY for call #t~mem779#1.base, #t~mem779#1.offset := read~$Pointer$#3(~#r~0#1.base, ~#r~0#1.offset, 4); srcloc: null [2025-02-08 08:45:49,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-4: assume !(1 == #valid[~#r~0#1.base]); [2025-02-08 08:45:49,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-4: assume !(4 + ~#r~0#1.offset <= #length[~#r~0#1.base] && 0 <= ~#r~0#1.offset); [2025-02-08 08:45:49,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5979-2: havoc vatomic32_await_eq_rlx_#t~ret172#1, vatomic32_await_eq_rlx_~a#1.base, vatomic32_await_eq_rlx_~a#1.offset, vatomic32_await_eq_rlx_~v#1; [2025-02-08 08:45:49,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808-2: havoc vatomic32_await_eq_rlx_#t~ret172#1; [2025-02-08 08:45:49,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5979-3: bounded_mpmc_deq_#t~ret774#1 := vatomic32_await_eq_rlx_#res#1; [2025-02-08 08:45:49,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808-4: havoc vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset, vatomic32_await_eq_#in~c#1; [2025-02-08 08:45:49,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808-3: assume { :end_inline_vatomic32_await_eq } true;vatomic32_await_eq_rlx_#res#1 := vatomic32_await_eq_rlx_#t~ret172#1; [2025-02-08 08:45:49,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808-6: vatomic32_await_eq_rlx_#t~ret172#1 := vatomic32_await_eq_#res#1; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5979-6: assume { :begin_inline_vatomic32_await_eq_rlx } true;vatomic32_await_eq_rlx_#in~a#1.base, vatomic32_await_eq_rlx_#in~a#1.offset, vatomic32_await_eq_rlx_#in~v#1 := bounded_mpmc_deq_~q#1.base, 12 + bounded_mpmc_deq_~q#1.offset, bounded_mpmc_deq_~curr~1#1; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808-5: havoc vatomic32_await_eq_#t~ret640#1, vatomic32_await_eq_#t~ite641#1, vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset, vatomic32_await_eq_~c#1, vatomic32_await_eq_~ret~0#1, vatomic32_await_eq_~o~5#1; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808-8: havoc vatomic32_await_eq_#res#1; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808-7: havoc vatomic32_await_eq_#t~ret640#1, vatomic32_await_eq_#t~ite641#1, vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset, vatomic32_await_eq_~c#1, vatomic32_await_eq_~ret~0#1, vatomic32_await_eq_~o~5#1; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808-9: assume { :begin_inline_vatomic32_await_eq } true;vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset, vatomic32_await_eq_#in~c#1 := vatomic32_await_eq_rlx_~a#1.base, vatomic32_await_eq_rlx_~a#1.offset, vatomic32_await_eq_rlx_~v#1; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4328-1: vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset := vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4328-2: vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset := vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4328: vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset := vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046: assume true; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046: assume !true; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-3: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5980-1: havoc vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-4: assume !(0 != #t~mem781#1 % 4294967296); [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-4: assume !!(0 != #t~mem781#1 % 4294967296); [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5980-2: havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-1: assume false; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-1: assume !false; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-2: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5980: assume { :end_inline_vatomic32_write_rel } true;bounded_mpmc_deq_#res#1 := 0; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-7: SUMMARY for call #t~mem781#1 := read~int#6(~#g_ret~0.base, ~#g_ret~0.offset + 4 * (if ~idx~1#1 % 4294967296 % 4294967296 <= 2147483647 then ~idx~1#1 % 4294967296 % 4294967296 else ~idx~1#1 % 4294967296 % 4294967296 - 4294967296), 4); srcloc: null [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-7: assume !(1 == #valid[~#g_ret~0.base]); [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-7: assume !(4 + (~#g_ret~0.offset + 4 * (if ~idx~1#1 % 4294967296 % 4294967296 <= 2147483647 then ~idx~1#1 % 4294967296 % 4294967296 else ~idx~1#1 % 4294967296 % 4294967296 - 4294967296)) <= #length[~#g_ret~0.base] && 0 <= ~#g_ret~0.offset + 4 * (if ~idx~1#1 % 4294967296 % 4294967296 <= 2147483647 then ~idx~1#1 % 4294967296 % 4294967296 else ~idx~1#1 % 4294967296 % 4294967296 - 4294967296)); [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-5: havoc #t~mem781#1; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5980-3: assume { :begin_inline_vatomic32_write_rel } true;vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1 := bounded_mpmc_deq_~q#1.base, 12 + bounded_mpmc_deq_~q#1.offset, bounded_mpmc_deq_~next~1#1; [2025-02-08 08:45:49,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-6: havoc #t~mem781#1; [2025-02-08 08:45:49,383 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6081: havoc main_~#r~1#1.base, main_~#r~1#1.offset; [2025-02-08 08:45:49,383 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6081-1: SUMMARY for call ULTIMATE.dealloc(main_~#r~1#1.base, main_~#r~1#1.offset); srcloc: null [2025-02-08 08:45:49,383 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:49,383 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-2: havoc verification_spin_end_~v#1; [2025-02-08 08:45:49,383 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-3: havoc verification_spin_end_~v#1; [2025-02-08 08:45:49,383 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 08:45:49,383 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-6: havoc vatomic32_await_eq_#t~ite641#1; [2025-02-08 08:45:49,383 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-7: assume 0 != vatomic32_await_eq_#t~ite641#1; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-7: assume !(0 != vatomic32_await_eq_#t~ite641#1); [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-5: havoc vatomic32_await_eq_#t~ite641#1; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_eq_#t~ite641#1 := 0; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-11: havoc verification_spin_end_#in~v#1; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-8: havoc vatomic32_await_eq_#t~ret640#1; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-9: havoc vatomic32_await_eq_#t~ret640#1; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-14: assume vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-14: assume !(vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296); [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-15: vatomic32_await_eq_#t~ite641#1 := 1; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-12: havoc verification_spin_end_~v#1; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-13: havoc verification_spin_end_~v#1; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-19: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 08:45:49,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_eq_~o~5#1 := vatomic32_await_eq_#t~ret640#1; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-20: vatomic32_await_eq_#t~ret640#1 := vatomic32_read_#res#1; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394: assume true; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394: assume !true; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394-1: assume false; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394-1: assume !false; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5395: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~o~5#1; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6058: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6058-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1118: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1118-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121: assume true; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121: assume !true; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-1: assume false; [2025-02-08 08:45:49,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-1: assume !false; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-2: assume true; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-2: assume !true; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-3: assume false; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-3: assume !false; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-4: assume true; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-4: assume !true; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-5: assume false; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-5: assume !false; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-6: assume true; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-6: assume !true; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-7: assume false; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-7: assume !false; [2025-02-08 08:45:49,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-8: assume true; [2025-02-08 08:45:49,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-8: assume !true; [2025-02-08 08:45:49,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-9: assume false; [2025-02-08 08:45:49,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-9: assume !false; [2025-02-08 08:45:49,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-10: assume true; [2025-02-08 08:45:49,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-10: assume !true; [2025-02-08 08:45:49,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-11: assume false; [2025-02-08 08:45:49,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-11: assume !false; [2025-02-08 08:45:49,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-10: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808: havoc vatomic32_await_eq_rlx_#t~ret172#1; [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: vatomic32_cmpxchg_rel_~v#1 := vatomic32_cmpxchg_rel_#in~v#1; [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480-2: vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset := vatomic32_cmpxchg_rel_#in~a#1.base, vatomic32_cmpxchg_rel_#in~a#1.offset; [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480-1: vatomic32_cmpxchg_rel_~e#1 := vatomic32_cmpxchg_rel_#in~e#1; [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4479: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_~e#1; [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-1: vatomic32_read_~tmp~2#1 := vatomic32_read_#t~mem436#1; [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-2: [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332: havoc vatomic32_read_#t~mem436#1; [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-3: SUMMARY for call vatomic32_read_#t~mem436#1 := read~int#1(vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-3: assume !(1 == #valid[vatomic32_read_~a#1.base]); [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-3: assume !(4 + vatomic32_read_~a#1.offset <= #length[vatomic32_read_~a#1.base] && 0 <= vatomic32_read_~a#1.offset); [2025-02-08 08:45:49,501 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-4: [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-2: havoc vatomic32_cmpxchg_#t~ret452#1; [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-3: havoc vatomic32_cmpxchg_#t~ret454#1; [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc vatomic32_cmpxchg_#t~ret454#1; [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-1: havoc vatomic32_cmpxchg_#t~mem453#1; [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-6: [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-7: SUMMARY for call write~int#1(vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-7: assume !(1 == #valid[vatomic32_cmpxchg_~a#1.base]); [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-7: assume !(4 + vatomic32_cmpxchg_~a#1.offset <= #length[vatomic32_cmpxchg_~a#1.base] && 0 <= vatomic32_cmpxchg_~a#1.offset); [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-4: havoc vatomic32_cmpxchg_#t~mem453#1; [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-5: havoc vatomic32_cmpxchg_#t~ret452#1; [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-10: vatomic32_cmpxchg_#t~ret452#1 := (if vatomic32_cmpxchg_#t~mem453#1 == vatomic32_cmpxchg_#t~ret454#1 then 1 else 0); [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-11: vatomic32_cmpxchg_#t~ret454#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-8: assume 0 != vatomic32_cmpxchg_#t~ret452#1 % 256; [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-8: assume !(0 != vatomic32_cmpxchg_#t~ret452#1 % 256); [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-9: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_#t~mem453#1; [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2450: vatomic32_write_rel_~v#1 := vatomic32_write_rel_#in~v#1; [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-12: SUMMARY for call vatomic32_cmpxchg_#t~mem453#1 := read~int#1(vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,502 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-12: assume !(1 == #valid[vatomic32_cmpxchg_~a#1.base]); [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-12: assume !(4 + vatomic32_cmpxchg_~a#1.offset <= #length[vatomic32_cmpxchg_~a#1.base] && 0 <= vatomic32_cmpxchg_~a#1.offset); [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-13: [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-3: assume { :end_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_rel_#res#1 := vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2450-1: vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset := vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-2: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-5: havoc vatomic32_cmpxchg_#t~ret452#1, vatomic32_cmpxchg_#t~mem453#1, vatomic32_cmpxchg_#t~ret454#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-4: havoc vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-7: havoc vatomic32_cmpxchg_#t~ret452#1, vatomic32_cmpxchg_#t~mem453#1, vatomic32_cmpxchg_#t~ret454#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-6: vatomic32_cmpxchg_rel_#t~ret123#1 := vatomic32_cmpxchg_#res#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-9: assume { :begin_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1 := vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset, vatomic32_cmpxchg_rel_~e#1, vatomic32_cmpxchg_rel_~v#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-8: havoc vatomic32_cmpxchg_#res#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4334-1: vatomic32_read_#res#1 := vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2435: vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset := vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4484-1: vatomic32_cmpxchg_#res#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954: havoc bounded_mpmc_enq_#t~ret762#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954-3: havoc vatomic32_read_acq_#t~ret117#1, vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954-4: bounded_mpmc_enq_#t~ret762#1 := vatomic32_read_acq_#res#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954-1: assume { :end_inline_vatomic32_read_acq } true;bounded_mpmc_enq_~curr~0#1 := bounded_mpmc_enq_#t~ret762#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954-2: havoc vatomic32_read_acq_#in~a#1.base, vatomic32_read_acq_#in~a#1.offset; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-1: havoc vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453: assume { :end_inline_vatomic32_write } true;havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-3: havoc vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-2: havoc vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-4: assume { :begin_inline_vatomic32_write } true;vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1 := vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955: havoc bounded_mpmc_enq_#t~mem764#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-1: havoc bounded_mpmc_enq_#t~mem764#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6021: havoc ~#xbo~0#1.base, ~#xbo~0#1.offset; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6021-1: SUMMARY for call ULTIMATE.dealloc(~#xbo~0#1.base, ~#xbo~0#1.offset); srcloc: null [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-4: havoc bounded_mpmc_enq_#t~ret763#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-5: SUMMARY for call bounded_mpmc_enq_#t~mem764#1 := read~int#1(bounded_mpmc_enq_~q#1.base, 20 + bounded_mpmc_enq_~q#1.offset, 4); srcloc: null [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-5: assume !(1 == #valid[bounded_mpmc_enq_~q#1.base]); [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-5: assume !(4 + (20 + bounded_mpmc_enq_~q#1.offset) <= #length[bounded_mpmc_enq_~q#1.base] && 0 <= 20 + bounded_mpmc_enq_~q#1.offset); [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-2: assume (bounded_mpmc_enq_~curr~0#1 - bounded_mpmc_enq_#t~ret763#1) % 4294967296 == bounded_mpmc_enq_#t~mem764#1 % 4294967296; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-2: assume !((bounded_mpmc_enq_~curr~0#1 - bounded_mpmc_enq_#t~ret763#1) % 4294967296 == bounded_mpmc_enq_#t~mem764#1 % 4294967296); [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-3: havoc bounded_mpmc_enq_#t~ret763#1; [2025-02-08 08:45:49,503 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-8: bounded_mpmc_enq_#t~ret763#1 := vatomic32_read_rlx_#res#1; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-9: havoc vatomic32_read_rlx_#t~ret116#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-6: havoc vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset;assume { :end_inline_vatomic32_read_rlx } true; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-7: havoc vatomic32_read_rlx_#t~ret116#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-10: havoc vatomic32_read_rlx_#res#1; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-11: assume { :begin_inline_vatomic32_read_rlx } true;vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset := bounded_mpmc_enq_~q#1.base, 12 + bounded_mpmc_enq_~q#1.offset; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5956-1: bounded_mpmc_enq_#res#1 := 1; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-2: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-4: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-3: assume { :end_inline_vatomic32_read } true;vatomic32_read_rlx_#res#1 := vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-6: vatomic32_read_rlx_#t~ret116#1 := vatomic32_read_#res#1; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-5: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-8: havoc vatomic32_read_#res#1; [2025-02-08 08:45:49,504 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-7: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-9: assume { :begin_inline_vatomic32_read } true;vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset := vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5958: bounded_mpmc_enq_~next~0#1 := 1 + bounded_mpmc_enq_~curr~0#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959: assume bounded_mpmc_enq_#t~ret765#1 != bounded_mpmc_enq_~curr~0#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959: assume !(bounded_mpmc_enq_#t~ret765#1 != bounded_mpmc_enq_~curr~0#1); [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-1: havoc bounded_mpmc_enq_#t~ret765#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-4: havoc vatomic32_cmpxchg_rel_#t~ret123#1, vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset, vatomic32_cmpxchg_rel_~e#1, vatomic32_cmpxchg_rel_~v#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-5: bounded_mpmc_enq_#t~ret765#1 := vatomic32_cmpxchg_rel_#res#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-2: havoc bounded_mpmc_enq_#t~ret765#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-3: havoc vatomic32_cmpxchg_rel_#in~a#1.base, vatomic32_cmpxchg_rel_#in~a#1.offset, vatomic32_cmpxchg_rel_#in~e#1, vatomic32_cmpxchg_rel_#in~v#1;assume { :end_inline_vatomic32_cmpxchg_rel } true; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-8: assume { :begin_inline_vatomic32_cmpxchg_rel } true;vatomic32_cmpxchg_rel_#in~a#1.base, vatomic32_cmpxchg_rel_#in~a#1.offset, vatomic32_cmpxchg_rel_#in~e#1, vatomic32_cmpxchg_rel_#in~v#1 := bounded_mpmc_enq_~q#1.base, bounded_mpmc_enq_~q#1.offset, bounded_mpmc_enq_~curr~0#1, bounded_mpmc_enq_~next~0#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-6: havoc vatomic32_cmpxchg_rel_#t~ret123#1, vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset, vatomic32_cmpxchg_rel_~e#1, vatomic32_cmpxchg_rel_~v#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-7: havoc vatomic32_cmpxchg_rel_#res#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374: vatomic32_write_~v#1 := vatomic32_write_#in~v#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374-1: vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset := vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-3: havoc #t~ret775#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5960-1: bounded_mpmc_enq_#res#1 := 3; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-4: assume { :end_inline_bounded_mpmc_enq } true;assume -2147483648 <= #t~ret775#1 && #t~ret775#1 <= 2147483647; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-1: assume 0 != #t~ret775#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-1: assume !(0 != #t~ret775#1); [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-2: havoc #t~ret775#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-7: #t~ret775#1 := bounded_mpmc_enq_#res#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-5: havoc bounded_mpmc_enq_#in~q#1.base, bounded_mpmc_enq_#in~q#1.offset, bounded_mpmc_enq_#in~v#1.base, bounded_mpmc_enq_#in~v#1.offset; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-6: havoc bounded_mpmc_enq_#t~ret762#1, bounded_mpmc_enq_#t~ret763#1, bounded_mpmc_enq_#t~mem764#1, bounded_mpmc_enq_#t~ret765#1, bounded_mpmc_enq_#t~mem767#1.base, bounded_mpmc_enq_#t~mem767#1.offset, bounded_mpmc_enq_#t~mem766#1, bounded_mpmc_enq_~q#1.base, bounded_mpmc_enq_~q#1.offset, bounded_mpmc_enq_~v#1.base, bounded_mpmc_enq_~v#1.offset, bounded_mpmc_enq_~curr~0#1, bounded_mpmc_enq_~next~0#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027: assume { :begin_inline_verification_ignore } true;assume { :end_inline_verification_ignore } true; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-3: assume { :end_inline_vatomic32_read } true;vatomic32_read_acq_#res#1 := vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-2: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-5: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-4: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-6: vatomic32_read_acq_#t~ret117#1 := vatomic32_read_#res#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962: havoc bounded_mpmc_enq_#t~mem766#1; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-3: SUMMARY for call bounded_mpmc_enq_#t~mem766#1 := read~int#1(bounded_mpmc_enq_~q#1.base, 20 + bounded_mpmc_enq_~q#1.offset, 4); srcloc: null [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-3: assume !(1 == #valid[bounded_mpmc_enq_~q#1.base]); [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-3: assume !(4 + (20 + bounded_mpmc_enq_~q#1.offset) <= #length[bounded_mpmc_enq_~q#1.base] && 0 <= 20 + bounded_mpmc_enq_~q#1.offset); [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-4: SUMMARY for call bounded_mpmc_enq_#t~mem767#1.base, bounded_mpmc_enq_#t~mem767#1.offset := read~$Pointer$#1(bounded_mpmc_enq_~q#1.base, 16 + bounded_mpmc_enq_~q#1.offset, 4); srcloc: null [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-4: assume !(1 == #valid[bounded_mpmc_enq_~q#1.base]); [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-4: assume !(4 + (16 + bounded_mpmc_enq_~q#1.offset) <= #length[bounded_mpmc_enq_~q#1.base] && 0 <= 16 + bounded_mpmc_enq_~q#1.offset); [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-1: havoc bounded_mpmc_enq_#t~mem767#1.base, bounded_mpmc_enq_#t~mem767#1.offset; [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-2: SUMMARY for call write~$Pointer$#2(bounded_mpmc_enq_~v#1.base, bounded_mpmc_enq_~v#1.offset, bounded_mpmc_enq_#t~mem767#1.base, bounded_mpmc_enq_#t~mem767#1.offset + 4 * (if bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 else bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296), 4); srcloc: null [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-2: assume !(1 == #valid[bounded_mpmc_enq_#t~mem767#1.base]); [2025-02-08 08:45:49,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-2: assume !(4 + (bounded_mpmc_enq_#t~mem767#1.offset + 4 * (if bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 else bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)) <= #length[bounded_mpmc_enq_#t~mem767#1.base] && 0 <= bounded_mpmc_enq_#t~mem767#1.offset + 4 * (if bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 else bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)); [2025-02-08 08:45:49,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476-1: vatomic32_cmpxchg_~e#1 := vatomic32_cmpxchg_#in~e#1; [2025-02-08 08:45:49,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476-2: vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset; [2025-02-08 08:45:49,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476: vatomic32_cmpxchg_~v#1 := vatomic32_cmpxchg_#in~v#1; [2025-02-08 08:45:49,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5963: assume { :end_inline_vatomic32_write_rel } true;bounded_mpmc_enq_#res#1 := 0; [2025-02-08 08:45:49,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5963-1: havoc vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1; [2025-02-08 08:45:49,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5963-2: havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 08:45:49,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5963-3: assume { :begin_inline_vatomic32_write_rel } true;vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1 := bounded_mpmc_enq_~q#1.base, 4 + bounded_mpmc_enq_~q#1.offset, bounded_mpmc_enq_~next~0#1; [2025-02-08 08:45:49,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4328: vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset := vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:49,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378: [2025-02-08 08:45:49,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-1: SUMMARY for call write~int#1(vatomic32_write_~v#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:49,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-1: assume !(1 == #valid[vatomic32_write_~a#1.base]); [2025-02-08 08:45:49,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-1: assume !(4 + vatomic32_write_~a#1.offset <= #length[vatomic32_write_~a#1.base] && 0 <= vatomic32_write_~a#1.offset); [2025-02-08 08:45:49,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-2: [2025-02-08 08:45:49,507 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:45:49,508 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:45:49,714 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:45:49,715 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:45:49,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:49 BoogieIcfgContainer [2025-02-08 08:45:49,715 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:45:49,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:45:49,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:45:49,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:45:49,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:45:46" (1/3) ... [2025-02-08 08:45:49,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5b6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:49, skipping insertion in model container [2025-02-08 08:45:49,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:48" (2/3) ... [2025-02-08 08:45:49,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5b6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:49, skipping insertion in model container [2025-02-08 08:45:49,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:49" (3/3) ... [2025-02-08 08:45:49,722 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_empty.i [2025-02-08 08:45:49,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:45:49,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_empty.i that has 3 procedures, 178 locations, 1 initial locations, 39 loop locations, and 110 error locations. [2025-02-08 08:45:49,738 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:45:49,851 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:45:49,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 222 transitions, 458 flow [2025-02-08 08:45:50,003 INFO L124 PetriNetUnfolderBase]: 129/647 cut-off events. [2025-02-08 08:45:50,005 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:45:50,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 647 events. 129/647 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3415 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 339. Up to 12 conditions per place. [2025-02-08 08:45:50,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 222 transitions, 458 flow [2025-02-08 08:45:50,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 222 transitions, 458 flow [2025-02-08 08:45:50,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:45:50,032 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=None, 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;@2d4aaddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:45:50,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2025-02-08 08:45:50,037 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:45:50,037 INFO L124 PetriNetUnfolderBase]: 6/18 cut-off events. [2025-02-08 08:45:50,037 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:45:50,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:50,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:45:50,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:45:50,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash 56127556, now seen corresponding path program 1 times [2025-02-08 08:45:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:50,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687147507] [2025-02-08 08:45:50,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:50,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:45:50,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:45:50,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:50,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687147507] [2025-02-08 08:45:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687147507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:50,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:50,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:50,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856450024] [2025-02-08 08:45:50,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:50,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:45:50,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:50,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:45:50,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:45:50,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 222 [2025-02-08 08:45:50,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 222 transitions, 458 flow. Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:50,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:50,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 222 [2025-02-08 08:45:50,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:51,398 INFO L124 PetriNetUnfolderBase]: 5694/10977 cut-off events. [2025-02-08 08:45:51,398 INFO L125 PetriNetUnfolderBase]: For 40/42 co-relation queries the response was YES. [2025-02-08 08:45:51,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20164 conditions, 10977 events. 5694/10977 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 81125 event pairs, 5325 based on Foata normal form. 2651/9523 useless extension candidates. Maximal degree in co-relation 18537. Up to 9153 conditions per place. [2025-02-08 08:45:51,460 INFO L140 encePairwiseOnDemand]: 195/222 looper letters, 82 selfloop transitions, 0 changer transitions 0/149 dead transitions. [2025-02-08 08:45:51,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 149 transitions, 473 flow [2025-02-08 08:45:51,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:45:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:45:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions. [2025-02-08 08:45:51,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6283783783783784 [2025-02-08 08:45:51,471 INFO L175 Difference]: Start difference. First operand has 184 places, 222 transitions, 458 flow. Second operand 2 states and 279 transitions. [2025-02-08 08:45:51,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 149 transitions, 473 flow [2025-02-08 08:45:51,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 149 transitions, 473 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:45:51,477 INFO L231 Difference]: Finished difference. Result has 150 places, 149 transitions, 309 flow [2025-02-08 08:45:51,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=309, PETRI_PLACES=150, PETRI_TRANSITIONS=149} [2025-02-08 08:45:51,481 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -34 predicate places. [2025-02-08 08:45:51,481 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 149 transitions, 309 flow [2025-02-08 08:45:51,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:51,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:51,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:45:51,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:45:51,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:45:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1739917676, now seen corresponding path program 1 times [2025-02-08 08:45:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:51,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450144462] [2025-02-08 08:45:51,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:51,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:45:51,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:45:51,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:51,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:51,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:51,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450144462] [2025-02-08 08:45:51,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450144462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:51,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:51,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:51,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005153227] [2025-02-08 08:45:51,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:51,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:51,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:51,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:51,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:51,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 222 [2025-02-08 08:45:51,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 149 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:51,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:51,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 222 [2025-02-08 08:45:51,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:52,523 INFO L124 PetriNetUnfolderBase]: 5694/10974 cut-off events. [2025-02-08 08:45:52,523 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2025-02-08 08:45:52,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20161 conditions, 10974 events. 5694/10974 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 81017 event pairs, 5325 based on Foata normal form. 1/6870 useless extension candidates. Maximal degree in co-relation 20156. Up to 9134 conditions per place. [2025-02-08 08:45:52,573 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 79 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-02-08 08:45:52,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 146 transitions, 465 flow [2025-02-08 08:45:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2025-02-08 08:45:52,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506006006006006 [2025-02-08 08:45:52,575 INFO L175 Difference]: Start difference. First operand has 150 places, 149 transitions, 309 flow. Second operand 3 states and 337 transitions. [2025-02-08 08:45:52,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 146 transitions, 465 flow [2025-02-08 08:45:52,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 146 transitions, 465 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:45:52,578 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 307 flow [2025-02-08 08:45:52,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=149, PETRI_TRANSITIONS=146} [2025-02-08 08:45:52,579 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -35 predicate places. [2025-02-08 08:45:52,579 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 307 flow [2025-02-08 08:45:52,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:52,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:52,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:52,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:45:52,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:45:52,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1966981960, now seen corresponding path program 1 times [2025-02-08 08:45:52,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:52,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987029967] [2025-02-08 08:45:52,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:52,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:52,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:45:52,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:45:52,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:52,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:52,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987029967] [2025-02-08 08:45:52,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987029967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:52,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:52,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108560460] [2025-02-08 08:45:52,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:52,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:52,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:52,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:52,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:52,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 222 [2025-02-08 08:45:52,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:52,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:52,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 222 [2025-02-08 08:45:52,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:53,818 INFO L124 PetriNetUnfolderBase]: 5694/10972 cut-off events. [2025-02-08 08:45:53,821 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2025-02-08 08:45:53,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20162 conditions, 10972 events. 5694/10972 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 81224 event pairs, 5325 based on Foata normal form. 1/6870 useless extension candidates. Maximal degree in co-relation 20156. Up to 9134 conditions per place. [2025-02-08 08:45:53,901 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 79 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-02-08 08:45:53,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 465 flow [2025-02-08 08:45:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-02-08 08:45:53,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2025-02-08 08:45:53,910 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 307 flow. Second operand 3 states and 332 transitions. [2025-02-08 08:45:53,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 144 transitions, 465 flow [2025-02-08 08:45:53,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 144 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:53,916 INFO L231 Difference]: Finished difference. Result has 147 places, 144 transitions, 303 flow [2025-02-08 08:45:53,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=147, PETRI_TRANSITIONS=144} [2025-02-08 08:45:53,922 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -37 predicate places. [2025-02-08 08:45:53,922 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 144 transitions, 303 flow [2025-02-08 08:45:53,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:53,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:53,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:53,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:45:53,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:45:53,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1966981959, now seen corresponding path program 1 times [2025-02-08 08:45:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884143878] [2025-02-08 08:45:53,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:53,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:45:53,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:45:53,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:53,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:54,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:54,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884143878] [2025-02-08 08:45:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884143878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:54,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:54,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166568761] [2025-02-08 08:45:54,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:54,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:54,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:54,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:54,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 222 [2025-02-08 08:45:54,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 144 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:54,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:54,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 222 [2025-02-08 08:45:54,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:54,839 INFO L124 PetriNetUnfolderBase]: 5694/10970 cut-off events. [2025-02-08 08:45:54,839 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2025-02-08 08:45:54,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20160 conditions, 10970 events. 5694/10970 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 81154 event pairs, 5325 based on Foata normal form. 1/6869 useless extension candidates. Maximal degree in co-relation 20154. Up to 9134 conditions per place. [2025-02-08 08:45:54,876 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 79 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-02-08 08:45:54,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 461 flow [2025-02-08 08:45:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-02-08 08:45:54,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2025-02-08 08:45:54,879 INFO L175 Difference]: Start difference. First operand has 147 places, 144 transitions, 303 flow. Second operand 3 states and 332 transitions. [2025-02-08 08:45:54,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 461 flow [2025-02-08 08:45:54,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 142 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:54,882 INFO L231 Difference]: Finished difference. Result has 145 places, 142 transitions, 299 flow [2025-02-08 08:45:54,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=145, PETRI_TRANSITIONS=142} [2025-02-08 08:45:54,883 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -39 predicate places. [2025-02-08 08:45:54,884 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 142 transitions, 299 flow [2025-02-08 08:45:54,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:54,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:54,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:54,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:45:54,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:45:54,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1966979337, now seen corresponding path program 1 times [2025-02-08 08:45:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:54,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854143554] [2025-02-08 08:45:54,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:54,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:45:54,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:45:54,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:54,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:54,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854143554] [2025-02-08 08:45:54,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854143554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:54,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:54,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303599918] [2025-02-08 08:45:54,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:54,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:54,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:54,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:54,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:54,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 222 [2025-02-08 08:45:54,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 142 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:54,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:54,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 222 [2025-02-08 08:45:54,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:55,519 INFO L124 PetriNetUnfolderBase]: 5694/10967 cut-off events. [2025-02-08 08:45:55,519 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2025-02-08 08:45:55,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20156 conditions, 10967 events. 5694/10967 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 80957 event pairs, 5325 based on Foata normal form. 1/6866 useless extension candidates. Maximal degree in co-relation 20150. Up to 9134 conditions per place. [2025-02-08 08:45:55,551 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 78 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2025-02-08 08:45:55,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 139 transitions, 453 flow [2025-02-08 08:45:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2025-02-08 08:45:55,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2025-02-08 08:45:55,553 INFO L175 Difference]: Start difference. First operand has 145 places, 142 transitions, 299 flow. Second operand 3 states and 336 transitions. [2025-02-08 08:45:55,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 139 transitions, 453 flow [2025-02-08 08:45:55,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:55,555 INFO L231 Difference]: Finished difference. Result has 142 places, 139 transitions, 293 flow [2025-02-08 08:45:55,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=142, PETRI_TRANSITIONS=139} [2025-02-08 08:45:55,556 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -42 predicate places. [2025-02-08 08:45:55,556 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 139 transitions, 293 flow [2025-02-08 08:45:55,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:55,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:55,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:55,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:45:55,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:45:55,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash -483996198, now seen corresponding path program 1 times [2025-02-08 08:45:55,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:55,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686555297] [2025-02-08 08:45:55,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:55,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:55,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:45:55,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:45:55,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:55,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:55,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686555297] [2025-02-08 08:45:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686555297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:55,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:55,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:55,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095035220] [2025-02-08 08:45:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:55,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:55,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:55,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:55,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:55,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 222 [2025-02-08 08:45:55,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 139 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:55,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:55,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 222 [2025-02-08 08:45:55,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:56,544 INFO L124 PetriNetUnfolderBase]: 5694/10963 cut-off events. [2025-02-08 08:45:56,544 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2025-02-08 08:45:56,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20149 conditions, 10963 events. 5694/10963 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 81098 event pairs, 5325 based on Foata normal form. 0/6865 useless extension candidates. Maximal degree in co-relation 20143. Up to 9134 conditions per place. [2025-02-08 08:45:56,591 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 74 selfloop transitions, 3 changer transitions 0/135 dead transitions. [2025-02-08 08:45:56,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 135 transitions, 439 flow [2025-02-08 08:45:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 409 transitions. [2025-02-08 08:45:56,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4605855855855856 [2025-02-08 08:45:56,593 INFO L175 Difference]: Start difference. First operand has 142 places, 139 transitions, 293 flow. Second operand 4 states and 409 transitions. [2025-02-08 08:45:56,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 135 transitions, 439 flow [2025-02-08 08:45:56,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 135 transitions, 435 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:56,595 INFO L231 Difference]: Finished difference. Result has 139 places, 135 transitions, 287 flow [2025-02-08 08:45:56,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=139, PETRI_TRANSITIONS=135} [2025-02-08 08:45:56,596 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -45 predicate places. [2025-02-08 08:45:56,596 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 135 transitions, 287 flow [2025-02-08 08:45:56,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:56,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:56,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:56,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:45:56,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:45:56,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash -483996197, now seen corresponding path program 1 times [2025-02-08 08:45:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:56,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20211423] [2025-02-08 08:45:56,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:56,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:56,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:45:56,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:45:56,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:56,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:56,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:56,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20211423] [2025-02-08 08:45:56,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20211423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:56,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:56,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:56,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776640960] [2025-02-08 08:45:56,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:56,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:56,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:56,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:56,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:56,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 222 [2025-02-08 08:45:56,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 135 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:56,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:56,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 222 [2025-02-08 08:45:56,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:57,572 INFO L124 PetriNetUnfolderBase]: 5694/10962 cut-off events. [2025-02-08 08:45:57,573 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2025-02-08 08:45:57,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20147 conditions, 10962 events. 5694/10962 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 80986 event pairs, 5325 based on Foata normal form. 0/6865 useless extension candidates. Maximal degree in co-relation 20141. Up to 9134 conditions per place. [2025-02-08 08:45:57,605 INFO L140 encePairwiseOnDemand]: 217/222 looper letters, 71 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-02-08 08:45:57,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 134 transitions, 435 flow [2025-02-08 08:45:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2025-02-08 08:45:57,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2025-02-08 08:45:57,606 INFO L175 Difference]: Start difference. First operand has 139 places, 135 transitions, 287 flow. Second operand 4 states and 408 transitions. [2025-02-08 08:45:57,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 134 transitions, 435 flow [2025-02-08 08:45:57,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 134 transitions, 429 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:57,608 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 287 flow [2025-02-08 08:45:57,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2025-02-08 08:45:57,609 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -46 predicate places. [2025-02-08 08:45:57,609 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 287 flow [2025-02-08 08:45:57,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:57,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:57,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:57,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:45:57,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:45:57,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1263818849, now seen corresponding path program 1 times [2025-02-08 08:45:57,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:57,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150375889] [2025-02-08 08:45:57,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:57,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:45:57,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:45:57,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:57,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:57,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:57,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150375889] [2025-02-08 08:45:57,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150375889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:57,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5172450] [2025-02-08 08:45:57,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:57,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:57,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:57,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:57,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:57,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 222 [2025-02-08 08:45:57,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:57,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:57,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 222 [2025-02-08 08:45:57,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:58,473 INFO L124 PetriNetUnfolderBase]: 5694/10961 cut-off events. [2025-02-08 08:45:58,473 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2025-02-08 08:45:58,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20146 conditions, 10961 events. 5694/10961 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 80996 event pairs, 5325 based on Foata normal form. 0/6865 useless extension candidates. Maximal degree in co-relation 20140. Up to 9134 conditions per place. [2025-02-08 08:45:58,518 INFO L140 encePairwiseOnDemand]: 217/222 looper letters, 70 selfloop transitions, 4 changer transitions 0/133 dead transitions. [2025-02-08 08:45:58,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 433 flow [2025-02-08 08:45:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions. [2025-02-08 08:45:58,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-02-08 08:45:58,521 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 287 flow. Second operand 4 states and 407 transitions. [2025-02-08 08:45:58,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 433 flow [2025-02-08 08:45:58,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 425 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:58,523 INFO L231 Difference]: Finished difference. Result has 137 places, 133 transitions, 285 flow [2025-02-08 08:45:58,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2025-02-08 08:45:58,527 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -47 predicate places. [2025-02-08 08:45:58,527 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 285 flow [2025-02-08 08:45:58,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:58,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:58,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:58,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:45:58,527 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:45:58,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:58,528 INFO L85 PathProgramCache]: Analyzing trace with hash 945886170, now seen corresponding path program 1 times [2025-02-08 08:45:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:58,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458857506] [2025-02-08 08:45:58,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:58,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:45:58,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:45:58,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:58,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:58,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458857506] [2025-02-08 08:45:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458857506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:58,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102032003] [2025-02-08 08:45:58,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:58,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:58,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:58,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 222 [2025-02-08 08:45:58,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:58,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:58,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 222 [2025-02-08 08:45:58,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:59,350 INFO L124 PetriNetUnfolderBase]: 5694/10960 cut-off events. [2025-02-08 08:45:59,351 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2025-02-08 08:45:59,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20144 conditions, 10960 events. 5694/10960 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 80967 event pairs, 5325 based on Foata normal form. 0/6865 useless extension candidates. Maximal degree in co-relation 20138. Up to 9134 conditions per place. [2025-02-08 08:45:59,386 INFO L140 encePairwiseOnDemand]: 217/222 looper letters, 69 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-02-08 08:45:59,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 132 transitions, 429 flow [2025-02-08 08:45:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2025-02-08 08:45:59,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4572072072072072 [2025-02-08 08:45:59,388 INFO L175 Difference]: Start difference. First operand has 137 places, 133 transitions, 285 flow. Second operand 4 states and 406 transitions. [2025-02-08 08:45:59,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 132 transitions, 429 flow [2025-02-08 08:45:59,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 132 transitions, 421 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:59,390 INFO L231 Difference]: Finished difference. Result has 136 places, 132 transitions, 283 flow [2025-02-08 08:45:59,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=136, PETRI_TRANSITIONS=132} [2025-02-08 08:45:59,390 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -48 predicate places. [2025-02-08 08:45:59,390 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 132 transitions, 283 flow [2025-02-08 08:45:59,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:59,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:59,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:59,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:45:59,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:45:59,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1536403738, now seen corresponding path program 1 times [2025-02-08 08:45:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:59,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623207921] [2025-02-08 08:45:59,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:59,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:59,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:45:59,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:45:59,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:59,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:59,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623207921] [2025-02-08 08:45:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623207921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:59,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:59,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:59,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223039656] [2025-02-08 08:45:59,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:59,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:59,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:59,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:59,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:59,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 222 [2025-02-08 08:45:59,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 132 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:59,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:59,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 222 [2025-02-08 08:45:59,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:00,192 INFO L124 PetriNetUnfolderBase]: 5694/10959 cut-off events. [2025-02-08 08:46:00,193 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2025-02-08 08:46:00,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20142 conditions, 10959 events. 5694/10959 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 81023 event pairs, 5325 based on Foata normal form. 0/6865 useless extension candidates. Maximal degree in co-relation 20136. Up to 9134 conditions per place. [2025-02-08 08:46:00,221 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 69 selfloop transitions, 3 changer transitions 0/131 dead transitions. [2025-02-08 08:46:00,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 425 flow [2025-02-08 08:46:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2025-02-08 08:46:00,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4560810810810811 [2025-02-08 08:46:00,223 INFO L175 Difference]: Start difference. First operand has 136 places, 132 transitions, 283 flow. Second operand 4 states and 405 transitions. [2025-02-08 08:46:00,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 425 flow [2025-02-08 08:46:00,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 131 transitions, 417 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:46:00,225 INFO L231 Difference]: Finished difference. Result has 135 places, 131 transitions, 279 flow [2025-02-08 08:46:00,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=135, PETRI_TRANSITIONS=131} [2025-02-08 08:46:00,225 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -49 predicate places. [2025-02-08 08:46:00,226 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 131 transitions, 279 flow [2025-02-08 08:46:00,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:00,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:00,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:00,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:46:00,226 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:46:00,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash 464371319, now seen corresponding path program 1 times [2025-02-08 08:46:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:00,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046799382] [2025-02-08 08:46:00,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:00,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:00,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:46:00,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:46:00,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:00,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:00,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:00,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046799382] [2025-02-08 08:46:00,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046799382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:00,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:00,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:46:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708062353] [2025-02-08 08:46:00,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:00,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:00,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:00,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:00,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 222 [2025-02-08 08:46:00,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 131 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:00,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:00,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 222 [2025-02-08 08:46:00,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:00,992 INFO L124 PetriNetUnfolderBase]: 5661/11138 cut-off events. [2025-02-08 08:46:00,992 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 08:46:01,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20251 conditions, 11138 events. 5661/11138 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 84421 event pairs, 1481 based on Foata normal form. 10/7064 useless extension candidates. Maximal degree in co-relation 20245. Up to 7528 conditions per place. [2025-02-08 08:46:01,037 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 107 selfloop transitions, 5 changer transitions 0/170 dead transitions. [2025-02-08 08:46:01,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 170 transitions, 584 flow [2025-02-08 08:46:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2025-02-08 08:46:01,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2025-02-08 08:46:01,039 INFO L175 Difference]: Start difference. First operand has 135 places, 131 transitions, 279 flow. Second operand 4 states and 450 transitions. [2025-02-08 08:46:01,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 170 transitions, 584 flow [2025-02-08 08:46:01,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 170 transitions, 578 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:46:01,047 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 302 flow [2025-02-08 08:46:01,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-02-08 08:46:01,048 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -48 predicate places. [2025-02-08 08:46:01,048 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 302 flow [2025-02-08 08:46:01,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:01,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:01,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:01,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:46:01,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:46:01,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash 464371318, now seen corresponding path program 1 times [2025-02-08 08:46:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:01,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74806807] [2025-02-08 08:46:01,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:01,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:01,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:46:01,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:46:01,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:01,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:01,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:01,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74806807] [2025-02-08 08:46:01,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74806807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:01,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:01,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:01,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198259639] [2025-02-08 08:46:01,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:01,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:01,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:01,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:01,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:01,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 222 [2025-02-08 08:46:01,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:01,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:01,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 222 [2025-02-08 08:46:01,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:01,846 INFO L124 PetriNetUnfolderBase]: 6557/13314 cut-off events. [2025-02-08 08:46:01,847 INFO L125 PetriNetUnfolderBase]: For 552/607 co-relation queries the response was YES. [2025-02-08 08:46:01,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25062 conditions, 13314 events. 6557/13314 cut-off events. For 552/607 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 109885 event pairs, 5012 based on Foata normal form. 0/8643 useless extension candidates. Maximal degree in co-relation 25054. Up to 9148 conditions per place. [2025-02-08 08:46:01,893 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 134 selfloop transitions, 5 changer transitions 0/191 dead transitions. [2025-02-08 08:46:01,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 191 transitions, 722 flow [2025-02-08 08:46:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-02-08 08:46:01,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5615615615615616 [2025-02-08 08:46:01,895 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 302 flow. Second operand 3 states and 374 transitions. [2025-02-08 08:46:01,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 191 transitions, 722 flow [2025-02-08 08:46:01,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 191 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:01,903 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 334 flow [2025-02-08 08:46:01,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2025-02-08 08:46:01,903 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -46 predicate places. [2025-02-08 08:46:01,903 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 334 flow [2025-02-08 08:46:01,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:01,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:01,904 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] [2025-02-08 08:46:01,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:46:01,904 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:46:01,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:01,904 INFO L85 PathProgramCache]: Analyzing trace with hash -59488182, now seen corresponding path program 1 times [2025-02-08 08:46:01,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:01,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863999200] [2025-02-08 08:46:01,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:01,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:46:01,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:46:01,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:01,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:02,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:02,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863999200] [2025-02-08 08:46:02,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863999200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:02,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:02,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:46:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049361759] [2025-02-08 08:46:02,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:02,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:46:02,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:02,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:46:02,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:46:02,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 222 [2025-02-08 08:46:02,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 136 transitions, 334 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:02,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:02,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 222 [2025-02-08 08:46:02,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:03,270 INFO L124 PetriNetUnfolderBase]: 8097/17418 cut-off events. [2025-02-08 08:46:03,271 INFO L125 PetriNetUnfolderBase]: For 1875/1932 co-relation queries the response was YES. [2025-02-08 08:46:03,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32957 conditions, 17418 events. 8097/17418 cut-off events. For 1875/1932 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 155355 event pairs, 5226 based on Foata normal form. 2/11857 useless extension candidates. Maximal degree in co-relation 32948. Up to 8671 conditions per place. [2025-02-08 08:46:03,341 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 177 selfloop transitions, 5 changer transitions 0/235 dead transitions. [2025-02-08 08:46:03,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 235 transitions, 923 flow [2025-02-08 08:46:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:46:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:46:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2025-02-08 08:46:03,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509009009009009 [2025-02-08 08:46:03,345 INFO L175 Difference]: Start difference. First operand has 138 places, 136 transitions, 334 flow. Second operand 5 states and 565 transitions. [2025-02-08 08:46:03,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 235 transitions, 923 flow [2025-02-08 08:46:03,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 235 transitions, 913 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:03,352 INFO L231 Difference]: Finished difference. Result has 142 places, 137 transitions, 356 flow [2025-02-08 08:46:03,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=142, PETRI_TRANSITIONS=137} [2025-02-08 08:46:03,353 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -42 predicate places. [2025-02-08 08:46:03,353 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 137 transitions, 356 flow [2025-02-08 08:46:03,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:03,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:03,354 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] [2025-02-08 08:46:03,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:46:03,354 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:46:03,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:03,354 INFO L85 PathProgramCache]: Analyzing trace with hash -59488181, now seen corresponding path program 1 times [2025-02-08 08:46:03,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:03,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779538964] [2025-02-08 08:46:03,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:03,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:03,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:46:03,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:46:03,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:03,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:03,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:03,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779538964] [2025-02-08 08:46:03,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779538964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:03,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:03,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:46:03,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998224195] [2025-02-08 08:46:03,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:03,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:46:03,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:03,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:46:03,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:46:04,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 222 [2025-02-08 08:46:04,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 137 transitions, 356 flow. Second operand has 9 states, 9 states have (on average 77.77777777777777) internal successors, (700), 9 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:04,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:04,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 222 [2025-02-08 08:46:04,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:05,567 INFO L124 PetriNetUnfolderBase]: 5528/9162 cut-off events. [2025-02-08 08:46:05,568 INFO L125 PetriNetUnfolderBase]: For 2777/2802 co-relation queries the response was YES. [2025-02-08 08:46:05,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18550 conditions, 9162 events. 5528/9162 cut-off events. For 2777/2802 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 62244 event pairs, 498 based on Foata normal form. 359/6597 useless extension candidates. Maximal degree in co-relation 18539. Up to 7026 conditions per place. [2025-02-08 08:46:05,603 INFO L140 encePairwiseOnDemand]: 213/222 looper letters, 177 selfloop transitions, 13 changer transitions 0/239 dead transitions. [2025-02-08 08:46:05,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 239 transitions, 949 flow [2025-02-08 08:46:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:46:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:46:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 948 transitions. [2025-02-08 08:46:05,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42702702702702705 [2025-02-08 08:46:05,606 INFO L175 Difference]: Start difference. First operand has 142 places, 137 transitions, 356 flow. Second operand 10 states and 948 transitions. [2025-02-08 08:46:05,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 239 transitions, 949 flow [2025-02-08 08:46:05,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 239 transitions, 924 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-02-08 08:46:05,610 INFO L231 Difference]: Finished difference. Result has 136 places, 129 transitions, 324 flow [2025-02-08 08:46:05,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=324, PETRI_PLACES=136, PETRI_TRANSITIONS=129} [2025-02-08 08:46:05,611 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -48 predicate places. [2025-02-08 08:46:05,611 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 129 transitions, 324 flow [2025-02-08 08:46:05,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 77.77777777777777) internal successors, (700), 9 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:05,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:05,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:05,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:46:05,612 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:46:05,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1845424896, now seen corresponding path program 1 times [2025-02-08 08:46:05,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:05,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717792957] [2025-02-08 08:46:05,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:05,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:46:05,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:46:05,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:05,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:46:05,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:46:05,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:46:05,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:46:05,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:05,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:46:05,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:46:05,711 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:46:05,712 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 68 remaining) [2025-02-08 08:46:05,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 68 remaining) [2025-02-08 08:46:05,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 68 remaining) [2025-02-08 08:46:05,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 68 remaining) [2025-02-08 08:46:05,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 68 remaining) [2025-02-08 08:46:05,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (62 of 68 remaining) [2025-02-08 08:46:05,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 68 remaining) [2025-02-08 08:46:05,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 68 remaining) [2025-02-08 08:46:05,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK (59 of 68 remaining) [2025-02-08 08:46:05,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 68 remaining) [2025-02-08 08:46:05,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 68 remaining) [2025-02-08 08:46:05,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 68 remaining) [2025-02-08 08:46:05,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 68 remaining) [2025-02-08 08:46:05,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 68 remaining) [2025-02-08 08:46:05,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 68 remaining) [2025-02-08 08:46:05,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 68 remaining) [2025-02-08 08:46:05,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 68 remaining) [2025-02-08 08:46:05,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (38 of 68 remaining) [2025-02-08 08:46:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (33 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (14 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (11 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 68 remaining) [2025-02-08 08:46:05,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 68 remaining) [2025-02-08 08:46:05,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 68 remaining) [2025-02-08 08:46:05,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 68 remaining) [2025-02-08 08:46:05,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 68 remaining) [2025-02-08 08:46:05,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 68 remaining) [2025-02-08 08:46:05,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 68 remaining) [2025-02-08 08:46:05,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:46:05,718 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:05,719 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:46:05,719 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:46:05,799 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 08:46:05,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 258 transitions, 548 flow [2025-02-08 08:46:05,896 INFO L124 PetriNetUnfolderBase]: 487/2332 cut-off events. [2025-02-08 08:46:05,896 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-08 08:46:05,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 2332 events. 487/2332 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 17788 event pairs, 1 based on Foata normal form. 0/1168 useless extension candidates. Maximal degree in co-relation 1238. Up to 48 conditions per place. [2025-02-08 08:46:05,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 258 transitions, 548 flow [2025-02-08 08:46:05,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 258 transitions, 548 flow [2025-02-08 08:46:05,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:46:05,919 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=None, 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;@2d4aaddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:46:05,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-02-08 08:46:05,920 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:46:05,920 INFO L124 PetriNetUnfolderBase]: 6/18 cut-off events. [2025-02-08 08:46:05,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:46:05,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:05,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:46:05,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, readerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-02-08 08:46:05,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash 64039044, now seen corresponding path program 1 times [2025-02-08 08:46:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:05,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811464245] [2025-02-08 08:46:05,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:05,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:46:05,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:46:05,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:05,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:05,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:05,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811464245] [2025-02-08 08:46:05,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811464245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:05,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:05,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:05,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477768983] [2025-02-08 08:46:05,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:05,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:46:05,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:05,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:46:05,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:46:05,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 258 [2025-02-08 08:46:05,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 258 transitions, 548 flow. Second operand has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:05,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:05,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 258 [2025-02-08 08:46:05,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand