./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.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/pthread-complex/workstealqueue_mutex-2.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 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:28:06,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:28:06,278 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:28:06,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:28:06,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:28:06,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:28:06,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:28:06,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:28:06,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:28:06,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:28:06,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:28:06,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:28:06,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:28:06,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:28:06,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:28:06,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:28:06,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:28:06,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:28:06,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:28:06,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:28:06,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:28:06,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:28:06,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:28:06,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:28:06,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:28:06,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:28:06,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:28:06,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:28:06,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:28:06,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:28:06,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:28:06,322 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 -> 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f [2025-02-08 08:28:06,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:28:06,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:28:06,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:28:06,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:28:06,632 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:28:06,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i [2025-02-08 08:28:07,992 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b980d3e4/1a0c208e2bbc40e7afcbd8b34654af5d/FLAG3f3a4e42d [2025-02-08 08:28:08,360 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:28:08,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/workstealqueue_mutex-2.i [2025-02-08 08:28:08,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b980d3e4/1a0c208e2bbc40e7afcbd8b34654af5d/FLAG3f3a4e42d [2025-02-08 08:28:08,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b980d3e4/1a0c208e2bbc40e7afcbd8b34654af5d [2025-02-08 08:28:08,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:28:08,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:28:08,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:28:08,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:28:08,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:28:08,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:28:08" (1/1) ... [2025-02-08 08:28:08,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72531e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:08, skipping insertion in model container [2025-02-08 08:28:08,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:28:08" (1/1) ... [2025-02-08 08:28:08,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:28:09,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:28:09,253 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:28:09,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:28:09,478 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:28:09,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09 WrapperNode [2025-02-08 08:28:09,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:28:09,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:28:09,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:28:09,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:28:09,485 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:28:09" (1/1) ... [2025-02-08 08:28:09,508 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:28:09" (1/1) ... [2025-02-08 08:28:09,589 INFO L138 Inliner]: procedures = 491, calls = 159, calls flagged for inlining = 48, calls inlined = 122, statements flattened = 1857 [2025-02-08 08:28:09,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:28:09,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:28:09,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:28:09,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:28:09,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (1/1) ... [2025-02-08 08:28:09,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (1/1) ... [2025-02-08 08:28:09,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (1/1) ... [2025-02-08 08:28:09,693 INFO L175 MemorySlicer]: Split 311 memory accesses to 9 slices as follows [2, 8, 4, 195, 12, 80, 2, 2, 6]. 63 percent of accesses are in the largest equivalence class. The 54 initializations are split as follows [2, 2, 0, 26, 4, 20, 0, 0, 0]. The 95 writes are split as follows [0, 2, 2, 61, 4, 20, 1, 1, 4]. [2025-02-08 08:28:09,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (1/1) ... [2025-02-08 08:28:09,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (1/1) ... [2025-02-08 08:28:09,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (1/1) ... [2025-02-08 08:28:09,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (1/1) ... [2025-02-08 08:28:09,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (1/1) ... [2025-02-08 08:28:09,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (1/1) ... [2025-02-08 08:28:09,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:28:09,788 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:28:09,788 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:28:09,788 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:28:09,789 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (1/1) ... [2025-02-08 08:28:09,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:28:09,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:09,824 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:28:09,828 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:28:09,850 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2025-02-08 08:28:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2025-02-08 08:28:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:28:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:28:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:28:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:28:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:28:09,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 08:28:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:28:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:28:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 08:28:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 08:28:09,860 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:28:10,221 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:28:10,223 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1852: assume { :end_inline_writeV } true;Steal_~found~0#1 := 0; [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1852-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1852-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-1: SUMMARY for call write~int#1(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-1: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-1: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1852-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-2: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-2: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-2: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1852-4: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 32 + ~#q~0.offset, Steal_~h~0#1; [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935: havoc ~#r~0#1.base, ~#r~0#1.offset; [2025-02-08 08:28:10,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935-1: SUMMARY for call ULTIMATE.dealloc(~#r~0#1.base, ~#r~0#1.offset); srcloc: null [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1936-1: havoc #t~post93#1; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1936-2: ~i~1#1 := 1 + #t~post93#1; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1936-3: #t~post93#1 := ~i~1#1; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937: assume 0 != #t~ret91#1 % 256; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937: assume !(0 != #t~ret91#1 % 256); [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937-1: havoc #t~ret91#1; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937-2: havoc #t~ret91#1; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937-3: havoc Steal_#in~result#1.base, Steal_#in~result#1.offset;assume { :end_inline_Steal } true; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937-4: havoc Steal_#t~ret41#1, Steal_#t~ret42#1, Steal_#t~ret43#1, Steal_#t~mem44#1, Steal_#t~bitwise45#1, Steal_#t~mem46#1.base, Steal_#t~mem46#1.offset, Steal_~temp~0#1, Steal_#t~ret47#1, Steal_~result#1.base, Steal_~result#1.offset, Steal_~found~0#1, Steal_~h~0#1; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937-5: #t~ret91#1 := Steal_#res#1; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-1: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-2: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-3: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1855: havoc Steal_#t~ret47#1; [2025-02-08 08:28:10,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1855-1: [2025-02-08 08:28:10,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822: [2025-02-08 08:28:10,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1789: Operation_~r#1.base, Operation_~r#1.offset := Operation_#in~r#1.base, Operation_#in~r#1.offset; [2025-02-08 08:28:10,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1855-2: SUMMARY for call Steal_#t~ret47#1 := #PthreadsMutexUnlock(~#q~0.base, ~#q~0.offset); srcloc: null [2025-02-08 08:28:10,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1855-3: [2025-02-08 08:28:10,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1938: assume { :end_inline_Operation } true;havoc #t~mem92#1.base, #t~mem92#1.offset; [2025-02-08 08:28:10,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1938-1: havoc Operation_#in~r#1.base, Operation_#in~r#1.offset; [2025-02-08 08:28:10,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1938-2: havoc Operation_#t~mem31#1, Operation_#t~post32#1, Operation_~r#1.base, Operation_~r#1.offset; [2025-02-08 08:28:10,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1938-3: havoc Operation_#t~mem31#1, Operation_#t~post32#1, Operation_~r#1.base, Operation_~r#1.offset; [2025-02-08 08:28:10,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1938-4: assume { :begin_inline_Operation } true;Operation_#in~r#1.base, Operation_#in~r#1.offset := #t~mem92#1.base, #t~mem92#1.offset; [2025-02-08 08:28:10,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806: [2025-02-08 08:28:10,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1938-5: SUMMARY for call #t~mem92#1.base, #t~mem92#1.offset := read~$Pointer$#7(~#r~0#1.base, ~#r~0#1.offset, 4); srcloc: null [2025-02-08 08:28:10,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1938-5: assume !(1 == #valid[~#r~0#1.base]); [2025-02-08 08:28:10,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1938-5: assume !(4 + ~#r~0#1.offset <= #length[~#r~0#1.base] && 0 <= ~#r~0#1.offset); [2025-02-08 08:28:10,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-1: [2025-02-08 08:28:10,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1856-1: Steal_#res#1 := (if 0 == Steal_~found~0#1 % 256 then 0 else 1); [2025-02-08 08:28:10,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790: havoc Operation_#t~post32#1; [2025-02-08 08:28:10,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-1: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:10,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-1: havoc Operation_#t~mem31#1; [2025-02-08 08:28:10,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-2: SUMMARY for call write~int#4(1 + Operation_#t~post32#1, Operation_~r#1.base, Operation_~r#1.offset, 4); srcloc: null [2025-02-08 08:28:10,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-2: assume !(1 == #valid[Operation_~r#1.base]); [2025-02-08 08:28:10,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-2: assume !(4 + Operation_~r#1.offset <= #length[Operation_~r#1.base] && 0 <= Operation_~r#1.offset); [2025-02-08 08:28:10,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-3: Operation_#t~post32#1 := Operation_#t~mem31#1; [2025-02-08 08:28:10,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-4: SUMMARY for call Operation_#t~mem31#1 := read~int#4(Operation_~r#1.base, Operation_~r#1.offset, 4); srcloc: null [2025-02-08 08:28:10,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-4: assume !(1 == #valid[Operation_~r#1.base]); [2025-02-08 08:28:10,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-4: assume !(4 + Operation_~r#1.offset <= #length[Operation_~r#1.base] && 0 <= Operation_~r#1.offset); [2025-02-08 08:28:10,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:10,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-1: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:10,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-2: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:10,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-2: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:10,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-2: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:10,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-3: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:10,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-4: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:10,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-5: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:10,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-5: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:10,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-5: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-1: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-1: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-1: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809: [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-1: [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-1: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-2: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-3: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-4: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-5: SUMMARY for call write~init~int#1(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-6: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-7: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:10,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-8: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-9: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-10: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-1: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-3: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-1: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-2: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-3: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-4: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-5: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-6: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-7: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-8: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-9: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: havoc readV_#t~mem39#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-2: havoc readV_#t~mem39#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-3: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-4: SUMMARY for call readV_#t~mem39#1 := read~int#1(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-4: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-4: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:10,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-5: havoc readV_#t~mem39#1; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-7: havoc readV_#t~mem39#1; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-8: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-9: SUMMARY for call readV_#t~mem39#1 := read~int#1(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-9: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-9: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1845: havoc Steal_#t~ret42#1; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1845-1: Steal_~h~0#1 := Steal_#t~ret42#1; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-1: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1845-2: assume { :end_inline_readV } true;assume -2147483648 <= Steal_#t~ret42#1 && Steal_#t~ret42#1 <= 2147483647; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-2: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1845-3: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1845-4: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1845-5: Steal_#t~ret42#1 := readV_#res#1; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846: assume { :end_inline_writeV } true;assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 36 + ~#q~0.offset; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:10,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:10,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:10,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846-4: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 32 + ~#q~0.offset, 1 + Steal_~h~0#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-1: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-2: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-3: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847: havoc Steal_~temp~0#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847-1: assume Steal_~h~0#1 < Steal_#t~ret43#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847-1: assume !(Steal_~h~0#1 < Steal_#t~ret43#1); [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814: [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847-2: havoc Steal_#t~ret43#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847-3: havoc Steal_#t~ret43#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847-4: assume { :end_inline_readV } true;assume -2147483648 <= Steal_#t~ret43#1 && Steal_#t~ret43#1 <= 2147483647; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847-5: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847-6: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847-7: Steal_#t~ret43#1 := readV_#res#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847-8: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1847-9: havoc readV_#res#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831: havoc writeV_#t~ret40#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-1: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-2: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:10,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-3: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-4: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-5: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-6: havoc atomic_exchange_#res#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-7: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-8: havoc writeV_#t~ret40#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-9: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-10: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-11: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-12: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-13: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-14: havoc atomic_exchange_#res#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848: havoc Steal_#t~bitwise45#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-15: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-1: havoc Steal_#t~mem44#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-2: Steal_~temp~0#1 := Steal_#t~bitwise45#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-1: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-3: [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-2: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-2: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-4: assume (((((Steal_~h~0#1 < 0 && Steal_#t~mem44#1 >= 0) || Steal_#t~bitwise45#1 <= Steal_~h~0#1) && ((Steal_~h~0#1 >= 0 && Steal_#t~mem44#1 < 0) || Steal_#t~bitwise45#1 <= Steal_#t~mem44#1)) && ((Steal_~h~0#1 < 0 && Steal_#t~mem44#1 < 0) || Steal_#t~bitwise45#1 >= 0)) && ((Steal_~h~0#1 >= 0 && Steal_#t~mem44#1 >= 0) || Steal_#t~bitwise45#1 > Steal_~h~0#1 + Steal_#t~mem44#1)) && Steal_#t~bitwise45#1 >= -2147483648; [2025-02-08 08:28:10,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-3: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-5: havoc Steal_#t~bitwise45#1; [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-4: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-6: assume Steal_~h~0#1 == Steal_#t~mem44#1; [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-6: assume !(Steal_~h~0#1 == Steal_#t~mem44#1); [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-5: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#1(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-5: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-5: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-7: Steal_#t~bitwise45#1 := Steal_~h~0#1; [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-6: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-6: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-6: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-8: assume 0 == Steal_~h~0#1 || 0 == Steal_#t~mem44#1; [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-8: assume !(0 == Steal_~h~0#1 || 0 == Steal_#t~mem44#1); [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-9: Steal_#t~bitwise45#1 := 0; [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-10: SUMMARY for call Steal_#t~mem44#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-10: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1848-10: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1849: havoc Steal_#t~mem46#1.base, Steal_#t~mem46#1.offset; [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1849-1: SUMMARY for call write~$Pointer$#7(Steal_#t~mem46#1.base, Steal_#t~mem46#1.offset, Steal_~result#1.base, Steal_~result#1.offset, 4); srcloc: null [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1849-1: assume !(1 == #valid[Steal_~result#1.base]); [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1849-1: assume !(4 + Steal_~result#1.offset <= #length[Steal_~result#1.base] && 0 <= Steal_~result#1.offset); [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1849-2: SUMMARY for call Steal_#t~mem46#1.base, Steal_#t~mem46#1.offset := read~$Pointer$#3(~#q~0.base, 40 + ~#q~0.offset + 4 * Steal_~temp~0#1, 4); srcloc: null [2025-02-08 08:28:10,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1849-2: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:10,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1849-2: assume !(4 + (40 + ~#q~0.offset + 4 * Steal_~temp~0#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * Steal_~temp~0#1); [2025-02-08 08:28:10,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-1: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:10,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-1: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:10,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-1: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:10,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1850: Steal_~found~0#1 := 1; [2025-02-08 08:28:12,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-118: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-118: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-118: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-119: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:12,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-120: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:12,959 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-121: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-121: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-122: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-123: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-124: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-124: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-124: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-1: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-1: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-1: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-125: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-125: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-125: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-2: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-2: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-2: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-126: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-3: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-127: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-4: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-4: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-4: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-128: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:12,960 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-128: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-5: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-5: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-5: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-129: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-6: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-130: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-7: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-7: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-7: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-131: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-131: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-131: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-8: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-8: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-8: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-132: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-132: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-132: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-9: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-10: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-10: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-10: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-11: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-11: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-11: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-15: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-16: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-16: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-16: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-17: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-17: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-17: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,964 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-18: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-19: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-19: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-19: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-20: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-20: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-20: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-21: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-22: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-22: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-22: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-23: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-23: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-23: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-24: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-25: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-25: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-25: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-26: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-26: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-26: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-27: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-28: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-28: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-28: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-29: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-29: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-29: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-30: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-31: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-31: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-31: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-1: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-32: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-32: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-32: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-2: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-33: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-3: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-34: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-34: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-34: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-35: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-35: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-35: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-5: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-36: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-6: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-37: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-37: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-37: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-7: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-38: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-38: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-38: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-8: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-39: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-9: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-40: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-40: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-40: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-10: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-41: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-41: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-41: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-11: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-42: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,968 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-12: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-43: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-43: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-43: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-13: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-44: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-44: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-44: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-14: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,969 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-45: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-15: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-46: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-46: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-46: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-47: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-47: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-47: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-16: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-48: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-17: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-49: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-49: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-49: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-18: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-50: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-50: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-50: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-51: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-52: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-52: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-52: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-53: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-53: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-53: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,970 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-54: havoc atomic_compare_exchange_strong_#t~mem37#1; [2025-02-08 08:28:12,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-55: SUMMARY for call write~int#5(atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:12,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-55: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:12,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-55: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:12,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-56: SUMMARY for call atomic_compare_exchange_strong_#t~mem37#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:12,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-56: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:12,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819-56: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:12,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1954-1: havoc main_#t~post100#1; [2025-02-08 08:28:12,971 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1954-2: main_~i~2#1 := 1 + main_#t~post100#1; [2025-02-08 08:28:12,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1954-3: main_#t~post100#1 := main_~i~2#1; [2025-02-08 08:28:12,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822: [2025-02-08 08:28:12,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1954-4: havoc main_~#r~1#1.base, main_~#r~1#1.offset; [2025-02-08 08:28:12,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-1: [2025-02-08 08:28:12,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-2: [2025-02-08 08:28:12,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-3: [2025-02-08 08:28:12,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-5: [2025-02-08 08:28:12,974 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-6: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-7: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-8: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-9: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-10: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-11: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-12: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-13: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-14: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-15: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-16: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-17: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-18: [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1955: assume { :end_inline_Push } true;assume { :begin_inline_Push } true;Push_#in~elem#1.base, Push_#in~elem#1.offset := ~#items~0.base, ~#items~0.offset + 4 * (1 + 2 * main_~i~2#1); [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1955-1: havoc Push_#in~elem#1.base, Push_#in~elem#1.offset; [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1955-2: havoc Push_#t~ret84#1, Push_#t~ret85#1, Push_#t~mem86#1, Push_#t~mem87#1, Push_#t~short88#1, Push_#t~mem89#1, Push_#t~bitwise90#1, Push_~temp~5#1, Push_~elem#1.base, Push_~elem#1.offset, Push_~t~4#1; [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-1: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-3: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-5: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-7: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-11: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-13: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-15: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-17: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,975 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-19: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-21: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-23: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-25: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956: havoc Push_#in~elem#1.base, Push_#in~elem#1.offset;assume { :end_inline_Push } true; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-27: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956-1: havoc Push_#t~ret84#1, Push_#t~ret85#1, Push_#t~mem86#1, Push_#t~mem87#1, Push_#t~short88#1, Push_#t~mem89#1, Push_#t~bitwise90#1, Push_~temp~5#1, Push_~elem#1.base, Push_~elem#1.offset, Push_~t~4#1; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-29: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956-2: havoc Push_#t~ret84#1, Push_#t~ret85#1, Push_#t~mem86#1, Push_#t~mem87#1, Push_#t~short88#1, Push_#t~mem89#1, Push_#t~bitwise90#1, Push_~temp~5#1, Push_~elem#1.base, Push_~elem#1.offset, Push_~t~4#1; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-31: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-33: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-35: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-37: atomic_compare_exchange_strong_#res#1 := (if 0 == atomic_compare_exchange_strong_~ret~0#1 then 0 else 1); [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1957: havoc main_~#r~1#1.base, main_~#r~1#1.offset; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1957-1: SUMMARY for call ULTIMATE.dealloc(main_~#r~1#1.base, main_~#r~1#1.offset); srcloc: null [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1957-2: assume { :begin_inline_Pop } true;Pop_#in~result#1.base, Pop_#in~result#1.offset := main_~#r~1#1.base, main_~#r~1#1.offset; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1957-3: SUMMARY for call main_~#r~1#1.base, main_~#r~1#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-2: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-3: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-5: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-6: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-7: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-8: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-9: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-10: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-11: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-12: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-13: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-14: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-15: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-16: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-17: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-18: readV_~v#1.base, readV_~v#1.offset := readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958: assume 0 != main_#t~ret98#1 % 256; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958: assume !(0 != main_#t~ret98#1 % 256); [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958-1: havoc main_#t~ret98#1; [2025-02-08 08:28:12,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958-2: havoc main_#t~ret98#1; [2025-02-08 08:28:12,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958-3: havoc Pop_#in~result#1.base, Pop_#in~result#1.offset;assume { :end_inline_Pop } true; [2025-02-08 08:28:12,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958-4: havoc Pop_#t~ret56#1, Pop_#t~ret57#1, Pop_#t~mem58#1, Pop_#t~bitwise59#1, Pop_#t~mem60#1.base, Pop_#t~mem60#1.offset, Pop_~temp~2#1, Pop_#t~ret61#1, Pop_~result#1.base, Pop_~result#1.offset, Pop_~t~2#1; [2025-02-08 08:28:12,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-1: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958-5: main_#t~ret98#1 := Pop_#res#1; [2025-02-08 08:28:12,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-2: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958-6: havoc Pop_#t~ret56#1, Pop_#t~ret57#1, Pop_#t~mem58#1, Pop_#t~bitwise59#1, Pop_#t~mem60#1.base, Pop_#t~mem60#1.offset, Pop_~temp~2#1, Pop_#t~ret61#1, Pop_~result#1.base, Pop_~result#1.offset, Pop_~t~2#1; [2025-02-08 08:28:12,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-3: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958-7: havoc Pop_#res#1; [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-4: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-5: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-6: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-7: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-8: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-9: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-10: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-11: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-12: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-13: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-14: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-15: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-16: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-17: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-18: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-19: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-20: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-21: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-22: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-23: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-24: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-25: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-26: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-27: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1959: assume { :end_inline_Operation } true;havoc main_#t~mem99#1.base, main_#t~mem99#1.offset; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-28: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1959-1: havoc Operation_#in~r#1.base, Operation_#in~r#1.offset; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-29: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1959-2: havoc Operation_#t~mem31#1, Operation_#t~post32#1, Operation_~r#1.base, Operation_~r#1.offset; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-30: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1959-3: havoc Operation_#t~mem31#1, Operation_#t~post32#1, Operation_~r#1.base, Operation_~r#1.offset; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-31: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1959-4: assume { :begin_inline_Operation } true;Operation_#in~r#1.base, Operation_#in~r#1.offset := main_#t~mem99#1.base, main_#t~mem99#1.offset; [2025-02-08 08:28:12,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-1: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1959-5: SUMMARY for call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$#8(main_~#r~1#1.base, main_~#r~1#1.offset, 4); srcloc: null [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1959-5: assume !(1 == #valid[main_~#r~1#1.base]); [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1959-5: assume !(4 + main_~#r~1#1.offset <= #length[main_~#r~1#1.base] && 0 <= main_~#r~1#1.offset); [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-2: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-3: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-4: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-35: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-5: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-36: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-6: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-37: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-7: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-38: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-8: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-39: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-9: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-40: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-10: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-41: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-11: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-42: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-12: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-43: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-13: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-44: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-14: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-45: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-15: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-46: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-16: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-47: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-17: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-48: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-18: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-49: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-19: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-50: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-20: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-51: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-21: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-52: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-22: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-53: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-23: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-54: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-24: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-55: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-25: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-56: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-26: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-57: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-27: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-58: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-59: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-60: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-30: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-61: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-31: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-62: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-32: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-63: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-2: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-33: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-64: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-3: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-34: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-65: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-4: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-4: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-4: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-35: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-66: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-5: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-36: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-67: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-37: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-68: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-7: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-38: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-69: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-8: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-39: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-70: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-9: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-9: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-9: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-40: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-71: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-10: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-41: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-72: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-42: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-73: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-12: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-43: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-74: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-13: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-44: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-75: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-14: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-14: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-14: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-45: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-76: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-15: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-46: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-77: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-47: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-78: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-17: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-48: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-79: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-18: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-49: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-80: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-19: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-19: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-19: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-50: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-81: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-20: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-51: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-82: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-52: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-83: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-22: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-53: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-84: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-23: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-54: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-85: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-24: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-24: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-24: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-55: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-86: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-25: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-56: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-87: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-57: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-88: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-27: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-58: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-89: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-28: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-59: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-90: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-29: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-29: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-29: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-60: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-91: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-30: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-61: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-92: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-62: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-93: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-32: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-63: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-94: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-33: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-64: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-95: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-34: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-34: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-34: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-65: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-96: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-35: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-66: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-97: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-67: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-98: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-37: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-68: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-99: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-38: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-69: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-100: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-39: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-39: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-39: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-70: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-101: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-40: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-71: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-102: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-72: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-103: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-42: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-73: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-104: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-43: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-74: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-105: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-44: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-44: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-44: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-75: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-106: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-45: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-76: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-107: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-77: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-108: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-47: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-78: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-109: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-48: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-79: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-110: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-49: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-49: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-49: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-80: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-111: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-50: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-81: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-112: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-82: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-113: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-52: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-83: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-114: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-53: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-84: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-115: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-54: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-54: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-54: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-85: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-116: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-55: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-86: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-117: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-87: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-118: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-57: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-88: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-119: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-58: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-89: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-120: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962-1: havoc main_#t~post103#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-59: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-59: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-59: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-90: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-121: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962-2: main_~i~2#1 := 1 + main_#t~post103#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-60: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-91: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-122: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962-3: main_#t~post103#1 := main_~i~2#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-92: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-123: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962-4: havoc main_~#r~2#1.base, main_~#r~2#1.offset; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-62: havoc readV_#t~mem39#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-93: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-124: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-1: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-63: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-94: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-125: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-2: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-64: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-64: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-64: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-95: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-126: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:12,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-3: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-65: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-96: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-127: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-4: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-97: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-128: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-5: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-67: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-98: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-129: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-6: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-68: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-99: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-130: assume { :begin_inline_atomic_compare_exchange_strong } true;atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1 := readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 0; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-7: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-69: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-69: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-69: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-100: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-131: SUMMARY for call write~init~int#5(0, readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-8: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-70: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-101: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-132: SUMMARY for call readV_~#expected~0#1.base, readV_~#expected~0#1.offset := #Ultimate.allocOnStack(4); srcloc: null [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-9: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-102: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-133: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-10: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-72: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-103: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-134: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-11: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-73: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-104: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-135: havoc readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-12: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-74: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-74: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-74: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-105: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826-136: SUMMARY for call ULTIMATE.dealloc(readV_~#expected~0#1.base, readV_~#expected~0#1.offset); srcloc: null [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-13: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-75: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-106: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-14: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-107: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-15: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-77: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-108: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-16: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-78: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-109: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-17: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-79: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-79: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-79: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-110: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-18: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-80: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-111: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-19: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-112: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-20: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-82: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-113: havoc atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-21: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-83: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-114: assume { :end_inline_atomic_compare_exchange_strong } true;havoc readV_#t~ret38#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-22: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-84: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-84: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-84: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-115: havoc atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset, atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset, atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-23: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-85: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-116: havoc atomic_compare_exchange_strong_#t~mem35#1, atomic_compare_exchange_strong_#t~mem36#1, atomic_compare_exchange_strong_#t~mem37#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~ret~0#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-24: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827-117: readV_#t~ret38#1 := atomic_compare_exchange_strong_#res#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-25: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-87: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-26: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-88: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1963: havoc main_~#r~2#1.base, main_~#r~2#1.offset; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-27: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-89: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-89: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-89: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1963-1: SUMMARY for call ULTIMATE.dealloc(main_~#r~2#1.base, main_~#r~2#1.offset); srcloc: null [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-28: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-90: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-29: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-30: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-92: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-31: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-93: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-1: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-32: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-94: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-94: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-94: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-2: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-33: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-95: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-3: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-34: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-4: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-35: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-97: havoc readV_#t~mem39#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-5: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-36: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-98: readV_#res#1 := readV_#t~mem39#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-6: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-37: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-99: SUMMARY for call readV_#t~mem39#1 := read~int#5(readV_~#expected~0#1.base, readV_~#expected~0#1.offset, 4); srcloc: null [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-99: assume !(1 == #valid[readV_~#expected~0#1.base]); [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828-99: assume !(4 + readV_~#expected~0#1.offset <= #length[readV_~#expected~0#1.base] && 0 <= readV_~#expected~0#1.offset); [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-7: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-38: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-8: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-39: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-9: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-40: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-10: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-41: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-11: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-42: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-12: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-43: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-13: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-44: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-14: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-45: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-15: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-46: writeV_~w#1 := writeV_#in~w#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-16: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-47: writeV_~v#1.base, writeV_~v#1.offset := writeV_#in~v#1.base, writeV_#in~v#1.offset; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-17: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-18: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-19: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-20: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-21: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-22: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-23: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-24: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-25: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-26: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964: assume 0 != main_#t~ret101#1 % 256; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964: assume !(0 != main_#t~ret101#1 % 256); [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-27: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-1: havoc main_#t~ret101#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-28: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-2: havoc main_#t~ret101#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-29: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-3: havoc Pop_#in~result#1.base, Pop_#in~result#1.offset;assume { :end_inline_Pop } true; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-30: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-4: havoc Pop_#t~ret56#1, Pop_#t~ret57#1, Pop_#t~mem58#1, Pop_#t~bitwise59#1, Pop_#t~mem60#1.base, Pop_#t~mem60#1.offset, Pop_~temp~2#1, Pop_#t~ret61#1, Pop_~result#1.base, Pop_~result#1.offset, Pop_~t~2#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-31: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-5: main_#t~ret101#1 := Pop_#res#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-32: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-33: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-34: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-35: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-36: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-37: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-38: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-39: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-40: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-41: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-42: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-43: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-44: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-45: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-46: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-47: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-48: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-49: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-50: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-51: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-52: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-53: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-54: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-55: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-56: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-57: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: assume { :end_inline_Operation } true;havoc main_#t~mem102#1.base, main_#t~mem102#1.offset; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-58: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-1: havoc Operation_#in~r#1.base, Operation_#in~r#1.offset; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-59: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-2: havoc Operation_#t~mem31#1, Operation_#t~post32#1, Operation_~r#1.base, Operation_~r#1.offset; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-60: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-3: havoc Operation_#t~mem31#1, Operation_#t~post32#1, Operation_~r#1.base, Operation_~r#1.offset; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-61: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-4: assume { :begin_inline_Operation } true;Operation_#in~r#1.base, Operation_#in~r#1.offset := main_#t~mem102#1.base, main_#t~mem102#1.offset; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-62: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-5: SUMMARY for call main_#t~mem102#1.base, main_#t~mem102#1.offset := read~$Pointer$#8(main_~#r~2#1.base, main_~#r~2#1.offset, 4); srcloc: null [2025-02-08 08:28:13,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-5: assume !(1 == #valid[main_~#r~2#1.base]); [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-5: assume !(4 + main_~#r~2#1.offset <= #length[main_~#r~2#1.base] && 0 <= main_~#r~2#1.offset); [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-63: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-64: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-65: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-66: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-67: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-68: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-69: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-70: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-71: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-72: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-73: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-74: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-75: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-76: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-77: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-78: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-79: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-80: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-81: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-82: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-83: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-84: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-85: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-86: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-87: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-88: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-89: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-90: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-91: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-92: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-93: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-94: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-95: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-96: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-97: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-98: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-99: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-100: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-101: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-102: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-103: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-104: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-105: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-106: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-107: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-108: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-109: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-110: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-111: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-112: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-113: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-114: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-115: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-116: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-117: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-118: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-119: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-120: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-121: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-122: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-123: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-124: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-125: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-126: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-127: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-128: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-129: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-130: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-131: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-132: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-133: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-134: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-135: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-136: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-137: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-138: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-139: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-140: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-141: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-142: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-143: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-144: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-145: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-146: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-147: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-148: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-149: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-150: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-151: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-152: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-153: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-154: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-155: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-156: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-157: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-158: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-159: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-160: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-161: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-162: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-163: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-164: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-165: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-166: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-167: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-168: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-169: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-170: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-171: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-172: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-173: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-174: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-175: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-176: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-177: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-178: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-179: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-180: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-181: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-182: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-183: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-184: havoc writeV_#t~ret40#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-185: assume { :end_inline_atomic_exchange } true;assume -2147483648 <= writeV_#t~ret40#1 && writeV_#t~ret40#1 <= 2147483647; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-186: havoc atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-187: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-188: writeV_#t~ret40#1 := atomic_exchange_#res#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-189: havoc atomic_exchange_#t~mem34#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, atomic_exchange_~v#1, atomic_exchange_~t~0#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-190: havoc atomic_exchange_#res#1; [2025-02-08 08:28:13,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831-191: assume { :begin_inline_atomic_exchange } true;atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset, atomic_exchange_#in~v#1 := writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1858: SyncPop_~result#1.base, SyncPop_~result#1.offset := SyncPop_#in~result#1.base, SyncPop_#in~result#1.offset; [2025-02-08 08:28:13,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1858-1: SyncPop_~result#1.base, SyncPop_~result#1.offset := SyncPop_#in~result#1.base, SyncPop_#in~result#1.offset; [2025-02-08 08:28:13,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc SyncPop_~found~1#1; [2025-02-08 08:28:13,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859-1: havoc SyncPop_~found~1#1; [2025-02-08 08:28:13,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860: havoc SyncPop_#t~ret48#1; [2025-02-08 08:28:13,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860-1: [2025-02-08 08:28:13,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860-2: SUMMARY for call SyncPop_#t~ret48#1 := #PthreadsMutexLock(~#q~0.base, ~#q~0.offset); srcloc: null [2025-02-08 08:28:13,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860-3: [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860-4: havoc SyncPop_#t~ret48#1; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860-5: [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860-6: SUMMARY for call SyncPop_#t~ret48#1 := #PthreadsMutexLock(~#q~0.base, ~#q~0.offset); srcloc: null [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860-7: [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861: havoc SyncPop_#t~ret49#1; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-1: SyncPop_~t~1#1 := SyncPop_#t~ret49#1 - 1; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-2: assume { :end_inline_readV } true;assume -2147483648 <= SyncPop_#t~ret49#1 && SyncPop_#t~ret49#1 <= 2147483647; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-3: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-4: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-5: SyncPop_#t~ret49#1 := readV_#res#1; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-6: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-7: havoc readV_#res#1; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-8: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 36 + ~#q~0.offset; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-9: havoc SyncPop_#t~ret49#1; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-10: SyncPop_~t~1#1 := SyncPop_#t~ret49#1 - 1; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-11: assume { :end_inline_readV } true;assume -2147483648 <= SyncPop_#t~ret49#1 && SyncPop_#t~ret49#1 <= 2147483647; [2025-02-08 08:28:13,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-12: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-13: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-14: SyncPop_#t~ret49#1 := readV_#res#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-15: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-16: havoc readV_#res#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-17: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 36 + ~#q~0.offset; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-2: assume false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-2: assume !false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-3: assume false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-3: assume !false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-4: assume false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-4: assume !false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-5: assume false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-5: assume !false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862: assume { :end_inline_writeV } true;assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 32 + ~#q~0.offset; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-6: assume false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-6: assume !false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-7: assume false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-7: assume !false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-8: assume false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-8: assume !false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-9: assume false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-9: assume !false; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-4: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, SyncPop_~t~1#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-5: assume { :end_inline_writeV } true;assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 32 + ~#q~0.offset; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-6: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-7: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-8: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862-9: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, SyncPop_~t~1#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863: havoc SyncPop_~temp~1#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-1: assume SyncPop_#t~ret50#1 <= SyncPop_~t~1#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-1: assume !(SyncPop_#t~ret50#1 <= SyncPop_~t~1#1); [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-2: havoc SyncPop_#t~ret50#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-3: havoc SyncPop_#t~ret50#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-4: assume { :end_inline_readV } true;assume -2147483648 <= SyncPop_#t~ret50#1 && SyncPop_#t~ret50#1 <= 2147483647; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-5: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-6: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-7: SyncPop_#t~ret50#1 := readV_#res#1; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-8: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-9: havoc readV_#res#1; [2025-02-08 08:28:13,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-10: havoc SyncPop_~temp~1#1; [2025-02-08 08:28:13,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-11: assume SyncPop_#t~ret50#1 <= SyncPop_~t~1#1; [2025-02-08 08:28:13,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-11: assume !(SyncPop_#t~ret50#1 <= SyncPop_~t~1#1); [2025-02-08 08:28:13,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-12: havoc SyncPop_#t~ret50#1; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-13: havoc SyncPop_#t~ret50#1; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-14: assume { :end_inline_readV } true;assume -2147483648 <= SyncPop_#t~ret50#1 && SyncPop_#t~ret50#1 <= 2147483647; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-15: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-16: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-17: SyncPop_#t~ret50#1 := readV_#res#1; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-18: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863-19: havoc readV_#res#1; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864: havoc SyncPop_#t~bitwise52#1; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-1: havoc SyncPop_#t~mem51#1; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-2: SyncPop_~temp~1#1 := SyncPop_#t~bitwise52#1; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-3: [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-4: assume (((((SyncPop_~t~1#1 < 0 && SyncPop_#t~mem51#1 >= 0) || SyncPop_#t~bitwise52#1 <= SyncPop_~t~1#1) && ((SyncPop_~t~1#1 >= 0 && SyncPop_#t~mem51#1 < 0) || SyncPop_#t~bitwise52#1 <= SyncPop_#t~mem51#1)) && ((SyncPop_~t~1#1 < 0 && SyncPop_#t~mem51#1 < 0) || SyncPop_#t~bitwise52#1 >= 0)) && ((SyncPop_~t~1#1 >= 0 && SyncPop_#t~mem51#1 >= 0) || SyncPop_#t~bitwise52#1 > SyncPop_~t~1#1 + SyncPop_#t~mem51#1)) && SyncPop_#t~bitwise52#1 >= -2147483648; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-5: havoc SyncPop_#t~bitwise52#1; [2025-02-08 08:28:13,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-6: assume SyncPop_~t~1#1 == SyncPop_#t~mem51#1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-6: assume !(SyncPop_~t~1#1 == SyncPop_#t~mem51#1); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-7: SyncPop_#t~bitwise52#1 := SyncPop_~t~1#1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-8: assume 0 == SyncPop_~t~1#1 || 0 == SyncPop_#t~mem51#1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-8: assume !(0 == SyncPop_~t~1#1 || 0 == SyncPop_#t~mem51#1); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-9: SyncPop_#t~bitwise52#1 := 0; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-10: SUMMARY for call SyncPop_#t~mem51#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-10: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-10: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-11: havoc SyncPop_#t~bitwise52#1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-12: havoc SyncPop_#t~mem51#1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-13: SyncPop_~temp~1#1 := SyncPop_#t~bitwise52#1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-14: [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-15: assume (((((SyncPop_~t~1#1 < 0 && SyncPop_#t~mem51#1 >= 0) || SyncPop_#t~bitwise52#1 <= SyncPop_~t~1#1) && ((SyncPop_~t~1#1 >= 0 && SyncPop_#t~mem51#1 < 0) || SyncPop_#t~bitwise52#1 <= SyncPop_#t~mem51#1)) && ((SyncPop_~t~1#1 < 0 && SyncPop_#t~mem51#1 < 0) || SyncPop_#t~bitwise52#1 >= 0)) && ((SyncPop_~t~1#1 >= 0 && SyncPop_#t~mem51#1 >= 0) || SyncPop_#t~bitwise52#1 > SyncPop_~t~1#1 + SyncPop_#t~mem51#1)) && SyncPop_#t~bitwise52#1 >= -2147483648; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-16: havoc SyncPop_#t~bitwise52#1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-17: assume SyncPop_~t~1#1 == SyncPop_#t~mem51#1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-17: assume !(SyncPop_~t~1#1 == SyncPop_#t~mem51#1); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-18: SyncPop_#t~bitwise52#1 := SyncPop_~t~1#1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-19: assume 0 == SyncPop_~t~1#1 || 0 == SyncPop_#t~mem51#1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-19: assume !(0 == SyncPop_~t~1#1 || 0 == SyncPop_#t~mem51#1); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-20: SyncPop_#t~bitwise52#1 := 0; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-21: SUMMARY for call SyncPop_#t~mem51#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-21: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-21: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865: havoc SyncPop_#t~mem53#1.base, SyncPop_#t~mem53#1.offset; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-1: SUMMARY for call write~$Pointer$#8(SyncPop_#t~mem53#1.base, SyncPop_#t~mem53#1.offset, SyncPop_~result#1.base, SyncPop_~result#1.offset, 4); srcloc: null [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-1: assume !(1 == #valid[SyncPop_~result#1.base]); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-1: assume !(4 + SyncPop_~result#1.offset <= #length[SyncPop_~result#1.base] && 0 <= SyncPop_~result#1.offset); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-2: SUMMARY for call SyncPop_#t~mem53#1.base, SyncPop_#t~mem53#1.offset := read~$Pointer$#3(~#q~0.base, 40 + ~#q~0.offset + 4 * SyncPop_~temp~1#1, 4); srcloc: null [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-2: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-2: assume !(4 + (40 + ~#q~0.offset + 4 * SyncPop_~temp~1#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * SyncPop_~temp~1#1); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-3: havoc SyncPop_#t~mem53#1.base, SyncPop_#t~mem53#1.offset; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-4: SUMMARY for call write~$Pointer$#8(SyncPop_#t~mem53#1.base, SyncPop_#t~mem53#1.offset, SyncPop_~result#1.base, SyncPop_~result#1.offset, 4); srcloc: null [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-4: assume !(1 == #valid[SyncPop_~result#1.base]); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-4: assume !(4 + SyncPop_~result#1.offset <= #length[SyncPop_~result#1.base] && 0 <= SyncPop_~result#1.offset); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-5: SUMMARY for call SyncPop_#t~mem53#1.base, SyncPop_#t~mem53#1.offset := read~$Pointer$#3(~#q~0.base, 40 + ~#q~0.offset + 4 * SyncPop_~temp~1#1, 4); srcloc: null [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-5: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865-5: assume !(4 + (40 + ~#q~0.offset + 4 * SyncPop_~temp~1#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * SyncPop_~temp~1#1); [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866: SyncPop_~found~1#1 := 1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866-1: SyncPop_~found~1#1 := 1; [2025-02-08 08:28:13,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868: assume { :end_inline_writeV } true;SyncPop_~found~1#1 := 0; [2025-02-08 08:28:13,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868-4: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, 1 + SyncPop_~t~1#1; [2025-02-08 08:28:13,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868-5: assume { :end_inline_writeV } true;SyncPop_~found~1#1 := 0; [2025-02-08 08:28:13,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868-6: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868-7: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868-8: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868-9: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, 1 + SyncPop_~t~1#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871: assume SyncPop_#t~ret54#1 > SyncPop_~t~1#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871: assume !(SyncPop_#t~ret54#1 > SyncPop_~t~1#1); [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-1: havoc SyncPop_#t~ret54#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-2: havoc SyncPop_#t~ret54#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-3: assume { :end_inline_readV } true;assume -2147483648 <= SyncPop_#t~ret54#1 && SyncPop_#t~ret54#1 <= 2147483647; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-4: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-5: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-6: SyncPop_#t~ret54#1 := readV_#res#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-7: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-8: havoc readV_#res#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-9: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 32 + ~#q~0.offset; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-10: assume SyncPop_#t~ret54#1 > SyncPop_~t~1#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-10: assume !(SyncPop_#t~ret54#1 > SyncPop_~t~1#1); [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-11: havoc SyncPop_#t~ret54#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-12: havoc SyncPop_#t~ret54#1; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-13: assume { :end_inline_readV } true;assume -2147483648 <= SyncPop_#t~ret54#1 && SyncPop_#t~ret54#1 <= 2147483647; [2025-02-08 08:28:13,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-14: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-15: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-16: SyncPop_#t~ret54#1 := readV_#res#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-17: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-18: havoc readV_#res#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-19: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 32 + ~#q~0.offset; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872: assume { :end_inline_writeV } true;assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, 0; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-4: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 32 + ~#q~0.offset, 0; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-5: assume { :end_inline_writeV } true;assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, 0; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-6: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-7: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-8: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-9: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 32 + ~#q~0.offset, 0; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1873: assume { :end_inline_writeV } true;SyncPop_~found~1#1 := 0; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1873-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1873-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1873-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1873-4: assume { :end_inline_writeV } true;SyncPop_~found~1#1 := 0; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1873-5: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1873-6: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1873-7: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876: havoc SyncPop_#t~ret55#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876-1: [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876-2: SUMMARY for call SyncPop_#t~ret55#1 := #PthreadsMutexUnlock(~#q~0.base, ~#q~0.offset); srcloc: null [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876-3: [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876-4: havoc SyncPop_#t~ret55#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876-5: [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876-6: SUMMARY for call SyncPop_#t~ret55#1 := #PthreadsMutexUnlock(~#q~0.base, ~#q~0.offset); srcloc: null [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876-7: [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1877-1: SyncPop_#res#1 := (if 0 == SyncPop_~found~1#1 % 256 then 0 else 1); [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1877-3: SyncPop_#res#1 := (if 0 == SyncPop_~found~1#1 % 256 then 0 else 1); [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1879-1: Pop_~result#1.base, Pop_~result#1.offset := Pop_#in~result#1.base, Pop_#in~result#1.offset; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880: havoc Pop_#t~ret56#1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-1: Pop_~t~2#1 := Pop_#t~ret56#1 - 1; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-2: assume { :end_inline_readV } true;assume -2147483648 <= Pop_#t~ret56#1 && Pop_#t~ret56#1 <= 2147483647; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-3: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-4: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-5: Pop_#t~ret56#1 := readV_#res#1; [2025-02-08 08:28:13,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-9: havoc Pop_#t~ret56#1; [2025-02-08 08:28:13,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-10: Pop_~t~2#1 := Pop_#t~ret56#1 - 1; [2025-02-08 08:28:13,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-11: assume { :end_inline_readV } true;assume -2147483648 <= Pop_#t~ret56#1 && Pop_#t~ret56#1 <= 2147483647; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-12: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-13: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-14: Pop_#t~ret56#1 := readV_#res#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-15: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-16: havoc readV_#res#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880-17: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 36 + ~#q~0.offset; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: assume { :end_inline_writeV } true;assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 32 + ~#q~0.offset; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881-4: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, Pop_~t~2#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881-5: assume { :end_inline_writeV } true;assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 32 + ~#q~0.offset; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881-6: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881-7: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881-8: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881-9: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, Pop_~t~2#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882: havoc Pop_~temp~2#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-1: assume Pop_#t~ret57#1 <= Pop_~t~2#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-1: assume !(Pop_#t~ret57#1 <= Pop_~t~2#1); [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-2: havoc Pop_#t~ret57#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-3: havoc Pop_#t~ret57#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-4: assume { :end_inline_readV } true;assume -2147483648 <= Pop_#t~ret57#1 && Pop_#t~ret57#1 <= 2147483647; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-5: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-6: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-7: Pop_#t~ret57#1 := readV_#res#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-8: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-9: havoc readV_#res#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-10: havoc Pop_~temp~2#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-11: assume Pop_#t~ret57#1 <= Pop_~t~2#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-11: assume !(Pop_#t~ret57#1 <= Pop_~t~2#1); [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-12: havoc Pop_#t~ret57#1; [2025-02-08 08:28:13,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-13: havoc Pop_#t~ret57#1; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-14: assume { :end_inline_readV } true;assume -2147483648 <= Pop_#t~ret57#1 && Pop_#t~ret57#1 <= 2147483647; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-15: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-16: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-17: Pop_#t~ret57#1 := readV_#res#1; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-18: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882-19: havoc readV_#res#1; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883: havoc Pop_#t~bitwise59#1; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-1: havoc Pop_#t~mem58#1; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-2: Pop_~temp~2#1 := Pop_#t~bitwise59#1; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-3: [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-4: assume (((((Pop_~t~2#1 < 0 && Pop_#t~mem58#1 >= 0) || Pop_#t~bitwise59#1 <= Pop_~t~2#1) && ((Pop_~t~2#1 >= 0 && Pop_#t~mem58#1 < 0) || Pop_#t~bitwise59#1 <= Pop_#t~mem58#1)) && ((Pop_~t~2#1 < 0 && Pop_#t~mem58#1 < 0) || Pop_#t~bitwise59#1 >= 0)) && ((Pop_~t~2#1 >= 0 && Pop_#t~mem58#1 >= 0) || Pop_#t~bitwise59#1 > Pop_~t~2#1 + Pop_#t~mem58#1)) && Pop_#t~bitwise59#1 >= -2147483648; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-5: havoc Pop_#t~bitwise59#1; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-6: assume Pop_~t~2#1 == Pop_#t~mem58#1; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-6: assume !(Pop_~t~2#1 == Pop_#t~mem58#1); [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-7: Pop_#t~bitwise59#1 := Pop_~t~2#1; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-8: assume 0 == Pop_~t~2#1 || 0 == Pop_#t~mem58#1; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-8: assume !(0 == Pop_~t~2#1 || 0 == Pop_#t~mem58#1); [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-9: Pop_#t~bitwise59#1 := 0; [2025-02-08 08:28:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-10: SUMMARY for call Pop_#t~mem58#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-10: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-10: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-11: havoc Pop_#t~bitwise59#1; [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-12: havoc Pop_#t~mem58#1; [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-13: Pop_~temp~2#1 := Pop_#t~bitwise59#1; [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-14: [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-15: assume (((((Pop_~t~2#1 < 0 && Pop_#t~mem58#1 >= 0) || Pop_#t~bitwise59#1 <= Pop_~t~2#1) && ((Pop_~t~2#1 >= 0 && Pop_#t~mem58#1 < 0) || Pop_#t~bitwise59#1 <= Pop_#t~mem58#1)) && ((Pop_~t~2#1 < 0 && Pop_#t~mem58#1 < 0) || Pop_#t~bitwise59#1 >= 0)) && ((Pop_~t~2#1 >= 0 && Pop_#t~mem58#1 >= 0) || Pop_#t~bitwise59#1 > Pop_~t~2#1 + Pop_#t~mem58#1)) && Pop_#t~bitwise59#1 >= -2147483648; [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-16: havoc Pop_#t~bitwise59#1; [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-17: assume Pop_~t~2#1 == Pop_#t~mem58#1; [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-17: assume !(Pop_~t~2#1 == Pop_#t~mem58#1); [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-18: Pop_#t~bitwise59#1 := Pop_~t~2#1; [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-19: assume 0 == Pop_~t~2#1 || 0 == Pop_#t~mem58#1; [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-19: assume !(0 == Pop_~t~2#1 || 0 == Pop_#t~mem58#1); [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-20: Pop_#t~bitwise59#1 := 0; [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-21: SUMMARY for call Pop_#t~mem58#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-21: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-21: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884: havoc Pop_#t~mem60#1.base, Pop_#t~mem60#1.offset; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-1: SUMMARY for call write~$Pointer$#8(Pop_#t~mem60#1.base, Pop_#t~mem60#1.offset, Pop_~result#1.base, Pop_~result#1.offset, 4); srcloc: null [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-1: assume !(1 == #valid[Pop_~result#1.base]); [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-1: assume !(4 + Pop_~result#1.offset <= #length[Pop_~result#1.base] && 0 <= Pop_~result#1.offset); [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-2: SUMMARY for call Pop_#t~mem60#1.base, Pop_#t~mem60#1.offset := read~$Pointer$#3(~#q~0.base, 40 + ~#q~0.offset + 4 * Pop_~temp~2#1, 4); srcloc: null [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-2: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-2: assume !(4 + (40 + ~#q~0.offset + 4 * Pop_~temp~2#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * Pop_~temp~2#1); [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-3: havoc Pop_#t~mem60#1.base, Pop_#t~mem60#1.offset; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-4: SUMMARY for call write~$Pointer$#8(Pop_#t~mem60#1.base, Pop_#t~mem60#1.offset, Pop_~result#1.base, Pop_~result#1.offset, 4); srcloc: null [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-4: assume !(1 == #valid[Pop_~result#1.base]); [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-4: assume !(4 + Pop_~result#1.offset <= #length[Pop_~result#1.base] && 0 <= Pop_~result#1.offset); [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-5: SUMMARY for call Pop_#t~mem60#1.base, Pop_#t~mem60#1.offset := read~$Pointer$#3(~#q~0.base, 40 + ~#q~0.offset + 4 * Pop_~temp~2#1, 4); srcloc: null [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-5: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884-5: assume !(4 + (40 + ~#q~0.offset + 4 * Pop_~temp~2#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * Pop_~temp~2#1); [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-1: Pop_#res#1 := 1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-3: Pop_#res#1 := 1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887: assume { :end_inline_writeV } true;assume { :begin_inline_SyncPop } true;SyncPop_#in~result#1.base, SyncPop_#in~result#1.offset := Pop_~result#1.base, Pop_~result#1.offset; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887-4: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, 1 + Pop_~t~2#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887-5: assume { :end_inline_writeV } true;assume { :begin_inline_SyncPop } true;SyncPop_#in~result#1.base, SyncPop_#in~result#1.offset := Pop_~result#1.base, Pop_~result#1.offset; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887-6: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887-7: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887-8: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887-9: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, 1 + Pop_~t~2#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888: havoc Pop_#t~ret61#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-2: havoc Pop_#t~ret61#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-3: assume { :end_inline_SyncPop } true;Pop_#res#1 := (if 0 == Pop_#t~ret61#1 % 256 then 0 else 1); [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-4: havoc SyncPop_#in~result#1.base, SyncPop_#in~result#1.offset; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-5: havoc SyncPop_#t~ret48#1, SyncPop_#t~ret49#1, SyncPop_#t~ret50#1, SyncPop_#t~mem51#1, SyncPop_#t~bitwise52#1, SyncPop_#t~mem53#1.base, SyncPop_#t~mem53#1.offset, SyncPop_~temp~1#1, SyncPop_#t~ret54#1, SyncPop_#t~ret55#1, SyncPop_~result#1.base, SyncPop_~result#1.offset, SyncPop_~found~1#1, SyncPop_~t~1#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-6: Pop_#t~ret61#1 := SyncPop_#res#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-7: havoc SyncPop_#t~ret48#1, SyncPop_#t~ret49#1, SyncPop_#t~ret50#1, SyncPop_#t~mem51#1, SyncPop_#t~bitwise52#1, SyncPop_#t~mem53#1.base, SyncPop_#t~mem53#1.offset, SyncPop_~temp~1#1, SyncPop_#t~ret54#1, SyncPop_#t~ret55#1, SyncPop_~result#1.base, SyncPop_~result#1.offset, SyncPop_~found~1#1, SyncPop_~t~1#1; [2025-02-08 08:28:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-8: havoc SyncPop_#res#1; [2025-02-08 08:28:13,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-9: havoc Pop_#t~ret61#1; [2025-02-08 08:28:13,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-11: havoc Pop_#t~ret61#1; [2025-02-08 08:28:13,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-12: assume { :end_inline_SyncPop } true;Pop_#res#1 := (if 0 == Pop_#t~ret61#1 % 256 then 0 else 1); [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-13: havoc SyncPop_#in~result#1.base, SyncPop_#in~result#1.offset; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-14: havoc SyncPop_#t~ret48#1, SyncPop_#t~ret49#1, SyncPop_#t~ret50#1, SyncPop_#t~mem51#1, SyncPop_#t~bitwise52#1, SyncPop_#t~mem53#1.base, SyncPop_#t~mem53#1.offset, SyncPop_~temp~1#1, SyncPop_#t~ret54#1, SyncPop_#t~ret55#1, SyncPop_~result#1.base, SyncPop_~result#1.offset, SyncPop_~found~1#1, SyncPop_~t~1#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-15: Pop_#t~ret61#1 := SyncPop_#res#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-16: havoc SyncPop_#t~ret48#1, SyncPop_#t~ret49#1, SyncPop_#t~ret50#1, SyncPop_#t~mem51#1, SyncPop_#t~bitwise52#1, SyncPop_#t~mem53#1.base, SyncPop_#t~mem53#1.offset, SyncPop_~temp~1#1, SyncPop_#t~ret54#1, SyncPop_#t~ret55#1, SyncPop_~result#1.base, SyncPop_~result#1.offset, SyncPop_~found~1#1, SyncPop_~t~1#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1888-17: havoc SyncPop_#res#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1891: SyncPush_~elem#1.base, SyncPush_~elem#1.offset := SyncPush_#in~elem#1.base, SyncPush_#in~elem#1.offset; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1891-1: SyncPush_~elem#1.base, SyncPush_~elem#1.offset := SyncPush_#in~elem#1.base, SyncPush_#in~elem#1.offset; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892: havoc SyncPush_#t~ret62#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892-1: [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892-2: SUMMARY for call SyncPush_#t~ret62#1 := #PthreadsMutexLock(~#q~0.base, ~#q~0.offset); srcloc: null [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892-3: [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892-4: havoc SyncPush_#t~ret62#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892-5: [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892-6: SUMMARY for call SyncPush_#t~ret62#1 := #PthreadsMutexLock(~#q~0.base, ~#q~0.offset); srcloc: null [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892-7: [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893: havoc SyncPush_#t~ret63#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-1: SyncPush_~h~1#1 := SyncPush_#t~ret63#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-2: assume { :end_inline_readV } true;assume -2147483648 <= SyncPush_#t~ret63#1 && SyncPush_#t~ret63#1 <= 2147483647; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-3: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-4: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-5: SyncPush_#t~ret63#1 := readV_#res#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-6: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-7: havoc readV_#res#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-8: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 32 + ~#q~0.offset; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-9: havoc SyncPush_#t~ret63#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-10: SyncPush_~h~1#1 := SyncPush_#t~ret63#1; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-11: assume { :end_inline_readV } true;assume -2147483648 <= SyncPush_#t~ret63#1 && SyncPush_#t~ret63#1 <= 2147483647; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-12: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-13: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-14: SyncPush_#t~ret63#1 := readV_#res#1; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-15: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-16: havoc readV_#res#1; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-17: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 32 + ~#q~0.offset; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc SyncPush_#t~ret64#1; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-1: SyncPush_~count~0#1 := SyncPush_#t~ret64#1 - SyncPush_~h~1#1; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-2: assume { :end_inline_readV } true;assume -2147483648 <= SyncPush_#t~ret64#1 && SyncPush_#t~ret64#1 <= 2147483647; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-3: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-4: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-5: SyncPush_#t~ret64#1 := readV_#res#1; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-6: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-7: havoc readV_#res#1; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-8: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 36 + ~#q~0.offset; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-9: havoc SyncPush_#t~ret64#1; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-10: SyncPush_~count~0#1 := SyncPush_#t~ret64#1 - SyncPush_~h~1#1; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-11: assume { :end_inline_readV } true;assume -2147483648 <= SyncPush_#t~ret64#1 && SyncPush_#t~ret64#1 <= 2147483647; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-12: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-13: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-14: SyncPush_#t~ret64#1 := readV_#res#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-15: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-16: havoc readV_#res#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-17: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 36 + ~#q~0.offset; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895: havoc SyncPush_#t~bitwise66#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-1: havoc SyncPush_#t~mem65#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-2: SyncPush_~h~1#1 := SyncPush_#t~bitwise66#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-3: [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-4: assume (((((SyncPush_~h~1#1 < 0 && SyncPush_#t~mem65#1 >= 0) || SyncPush_#t~bitwise66#1 <= SyncPush_~h~1#1) && ((SyncPush_~h~1#1 >= 0 && SyncPush_#t~mem65#1 < 0) || SyncPush_#t~bitwise66#1 <= SyncPush_#t~mem65#1)) && ((SyncPush_~h~1#1 < 0 && SyncPush_#t~mem65#1 < 0) || SyncPush_#t~bitwise66#1 >= 0)) && ((SyncPush_~h~1#1 >= 0 && SyncPush_#t~mem65#1 >= 0) || SyncPush_#t~bitwise66#1 > SyncPush_~h~1#1 + SyncPush_#t~mem65#1)) && SyncPush_#t~bitwise66#1 >= -2147483648; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-5: havoc SyncPush_#t~bitwise66#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-6: assume SyncPush_~h~1#1 == SyncPush_#t~mem65#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-6: assume !(SyncPush_~h~1#1 == SyncPush_#t~mem65#1); [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-7: SyncPush_#t~bitwise66#1 := SyncPush_~h~1#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-8: assume 0 == SyncPush_~h~1#1 || 0 == SyncPush_#t~mem65#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-8: assume !(0 == SyncPush_~h~1#1 || 0 == SyncPush_#t~mem65#1); [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-9: SyncPush_#t~bitwise66#1 := 0; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-10: SUMMARY for call SyncPush_#t~mem65#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-10: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-10: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-11: havoc SyncPush_#t~bitwise66#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-12: havoc SyncPush_#t~mem65#1; [2025-02-08 08:28:13,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-13: SyncPush_~h~1#1 := SyncPush_#t~bitwise66#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-14: [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-15: assume (((((SyncPush_~h~1#1 < 0 && SyncPush_#t~mem65#1 >= 0) || SyncPush_#t~bitwise66#1 <= SyncPush_~h~1#1) && ((SyncPush_~h~1#1 >= 0 && SyncPush_#t~mem65#1 < 0) || SyncPush_#t~bitwise66#1 <= SyncPush_#t~mem65#1)) && ((SyncPush_~h~1#1 < 0 && SyncPush_#t~mem65#1 < 0) || SyncPush_#t~bitwise66#1 >= 0)) && ((SyncPush_~h~1#1 >= 0 && SyncPush_#t~mem65#1 >= 0) || SyncPush_#t~bitwise66#1 > SyncPush_~h~1#1 + SyncPush_#t~mem65#1)) && SyncPush_#t~bitwise66#1 >= -2147483648; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-16: havoc SyncPush_#t~bitwise66#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-17: assume SyncPush_~h~1#1 == SyncPush_#t~mem65#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-17: assume !(SyncPush_~h~1#1 == SyncPush_#t~mem65#1); [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-18: SyncPush_#t~bitwise66#1 := SyncPush_~h~1#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-19: assume 0 == SyncPush_~h~1#1 || 0 == SyncPush_#t~mem65#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-19: assume !(0 == SyncPush_~h~1#1 || 0 == SyncPush_#t~mem65#1); [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-20: SyncPush_#t~bitwise66#1 := 0; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-21: SUMMARY for call SyncPush_#t~mem65#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-21: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-21: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: assume { :end_inline_writeV } true;assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, SyncPush_~h~1#1 + SyncPush_~count~0#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896-4: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 32 + ~#q~0.offset, SyncPush_~h~1#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896-5: assume { :end_inline_writeV } true;assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, SyncPush_~h~1#1 + SyncPush_~count~0#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896-6: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896-7: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896-8: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896-9: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 32 + ~#q~0.offset, SyncPush_~h~1#1; [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1;assume { :end_inline_writeV } true; [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897-1: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897-3: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1;assume { :end_inline_writeV } true; [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897-4: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897-5: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898: havoc SyncPush_~newsize~0#1, SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset, SyncPush_~i~0#1; [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-1: assume SyncPush_~count~0#1 >= SyncPush_#t~mem67#1; [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-1: assume !(SyncPush_~count~0#1 >= SyncPush_#t~mem67#1); [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-2: havoc SyncPush_#t~mem67#1; [2025-02-08 08:28:13,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-3: havoc SyncPush_#t~mem67#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-4: SUMMARY for call SyncPush_#t~mem67#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-4: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-4: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-5: havoc SyncPush_~newsize~0#1, SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset, SyncPush_~i~0#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-6: assume SyncPush_~count~0#1 >= SyncPush_#t~mem67#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-6: assume !(SyncPush_~count~0#1 >= SyncPush_#t~mem67#1); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-7: havoc SyncPush_#t~mem67#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-8: havoc SyncPush_#t~mem67#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-9: SUMMARY for call SyncPush_#t~mem67#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-9: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898-9: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899: havoc SyncPush_#t~mem70#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-1: havoc SyncPush_#t~mem69#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-2: havoc SyncPush_#t~ite71#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-3: havoc SyncPush_#t~mem68#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-4: SyncPush_~newsize~0#1 := SyncPush_#t~ite71#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-5: SyncPush_#t~ite71#1 := SyncPush_#t~mem69#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-6: SUMMARY for call SyncPush_#t~mem69#1 := read~int#3(~#q~0.base, 28 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-6: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-6: assume !(4 + (28 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 28 + ~#q~0.offset); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-7: SyncPush_#t~ite71#1 := 2 * (1 + SyncPush_#t~mem70#1); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-8: SUMMARY for call SyncPush_#t~mem70#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-8: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-8: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-9: assume 0 == SyncPush_#t~mem68#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-9: assume !(0 == SyncPush_#t~mem68#1); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-10: SUMMARY for call SyncPush_#t~mem68#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-10: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-10: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-11: havoc SyncPush_#t~mem70#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-12: havoc SyncPush_#t~mem69#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-13: havoc SyncPush_#t~ite71#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-14: havoc SyncPush_#t~mem68#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-15: SyncPush_~newsize~0#1 := SyncPush_#t~ite71#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-16: SyncPush_#t~ite71#1 := SyncPush_#t~mem69#1; [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-17: SUMMARY for call SyncPush_#t~mem69#1 := read~int#3(~#q~0.base, 28 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-17: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-17: assume !(4 + (28 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 28 + ~#q~0.offset); [2025-02-08 08:28:13,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-18: SyncPush_#t~ite71#1 := 2 * (1 + SyncPush_#t~mem70#1); [2025-02-08 08:28:13,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-19: SUMMARY for call SyncPush_#t~mem70#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-19: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-19: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-20: assume 0 == SyncPush_#t~mem68#1; [2025-02-08 08:28:13,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-20: assume !(0 == SyncPush_#t~mem68#1); [2025-02-08 08:28:13,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-21: SUMMARY for call SyncPush_#t~mem68#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-21: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-21: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900: assume { :end_inline_reach_error } true;assume false; [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-3: assume !(SyncPush_~newsize~0#1 < SyncPush_#t~mem72#1); [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-3: assume !!(SyncPush_~newsize~0#1 < SyncPush_#t~mem72#1); [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-4: havoc SyncPush_#t~mem72#1; [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-5: havoc SyncPush_#t~mem72#1; [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-6: SUMMARY for call SyncPush_#t~mem72#1 := read~int#3(~#q~0.base, 24 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-6: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-6: assume !(4 + (24 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 24 + ~#q~0.offset); [2025-02-08 08:28:13,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-7: assume { :end_inline_reach_error } true;assume false; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-8: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-9: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-10: assume !(SyncPush_~newsize~0#1 < SyncPush_#t~mem72#1); [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-10: assume !!(SyncPush_~newsize~0#1 < SyncPush_#t~mem72#1); [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-11: havoc SyncPush_#t~mem72#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-12: havoc SyncPush_#t~mem72#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-13: SUMMARY for call SyncPush_#t~mem72#1 := read~int#3(~#q~0.base, 24 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-13: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-13: assume !(4 + (24 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 24 + ~#q~0.offset); [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901: havoc SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901-1: SUMMARY for call ULTIMATE.dealloc(SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset); srcloc: null [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901-2: havoc SyncPush_~i~0#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901-3: SUMMARY for call SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset := #Ultimate.allocOnStack(64); srcloc: null [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901-4: havoc SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901-5: SUMMARY for call ULTIMATE.dealloc(SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset); srcloc: null [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901-6: havoc SyncPush_~i~0#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901-7: SUMMARY for call SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset := #Ultimate.allocOnStack(64); srcloc: null [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903: assume SyncPush_~i~0#1 < SyncPush_~count~0#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903: assume !(SyncPush_~i~0#1 < SyncPush_~count~0#1); [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-1: havoc SyncPush_#t~post76#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-2: SyncPush_~i~0#1 := 1 + SyncPush_#t~post76#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-3: SyncPush_#t~post76#1 := SyncPush_~i~0#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-4: SyncPush_~i~0#1 := 0; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-5: assume SyncPush_~i~0#1 < SyncPush_~count~0#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-5: assume !(SyncPush_~i~0#1 < SyncPush_~count~0#1); [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-6: havoc SyncPush_#t~post76#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-7: SyncPush_~i~0#1 := 1 + SyncPush_#t~post76#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-8: SyncPush_#t~post76#1 := SyncPush_~i~0#1; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-9: SyncPush_~i~0#1 := 0; [2025-02-08 08:28:13,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904: havoc SyncPush_#t~bitwise74#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-1: havoc SyncPush_#t~mem73#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-2: SyncPush_~temp~3#1 := SyncPush_#t~bitwise74#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-3: [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-4: assume (((((SyncPush_~h~1#1 + SyncPush_~i~0#1 < 0 && SyncPush_#t~mem73#1 >= 0) || SyncPush_#t~bitwise74#1 <= SyncPush_~h~1#1 + SyncPush_~i~0#1) && ((SyncPush_~h~1#1 + SyncPush_~i~0#1 >= 0 && SyncPush_#t~mem73#1 < 0) || SyncPush_#t~bitwise74#1 <= SyncPush_#t~mem73#1)) && ((SyncPush_~h~1#1 + SyncPush_~i~0#1 < 0 && SyncPush_#t~mem73#1 < 0) || SyncPush_#t~bitwise74#1 >= 0)) && ((SyncPush_~h~1#1 + SyncPush_~i~0#1 >= 0 && SyncPush_#t~mem73#1 >= 0) || SyncPush_#t~bitwise74#1 > SyncPush_~h~1#1 + SyncPush_~i~0#1 + SyncPush_#t~mem73#1)) && SyncPush_#t~bitwise74#1 >= -2147483648; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-5: havoc SyncPush_#t~bitwise74#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-6: assume SyncPush_~h~1#1 + SyncPush_~i~0#1 == SyncPush_#t~mem73#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-6: assume !(SyncPush_~h~1#1 + SyncPush_~i~0#1 == SyncPush_#t~mem73#1); [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-7: SyncPush_#t~bitwise74#1 := SyncPush_~h~1#1 + SyncPush_~i~0#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-8: assume 0 == SyncPush_~h~1#1 + SyncPush_~i~0#1 || 0 == SyncPush_#t~mem73#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-8: assume !(0 == SyncPush_~h~1#1 + SyncPush_~i~0#1 || 0 == SyncPush_#t~mem73#1); [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-9: SyncPush_#t~bitwise74#1 := 0; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-10: SUMMARY for call SyncPush_#t~mem73#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-10: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-10: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-11: havoc SyncPush_#t~bitwise74#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-12: havoc SyncPush_#t~mem73#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-13: SyncPush_~temp~3#1 := SyncPush_#t~bitwise74#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-14: [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-15: assume (((((SyncPush_~h~1#1 + SyncPush_~i~0#1 < 0 && SyncPush_#t~mem73#1 >= 0) || SyncPush_#t~bitwise74#1 <= SyncPush_~h~1#1 + SyncPush_~i~0#1) && ((SyncPush_~h~1#1 + SyncPush_~i~0#1 >= 0 && SyncPush_#t~mem73#1 < 0) || SyncPush_#t~bitwise74#1 <= SyncPush_#t~mem73#1)) && ((SyncPush_~h~1#1 + SyncPush_~i~0#1 < 0 && SyncPush_#t~mem73#1 < 0) || SyncPush_#t~bitwise74#1 >= 0)) && ((SyncPush_~h~1#1 + SyncPush_~i~0#1 >= 0 && SyncPush_#t~mem73#1 >= 0) || SyncPush_#t~bitwise74#1 > SyncPush_~h~1#1 + SyncPush_~i~0#1 + SyncPush_#t~mem73#1)) && SyncPush_#t~bitwise74#1 >= -2147483648; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-16: havoc SyncPush_#t~bitwise74#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-17: assume SyncPush_~h~1#1 + SyncPush_~i~0#1 == SyncPush_#t~mem73#1; [2025-02-08 08:28:13,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-17: assume !(SyncPush_~h~1#1 + SyncPush_~i~0#1 == SyncPush_#t~mem73#1); [2025-02-08 08:28:13,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-18: SyncPush_#t~bitwise74#1 := SyncPush_~h~1#1 + SyncPush_~i~0#1; [2025-02-08 08:28:13,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-19: assume 0 == SyncPush_~h~1#1 + SyncPush_~i~0#1 || 0 == SyncPush_#t~mem73#1; [2025-02-08 08:28:13,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-19: assume !(0 == SyncPush_~h~1#1 + SyncPush_~i~0#1 || 0 == SyncPush_#t~mem73#1); [2025-02-08 08:28:13,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-20: SyncPush_#t~bitwise74#1 := 0; [2025-02-08 08:28:13,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-21: SUMMARY for call SyncPush_#t~mem73#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-21: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-21: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905: havoc SyncPush_#t~mem75#1.base, SyncPush_#t~mem75#1.offset; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-1: havoc SyncPush_~temp~3#1; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-2: SUMMARY for call write~$Pointer$#2(SyncPush_#t~mem75#1.base, SyncPush_#t~mem75#1.offset, SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1, 4); srcloc: null [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-2: assume !(1 == #valid[SyncPush_~#newtasks~0#1.base]); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-2: assume !(4 + (SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1) <= #length[SyncPush_~#newtasks~0#1.base] && 0 <= SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-3: SUMMARY for call SyncPush_#t~mem75#1.base, SyncPush_#t~mem75#1.offset := read~$Pointer$#3(~#q~0.base, 40 + ~#q~0.offset + 4 * SyncPush_~temp~3#1, 4); srcloc: null [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-3: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-3: assume !(4 + (40 + ~#q~0.offset + 4 * SyncPush_~temp~3#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * SyncPush_~temp~3#1); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-4: havoc SyncPush_#t~mem75#1.base, SyncPush_#t~mem75#1.offset; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-5: havoc SyncPush_~temp~3#1; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-6: SUMMARY for call write~$Pointer$#2(SyncPush_#t~mem75#1.base, SyncPush_#t~mem75#1.offset, SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1, 4); srcloc: null [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-6: assume !(1 == #valid[SyncPush_~#newtasks~0#1.base]); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-6: assume !(4 + (SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1) <= #length[SyncPush_~#newtasks~0#1.base] && 0 <= SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-7: SUMMARY for call SyncPush_#t~mem75#1.base, SyncPush_#t~mem75#1.offset := read~$Pointer$#3(~#q~0.base, 40 + ~#q~0.offset + 4 * SyncPush_~temp~3#1, 4); srcloc: null [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-7: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-7: assume !(4 + (40 + ~#q~0.offset + 4 * SyncPush_~temp~3#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * SyncPush_~temp~3#1); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: assume SyncPush_~i~0#1 < SyncPush_~newsize~0#1; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: assume !(SyncPush_~i~0#1 < SyncPush_~newsize~0#1); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-1: havoc SyncPush_#t~post78#1; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-2: SyncPush_~i~0#1 := 1 + SyncPush_#t~post78#1; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-3: SyncPush_#t~post78#1 := SyncPush_~i~0#1; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-4: SyncPush_~i~0#1 := 0; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-5: assume SyncPush_~i~0#1 < SyncPush_~newsize~0#1; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-5: assume !(SyncPush_~i~0#1 < SyncPush_~newsize~0#1); [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-6: havoc SyncPush_#t~post78#1; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-7: SyncPush_~i~0#1 := 1 + SyncPush_#t~post78#1; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-8: SyncPush_#t~post78#1 := SyncPush_~i~0#1; [2025-02-08 08:28:13,044 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-9: SyncPush_~i~0#1 := 0; [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908: havoc SyncPush_#t~mem77#1.base, SyncPush_#t~mem77#1.offset; [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-1: SUMMARY for call write~$Pointer$#3(SyncPush_#t~mem77#1.base, SyncPush_#t~mem77#1.offset, ~#q~0.base, 40 + ~#q~0.offset + 4 * SyncPush_~i~0#1, 4); srcloc: null [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-1: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-1: assume !(4 + (40 + ~#q~0.offset + 4 * SyncPush_~i~0#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * SyncPush_~i~0#1); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-2: SUMMARY for call SyncPush_#t~mem77#1.base, SyncPush_#t~mem77#1.offset := read~$Pointer$#2(SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1, 4); srcloc: null [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-2: assume !(1 == #valid[SyncPush_~#newtasks~0#1.base]); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-2: assume !(4 + (SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1) <= #length[SyncPush_~#newtasks~0#1.base] && 0 <= SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-3: havoc SyncPush_#t~mem77#1.base, SyncPush_#t~mem77#1.offset; [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-4: SUMMARY for call write~$Pointer$#3(SyncPush_#t~mem77#1.base, SyncPush_#t~mem77#1.offset, ~#q~0.base, 40 + ~#q~0.offset + 4 * SyncPush_~i~0#1, 4); srcloc: null [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-4: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-4: assume !(4 + (40 + ~#q~0.offset + 4 * SyncPush_~i~0#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * SyncPush_~i~0#1); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-5: SUMMARY for call SyncPush_#t~mem77#1.base, SyncPush_#t~mem77#1.offset := read~$Pointer$#2(SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1, 4); srcloc: null [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-5: assume !(1 == #valid[SyncPush_~#newtasks~0#1.base]); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-5: assume !(4 + (SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1) <= #length[SyncPush_~#newtasks~0#1.base] && 0 <= SyncPush_~#newtasks~0#1.offset + 4 * SyncPush_~i~0#1); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 32 + ~#q~0.offset, 0; [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-1: SUMMARY for call write~int#3(SyncPush_~newsize~0#1 - 1, ~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-1: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-1: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-2: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 32 + ~#q~0.offset, 0; [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-3: SUMMARY for call write~int#3(SyncPush_~newsize~0#1 - 1, ~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-3: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-3: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911: assume { :end_inline_writeV } true;assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, SyncPush_~count~0#1; [2025-02-08 08:28:13,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911-4: assume { :end_inline_writeV } true;assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, SyncPush_~count~0#1; [2025-02-08 08:28:13,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911-5: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911-6: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911-7: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1912: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1;assume { :end_inline_writeV } true; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1912-1: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1912-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1912-3: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1;assume { :end_inline_writeV } true; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1912-4: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1912-5: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914: assume { :end_inline_reach_error } true;assume false; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-3: assume !(SyncPush_~count~0#1 < SyncPush_#t~mem79#1); [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-3: assume !!(SyncPush_~count~0#1 < SyncPush_#t~mem79#1); [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-4: havoc SyncPush_#t~mem79#1; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-5: havoc SyncPush_#t~mem79#1; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-6: SUMMARY for call SyncPush_#t~mem79#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-6: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-6: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-7: assume { :end_inline_reach_error } true;assume false; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-8: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-9: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-10: assume !(SyncPush_~count~0#1 < SyncPush_#t~mem79#1); [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-10: assume !!(SyncPush_~count~0#1 < SyncPush_#t~mem79#1); [2025-02-08 08:28:13,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-11: havoc SyncPush_#t~mem79#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-12: havoc SyncPush_#t~mem79#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-13: SUMMARY for call SyncPush_#t~mem79#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-13: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-13: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915: havoc SyncPush_#t~ret80#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-1: SyncPush_~t~3#1 := SyncPush_#t~ret80#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-2: assume { :end_inline_readV } true;assume -2147483648 <= SyncPush_#t~ret80#1 && SyncPush_#t~ret80#1 <= 2147483647; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-3: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-4: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-5: SyncPush_#t~ret80#1 := readV_#res#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-6: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-7: havoc readV_#res#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-8: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 36 + ~#q~0.offset; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-9: havoc SyncPush_#t~ret80#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-10: SyncPush_~t~3#1 := SyncPush_#t~ret80#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-11: assume { :end_inline_readV } true;assume -2147483648 <= SyncPush_#t~ret80#1 && SyncPush_#t~ret80#1 <= 2147483647; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-12: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-13: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-14: SyncPush_#t~ret80#1 := readV_#res#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-15: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-16: havoc readV_#res#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-17: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 36 + ~#q~0.offset; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916: havoc SyncPush_#t~bitwise82#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-1: havoc SyncPush_#t~mem81#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-2: SyncPush_~temp~4#1 := SyncPush_#t~bitwise82#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-3: [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-4: assume (((((SyncPush_~t~3#1 < 0 && SyncPush_#t~mem81#1 >= 0) || SyncPush_#t~bitwise82#1 <= SyncPush_~t~3#1) && ((SyncPush_~t~3#1 >= 0 && SyncPush_#t~mem81#1 < 0) || SyncPush_#t~bitwise82#1 <= SyncPush_#t~mem81#1)) && ((SyncPush_~t~3#1 < 0 && SyncPush_#t~mem81#1 < 0) || SyncPush_#t~bitwise82#1 >= 0)) && ((SyncPush_~t~3#1 >= 0 && SyncPush_#t~mem81#1 >= 0) || SyncPush_#t~bitwise82#1 > SyncPush_~t~3#1 + SyncPush_#t~mem81#1)) && SyncPush_#t~bitwise82#1 >= -2147483648; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-5: havoc SyncPush_#t~bitwise82#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-6: assume SyncPush_~t~3#1 == SyncPush_#t~mem81#1; [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-6: assume !(SyncPush_~t~3#1 == SyncPush_#t~mem81#1); [2025-02-08 08:28:13,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-7: SyncPush_#t~bitwise82#1 := SyncPush_~t~3#1; [2025-02-08 08:28:13,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-8: assume 0 == SyncPush_~t~3#1 || 0 == SyncPush_#t~mem81#1; [2025-02-08 08:28:13,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-8: assume !(0 == SyncPush_~t~3#1 || 0 == SyncPush_#t~mem81#1); [2025-02-08 08:28:13,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-9: SyncPush_#t~bitwise82#1 := 0; [2025-02-08 08:28:13,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-10: SUMMARY for call SyncPush_#t~mem81#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,049 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-10: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-10: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-11: havoc SyncPush_#t~bitwise82#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-12: havoc SyncPush_#t~mem81#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-13: SyncPush_~temp~4#1 := SyncPush_#t~bitwise82#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-14: [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-15: assume (((((SyncPush_~t~3#1 < 0 && SyncPush_#t~mem81#1 >= 0) || SyncPush_#t~bitwise82#1 <= SyncPush_~t~3#1) && ((SyncPush_~t~3#1 >= 0 && SyncPush_#t~mem81#1 < 0) || SyncPush_#t~bitwise82#1 <= SyncPush_#t~mem81#1)) && ((SyncPush_~t~3#1 < 0 && SyncPush_#t~mem81#1 < 0) || SyncPush_#t~bitwise82#1 >= 0)) && ((SyncPush_~t~3#1 >= 0 && SyncPush_#t~mem81#1 >= 0) || SyncPush_#t~bitwise82#1 > SyncPush_~t~3#1 + SyncPush_#t~mem81#1)) && SyncPush_#t~bitwise82#1 >= -2147483648; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-16: havoc SyncPush_#t~bitwise82#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-17: assume SyncPush_~t~3#1 == SyncPush_#t~mem81#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-17: assume !(SyncPush_~t~3#1 == SyncPush_#t~mem81#1); [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-18: SyncPush_#t~bitwise82#1 := SyncPush_~t~3#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-19: assume 0 == SyncPush_~t~3#1 || 0 == SyncPush_#t~mem81#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-19: assume !(0 == SyncPush_~t~3#1 || 0 == SyncPush_#t~mem81#1); [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-20: SyncPush_#t~bitwise82#1 := 0; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-21: SUMMARY for call SyncPush_#t~mem81#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-21: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916-21: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, 1 + SyncPush_~t~3#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917-1: SUMMARY for call write~$Pointer$#3(SyncPush_~elem#1.base, SyncPush_~elem#1.offset, ~#q~0.base, 40 + ~#q~0.offset + 4 * SyncPush_~temp~4#1, 4); srcloc: null [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917-1: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917-1: assume !(4 + (40 + ~#q~0.offset + 4 * SyncPush_~temp~4#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * SyncPush_~temp~4#1); [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917-2: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, 1 + SyncPush_~t~3#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917-3: SUMMARY for call write~$Pointer$#3(SyncPush_~elem#1.base, SyncPush_~elem#1.offset, ~#q~0.base, 40 + ~#q~0.offset + 4 * SyncPush_~temp~4#1, 4); srcloc: null [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917-3: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917-3: assume !(4 + (40 + ~#q~0.offset + 4 * SyncPush_~temp~4#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * SyncPush_~temp~4#1); [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1918: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1;assume { :end_inline_writeV } true; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1918-1: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1918-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1918-3: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1;assume { :end_inline_writeV } true; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1918-4: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1918-5: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919: havoc SyncPush_#t~ret83#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919-1: [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919-2: SUMMARY for call SyncPush_#t~ret83#1 := #PthreadsMutexUnlock(~#q~0.base, ~#q~0.offset); srcloc: null [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919-3: [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919-4: havoc SyncPush_#t~ret83#1; [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919-5: [2025-02-08 08:28:13,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919-6: SUMMARY for call SyncPush_#t~ret83#1 := #PthreadsMutexUnlock(~#q~0.base, ~#q~0.offset); srcloc: null [2025-02-08 08:28:13,051 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919-7: [2025-02-08 08:28:13,051 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: Push_~elem#1.base, Push_~elem#1.offset := Push_#in~elem#1.base, Push_#in~elem#1.offset; [2025-02-08 08:28:13,051 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1789: Operation_~r#1.base, Operation_~r#1.offset := Operation_#in~r#1.base, Operation_#in~r#1.offset; [2025-02-08 08:28:13,051 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1789-1: Operation_~r#1.base, Operation_~r#1.offset := Operation_#in~r#1.base, Operation_#in~r#1.offset; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922: havoc Push_#t~ret84#1; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-1: Push_~t~4#1 := Push_#t~ret84#1; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-2: assume { :end_inline_readV } true;assume -2147483648 <= Push_#t~ret84#1 && Push_#t~ret84#1 <= 2147483647; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-3: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790: havoc Operation_#t~post32#1; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-4: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-1: havoc Operation_#t~mem31#1; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-5: Push_#t~ret84#1 := readV_#res#1; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-2: SUMMARY for call write~int#4(1 + Operation_#t~post32#1, Operation_~r#1.base, Operation_~r#1.offset, 4); srcloc: null [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-2: assume !(1 == #valid[Operation_~r#1.base]); [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-2: assume !(4 + Operation_~r#1.offset <= #length[Operation_~r#1.base] && 0 <= Operation_~r#1.offset); [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-6: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-3: Operation_#t~post32#1 := Operation_#t~mem31#1; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-7: havoc readV_#res#1; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-4: SUMMARY for call Operation_#t~mem31#1 := read~int#4(Operation_~r#1.base, Operation_~r#1.offset, 4); srcloc: null [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-4: assume !(1 == #valid[Operation_~r#1.base]); [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-4: assume !(4 + Operation_~r#1.offset <= #length[Operation_~r#1.base] && 0 <= Operation_~r#1.offset); [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-8: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 36 + ~#q~0.offset; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-5: havoc Operation_#t~post32#1; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-9: havoc Push_#t~ret84#1; [2025-02-08 08:28:13,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-6: havoc Operation_#t~mem31#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-10: Push_~t~4#1 := Push_#t~ret84#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-7: SUMMARY for call write~int#4(1 + Operation_#t~post32#1, Operation_~r#1.base, Operation_~r#1.offset, 4); srcloc: null [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-7: assume !(1 == #valid[Operation_~r#1.base]); [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-7: assume !(4 + Operation_~r#1.offset <= #length[Operation_~r#1.base] && 0 <= Operation_~r#1.offset); [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-11: assume { :end_inline_readV } true;assume -2147483648 <= Push_#t~ret84#1 && Push_#t~ret84#1 <= 2147483647; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-8: Operation_#t~post32#1 := Operation_#t~mem31#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-12: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-9: SUMMARY for call Operation_#t~mem31#1 := read~int#4(Operation_~r#1.base, Operation_~r#1.offset, 4); srcloc: null [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-9: assume !(1 == #valid[Operation_~r#1.base]); [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790-9: assume !(4 + Operation_~r#1.offset <= #length[Operation_~r#1.base] && 0 <= Operation_~r#1.offset); [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-13: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-14: Push_#t~ret84#1 := readV_#res#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923: havoc Push_#t~short88#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-1: havoc Push_#t~mem86#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-2: havoc Push_#t~short88#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-3: havoc Push_#t~mem86#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-4: assume Push_#t~short88#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-4: assume !Push_#t~short88#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-5: havoc Push_#t~ret85#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-6: havoc Push_#t~ret85#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-7: assume Push_#t~short88#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-7: assume !Push_#t~short88#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-8: Push_#t~short88#1 := Push_~t~4#1 < Push_#t~ret85#1 + Push_#t~mem86#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-9: SUMMARY for call Push_#t~mem86#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-9: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-9: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-10: assume { :end_inline_readV } true;assume -2147483648 <= Push_#t~ret85#1 && Push_#t~ret85#1 <= 2147483647; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-11: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-12: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-13: Push_#t~ret85#1 := readV_#res#1; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-14: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-15: havoc readV_#res#1; [2025-02-08 08:28:13,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-16: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 32 + ~#q~0.offset; [2025-02-08 08:28:13,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-17: havoc Push_#t~short88#1; [2025-02-08 08:28:13,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-18: havoc Push_#t~mem86#1; [2025-02-08 08:28:13,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-19: havoc Push_#t~short88#1; [2025-02-08 08:28:13,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-20: havoc Push_#t~mem86#1; [2025-02-08 08:28:13,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-21: assume Push_#t~short88#1; [2025-02-08 08:28:13,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-21: assume !Push_#t~short88#1; [2025-02-08 08:28:13,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-22: havoc Push_#t~ret85#1; [2025-02-08 08:28:13,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-23: havoc Push_#t~ret85#1; [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-24: assume Push_#t~short88#1; [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-24: assume !Push_#t~short88#1; [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-25: Push_#t~short88#1 := Push_~t~4#1 < Push_#t~ret85#1 + Push_#t~mem86#1; [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-26: SUMMARY for call Push_#t~mem86#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-26: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-26: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-27: assume { :end_inline_readV } true;assume -2147483648 <= Push_#t~ret85#1 && Push_#t~ret85#1 <= 2147483647; [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-28: havoc readV_#in~v#1.base, readV_#in~v#1.offset; [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-29: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-30: Push_#t~ret85#1 := readV_#res#1; [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924: havoc Push_#t~mem87#1; [2025-02-08 08:28:13,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-31: havoc readV_#t~ret38#1, readV_#t~mem39#1, readV_~v#1.base, readV_~v#1.offset, readV_~#expected~0#1.base, readV_~#expected~0#1.offset; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-1: havoc Push_#t~mem87#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-32: havoc readV_#res#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-2: Push_#t~short88#1 := Push_~t~4#1 < Push_#t~mem87#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923-33: assume { :begin_inline_readV } true;readV_#in~v#1.base, readV_#in~v#1.offset := ~#q~0.base, 32 + ~#q~0.offset; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-3: SUMMARY for call Push_#t~mem87#1 := read~int#3(~#q~0.base, 24 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-3: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-3: assume !(4 + (24 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 24 + ~#q~0.offset); [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-4: havoc Push_#t~mem87#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-5: havoc Push_#t~mem87#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-6: Push_#t~short88#1 := Push_~t~4#1 < Push_#t~mem87#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-7: SUMMARY for call Push_#t~mem87#1 := read~int#3(~#q~0.base, 24 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-7: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924-7: assume !(4 + (24 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 24 + ~#q~0.offset); [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926: havoc Push_#t~bitwise90#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-1: havoc Push_#t~mem89#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-2: Push_~temp~5#1 := Push_#t~bitwise90#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-3: [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-4: assume (((((Push_~t~4#1 < 0 && Push_#t~mem89#1 >= 0) || Push_#t~bitwise90#1 <= Push_~t~4#1) && ((Push_~t~4#1 >= 0 && Push_#t~mem89#1 < 0) || Push_#t~bitwise90#1 <= Push_#t~mem89#1)) && ((Push_~t~4#1 < 0 && Push_#t~mem89#1 < 0) || Push_#t~bitwise90#1 >= 0)) && ((Push_~t~4#1 >= 0 && Push_#t~mem89#1 >= 0) || Push_#t~bitwise90#1 > Push_~t~4#1 + Push_#t~mem89#1)) && Push_#t~bitwise90#1 >= -2147483648; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-5: havoc Push_#t~bitwise90#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-6: assume Push_~t~4#1 == Push_#t~mem89#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-6: assume !(Push_~t~4#1 == Push_#t~mem89#1); [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-7: Push_#t~bitwise90#1 := Push_~t~4#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-8: assume 0 == Push_~t~4#1 || 0 == Push_#t~mem89#1; [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-8: assume !(0 == Push_~t~4#1 || 0 == Push_#t~mem89#1); [2025-02-08 08:28:13,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-9: Push_#t~bitwise90#1 := 0; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-10: SUMMARY for call Push_#t~mem89#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-10: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-10: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-11: havoc Push_#t~bitwise90#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-12: havoc Push_#t~mem89#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-13: Push_~temp~5#1 := Push_#t~bitwise90#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-14: [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-15: assume (((((Push_~t~4#1 < 0 && Push_#t~mem89#1 >= 0) || Push_#t~bitwise90#1 <= Push_~t~4#1) && ((Push_~t~4#1 >= 0 && Push_#t~mem89#1 < 0) || Push_#t~bitwise90#1 <= Push_#t~mem89#1)) && ((Push_~t~4#1 < 0 && Push_#t~mem89#1 < 0) || Push_#t~bitwise90#1 >= 0)) && ((Push_~t~4#1 >= 0 && Push_#t~mem89#1 >= 0) || Push_#t~bitwise90#1 > Push_~t~4#1 + Push_#t~mem89#1)) && Push_#t~bitwise90#1 >= -2147483648; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-16: havoc Push_#t~bitwise90#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-17: assume Push_~t~4#1 == Push_#t~mem89#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-17: assume !(Push_~t~4#1 == Push_#t~mem89#1); [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-18: Push_#t~bitwise90#1 := Push_~t~4#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-19: assume 0 == Push_~t~4#1 || 0 == Push_#t~mem89#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-19: assume !(0 == Push_~t~4#1 || 0 == Push_#t~mem89#1); [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-20: Push_#t~bitwise90#1 := 0; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-21: SUMMARY for call Push_#t~mem89#1 := read~int#3(~#q~0.base, 104 + ~#q~0.offset, 4); srcloc: null [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-21: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926-21: assume !(4 + (104 + ~#q~0.offset) <= #length[~#q~0.base] && 0 <= 104 + ~#q~0.offset); [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, 1 + Push_~t~4#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927-1: SUMMARY for call write~$Pointer$#3(Push_~elem#1.base, Push_~elem#1.offset, ~#q~0.base, 40 + ~#q~0.offset + 4 * Push_~temp~5#1, 4); srcloc: null [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927-1: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927-1: assume !(4 + (40 + ~#q~0.offset + 4 * Push_~temp~5#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * Push_~temp~5#1); [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927-2: assume { :begin_inline_writeV } true;writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1 := ~#q~0.base, 36 + ~#q~0.offset, 1 + Push_~t~4#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927-3: SUMMARY for call write~$Pointer$#3(Push_~elem#1.base, Push_~elem#1.offset, ~#q~0.base, 40 + ~#q~0.offset + 4 * Push_~temp~5#1, 4); srcloc: null [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927-3: assume !(1 == #valid[~#q~0.base]); [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927-3: assume !(4 + (40 + ~#q~0.offset + 4 * Push_~temp~5#1) <= #length[~#q~0.base] && 0 <= 40 + ~#q~0.offset + 4 * Push_~temp~5#1); [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: assume { :end_inline_writeV } true;havoc Push_~temp~5#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928-1: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928-2: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928-3: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928-4: assume { :end_inline_writeV } true;havoc Push_~temp~5#1; [2025-02-08 08:28:13,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928-5: havoc writeV_#in~v#1.base, writeV_#in~v#1.offset, writeV_#in~w#1; [2025-02-08 08:28:13,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928-6: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928-7: havoc writeV_#t~ret40#1, writeV_~v#1.base, writeV_~v#1.offset, writeV_~w#1; [2025-02-08 08:28:13,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930: havoc SyncPush_#in~elem#1.base, SyncPush_#in~elem#1.offset;assume { :end_inline_SyncPush } true; [2025-02-08 08:28:13,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930-1: havoc SyncPush_#t~ret62#1, SyncPush_#t~ret63#1, SyncPush_#t~ret64#1, SyncPush_#t~mem65#1, SyncPush_#t~bitwise66#1, SyncPush_#t~mem67#1, SyncPush_#t~mem68#1, SyncPush_#t~ite71#1, SyncPush_#t~mem69#1, SyncPush_#t~mem70#1, SyncPush_#t~mem72#1, SyncPush_#t~mem73#1, SyncPush_#t~bitwise74#1, SyncPush_#t~mem75#1.base, SyncPush_#t~mem75#1.offset, SyncPush_~temp~3#1, SyncPush_#t~post76#1, SyncPush_#t~mem77#1.base, SyncPush_#t~mem77#1.offset, SyncPush_#t~post78#1, SyncPush_~newsize~0#1, SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset, SyncPush_~i~0#1, SyncPush_#t~mem79#1, SyncPush_#t~ret80#1, SyncPush_#t~mem81#1, SyncPush_#t~bitwise82#1, SyncPush_#t~ret83#1, SyncPush_~elem#1.base, SyncPush_~elem#1.offset, SyncPush_~h~1#1, SyncPush_~count~0#1, SyncPush_~t~3#1, SyncPush_~temp~4#1; [2025-02-08 08:28:13,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930-2: havoc SyncPush_#t~ret62#1, SyncPush_#t~ret63#1, SyncPush_#t~ret64#1, SyncPush_#t~mem65#1, SyncPush_#t~bitwise66#1, SyncPush_#t~mem67#1, SyncPush_#t~mem68#1, SyncPush_#t~ite71#1, SyncPush_#t~mem69#1, SyncPush_#t~mem70#1, SyncPush_#t~mem72#1, SyncPush_#t~mem73#1, SyncPush_#t~bitwise74#1, SyncPush_#t~mem75#1.base, SyncPush_#t~mem75#1.offset, SyncPush_~temp~3#1, SyncPush_#t~post76#1, SyncPush_#t~mem77#1.base, SyncPush_#t~mem77#1.offset, SyncPush_#t~post78#1, SyncPush_~newsize~0#1, SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset, SyncPush_~i~0#1, SyncPush_#t~mem79#1, SyncPush_#t~ret80#1, SyncPush_#t~mem81#1, SyncPush_#t~bitwise82#1, SyncPush_#t~ret83#1, SyncPush_~elem#1.base, SyncPush_~elem#1.offset, SyncPush_~h~1#1, SyncPush_~count~0#1, SyncPush_~t~3#1, SyncPush_~temp~4#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930-3: assume { :begin_inline_SyncPush } true;SyncPush_#in~elem#1.base, SyncPush_#in~elem#1.offset := Push_~elem#1.base, Push_~elem#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930-4: havoc SyncPush_#in~elem#1.base, SyncPush_#in~elem#1.offset;assume { :end_inline_SyncPush } true; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930-5: havoc SyncPush_#t~ret62#1, SyncPush_#t~ret63#1, SyncPush_#t~ret64#1, SyncPush_#t~mem65#1, SyncPush_#t~bitwise66#1, SyncPush_#t~mem67#1, SyncPush_#t~mem68#1, SyncPush_#t~ite71#1, SyncPush_#t~mem69#1, SyncPush_#t~mem70#1, SyncPush_#t~mem72#1, SyncPush_#t~mem73#1, SyncPush_#t~bitwise74#1, SyncPush_#t~mem75#1.base, SyncPush_#t~mem75#1.offset, SyncPush_~temp~3#1, SyncPush_#t~post76#1, SyncPush_#t~mem77#1.base, SyncPush_#t~mem77#1.offset, SyncPush_#t~post78#1, SyncPush_~newsize~0#1, SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset, SyncPush_~i~0#1, SyncPush_#t~mem79#1, SyncPush_#t~ret80#1, SyncPush_#t~mem81#1, SyncPush_#t~bitwise82#1, SyncPush_#t~ret83#1, SyncPush_~elem#1.base, SyncPush_~elem#1.offset, SyncPush_~h~1#1, SyncPush_~count~0#1, SyncPush_~t~3#1, SyncPush_~temp~4#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930-6: havoc SyncPush_#t~ret62#1, SyncPush_#t~ret63#1, SyncPush_#t~ret64#1, SyncPush_#t~mem65#1, SyncPush_#t~bitwise66#1, SyncPush_#t~mem67#1, SyncPush_#t~mem68#1, SyncPush_#t~ite71#1, SyncPush_#t~mem69#1, SyncPush_#t~mem70#1, SyncPush_#t~mem72#1, SyncPush_#t~mem73#1, SyncPush_#t~bitwise74#1, SyncPush_#t~mem75#1.base, SyncPush_#t~mem75#1.offset, SyncPush_~temp~3#1, SyncPush_#t~post76#1, SyncPush_#t~mem77#1.base, SyncPush_#t~mem77#1.offset, SyncPush_#t~post78#1, SyncPush_~newsize~0#1, SyncPush_~#newtasks~0#1.base, SyncPush_~#newtasks~0#1.offset, SyncPush_~i~0#1, SyncPush_#t~mem79#1, SyncPush_#t~ret80#1, SyncPush_#t~mem81#1, SyncPush_#t~bitwise82#1, SyncPush_#t~ret83#1, SyncPush_~elem#1.base, SyncPush_~elem#1.offset, SyncPush_~h~1#1, SyncPush_~count~0#1, SyncPush_~t~3#1, SyncPush_~temp~4#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930-7: assume { :begin_inline_SyncPush } true;SyncPush_#in~elem#1.base, SyncPush_#in~elem#1.offset := Push_~elem#1.base, Push_~elem#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-1: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-2: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-3: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-4: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-5: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-6: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-7: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-8: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-9: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-10: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-11: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-12: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-13: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-14: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-15: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-16: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-17: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-18: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-19: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-20: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-21: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-22: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-23: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-24: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-25: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-26: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-27: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-28: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-29: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-30: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-31: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-1: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-32: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-2: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-33: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-3: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-34: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-4: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-35: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-5: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-36: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-6: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-37: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-7: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-38: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-8: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-39: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-9: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-40: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-10: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-41: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-11: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-42: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-12: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-43: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-13: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-44: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-14: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-45: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-15: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-46: atomic_exchange_~v#1 := atomic_exchange_#in~v#1; [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-16: [2025-02-08 08:28:13,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-47: atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset := atomic_exchange_#in~obj#1.base, atomic_exchange_#in~obj#1.offset; [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-17: [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-18: [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-19: [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-20: [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-21: [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-22: [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-23: [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-1: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-2: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-2: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-2: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-3: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-4: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-5: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-5: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-5: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-6: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-7: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-8: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-8: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-8: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-9: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-10: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-11: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-11: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-11: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-12: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-13: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-14: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-14: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-14: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-15: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-16: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-17: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-17: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-17: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-18: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-19: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,080 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-20: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-20: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-20: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-21: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-22: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-23: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-23: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-23: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-24: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-25: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-26: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-26: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-26: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-27: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-28: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-29: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-29: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-29: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-30: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-31: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-1: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-1: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-1: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-32: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-32: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-32: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-2: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-2: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-2: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-33: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-3: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-3: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-3: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-34: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,081 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-4: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,082 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-4: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,082 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-4: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,082 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-35: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,082 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-35: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,082 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-35: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,082 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-5: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,082 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-5: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-5: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-36: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-6: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-6: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-6: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-37: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-7: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-7: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-7: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-38: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-38: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-38: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-8: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-8: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-8: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-39: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-9: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-9: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-9: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-40: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-10: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-10: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-10: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-41: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-41: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-41: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-11: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-11: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-11: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-42: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-12: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-12: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-12: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-43: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-13: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-13: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-13: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-44: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-44: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-44: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-14: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-14: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-14: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-45: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-15: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-15: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-15: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-46: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-47: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-47: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-47: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-16: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-16: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-16: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-48: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-17: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-17: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-17: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-49: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-18: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-18: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-18: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-50: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-50: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-50: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-19: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-19: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-19: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-51: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-20: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-20: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-20: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-52: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-21: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-21: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,085 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-21: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-53: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-53: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-53: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-22: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-22: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-22: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-54: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-23: SUMMARY for call write~int#3(atomic_exchange_~v#1, atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-23: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-23: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-55: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-56: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-56: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-56: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-57: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-58: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-59: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-59: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-59: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-60: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-61: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809: [2025-02-08 08:28:13,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-62: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-62: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-62: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-1: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-63: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-2: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-64: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-3: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-65: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-65: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-65: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-4: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-66: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-5: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-67: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-6: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-68: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-68: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-68: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-7: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-69: havoc atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-8: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-70: atomic_exchange_~t~0#1 := atomic_exchange_#t~mem34#1; [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-9: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-71: SUMMARY for call atomic_exchange_#t~mem34#1 := read~int#3(atomic_exchange_~obj#1.base, atomic_exchange_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-71: assume !(1 == #valid[atomic_exchange_~obj#1.base]); [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807-71: assume !(4 + atomic_exchange_~obj#1.offset <= #length[atomic_exchange_~obj#1.base] && 0 <= atomic_exchange_~obj#1.offset); [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-10: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-11: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-12: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-13: [2025-02-08 08:28:13,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-14: [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-15: [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-16: [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-17: [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-18: [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-19: [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-20: [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-21: [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-22: [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-23: [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-1: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-3: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-5: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-7: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-9: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-11: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-13: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-15: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-17: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-19: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-21: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-23: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-25: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-27: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-29: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-31: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-33: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-35: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-37: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-39: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-41: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-43: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-45: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1810-47: atomic_exchange_#res#1 := atomic_exchange_~t~0#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-1: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-2: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-3: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-4: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-5: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-6: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-7: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-8: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-9: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-10: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-11: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,094 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-15: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,095 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-16: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,095 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-17: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,095 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-18: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,095 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-19: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,095 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-20: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,095 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-21: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,095 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-22: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,095 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-23: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,095 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-24: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,095 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-25: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-26: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-27: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-28: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-29: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-30: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-31: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-1: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-32: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-2: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-33: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-3: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-34: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-35: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-5: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-36: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-6: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-37: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-7: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-38: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-8: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-39: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-9: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-40: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-10: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-41: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-11: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-42: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-12: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-43: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-13: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-44: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-14: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-45: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,096 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-15: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,097 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-46: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,097 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-47: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-16: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-48: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-17: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-49: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813-18: atomic_compare_exchange_strong_~ret~0#1 := 0; [2025-02-08 08:28:13,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-50: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-51: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-52: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-53: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-54: atomic_compare_exchange_strong_~desired#1 := atomic_compare_exchange_strong_#in~desired#1; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-55: atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset := atomic_compare_exchange_strong_#in~expected#1.base, atomic_compare_exchange_strong_#in~expected#1.offset; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-56: atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset := atomic_compare_exchange_strong_#in~obj#1.base, atomic_compare_exchange_strong_#in~obj#1.offset; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946: havoc main_~#handles~0#1.base, main_~#handles~0#1.offset; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946-1: SUMMARY for call ULTIMATE.dealloc(main_~#handles~0#1.base, main_~#handles~0#1.offset); srcloc: null [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-1: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-2: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-3: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-5: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-6: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-7: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-8: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-9: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-10: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-11: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-12: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-13: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-14: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-15: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-16: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-17: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-18: [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-1: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-2: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,100 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-2: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-3: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-4: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-5: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-5: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-5: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-6: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-6: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-6: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-7: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-8: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-9: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,101 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-9: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-10: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-11: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-12: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-12: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-12: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-13: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-13: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-13: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-14: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-15: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-16: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-16: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-17: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-18: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-19: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-19: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-19: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-20: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-20: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-20: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-21: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-22: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-23: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-23: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-24: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-25: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-26: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-26: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-26: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-27: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-27: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-27: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-1: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-1: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-1: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-2: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-3: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-3: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-3: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-4: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-35: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-5: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-5: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-5: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-36: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-6: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-37: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-37: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-7: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-7: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-7: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-38: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-39: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-40: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-40: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-40: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-10: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-41: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-41: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-41: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-11: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-11: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-11: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-42: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-12: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-43: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-13: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-13: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-13: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-44: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-44: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-45: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-14: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-46: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-15: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-15: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-15: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-47: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-47: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,107 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-47: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-16: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-48: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-48: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-48: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-17: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-17: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-17: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-49: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-18: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-50: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-19: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-19: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-19: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-51: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-51: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-20: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-52: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-21: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-21: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-21: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,108 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-53: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-22: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-54: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-54: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-54: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-23: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-23: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-23: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-55: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-55: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-55: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-24: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-56: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-25: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-25: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-25: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-57: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-26: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-58: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-58: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-27: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-27: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-27: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-59: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-28: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-60: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-29: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-29: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-29: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-61: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-61: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-61: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-30: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-62: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-62: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-62: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-31: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-31: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-31: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-63: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-32: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-64: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-33: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-33: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-33: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-65: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-65: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-34: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-66: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-35: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-35: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-35: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-67: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-36: atomic_compare_exchange_strong_~ret~0#1 := 1; [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-68: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-68: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-68: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-37: SUMMARY for call write~int#3(atomic_compare_exchange_strong_~desired#1, atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-37: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816-37: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-69: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-69: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-69: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-70: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-71: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,111 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-72: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-72: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-73: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-74: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-75: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-75: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-75: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-76: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-76: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-76: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-77: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-78: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-79: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-79: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-80: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-81: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-82: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-82: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-82: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-83: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-83: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-83: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-84: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-85: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-86: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-86: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-87: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-88: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-89: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-89: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-89: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-90: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-90: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-90: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-91: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-92: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-93: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-93: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-94: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-95: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-96: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-96: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-96: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-97: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-97: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-97: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-98: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-99: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-100: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-100: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-101: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-102: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-103: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-103: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-103: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-104: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-104: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-104: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-105: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-106: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-107: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-107: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-108: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-109: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-110: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-110: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-110: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-111: SUMMARY for call atomic_compare_exchange_strong_#t~mem35#1 := read~int#3(atomic_compare_exchange_strong_~obj#1.base, atomic_compare_exchange_strong_~obj#1.offset, 4); srcloc: null [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-111: assume !(1 == #valid[atomic_compare_exchange_strong_~obj#1.base]); [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-111: assume !(4 + atomic_compare_exchange_strong_~obj#1.offset <= #length[atomic_compare_exchange_strong_~obj#1.base] && 0 <= atomic_compare_exchange_strong_~obj#1.offset); [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-112: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-113: havoc atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-114: assume atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1; [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-114: assume !(atomic_compare_exchange_strong_#t~mem35#1 == atomic_compare_exchange_strong_#t~mem36#1); [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-115: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-116: havoc atomic_compare_exchange_strong_#t~mem35#1; [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-117: SUMMARY for call atomic_compare_exchange_strong_#t~mem36#1 := read~int#5(atomic_compare_exchange_strong_~expected#1.base, atomic_compare_exchange_strong_~expected#1.offset, 4); srcloc: null [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-117: assume !(1 == #valid[atomic_compare_exchange_strong_~expected#1.base]); [2025-02-08 08:28:13,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815-117: assume !(4 + atomic_compare_exchange_strong_~expected#1.offset <= #length[atomic_compare_exchange_strong_~expected#1.base] && 0 <= atomic_compare_exchange_strong_~expected#1.offset); [2025-02-08 08:28:13,118 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:28:13,118 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:28:13,366 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:28:13,366 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:28:13,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:28:13 BoogieIcfgContainer [2025-02-08 08:28:13,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:28:13,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:28:13,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:28:13,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:28:13,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:28:08" (1/3) ... [2025-02-08 08:28:13,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f14f5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:28:13, skipping insertion in model container [2025-02-08 08:28:13,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:09" (2/3) ... [2025-02-08 08:28:13,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f14f5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:28:13, skipping insertion in model container [2025-02-08 08:28:13,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:28:13" (3/3) ... [2025-02-08 08:28:13,377 INFO L128 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2025-02-08 08:28:13,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:28:13,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG workstealqueue_mutex-2.i that has 2 procedures, 97 locations, 1 initial locations, 11 loop locations, and 520 error locations. [2025-02-08 08:28:13,394 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:28:13,471 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 08:28:13,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 103 transitions, 213 flow [2025-02-08 08:28:13,588 INFO L124 PetriNetUnfolderBase]: 10/157 cut-off events. [2025-02-08 08:28:13,591 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:28:13,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 157 events. 10/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 787 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. [2025-02-08 08:28:13,595 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 103 transitions, 213 flow [2025-02-08 08:28:13,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 103 transitions, 213 flow [2025-02-08 08:28:13,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:28:13,625 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;@855856, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:28:13,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-02-08 08:28:13,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:28:13,633 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-08 08:28:13,633 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:28:13,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:13,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:28:13,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr474REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:13,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash 108647, now seen corresponding path program 1 times [2025-02-08 08:28:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926761024] [2025-02-08 08:28:13,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:13,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:13,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:28:13,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:28:13,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:13,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:14,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:28:14,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926761024] [2025-02-08 08:28:14,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926761024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:14,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:14,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:28:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544010130] [2025-02-08 08:28:14,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:14,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:14,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:14,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:14,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 103 [2025-02-08 08:28:14,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 103 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:28:14,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:14,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 103 [2025-02-08 08:28:14,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:14,566 INFO L124 PetriNetUnfolderBase]: 257/651 cut-off events. [2025-02-08 08:28:14,567 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-02-08 08:28:14,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 651 events. 257/651 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3686 event pairs, 189 based on Foata normal form. 26/360 useless extension candidates. Maximal degree in co-relation 1088. Up to 466 conditions per place. [2025-02-08 08:28:14,572 INFO L140 encePairwiseOnDemand]: 73/103 looper letters, 81 selfloop transitions, 3 changer transitions 3/109 dead transitions. [2025-02-08 08:28:14,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 399 flow [2025-02-08 08:28:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2025-02-08 08:28:14,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6472491909385113 [2025-02-08 08:28:14,590 INFO L175 Difference]: Start difference. First operand has 100 places, 103 transitions, 213 flow. Second operand 3 states and 200 transitions. [2025-02-08 08:28:14,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 399 flow [2025-02-08 08:28:14,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 109 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:28:14,597 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 174 flow [2025-02-08 08:28:14,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2025-02-08 08:28:14,605 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -23 predicate places. [2025-02-08 08:28:14,605 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 174 flow [2025-02-08 08:28:14,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:28:14,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:14,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:28:14,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:28:14,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr475REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:14,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash 108648, now seen corresponding path program 1 times [2025-02-08 08:28:14,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:14,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148087880] [2025-02-08 08:28:14,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:14,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:14,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:28:14,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:28:14,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:14,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:14,824 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:28:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148087880] [2025-02-08 08:28:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148087880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:28:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116040984] [2025-02-08 08:28:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:14,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:14,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:14,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 103 [2025-02-08 08:28:14,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:28:14,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:14,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 103 [2025-02-08 08:28:14,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:15,082 INFO L124 PetriNetUnfolderBase]: 256/632 cut-off events. [2025-02-08 08:28:15,083 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2025-02-08 08:28:15,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 632 events. 256/632 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3505 event pairs, 100 based on Foata normal form. 2/359 useless extension candidates. Maximal degree in co-relation 1137. Up to 526 conditions per place. [2025-02-08 08:28:15,091 INFO L140 encePairwiseOnDemand]: 96/103 looper letters, 65 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2025-02-08 08:28:15,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 339 flow [2025-02-08 08:28:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-02-08 08:28:15,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44983818770226536 [2025-02-08 08:28:15,093 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 174 flow. Second operand 3 states and 139 transitions. [2025-02-08 08:28:15,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 339 flow [2025-02-08 08:28:15,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:15,098 INFO L231 Difference]: Finished difference. Result has 76 places, 77 transitions, 189 flow [2025-02-08 08:28:15,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=76, PETRI_TRANSITIONS=77} [2025-02-08 08:28:15,098 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -24 predicate places. [2025-02-08 08:28:15,099 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 189 flow [2025-02-08 08:28:15,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:28:15,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:15,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:28:15,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:28:15,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr470REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:15,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash 104514054, now seen corresponding path program 1 times [2025-02-08 08:28:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:15,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974509357] [2025-02-08 08:28:15,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:15,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:28:15,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:28:15,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:15,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:15,279 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:28:15,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:15,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974509357] [2025-02-08 08:28:15,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974509357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:15,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:15,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:28:15,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484695412] [2025-02-08 08:28:15,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:15,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:28:15,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:15,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:28:15,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:28:15,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 103 [2025-02-08 08:28:15,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:28:15,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:15,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 103 [2025-02-08 08:28:15,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:15,606 INFO L124 PetriNetUnfolderBase]: 256/647 cut-off events. [2025-02-08 08:28:15,606 INFO L125 PetriNetUnfolderBase]: For 56/59 co-relation queries the response was YES. [2025-02-08 08:28:15,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 647 events. 256/647 cut-off events. For 56/59 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3600 event pairs, 171 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 1182. Up to 458 conditions per place. [2025-02-08 08:28:15,612 INFO L140 encePairwiseOnDemand]: 94/103 looper letters, 78 selfloop transitions, 7 changer transitions 3/107 dead transitions. [2025-02-08 08:28:15,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 107 transitions, 432 flow [2025-02-08 08:28:15,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:28:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:28:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-02-08 08:28:15,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42475728155339804 [2025-02-08 08:28:15,617 INFO L175 Difference]: Start difference. First operand has 76 places, 77 transitions, 189 flow. Second operand 4 states and 175 transitions. [2025-02-08 08:28:15,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 107 transitions, 432 flow [2025-02-08 08:28:15,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 107 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:15,621 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 195 flow [2025-02-08 08:28:15,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2025-02-08 08:28:15,622 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -24 predicate places. [2025-02-08 08:28:15,622 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 195 flow [2025-02-08 08:28:15,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:28:15,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:15,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:28:15,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:28:15,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr471REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:15,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash 104514055, now seen corresponding path program 1 times [2025-02-08 08:28:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:15,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849598469] [2025-02-08 08:28:15,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:15,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:28:15,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:28:15,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:15,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:15,964 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:28:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:15,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849598469] [2025-02-08 08:28:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849598469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:15,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:15,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341641297] [2025-02-08 08:28:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:15,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:28:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:15,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:28:15,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:28:16,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 103 [2025-02-08 08:28:16,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:28:16,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:16,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 103 [2025-02-08 08:28:16,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:16,296 INFO L124 PetriNetUnfolderBase]: 256/628 cut-off events. [2025-02-08 08:28:16,296 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-02-08 08:28:16,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 628 events. 256/628 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3398 event pairs, 100 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 1182. Up to 526 conditions per place. [2025-02-08 08:28:16,300 INFO L140 encePairwiseOnDemand]: 96/103 looper letters, 60 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2025-02-08 08:28:16,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 86 transitions, 353 flow [2025-02-08 08:28:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:28:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:28:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-02-08 08:28:16,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38106796116504854 [2025-02-08 08:28:16,303 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 195 flow. Second operand 4 states and 157 transitions. [2025-02-08 08:28:16,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 86 transitions, 353 flow [2025-02-08 08:28:16,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 86 transitions, 341 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:28:16,307 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 195 flow [2025-02-08 08:28:16,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2025-02-08 08:28:16,308 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -25 predicate places. [2025-02-08 08:28:16,309 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 195 flow [2025-02-08 08:28:16,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:28:16,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:16,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:16,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:28:16,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr465REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:16,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash -269684718, now seen corresponding path program 1 times [2025-02-08 08:28:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:16,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396755846] [2025-02-08 08:28:16,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:16,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:16,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:28:16,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:28:16,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:16,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:16,617 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:28:16,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:16,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396755846] [2025-02-08 08:28:16,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396755846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:16,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:28:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443435297] [2025-02-08 08:28:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:16,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:28:16,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:16,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:28:16,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:28:16,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 103 [2025-02-08 08:28:16,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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:28:16,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:16,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 103 [2025-02-08 08:28:16,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:16,903 INFO L124 PetriNetUnfolderBase]: 256/633 cut-off events. [2025-02-08 08:28:16,903 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-02-08 08:28:16,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 633 events. 256/633 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3472 event pairs, 209 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 1170. Up to 555 conditions per place. [2025-02-08 08:28:16,907 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 48 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2025-02-08 08:28:16,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 299 flow [2025-02-08 08:28:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:28:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:28:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-02-08 08:28:16,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34757281553398056 [2025-02-08 08:28:16,908 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 195 flow. Second operand 5 states and 179 transitions. [2025-02-08 08:28:16,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 299 flow [2025-02-08 08:28:16,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 289 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:28:16,911 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 193 flow [2025-02-08 08:28:16,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2025-02-08 08:28:16,911 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -25 predicate places. [2025-02-08 08:28:16,911 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 193 flow [2025-02-08 08:28:16,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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:28:16,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:16,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:16,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:28:16,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr460REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:16,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:16,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1709757978, now seen corresponding path program 1 times [2025-02-08 08:28:16,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:16,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572734457] [2025-02-08 08:28:16,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:16,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:28:16,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:28:16,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:16,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:17,092 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:28:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572734457] [2025-02-08 08:28:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572734457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605768938] [2025-02-08 08:28:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:17,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:28:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:17,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:28:17,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:28:17,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 103 [2025-02-08 08:28:17,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:28:17,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:17,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 103 [2025-02-08 08:28:17,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:17,390 INFO L124 PetriNetUnfolderBase]: 256/638 cut-off events. [2025-02-08 08:28:17,390 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-02-08 08:28:17,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 638 events. 256/638 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3605 event pairs, 172 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 1270. Up to 460 conditions per place. [2025-02-08 08:28:17,394 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 77 selfloop transitions, 5 changer transitions 3/104 dead transitions. [2025-02-08 08:28:17,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 104 transitions, 431 flow [2025-02-08 08:28:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:28:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:28:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-02-08 08:28:17,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4441747572815534 [2025-02-08 08:28:17,396 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 193 flow. Second operand 4 states and 183 transitions. [2025-02-08 08:28:17,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 104 transitions, 431 flow [2025-02-08 08:28:17,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 104 transitions, 421 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:28:17,402 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 191 flow [2025-02-08 08:28:17,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2025-02-08 08:28:17,403 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -27 predicate places. [2025-02-08 08:28:17,403 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 191 flow [2025-02-08 08:28:17,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:28:17,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:17,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:17,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:28:17,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr461REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1709757979, now seen corresponding path program 1 times [2025-02-08 08:28:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:17,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927489435] [2025-02-08 08:28:17,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:17,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:17,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:28:17,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:28:17,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:17,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:17,722 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:28:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:17,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927489435] [2025-02-08 08:28:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927489435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:28:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569277658] [2025-02-08 08:28:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:17,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:28:17,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:17,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:28:17,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:28:17,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 103 [2025-02-08 08:28:17,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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:28:17,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:17,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 103 [2025-02-08 08:28:17,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:18,038 INFO L124 PetriNetUnfolderBase]: 238/635 cut-off events. [2025-02-08 08:28:18,038 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-02-08 08:28:18,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 635 events. 238/635 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3736 event pairs, 178 based on Foata normal form. 3/388 useless extension candidates. Maximal degree in co-relation 1177. Up to 492 conditions per place. [2025-02-08 08:28:18,041 INFO L140 encePairwiseOnDemand]: 92/103 looper letters, 50 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2025-02-08 08:28:18,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 78 transitions, 327 flow [2025-02-08 08:28:18,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:28:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:28:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-02-08 08:28:18,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36310679611650487 [2025-02-08 08:28:18,043 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 191 flow. Second operand 5 states and 187 transitions. [2025-02-08 08:28:18,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 78 transitions, 327 flow [2025-02-08 08:28:18,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 318 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:28:18,045 INFO L231 Difference]: Finished difference. Result has 78 places, 76 transitions, 244 flow [2025-02-08 08:28:18,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2025-02-08 08:28:18,046 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -22 predicate places. [2025-02-08 08:28:18,046 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 244 flow [2025-02-08 08:28:18,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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:28:18,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:18,046 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:18,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:28:18,047 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr461REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:18,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1894947653, now seen corresponding path program 1 times [2025-02-08 08:28:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:18,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120936936] [2025-02-08 08:28:18,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:18,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:28:18,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:28:18,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:18,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120936936] [2025-02-08 08:28:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120936936] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:28:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956079676] [2025-02-08 08:28:18,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:18,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:18,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:18,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:18,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:28:18,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:28:18,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:28:18,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:18,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:18,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 08:28:18,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:18,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:28:18,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 08:28:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:18,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:28:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:18,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956079676] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:28:18,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:28:18,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-02-08 08:28:18,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995580358] [2025-02-08 08:28:18,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:28:18,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 08:28:18,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:18,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 08:28:18,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:28:19,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 103 [2025-02-08 08:28:19,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 76 transitions, 244 flow. Second operand has 15 states, 15 states have (on average 27.2) internal successors, (408), 15 states have internal predecessors, (408), 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:28:19,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:19,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 103 [2025-02-08 08:28:19,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:19,863 INFO L124 PetriNetUnfolderBase]: 231/622 cut-off events. [2025-02-08 08:28:19,863 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-02-08 08:28:19,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 622 events. 231/622 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3575 event pairs, 187 based on Foata normal form. 4/382 useless extension candidates. Maximal degree in co-relation 1190. Up to 475 conditions per place. [2025-02-08 08:28:19,866 INFO L140 encePairwiseOnDemand]: 93/103 looper letters, 52 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2025-02-08 08:28:19,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 412 flow [2025-02-08 08:28:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:28:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:28:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 373 transitions. [2025-02-08 08:28:19,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3017799352750809 [2025-02-08 08:28:19,869 INFO L175 Difference]: Start difference. First operand has 78 places, 76 transitions, 244 flow. Second operand 12 states and 373 transitions. [2025-02-08 08:28:19,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 412 flow [2025-02-08 08:28:19,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 397 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 08:28:19,872 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 303 flow [2025-02-08 08:28:19,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=303, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2025-02-08 08:28:19,874 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -10 predicate places. [2025-02-08 08:28:19,874 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 303 flow [2025-02-08 08:28:19,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 27.2) internal successors, (408), 15 states have internal predecessors, (408), 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:28:19,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:19,875 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:19,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:28:20,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:20,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr461REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:20,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1428955291, now seen corresponding path program 2 times [2025-02-08 08:28:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:20,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582578288] [2025-02-08 08:28:20,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:28:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:20,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 08:28:20,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:28:20,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:28:20,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:20,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:20,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582578288] [2025-02-08 08:28:20,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582578288] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:28:20,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766537586] [2025-02-08 08:28:20,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:28:20,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:20,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:20,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:20,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:28:20,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 08:28:20,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:28:20,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:28:20,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:20,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:28:20,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:20,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:20,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766537586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:20,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:28:20,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2025-02-08 08:28:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995905613] [2025-02-08 08:28:20,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:20,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:28:20,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:20,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:28:20,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:28:20,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 103 [2025-02-08 08:28:20,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 303 flow. Second operand has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 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:28:20,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:20,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 103 [2025-02-08 08:28:20,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:21,183 INFO L124 PetriNetUnfolderBase]: 389/1127 cut-off events. [2025-02-08 08:28:21,184 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2025-02-08 08:28:21,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 1127 events. 389/1127 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6848 event pairs, 165 based on Foata normal form. 12/700 useless extension candidates. Maximal degree in co-relation 2118. Up to 410 conditions per place. [2025-02-08 08:28:21,190 INFO L140 encePairwiseOnDemand]: 91/103 looper letters, 102 selfloop transitions, 25 changer transitions 2/146 dead transitions. [2025-02-08 08:28:21,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 146 transitions, 717 flow [2025-02-08 08:28:21,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:28:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:28:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 297 transitions. [2025-02-08 08:28:21,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4119278779472954 [2025-02-08 08:28:21,192 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 303 flow. Second operand 7 states and 297 transitions. [2025-02-08 08:28:21,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 146 transitions, 717 flow [2025-02-08 08:28:21,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 146 transitions, 670 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-02-08 08:28:21,196 INFO L231 Difference]: Finished difference. Result has 88 places, 90 transitions, 358 flow [2025-02-08 08:28:21,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=358, PETRI_PLACES=88, PETRI_TRANSITIONS=90} [2025-02-08 08:28:21,197 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -12 predicate places. [2025-02-08 08:28:21,197 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 358 flow [2025-02-08 08:28:21,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 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:28:21,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:21,197 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:21,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:28:21,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:21,398 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr458REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:21,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1347943567, now seen corresponding path program 1 times [2025-02-08 08:28:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106876210] [2025-02-08 08:28:21,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:21,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:28:21,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:28:21,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:21,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:21,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106876210] [2025-02-08 08:28:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106876210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:28:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318872868] [2025-02-08 08:28:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:21,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:21,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:21,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:21,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 103 [2025-02-08 08:28:21,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:28:21,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:21,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 103 [2025-02-08 08:28:21,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:21,823 INFO L124 PetriNetUnfolderBase]: 403/1137 cut-off events. [2025-02-08 08:28:21,823 INFO L125 PetriNetUnfolderBase]: For 498/498 co-relation queries the response was YES. [2025-02-08 08:28:21,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 1137 events. 403/1137 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6838 event pairs, 282 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 2189. Up to 678 conditions per place. [2025-02-08 08:28:21,831 INFO L140 encePairwiseOnDemand]: 96/103 looper letters, 103 selfloop transitions, 14 changer transitions 3/134 dead transitions. [2025-02-08 08:28:21,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 134 transitions, 749 flow [2025-02-08 08:28:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-02-08 08:28:21,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5080906148867314 [2025-02-08 08:28:21,833 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 358 flow. Second operand 3 states and 157 transitions. [2025-02-08 08:28:21,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 134 transitions, 749 flow [2025-02-08 08:28:21,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 134 transitions, 743 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:21,839 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 467 flow [2025-02-08 08:28:21,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2025-02-08 08:28:21,841 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -9 predicate places. [2025-02-08 08:28:21,841 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 467 flow [2025-02-08 08:28:21,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:28:21,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:21,842 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:21,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:28:21,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:21,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1347943568, now seen corresponding path program 1 times [2025-02-08 08:28:21,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:21,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996000179] [2025-02-08 08:28:21,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:21,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:21,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:28:21,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:28:21,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:21,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:22,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:22,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996000179] [2025-02-08 08:28:22,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996000179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:22,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:22,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:22,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703146065] [2025-02-08 08:28:22,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:22,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:28:22,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:22,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:28:22,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:28:22,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 103 [2025-02-08 08:28:22,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 467 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:28:22,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:22,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 103 [2025-02-08 08:28:22,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:22,310 INFO L124 PetriNetUnfolderBase]: 405/1163 cut-off events. [2025-02-08 08:28:22,310 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES. [2025-02-08 08:28:22,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 1163 events. 405/1163 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7144 event pairs, 314 based on Foata normal form. 1/748 useless extension candidates. Maximal degree in co-relation 2522. Up to 839 conditions per place. [2025-02-08 08:28:22,316 INFO L140 encePairwiseOnDemand]: 96/103 looper letters, 75 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2025-02-08 08:28:22,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 100 transitions, 637 flow [2025-02-08 08:28:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:28:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:28:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-02-08 08:28:22,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3737864077669903 [2025-02-08 08:28:22,318 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 467 flow. Second operand 4 states and 154 transitions. [2025-02-08 08:28:22,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 100 transitions, 637 flow [2025-02-08 08:28:22,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 100 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:28:22,323 INFO L231 Difference]: Finished difference. Result has 93 places, 97 transitions, 460 flow [2025-02-08 08:28:22,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=460, PETRI_PLACES=93, PETRI_TRANSITIONS=97} [2025-02-08 08:28:22,324 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -7 predicate places. [2025-02-08 08:28:22,324 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 97 transitions, 460 flow [2025-02-08 08:28:22,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:28:22,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:22,325 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:22,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:28:22,325 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:22,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash 973388938, now seen corresponding path program 1 times [2025-02-08 08:28:22,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:22,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494755736] [2025-02-08 08:28:22,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:22,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:28:22,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:28:22,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:22,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:22,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:22,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494755736] [2025-02-08 08:28:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494755736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:22,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:22,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:28:22,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224942560] [2025-02-08 08:28:22,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:22,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:28:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:22,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:28:22,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:28:22,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 103 [2025-02-08 08:28:22,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 97 transitions, 460 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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:28:22,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:22,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 103 [2025-02-08 08:28:22,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:22,989 INFO L124 PetriNetUnfolderBase]: 430/1209 cut-off events. [2025-02-08 08:28:22,989 INFO L125 PetriNetUnfolderBase]: For 778/778 co-relation queries the response was YES. [2025-02-08 08:28:22,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 1209 events. 430/1209 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7399 event pairs, 360 based on Foata normal form. 1/788 useless extension candidates. Maximal degree in co-relation 2618. Up to 898 conditions per place. [2025-02-08 08:28:22,997 INFO L140 encePairwiseOnDemand]: 96/103 looper letters, 80 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2025-02-08 08:28:22,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 648 flow [2025-02-08 08:28:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:28:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:28:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2025-02-08 08:28:22,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3074433656957929 [2025-02-08 08:28:22,999 INFO L175 Difference]: Start difference. First operand has 93 places, 97 transitions, 460 flow. Second operand 6 states and 190 transitions. [2025-02-08 08:28:22,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 648 flow [2025-02-08 08:28:23,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 101 transitions, 634 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:28:23,006 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 468 flow [2025-02-08 08:28:23,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2025-02-08 08:28:23,006 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -4 predicate places. [2025-02-08 08:28:23,006 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 468 flow [2025-02-08 08:28:23,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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:28:23,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:23,007 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:23,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:28:23,007 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:23,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash 110809282, now seen corresponding path program 1 times [2025-02-08 08:28:23,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:23,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475956866] [2025-02-08 08:28:23,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:23,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:23,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:28:23,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:28:23,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:23,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:23,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475956866] [2025-02-08 08:28:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475956866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:23,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:28:23,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942296832] [2025-02-08 08:28:23,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:23,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:28:23,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:23,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:28:23,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:28:23,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 103 [2025-02-08 08:28:23,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 468 flow. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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:28:23,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:23,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 103 [2025-02-08 08:28:23,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:23,801 INFO L124 PetriNetUnfolderBase]: 446/1264 cut-off events. [2025-02-08 08:28:23,802 INFO L125 PetriNetUnfolderBase]: For 836/836 co-relation queries the response was YES. [2025-02-08 08:28:23,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 1264 events. 446/1264 cut-off events. For 836/836 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7894 event pairs, 303 based on Foata normal form. 20/846 useless extension candidates. Maximal degree in co-relation 2561. Up to 884 conditions per place. [2025-02-08 08:28:23,810 INFO L140 encePairwiseOnDemand]: 92/103 looper letters, 97 selfloop transitions, 13 changer transitions 0/121 dead transitions. [2025-02-08 08:28:23,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 121 transitions, 761 flow [2025-02-08 08:28:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:28:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:28:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2025-02-08 08:28:23,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30374479889042993 [2025-02-08 08:28:23,811 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 468 flow. Second operand 7 states and 219 transitions. [2025-02-08 08:28:23,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 121 transitions, 761 flow [2025-02-08 08:28:23,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 121 transitions, 747 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:28:23,819 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 531 flow [2025-02-08 08:28:23,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=531, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2025-02-08 08:28:23,820 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2025-02-08 08:28:23,820 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 531 flow [2025-02-08 08:28:23,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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:28:23,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:23,821 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:23,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:28:23,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:23,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:23,822 INFO L85 PathProgramCache]: Analyzing trace with hash 110292202, now seen corresponding path program 2 times [2025-02-08 08:28:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721376633] [2025-02-08 08:28:23,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:28:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:23,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 08:28:23,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 24 statements. [2025-02-08 08:28:23,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:28:23,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721376633] [2025-02-08 08:28:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721376633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:24,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:28:24,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625212847] [2025-02-08 08:28:24,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:24,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:28:24,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:24,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:28:24,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:28:24,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 103 [2025-02-08 08:28:24,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 531 flow. Second operand has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 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:28:24,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:24,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 103 [2025-02-08 08:28:24,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:24,338 INFO L124 PetriNetUnfolderBase]: 45/160 cut-off events. [2025-02-08 08:28:24,338 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2025-02-08 08:28:24,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 160 events. 45/160 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 678 event pairs, 18 based on Foata normal form. 20/150 useless extension candidates. Maximal degree in co-relation 420. Up to 101 conditions per place. [2025-02-08 08:28:24,339 INFO L140 encePairwiseOnDemand]: 94/103 looper letters, 36 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2025-02-08 08:28:24,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 52 transitions, 374 flow [2025-02-08 08:28:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:28:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:28:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2025-02-08 08:28:24,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2510402219140083 [2025-02-08 08:28:24,341 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 531 flow. Second operand 7 states and 181 transitions. [2025-02-08 08:28:24,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 52 transitions, 374 flow [2025-02-08 08:28:24,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 298 flow, removed 1 selfloop flow, removed 17 redundant places. [2025-02-08 08:28:24,343 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 208 flow [2025-02-08 08:28:24,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-02-08 08:28:24,344 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -45 predicate places. [2025-02-08 08:28:24,344 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 208 flow [2025-02-08 08:28:24,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 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:28:24,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:24,345 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:24,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:28:24,345 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-08 08:28:24,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash 110289337, now seen corresponding path program 1 times [2025-02-08 08:28:24,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:24,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862729468] [2025-02-08 08:28:24,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:24,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:28:24,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:28:24,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:24,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:28:24,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:28:24,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:28:24,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:28:24,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:24,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:28:24,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:28:24,470 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:28:24,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 65 remaining) [2025-02-08 08:28:24,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2025-02-08 08:28:24,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2025-02-08 08:28:24,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2025-02-08 08:28:24,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2025-02-08 08:28:24,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2025-02-08 08:28:24,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2025-02-08 08:28:24,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2025-02-08 08:28:24,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2025-02-08 08:28:24,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2025-02-08 08:28:24,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2025-02-08 08:28:24,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr474REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2025-02-08 08:28:24,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr475REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2025-02-08 08:28:24,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr472REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2025-02-08 08:28:24,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr473REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2025-02-08 08:28:24,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr470REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 65 remaining) [2025-02-08 08:28:24,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr471REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2025-02-08 08:28:24,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr468REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr469REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr466REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr467REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr464REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr465REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr462REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr463REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr460REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr461REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr458REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr456REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr457REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr454REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr455REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr448REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr449REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2025-02-08 08:28:24,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr452REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr453REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr450REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr451REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (11 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (10 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 65 remaining) [2025-02-08 08:28:24,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 65 remaining) [2025-02-08 08:28:24,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 65 remaining) [2025-02-08 08:28:24,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2025-02-08 08:28:24,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2025-02-08 08:28:24,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 65 remaining) [2025-02-08 08:28:24,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 65 remaining) [2025-02-08 08:28:24,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 65 remaining) [2025-02-08 08:28:24,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location StealerErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 65 remaining) [2025-02-08 08:28:24,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:28:24,479 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:24,481 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:28:24,483 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:28:24,530 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:28:24,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 122 transitions, 260 flow [2025-02-08 08:28:24,562 INFO L124 PetriNetUnfolderBase]: 19/255 cut-off events. [2025-02-08 08:28:24,563 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:28:24,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 255 events. 19/255 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1370 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 159. Up to 8 conditions per place. [2025-02-08 08:28:24,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 122 transitions, 260 flow [2025-02-08 08:28:24,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 122 transitions, 260 flow [2025-02-08 08:28:24,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:28:24,568 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;@855856, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:28:24,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-02-08 08:28:24,570 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:28:24,570 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-08 08:28:24,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:28:24,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:24,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:28:24,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr474REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:24,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash 112551, now seen corresponding path program 1 times [2025-02-08 08:28:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:24,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872535730] [2025-02-08 08:28:24,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:24,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:24,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:28:24,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:28:24,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:24,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:24,620 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:28:24,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:24,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872535730] [2025-02-08 08:28:24,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872535730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:24,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:24,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:28:24,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208627908] [2025-02-08 08:28:24,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:24,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:24,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:24,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:24,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 122 [2025-02-08 08:28:24,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 122 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:28:24,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:24,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 122 [2025-02-08 08:28:24,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:25,746 INFO L124 PetriNetUnfolderBase]: 5842/9906 cut-off events. [2025-02-08 08:28:25,747 INFO L125 PetriNetUnfolderBase]: For 73/78 co-relation queries the response was YES. [2025-02-08 08:28:25,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19170 conditions, 9906 events. 5842/9906 cut-off events. For 73/78 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 68709 event pairs, 4079 based on Foata normal form. 307/5347 useless extension candidates. Maximal degree in co-relation 15893. Up to 6736 conditions per place. [2025-02-08 08:28:25,805 INFO L140 encePairwiseOnDemand]: 85/122 looper letters, 106 selfloop transitions, 4 changer transitions 0/133 dead transitions. [2025-02-08 08:28:25,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 133 transitions, 507 flow [2025-02-08 08:28:25,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2025-02-08 08:28:25,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2025-02-08 08:28:25,807 INFO L175 Difference]: Start difference. First operand has 120 places, 122 transitions, 260 flow. Second operand 3 states and 238 transitions. [2025-02-08 08:28:25,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 133 transitions, 507 flow [2025-02-08 08:28:25,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 133 transitions, 507 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:28:25,810 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 216 flow [2025-02-08 08:28:25,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=91, PETRI_TRANSITIONS=91} [2025-02-08 08:28:25,810 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -29 predicate places. [2025-02-08 08:28:25,810 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 216 flow [2025-02-08 08:28:25,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:28:25,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:25,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:28:25,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:28:25,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr475REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:25,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash 112552, now seen corresponding path program 1 times [2025-02-08 08:28:25,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:25,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620230009] [2025-02-08 08:28:25,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:25,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:28:25,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:28:25,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:25,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:25,872 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:28:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620230009] [2025-02-08 08:28:25,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620230009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:25,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:25,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:28:25,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000626466] [2025-02-08 08:28:25,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:25,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:25,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:25,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:25,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 122 [2025-02-08 08:28:25,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:28:25,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:25,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 122 [2025-02-08 08:28:25,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:26,966 INFO L124 PetriNetUnfolderBase]: 5842/9784 cut-off events. [2025-02-08 08:28:26,967 INFO L125 PetriNetUnfolderBase]: For 440/448 co-relation queries the response was YES. [2025-02-08 08:28:26,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20348 conditions, 9784 events. 5842/9784 cut-off events. For 440/448 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 65800 event pairs, 3686 based on Foata normal form. 3/5660 useless extension candidates. Maximal degree in co-relation 18607. Up to 9154 conditions per place. [2025-02-08 08:28:27,020 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 79 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2025-02-08 08:28:27,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 105 transitions, 420 flow [2025-02-08 08:28:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-02-08 08:28:27,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4262295081967213 [2025-02-08 08:28:27,022 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 216 flow. Second operand 3 states and 156 transitions. [2025-02-08 08:28:27,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 105 transitions, 420 flow [2025-02-08 08:28:27,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 105 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:27,025 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 237 flow [2025-02-08 08:28:27,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2025-02-08 08:28:27,026 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -30 predicate places. [2025-02-08 08:28:27,027 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 237 flow [2025-02-08 08:28:27,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:28:27,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:27,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:28:27,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:28:27,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr470REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:27,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:27,028 INFO L85 PathProgramCache]: Analyzing trace with hash 108269702, now seen corresponding path program 1 times [2025-02-08 08:28:27,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:27,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139961841] [2025-02-08 08:28:27,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:27,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:27,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:28:27,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:28:27,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:27,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:27,104 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:28:27,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:27,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139961841] [2025-02-08 08:28:27,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139961841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:27,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:27,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:28:27,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641204754] [2025-02-08 08:28:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:27,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:28:27,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:27,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:28:27,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:28:27,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 122 [2025-02-08 08:28:27,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:28:27,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:27,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 122 [2025-02-08 08:28:27,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:28,270 INFO L124 PetriNetUnfolderBase]: 5842/9881 cut-off events. [2025-02-08 08:28:28,271 INFO L125 PetriNetUnfolderBase]: For 1192/1197 co-relation queries the response was YES. [2025-02-08 08:28:28,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20749 conditions, 9881 events. 5842/9881 cut-off events. For 1192/1197 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 68631 event pairs, 3773 based on Foata normal form. 2/6006 useless extension candidates. Maximal degree in co-relation 14562. Up to 6728 conditions per place. [2025-02-08 08:28:28,337 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 106 selfloop transitions, 8 changer transitions 0/134 dead transitions. [2025-02-08 08:28:28,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 134 transitions, 568 flow [2025-02-08 08:28:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:28:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:28:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2025-02-08 08:28:28,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4139344262295082 [2025-02-08 08:28:28,339 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 237 flow. Second operand 4 states and 202 transitions. [2025-02-08 08:28:28,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 134 transitions, 568 flow [2025-02-08 08:28:28,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 134 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:28,344 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 244 flow [2025-02-08 08:28:28,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2025-02-08 08:28:28,344 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -30 predicate places. [2025-02-08 08:28:28,345 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 244 flow [2025-02-08 08:28:28,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:28:28,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:28,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:28:28,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 08:28:28,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr471REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:28,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:28,346 INFO L85 PathProgramCache]: Analyzing trace with hash 108269703, now seen corresponding path program 1 times [2025-02-08 08:28:28,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:28,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482710060] [2025-02-08 08:28:28,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:28,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:28:28,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:28:28,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:28,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:28,538 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:28:28,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:28,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482710060] [2025-02-08 08:28:28,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482710060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:28,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:28,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:28,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266494172] [2025-02-08 08:28:28,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:28,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:28:28,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:28,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:28:28,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:28:28,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 122 [2025-02-08 08:28:28,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:28:28,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:28,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 122 [2025-02-08 08:28:28,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:29,308 INFO L124 PetriNetUnfolderBase]: 5842/9774 cut-off events. [2025-02-08 08:28:29,308 INFO L125 PetriNetUnfolderBase]: For 2053/2053 co-relation queries the response was YES. [2025-02-08 08:28:29,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21176 conditions, 9774 events. 5842/9774 cut-off events. For 2053/2053 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 66018 event pairs, 3686 based on Foata normal form. 0/5916 useless extension candidates. Maximal degree in co-relation 19379. Up to 9154 conditions per place. [2025-02-08 08:28:29,356 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 74 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-02-08 08:28:29,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 102 transitions, 439 flow [2025-02-08 08:28:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:28:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:28:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-02-08 08:28:29,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35860655737704916 [2025-02-08 08:28:29,358 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 244 flow. Second operand 4 states and 175 transitions. [2025-02-08 08:28:29,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 102 transitions, 439 flow [2025-02-08 08:28:29,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 102 transitions, 425 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:28:29,362 INFO L231 Difference]: Finished difference. Result has 89 places, 89 transitions, 244 flow [2025-02-08 08:28:29,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=89, PETRI_TRANSITIONS=89} [2025-02-08 08:28:29,362 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -31 predicate places. [2025-02-08 08:28:29,362 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 89 transitions, 244 flow [2025-02-08 08:28:29,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:28:29,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:29,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:29,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:28:29,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr465REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:29,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash -54203700, now seen corresponding path program 1 times [2025-02-08 08:28:29,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:29,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331102650] [2025-02-08 08:28:29,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:29,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:29,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:28:29,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:28:29,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:29,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:29,551 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:28:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331102650] [2025-02-08 08:28:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331102650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:28:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594115628] [2025-02-08 08:28:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:29,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:28:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:29,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:28:29,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:28:29,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 122 [2025-02-08 08:28:29,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 89 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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:28:29,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:29,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 122 [2025-02-08 08:28:29,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:30,572 INFO L124 PetriNetUnfolderBase]: 5842/9800 cut-off events. [2025-02-08 08:28:30,572 INFO L125 PetriNetUnfolderBase]: For 1291/1296 co-relation queries the response was YES. [2025-02-08 08:28:30,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20670 conditions, 9800 events. 5842/9800 cut-off events. For 1291/1296 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 66536 event pairs, 5104 based on Foata normal form. 0/5927 useless extension candidates. Maximal degree in co-relation 14534. Up to 9196 conditions per place. [2025-02-08 08:28:30,622 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 62 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2025-02-08 08:28:30,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 88 transitions, 376 flow [2025-02-08 08:28:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:28:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:28:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2025-02-08 08:28:30,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32131147540983607 [2025-02-08 08:28:30,624 INFO L175 Difference]: Start difference. First operand has 89 places, 89 transitions, 244 flow. Second operand 5 states and 196 transitions. [2025-02-08 08:28:30,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 88 transitions, 376 flow [2025-02-08 08:28:30,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 364 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:28:30,628 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 240 flow [2025-02-08 08:28:30,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2025-02-08 08:28:30,628 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -31 predicate places. [2025-02-08 08:28:30,628 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 240 flow [2025-02-08 08:28:30,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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:28:30,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:30,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:30,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:28:30,629 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr460REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:30,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash 128778842, now seen corresponding path program 1 times [2025-02-08 08:28:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:30,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494538212] [2025-02-08 08:28:30,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:30,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:28:30,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:28:30,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:30,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:30,771 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:28:30,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:30,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494538212] [2025-02-08 08:28:30,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494538212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:30,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:30,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:30,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134363718] [2025-02-08 08:28:30,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:30,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:28:30,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:30,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:28:30,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:28:30,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 122 [2025-02-08 08:28:30,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:28:30,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:30,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 122 [2025-02-08 08:28:30,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:31,805 INFO L124 PetriNetUnfolderBase]: 5842/9856 cut-off events. [2025-02-08 08:28:31,805 INFO L125 PetriNetUnfolderBase]: For 1197/1202 co-relation queries the response was YES. [2025-02-08 08:28:31,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20687 conditions, 9856 events. 5842/9856 cut-off events. For 1197/1202 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 67916 event pairs, 3785 based on Foata normal form. 2/5988 useless extension candidates. Maximal degree in co-relation 20655. Up to 6730 conditions per place. [2025-02-08 08:28:31,856 INFO L140 encePairwiseOnDemand]: 115/122 looper letters, 105 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2025-02-08 08:28:31,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 131 transitions, 565 flow [2025-02-08 08:28:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:28:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:28:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-02-08 08:28:31,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.430327868852459 [2025-02-08 08:28:31,858 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 240 flow. Second operand 4 states and 210 transitions. [2025-02-08 08:28:31,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 131 transitions, 565 flow [2025-02-08 08:28:31,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 555 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:28:31,864 INFO L231 Difference]: Finished difference. Result has 87 places, 87 transitions, 240 flow [2025-02-08 08:28:31,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=87, PETRI_TRANSITIONS=87} [2025-02-08 08:28:31,864 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -33 predicate places. [2025-02-08 08:28:31,865 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 87 transitions, 240 flow [2025-02-08 08:28:31,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:28:31,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:31,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:31,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 08:28:31,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr461REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:31,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:31,867 INFO L85 PathProgramCache]: Analyzing trace with hash 128778843, now seen corresponding path program 1 times [2025-02-08 08:28:31,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:31,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095953329] [2025-02-08 08:28:31,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:31,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:31,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:28:31,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:28:31,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:31,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:32,073 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:28:32,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:32,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095953329] [2025-02-08 08:28:32,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095953329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:32,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:32,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:28:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358896662] [2025-02-08 08:28:32,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:28:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:32,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:28:32,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:28:32,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 122 [2025-02-08 08:28:32,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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:28:32,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:32,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 122 [2025-02-08 08:28:32,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:33,078 INFO L124 PetriNetUnfolderBase]: 5794/10140 cut-off events. [2025-02-08 08:28:33,079 INFO L125 PetriNetUnfolderBase]: For 2323/2351 co-relation queries the response was YES. [2025-02-08 08:28:33,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21398 conditions, 10140 events. 5794/10140 cut-off events. For 2323/2351 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 73267 event pairs, 5034 based on Foata normal form. 4/6143 useless extension candidates. Maximal degree in co-relation 17596. Up to 9085 conditions per place. [2025-02-08 08:28:33,109 INFO L140 encePairwiseOnDemand]: 110/122 looper letters, 65 selfloop transitions, 12 changer transitions 0/96 dead transitions. [2025-02-08 08:28:33,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 96 transitions, 423 flow [2025-02-08 08:28:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:28:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:28:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 208 transitions. [2025-02-08 08:28:33,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34098360655737703 [2025-02-08 08:28:33,111 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 240 flow. Second operand 5 states and 208 transitions. [2025-02-08 08:28:33,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 96 transitions, 423 flow [2025-02-08 08:28:33,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 96 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:28:33,115 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 304 flow [2025-02-08 08:28:33,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2025-02-08 08:28:33,116 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -28 predicate places. [2025-02-08 08:28:33,116 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 304 flow [2025-02-08 08:28:33,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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:28:33,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:33,117 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:33,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 08:28:33,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr461REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:33,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:33,117 INFO L85 PathProgramCache]: Analyzing trace with hash -797470661, now seen corresponding path program 1 times [2025-02-08 08:28:33,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:33,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420311410] [2025-02-08 08:28:33,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:33,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:33,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:28:33,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:28:33,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:33,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:33,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420311410] [2025-02-08 08:28:33,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420311410] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:28:33,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349214274] [2025-02-08 08:28:33,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:33,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:33,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:33,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:33,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:28:33,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:28:33,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:28:33,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:33,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:33,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 08:28:33,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:33,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:28:33,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 08:28:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:33,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:28:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349214274] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:28:33,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:28:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-02-08 08:28:33,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861923427] [2025-02-08 08:28:33,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:28:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 08:28:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:33,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 08:28:33,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:28:34,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 122 [2025-02-08 08:28:34,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 304 flow. Second operand has 15 states, 15 states have (on average 28.2) internal successors, (423), 15 states have internal predecessors, (423), 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:28:34,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:34,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 122 [2025-02-08 08:28:34,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:35,560 INFO L124 PetriNetUnfolderBase]: 5811/10187 cut-off events. [2025-02-08 08:28:35,560 INFO L125 PetriNetUnfolderBase]: For 3023/3051 co-relation queries the response was YES. [2025-02-08 08:28:35,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21488 conditions, 10187 events. 5811/10187 cut-off events. For 3023/3051 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 73678 event pairs, 3880 based on Foata normal form. 4/6315 useless extension candidates. Maximal degree in co-relation 21417. Up to 9086 conditions per place. [2025-02-08 08:28:35,587 INFO L140 encePairwiseOnDemand]: 108/122 looper letters, 76 selfloop transitions, 28 changer transitions 0/123 dead transitions. [2025-02-08 08:28:35,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 123 transitions, 625 flow [2025-02-08 08:28:35,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:28:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:28:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 420 transitions. [2025-02-08 08:28:35,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28688524590163933 [2025-02-08 08:28:35,589 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 304 flow. Second operand 12 states and 420 transitions. [2025-02-08 08:28:35,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 123 transitions, 625 flow [2025-02-08 08:28:35,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 123 transitions, 617 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:35,594 INFO L231 Difference]: Finished difference. Result has 106 places, 108 transitions, 464 flow [2025-02-08 08:28:35,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=464, PETRI_PLACES=106, PETRI_TRANSITIONS=108} [2025-02-08 08:28:35,594 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -14 predicate places. [2025-02-08 08:28:35,594 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 108 transitions, 464 flow [2025-02-08 08:28:35,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 28.2) internal successors, (423), 15 states have internal predecessors, (423), 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:28:35,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:35,595 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:35,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:28:35,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:35,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr461REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:35,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1430743515, now seen corresponding path program 2 times [2025-02-08 08:28:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:35,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361522035] [2025-02-08 08:28:35,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:28:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:35,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 08:28:35,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:28:35,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:28:35,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361522035] [2025-02-08 08:28:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361522035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:28:36,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226405171] [2025-02-08 08:28:36,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:28:36,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:28:36,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:36,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:28:36,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:28:36,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 08:28:36,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:28:36,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:28:36,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:36,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:28:36,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:28:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:36,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:28:36,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226405171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:36,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:28:36,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2025-02-08 08:28:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7949546] [2025-02-08 08:28:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:36,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:28:36,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:36,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:28:36,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:28:36,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 122 [2025-02-08 08:28:36,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 108 transitions, 464 flow. Second operand has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 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:28:36,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:36,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 122 [2025-02-08 08:28:36,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:38,292 INFO L124 PetriNetUnfolderBase]: 9505/18023 cut-off events. [2025-02-08 08:28:38,292 INFO L125 PetriNetUnfolderBase]: For 7106/7106 co-relation queries the response was YES. [2025-02-08 08:28:38,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38412 conditions, 18023 events. 9505/18023 cut-off events. For 7106/7106 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 144153 event pairs, 4203 based on Foata normal form. 274/11623 useless extension candidates. Maximal degree in co-relation 38351. Up to 7551 conditions per place. [2025-02-08 08:28:38,369 INFO L140 encePairwiseOnDemand]: 108/122 looper letters, 193 selfloop transitions, 31 changer transitions 0/241 dead transitions. [2025-02-08 08:28:38,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 241 transitions, 1296 flow [2025-02-08 08:28:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:28:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:28:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 378 transitions. [2025-02-08 08:28:38,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4426229508196721 [2025-02-08 08:28:38,371 INFO L175 Difference]: Start difference. First operand has 106 places, 108 transitions, 464 flow. Second operand 7 states and 378 transitions. [2025-02-08 08:28:38,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 241 transitions, 1296 flow [2025-02-08 08:28:38,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 241 transitions, 1220 flow, removed 12 selfloop flow, removed 11 redundant places. [2025-02-08 08:28:38,379 INFO L231 Difference]: Finished difference. Result has 101 places, 120 transitions, 520 flow [2025-02-08 08:28:38,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=520, PETRI_PLACES=101, PETRI_TRANSITIONS=120} [2025-02-08 08:28:38,380 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -19 predicate places. [2025-02-08 08:28:38,380 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 120 transitions, 520 flow [2025-02-08 08:28:38,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 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:28:38,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:38,380 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:38,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:28:38,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 08:28:38,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr458REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:38,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1403378633, now seen corresponding path program 1 times [2025-02-08 08:28:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:38,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404016247] [2025-02-08 08:28:38,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:38,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:28:38,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:28:38,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:38,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:38,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:38,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404016247] [2025-02-08 08:28:38,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404016247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:38,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:38,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:28:38,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218393076] [2025-02-08 08:28:38,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:38,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:38,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:38,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:38,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:38,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 122 [2025-02-08 08:28:38,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 120 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:28:38,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:38,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 122 [2025-02-08 08:28:38,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:40,034 INFO L124 PetriNetUnfolderBase]: 10471/20169 cut-off events. [2025-02-08 08:28:40,035 INFO L125 PetriNetUnfolderBase]: For 11662/11662 co-relation queries the response was YES. [2025-02-08 08:28:40,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46679 conditions, 20169 events. 10471/20169 cut-off events. For 11662/11662 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 169595 event pairs, 6218 based on Foata normal form. 0/13025 useless extension candidates. Maximal degree in co-relation 36534. Up to 11955 conditions per place. [2025-02-08 08:28:40,146 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 155 selfloop transitions, 17 changer transitions 0/186 dead transitions. [2025-02-08 08:28:40,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 186 transitions, 1118 flow [2025-02-08 08:28:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-02-08 08:28:40,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.505464480874317 [2025-02-08 08:28:40,147 INFO L175 Difference]: Start difference. First operand has 101 places, 120 transitions, 520 flow. Second operand 3 states and 185 transitions. [2025-02-08 08:28:40,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 186 transitions, 1118 flow [2025-02-08 08:28:40,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 186 transitions, 1104 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:40,175 INFO L231 Difference]: Finished difference. Result has 104 places, 129 transitions, 649 flow [2025-02-08 08:28:40,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=104, PETRI_TRANSITIONS=129} [2025-02-08 08:28:40,175 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -16 predicate places. [2025-02-08 08:28:40,175 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 129 transitions, 649 flow [2025-02-08 08:28:40,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:28:40,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:40,175 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:40,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 08:28:40,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:40,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1403378634, now seen corresponding path program 1 times [2025-02-08 08:28:40,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:40,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333238638] [2025-02-08 08:28:40,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:40,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:40,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:28:40,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:28:40,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:40,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:40,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:40,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333238638] [2025-02-08 08:28:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333238638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:40,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:40,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759236257] [2025-02-08 08:28:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:40,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:28:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:40,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:28:40,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:28:40,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 122 [2025-02-08 08:28:40,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 129 transitions, 649 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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:28:40,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:40,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 122 [2025-02-08 08:28:40,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:41,632 INFO L124 PetriNetUnfolderBase]: 10491/20630 cut-off events. [2025-02-08 08:28:41,632 INFO L125 PetriNetUnfolderBase]: For 21489/21571 co-relation queries the response was YES. [2025-02-08 08:28:41,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50378 conditions, 20630 events. 10491/20630 cut-off events. For 21489/21571 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 175913 event pairs, 8173 based on Foata normal form. 1/13349 useless extension candidates. Maximal degree in co-relation 41745. Up to 16619 conditions per place. [2025-02-08 08:28:41,766 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 102 selfloop transitions, 13 changer transitions 0/133 dead transitions. [2025-02-08 08:28:41,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 133 transitions, 894 flow [2025-02-08 08:28:41,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:28:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:28:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2025-02-08 08:28:41,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36270491803278687 [2025-02-08 08:28:41,768 INFO L175 Difference]: Start difference. First operand has 104 places, 129 transitions, 649 flow. Second operand 4 states and 177 transitions. [2025-02-08 08:28:41,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 133 transitions, 894 flow [2025-02-08 08:28:41,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 133 transitions, 846 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-02-08 08:28:41,814 INFO L231 Difference]: Finished difference. Result has 106 places, 129 transitions, 637 flow [2025-02-08 08:28:41,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=637, PETRI_PLACES=106, PETRI_TRANSITIONS=129} [2025-02-08 08:28:41,814 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -14 predicate places. [2025-02-08 08:28:41,814 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 129 transitions, 637 flow [2025-02-08 08:28:41,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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:28:41,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:41,815 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:41,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 08:28:41,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:41,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash 415070099, now seen corresponding path program 1 times [2025-02-08 08:28:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:41,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394807853] [2025-02-08 08:28:41,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:41,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:28:41,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:28:41,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:41,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:42,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:42,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394807853] [2025-02-08 08:28:42,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394807853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:42,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:28:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745916682] [2025-02-08 08:28:42,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:42,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:28:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:42,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:28:42,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:28:42,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 122 [2025-02-08 08:28:42,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 129 transitions, 637 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:28:42,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:42,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 122 [2025-02-08 08:28:42,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:43,425 INFO L124 PetriNetUnfolderBase]: 10998/21300 cut-off events. [2025-02-08 08:28:43,425 INFO L125 PetriNetUnfolderBase]: For 15511/15519 co-relation queries the response was YES. [2025-02-08 08:28:43,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50427 conditions, 21300 events. 10998/21300 cut-off events. For 15511/15519 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 179997 event pairs, 8617 based on Foata normal form. 1/13862 useless extension candidates. Maximal degree in co-relation 41839. Up to 17500 conditions per place. [2025-02-08 08:28:43,587 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 106 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2025-02-08 08:28:43,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 134 transitions, 900 flow [2025-02-08 08:28:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:28:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:28:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-02-08 08:28:43,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.296448087431694 [2025-02-08 08:28:43,589 INFO L175 Difference]: Start difference. First operand has 106 places, 129 transitions, 637 flow. Second operand 6 states and 217 transitions. [2025-02-08 08:28:43,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 134 transitions, 900 flow [2025-02-08 08:28:43,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 134 transitions, 874 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:28:43,623 INFO L231 Difference]: Finished difference. Result has 109 places, 129 transitions, 649 flow [2025-02-08 08:28:43,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=649, PETRI_PLACES=109, PETRI_TRANSITIONS=129} [2025-02-08 08:28:43,626 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -11 predicate places. [2025-02-08 08:28:43,626 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 129 transitions, 649 flow [2025-02-08 08:28:43,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:28:43,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:43,627 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:43,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 08:28:43,627 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:43,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:43,627 INFO L85 PathProgramCache]: Analyzing trace with hash -17722501, now seen corresponding path program 1 times [2025-02-08 08:28:43,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:43,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866083215] [2025-02-08 08:28:43,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:43,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:28:43,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:28:43,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:43,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866083215] [2025-02-08 08:28:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866083215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:28:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931491705] [2025-02-08 08:28:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:43,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:28:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:43,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:28:43,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:28:44,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 122 [2025-02-08 08:28:44,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 129 transitions, 649 flow. Second operand has 8 states, 8 states have (on average 22.125) internal successors, (177), 8 states have internal predecessors, (177), 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:28:44,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:44,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 122 [2025-02-08 08:28:44,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:44,819 INFO L124 PetriNetUnfolderBase]: 3334/7002 cut-off events. [2025-02-08 08:28:44,819 INFO L125 PetriNetUnfolderBase]: For 4418/4418 co-relation queries the response was YES. [2025-02-08 08:28:44,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16797 conditions, 7002 events. 3334/7002 cut-off events. For 4418/4418 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 52534 event pairs, 1868 based on Foata normal form. 150/4555 useless extension candidates. Maximal degree in co-relation 13594. Up to 2739 conditions per place. [2025-02-08 08:28:44,856 INFO L140 encePairwiseOnDemand]: 106/122 looper letters, 213 selfloop transitions, 42 changer transitions 0/266 dead transitions. [2025-02-08 08:28:44,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 266 transitions, 1549 flow [2025-02-08 08:28:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:28:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:28:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 379 transitions. [2025-02-08 08:28:44,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38831967213114754 [2025-02-08 08:28:44,858 INFO L175 Difference]: Start difference. First operand has 109 places, 129 transitions, 649 flow. Second operand 8 states and 379 transitions. [2025-02-08 08:28:44,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 266 transitions, 1549 flow [2025-02-08 08:28:44,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 266 transitions, 1509 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-02-08 08:28:44,869 INFO L231 Difference]: Finished difference. Result has 113 places, 150 transitions, 887 flow [2025-02-08 08:28:44,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=887, PETRI_PLACES=113, PETRI_TRANSITIONS=150} [2025-02-08 08:28:44,869 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -7 predicate places. [2025-02-08 08:28:44,869 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 150 transitions, 887 flow [2025-02-08 08:28:44,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.125) internal successors, (177), 8 states have internal predecessors, (177), 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:28:44,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:44,869 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:44,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 08:28:44,870 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr458REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash -547661383, now seen corresponding path program 1 times [2025-02-08 08:28:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:44,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533401881] [2025-02-08 08:28:44,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:44,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:28:44,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:28:44,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:44,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:44,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:44,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533401881] [2025-02-08 08:28:44,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533401881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:44,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:44,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:28:44,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550097770] [2025-02-08 08:28:44,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:44,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:44,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:44,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:44,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:44,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 122 [2025-02-08 08:28:44,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 150 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:28:44,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:44,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 122 [2025-02-08 08:28:44,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:45,471 INFO L124 PetriNetUnfolderBase]: 2257/4424 cut-off events. [2025-02-08 08:28:45,472 INFO L125 PetriNetUnfolderBase]: For 10056/10059 co-relation queries the response was YES. [2025-02-08 08:28:45,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12461 conditions, 4424 events. 2257/4424 cut-off events. For 10056/10059 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 28288 event pairs, 1735 based on Foata normal form. 167/2835 useless extension candidates. Maximal degree in co-relation 12135. Up to 3608 conditions per place. [2025-02-08 08:28:45,503 INFO L140 encePairwiseOnDemand]: 120/122 looper letters, 126 selfloop transitions, 9 changer transitions 0/153 dead transitions. [2025-02-08 08:28:45,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 153 transitions, 1129 flow [2025-02-08 08:28:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-02-08 08:28:45,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4371584699453552 [2025-02-08 08:28:45,505 INFO L175 Difference]: Start difference. First operand has 113 places, 150 transitions, 887 flow. Second operand 3 states and 160 transitions. [2025-02-08 08:28:45,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 153 transitions, 1129 flow [2025-02-08 08:28:45,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 153 transitions, 1068 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-02-08 08:28:45,516 INFO L231 Difference]: Finished difference. Result has 110 places, 127 transitions, 679 flow [2025-02-08 08:28:45,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=110, PETRI_TRANSITIONS=127} [2025-02-08 08:28:45,520 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -10 predicate places. [2025-02-08 08:28:45,521 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 127 transitions, 679 flow [2025-02-08 08:28:45,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:28:45,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:45,521 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:45,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 08:28:45,521 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:45,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash -532764729, now seen corresponding path program 1 times [2025-02-08 08:28:45,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:45,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214441420] [2025-02-08 08:28:45,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:45,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:45,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:28:45,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:28:45,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:45,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:45,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:45,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214441420] [2025-02-08 08:28:45,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214441420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:45,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:28:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784051622] [2025-02-08 08:28:45,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:45,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:28:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:45,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:28:45,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:28:45,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 122 [2025-02-08 08:28:45,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 127 transitions, 679 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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:28:45,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:45,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 122 [2025-02-08 08:28:45,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:46,412 INFO L124 PetriNetUnfolderBase]: 2072/4121 cut-off events. [2025-02-08 08:28:46,412 INFO L125 PetriNetUnfolderBase]: For 8265/8267 co-relation queries the response was YES. [2025-02-08 08:28:46,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11685 conditions, 4121 events. 2072/4121 cut-off events. For 8265/8267 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27111 event pairs, 1160 based on Foata normal form. 2/2545 useless extension candidates. Maximal degree in co-relation 9403. Up to 1287 conditions per place. [2025-02-08 08:28:46,429 INFO L140 encePairwiseOnDemand]: 109/122 looper letters, 177 selfloop transitions, 34 changer transitions 0/228 dead transitions. [2025-02-08 08:28:46,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 228 transitions, 1570 flow [2025-02-08 08:28:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:28:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:28:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 303 transitions. [2025-02-08 08:28:46,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548009367681499 [2025-02-08 08:28:46,430 INFO L175 Difference]: Start difference. First operand has 110 places, 127 transitions, 679 flow. Second operand 7 states and 303 transitions. [2025-02-08 08:28:46,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 228 transitions, 1570 flow [2025-02-08 08:28:46,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 228 transitions, 1560 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:46,439 INFO L231 Difference]: Finished difference. Result has 120 places, 148 transitions, 977 flow [2025-02-08 08:28:46,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=977, PETRI_PLACES=120, PETRI_TRANSITIONS=148} [2025-02-08 08:28:46,440 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2025-02-08 08:28:46,440 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 148 transitions, 977 flow [2025-02-08 08:28:46,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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:28:46,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:46,441 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:46,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 08:28:46,441 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:46,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash -532764728, now seen corresponding path program 1 times [2025-02-08 08:28:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11969513] [2025-02-08 08:28:46,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:46,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:28:46,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:28:46,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:46,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:46,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11969513] [2025-02-08 08:28:46,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11969513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:46,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:46,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:28:46,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999791596] [2025-02-08 08:28:46,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:46,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:28:46,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:46,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:28:46,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:28:47,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 122 [2025-02-08 08:28:47,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 148 transitions, 977 flow. Second operand has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 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:28:47,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:47,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 122 [2025-02-08 08:28:47,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:47,698 INFO L124 PetriNetUnfolderBase]: 2660/5301 cut-off events. [2025-02-08 08:28:47,698 INFO L125 PetriNetUnfolderBase]: For 12866/12870 co-relation queries the response was YES. [2025-02-08 08:28:47,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16549 conditions, 5301 events. 2660/5301 cut-off events. For 12866/12870 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 37413 event pairs, 1116 based on Foata normal form. 106/3493 useless extension candidates. Maximal degree in co-relation 14202. Up to 2017 conditions per place. [2025-02-08 08:28:47,722 INFO L140 encePairwiseOnDemand]: 110/122 looper letters, 169 selfloop transitions, 28 changer transitions 0/214 dead transitions. [2025-02-08 08:28:47,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 214 transitions, 1670 flow [2025-02-08 08:28:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:28:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:28:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 312 transitions. [2025-02-08 08:28:47,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28415300546448086 [2025-02-08 08:28:47,724 INFO L175 Difference]: Start difference. First operand has 120 places, 148 transitions, 977 flow. Second operand 9 states and 312 transitions. [2025-02-08 08:28:47,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 214 transitions, 1670 flow [2025-02-08 08:28:47,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 214 transitions, 1666 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:47,748 INFO L231 Difference]: Finished difference. Result has 129 places, 155 transitions, 1126 flow [2025-02-08 08:28:47,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1126, PETRI_PLACES=129, PETRI_TRANSITIONS=155} [2025-02-08 08:28:47,750 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 9 predicate places. [2025-02-08 08:28:47,750 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 155 transitions, 1126 flow [2025-02-08 08:28:47,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 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:28:47,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:47,751 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:47,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 08:28:47,751 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:47,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash -532764727, now seen corresponding path program 1 times [2025-02-08 08:28:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:47,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876670808] [2025-02-08 08:28:47,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:47,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:28:47,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:28:47,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:47,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:47,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:47,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876670808] [2025-02-08 08:28:47,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876670808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:47,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:47,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:47,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357907787] [2025-02-08 08:28:47,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:47,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:47,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:47,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:47,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:47,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 122 [2025-02-08 08:28:47,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 155 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:28:47,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:47,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 122 [2025-02-08 08:28:47,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:48,342 INFO L124 PetriNetUnfolderBase]: 2298/4676 cut-off events. [2025-02-08 08:28:48,342 INFO L125 PetriNetUnfolderBase]: For 16022/16022 co-relation queries the response was YES. [2025-02-08 08:28:48,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15645 conditions, 4676 events. 2298/4676 cut-off events. For 16022/16022 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 32790 event pairs, 1249 based on Foata normal form. 0/3158 useless extension candidates. Maximal degree in co-relation 13573. Up to 2267 conditions per place. [2025-02-08 08:28:48,367 INFO L140 encePairwiseOnDemand]: 117/122 looper letters, 163 selfloop transitions, 33 changer transitions 0/214 dead transitions. [2025-02-08 08:28:48,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 214 transitions, 1845 flow [2025-02-08 08:28:48,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2025-02-08 08:28:48,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4972677595628415 [2025-02-08 08:28:48,368 INFO L175 Difference]: Start difference. First operand has 129 places, 155 transitions, 1126 flow. Second operand 3 states and 182 transitions. [2025-02-08 08:28:48,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 214 transitions, 1845 flow [2025-02-08 08:28:48,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 214 transitions, 1801 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-02-08 08:28:48,387 INFO L231 Difference]: Finished difference. Result has 129 places, 165 transitions, 1334 flow [2025-02-08 08:28:48,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1334, PETRI_PLACES=129, PETRI_TRANSITIONS=165} [2025-02-08 08:28:48,388 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 9 predicate places. [2025-02-08 08:28:48,388 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 165 transitions, 1334 flow [2025-02-08 08:28:48,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:28:48,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:48,388 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:48,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 08:28:48,388 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:48,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash -532764726, now seen corresponding path program 1 times [2025-02-08 08:28:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:48,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770473387] [2025-02-08 08:28:48,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:48,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:48,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:28:48,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:28:48,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:48,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:48,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770473387] [2025-02-08 08:28:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770473387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:48,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:48,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363458392] [2025-02-08 08:28:48,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:48,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:48,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:48,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:48,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:48,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 122 [2025-02-08 08:28:48,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 165 transitions, 1334 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:28:48,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:48,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 122 [2025-02-08 08:28:48,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:49,048 INFO L124 PetriNetUnfolderBase]: 1878/3888 cut-off events. [2025-02-08 08:28:49,048 INFO L125 PetriNetUnfolderBase]: For 17162/17166 co-relation queries the response was YES. [2025-02-08 08:28:49,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13594 conditions, 3888 events. 1878/3888 cut-off events. For 17162/17166 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 26375 event pairs, 1076 based on Foata normal form. 87/2960 useless extension candidates. Maximal degree in co-relation 13310. Up to 1923 conditions per place. [2025-02-08 08:28:49,073 INFO L140 encePairwiseOnDemand]: 120/122 looper letters, 184 selfloop transitions, 6 changer transitions 0/208 dead transitions. [2025-02-08 08:28:49,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 208 transitions, 1911 flow [2025-02-08 08:28:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-02-08 08:28:49,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48360655737704916 [2025-02-08 08:28:49,074 INFO L175 Difference]: Start difference. First operand has 129 places, 165 transitions, 1334 flow. Second operand 3 states and 177 transitions. [2025-02-08 08:28:49,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 208 transitions, 1911 flow [2025-02-08 08:28:49,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 208 transitions, 1845 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:28:49,097 INFO L231 Difference]: Finished difference. Result has 128 places, 163 transitions, 1270 flow [2025-02-08 08:28:49,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1270, PETRI_PLACES=128, PETRI_TRANSITIONS=163} [2025-02-08 08:28:49,097 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 8 predicate places. [2025-02-08 08:28:49,098 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 163 transitions, 1270 flow [2025-02-08 08:28:49,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:28:49,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:49,098 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:49,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 08:28:49,098 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr456REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:49,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1502674880, now seen corresponding path program 1 times [2025-02-08 08:28:49,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:49,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924792981] [2025-02-08 08:28:49,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:49,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:28:49,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:28:49,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:49,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:49,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924792981] [2025-02-08 08:28:49,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924792981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:49,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:49,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:28:49,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015367507] [2025-02-08 08:28:49,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:49,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:28:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:49,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:28:49,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:28:49,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 122 [2025-02-08 08:28:49,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 163 transitions, 1270 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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:28:49,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:49,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 122 [2025-02-08 08:28:49,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:49,795 INFO L124 PetriNetUnfolderBase]: 1703/3674 cut-off events. [2025-02-08 08:28:49,796 INFO L125 PetriNetUnfolderBase]: For 14679/14683 co-relation queries the response was YES. [2025-02-08 08:28:49,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12821 conditions, 3674 events. 1703/3674 cut-off events. For 14679/14683 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 25690 event pairs, 595 based on Foata normal form. 2/2753 useless extension candidates. Maximal degree in co-relation 12118. Up to 1208 conditions per place. [2025-02-08 08:28:49,817 INFO L140 encePairwiseOnDemand]: 111/122 looper letters, 160 selfloop transitions, 28 changer transitions 0/205 dead transitions. [2025-02-08 08:28:49,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 205 transitions, 1952 flow [2025-02-08 08:28:49,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:28:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:28:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2025-02-08 08:28:49,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34590163934426227 [2025-02-08 08:28:49,818 INFO L175 Difference]: Start difference. First operand has 128 places, 163 transitions, 1270 flow. Second operand 5 states and 211 transitions. [2025-02-08 08:28:49,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 205 transitions, 1952 flow [2025-02-08 08:28:49,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 205 transitions, 1943 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:49,838 INFO L231 Difference]: Finished difference. Result has 134 places, 171 transitions, 1456 flow [2025-02-08 08:28:49,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1456, PETRI_PLACES=134, PETRI_TRANSITIONS=171} [2025-02-08 08:28:49,839 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 14 predicate places. [2025-02-08 08:28:49,839 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 171 transitions, 1456 flow [2025-02-08 08:28:49,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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:28:49,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:49,839 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:49,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 08:28:49,840 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr454REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:49,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1502674878, now seen corresponding path program 1 times [2025-02-08 08:28:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:49,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064556660] [2025-02-08 08:28:49,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:49,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:28:49,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:28:49,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:49,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 08:28:49,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:49,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064556660] [2025-02-08 08:28:50,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064556660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:50,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:50,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:50,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053537229] [2025-02-08 08:28:50,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:50,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:50,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:50,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:50,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:50,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 122 [2025-02-08 08:28:50,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 171 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:28:50,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:50,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 122 [2025-02-08 08:28:50,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:50,503 INFO L124 PetriNetUnfolderBase]: 1561/3428 cut-off events. [2025-02-08 08:28:50,503 INFO L125 PetriNetUnfolderBase]: For 13988/13992 co-relation queries the response was YES. [2025-02-08 08:28:50,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12720 conditions, 3428 events. 1561/3428 cut-off events. For 13988/13992 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 23842 event pairs, 616 based on Foata normal form. 2/2795 useless extension candidates. Maximal degree in co-relation 12002. Up to 1672 conditions per place. [2025-02-08 08:28:50,517 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 167 selfloop transitions, 14 changer transitions 0/199 dead transitions. [2025-02-08 08:28:50,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 199 transitions, 2014 flow [2025-02-08 08:28:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-02-08 08:28:50,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43989071038251365 [2025-02-08 08:28:50,518 INFO L175 Difference]: Start difference. First operand has 134 places, 171 transitions, 1456 flow. Second operand 3 states and 161 transitions. [2025-02-08 08:28:50,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 199 transitions, 2014 flow [2025-02-08 08:28:50,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 199 transitions, 2014 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:28:50,537 INFO L231 Difference]: Finished difference. Result has 137 places, 170 transitions, 1512 flow [2025-02-08 08:28:50,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1512, PETRI_PLACES=137, PETRI_TRANSITIONS=170} [2025-02-08 08:28:50,538 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 17 predicate places. [2025-02-08 08:28:50,538 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 170 transitions, 1512 flow [2025-02-08 08:28:50,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:28:50,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:50,538 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:50,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 08:28:50,538 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr457REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:50,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1502674879, now seen corresponding path program 1 times [2025-02-08 08:28:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:50,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311115904] [2025-02-08 08:28:50,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:50,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:50,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:28:50,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:28:50,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:50,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:50,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:50,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311115904] [2025-02-08 08:28:50,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311115904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:50,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:50,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:28:50,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437776083] [2025-02-08 08:28:50,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:50,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:28:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:50,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:28:50,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:28:51,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 122 [2025-02-08 08:28:51,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 170 transitions, 1512 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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:28:51,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:51,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 122 [2025-02-08 08:28:51,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:51,635 INFO L124 PetriNetUnfolderBase]: 1883/4019 cut-off events. [2025-02-08 08:28:51,635 INFO L125 PetriNetUnfolderBase]: For 19569/19573 co-relation queries the response was YES. [2025-02-08 08:28:51,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15603 conditions, 4019 events. 1883/4019 cut-off events. For 19569/19573 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28610 event pairs, 825 based on Foata normal form. 82/3373 useless extension candidates. Maximal degree in co-relation 14882. Up to 1611 conditions per place. [2025-02-08 08:28:51,656 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 157 selfloop transitions, 34 changer transitions 0/208 dead transitions. [2025-02-08 08:28:51,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 208 transitions, 2168 flow [2025-02-08 08:28:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:28:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:28:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2025-02-08 08:28:51,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2822014051522248 [2025-02-08 08:28:51,658 INFO L175 Difference]: Start difference. First operand has 137 places, 170 transitions, 1512 flow. Second operand 7 states and 241 transitions. [2025-02-08 08:28:51,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 208 transitions, 2168 flow [2025-02-08 08:28:51,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 208 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:28:51,679 INFO L231 Difference]: Finished difference. Result has 143 places, 181 transitions, 1755 flow [2025-02-08 08:28:51,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1755, PETRI_PLACES=143, PETRI_TRANSITIONS=181} [2025-02-08 08:28:51,680 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 23 predicate places. [2025-02-08 08:28:51,680 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 181 transitions, 1755 flow [2025-02-08 08:28:51,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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:28:51,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:51,680 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 08:28:51,680 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr455REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:51,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1502674877, now seen corresponding path program 1 times [2025-02-08 08:28:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264594581] [2025-02-08 08:28:51,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:51,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:28:51,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:28:51,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:51,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 08:28:51,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:51,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264594581] [2025-02-08 08:28:51,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264594581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:51,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:51,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:51,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560113219] [2025-02-08 08:28:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:51,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:51,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:51,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:51,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:51,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 122 [2025-02-08 08:28:51,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 181 transitions, 1755 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:28:51,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:51,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 122 [2025-02-08 08:28:51,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:52,245 INFO L124 PetriNetUnfolderBase]: 1565/3470 cut-off events. [2025-02-08 08:28:52,245 INFO L125 PetriNetUnfolderBase]: For 19365/19369 co-relation queries the response was YES. [2025-02-08 08:28:52,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13932 conditions, 3470 events. 1565/3470 cut-off events. For 19365/19369 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 24232 event pairs, 708 based on Foata normal form. 47/2991 useless extension candidates. Maximal degree in co-relation 13192. Up to 1473 conditions per place. [2025-02-08 08:28:52,260 INFO L140 encePairwiseOnDemand]: 118/122 looper letters, 175 selfloop transitions, 9 changer transitions 0/202 dead transitions. [2025-02-08 08:28:52,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 202 transitions, 2290 flow [2025-02-08 08:28:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-02-08 08:28:52,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42349726775956287 [2025-02-08 08:28:52,261 INFO L175 Difference]: Start difference. First operand has 143 places, 181 transitions, 1755 flow. Second operand 3 states and 155 transitions. [2025-02-08 08:28:52,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 202 transitions, 2290 flow [2025-02-08 08:28:52,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 202 transitions, 2249 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-02-08 08:28:52,285 INFO L231 Difference]: Finished difference. Result has 141 places, 178 transitions, 1718 flow [2025-02-08 08:28:52,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1700, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1718, PETRI_PLACES=141, PETRI_TRANSITIONS=178} [2025-02-08 08:28:52,286 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 21 predicate places. [2025-02-08 08:28:52,286 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 178 transitions, 1718 flow [2025-02-08 08:28:52,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:28:52,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:52,286 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:52,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 08:28:52,286 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:52,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash 694611264, now seen corresponding path program 1 times [2025-02-08 08:28:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363306874] [2025-02-08 08:28:52,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:52,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:28:52,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:28:52,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:52,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:52,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:52,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363306874] [2025-02-08 08:28:52,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363306874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:52,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:52,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:28:52,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713837163] [2025-02-08 08:28:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:52,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:28:52,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:52,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:28:52,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:28:52,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 122 [2025-02-08 08:28:52,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 178 transitions, 1718 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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:28:52,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:52,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 122 [2025-02-08 08:28:52,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:53,162 INFO L124 PetriNetUnfolderBase]: 1459/3299 cut-off events. [2025-02-08 08:28:53,162 INFO L125 PetriNetUnfolderBase]: For 17952/17956 co-relation queries the response was YES. [2025-02-08 08:28:53,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13113 conditions, 3299 events. 1459/3299 cut-off events. For 17952/17956 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 23034 event pairs, 588 based on Foata normal form. 2/2843 useless extension candidates. Maximal degree in co-relation 12084. Up to 1207 conditions per place. [2025-02-08 08:28:53,179 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 129 selfloop transitions, 66 changer transitions 0/212 dead transitions. [2025-02-08 08:28:53,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 212 transitions, 2452 flow [2025-02-08 08:28:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:28:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:28:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2025-02-08 08:28:53,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30327868852459017 [2025-02-08 08:28:53,181 INFO L175 Difference]: Start difference. First operand has 141 places, 178 transitions, 1718 flow. Second operand 6 states and 222 transitions. [2025-02-08 08:28:53,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 212 transitions, 2452 flow [2025-02-08 08:28:53,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 212 transitions, 2438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:53,204 INFO L231 Difference]: Finished difference. Result has 144 places, 177 transitions, 1839 flow [2025-02-08 08:28:53,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1839, PETRI_PLACES=144, PETRI_TRANSITIONS=177} [2025-02-08 08:28:53,205 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 24 predicate places. [2025-02-08 08:28:53,205 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 177 transitions, 1839 flow [2025-02-08 08:28:53,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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:28:53,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:53,205 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:53,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 08:28:53,205 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:53,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash 694611265, now seen corresponding path program 1 times [2025-02-08 08:28:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:53,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145414009] [2025-02-08 08:28:53,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:53,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:28:53,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:28:53,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:53,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:53,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:53,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145414009] [2025-02-08 08:28:53,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145414009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:53,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:53,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:28:53,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765374551] [2025-02-08 08:28:53,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:53,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:28:53,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:53,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:28:53,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:28:53,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 122 [2025-02-08 08:28:53,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 177 transitions, 1839 flow. Second operand has 9 states, 9 states have (on average 22.22222222222222) internal successors, (200), 9 states have internal predecessors, (200), 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:28:53,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:53,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 122 [2025-02-08 08:28:53,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:54,446 INFO L124 PetriNetUnfolderBase]: 1535/3403 cut-off events. [2025-02-08 08:28:54,446 INFO L125 PetriNetUnfolderBase]: For 19718/19722 co-relation queries the response was YES. [2025-02-08 08:28:54,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13918 conditions, 3403 events. 1535/3403 cut-off events. For 19718/19722 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 23652 event pairs, 564 based on Foata normal form. 2/2935 useless extension candidates. Maximal degree in co-relation 12927. Up to 1207 conditions per place. [2025-02-08 08:28:54,462 INFO L140 encePairwiseOnDemand]: 109/122 looper letters, 126 selfloop transitions, 69 changer transitions 0/212 dead transitions. [2025-02-08 08:28:54,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 212 transitions, 2529 flow [2025-02-08 08:28:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:28:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:28:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 247 transitions. [2025-02-08 08:28:54,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2530737704918033 [2025-02-08 08:28:54,464 INFO L175 Difference]: Start difference. First operand has 144 places, 177 transitions, 1839 flow. Second operand 8 states and 247 transitions. [2025-02-08 08:28:54,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 212 transitions, 2529 flow [2025-02-08 08:28:54,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 212 transitions, 2401 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:28:54,508 INFO L231 Difference]: Finished difference. Result has 148 places, 180 transitions, 1926 flow [2025-02-08 08:28:54,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1926, PETRI_PLACES=148, PETRI_TRANSITIONS=180} [2025-02-08 08:28:54,509 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 28 predicate places. [2025-02-08 08:28:54,509 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 180 transitions, 1926 flow [2025-02-08 08:28:54,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.22222222222222) internal successors, (200), 9 states have internal predecessors, (200), 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:28:54,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:54,509 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:54,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 08:28:54,510 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr457REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:54,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash 661725612, now seen corresponding path program 1 times [2025-02-08 08:28:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:54,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049302025] [2025-02-08 08:28:54,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:54,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:28:54,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:28:54,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:54,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049302025] [2025-02-08 08:28:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049302025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:54,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:54,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:28:54,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625703370] [2025-02-08 08:28:54,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:54,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:28:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:54,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:28:54,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:28:55,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 122 [2025-02-08 08:28:55,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 180 transitions, 1926 flow. Second operand has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 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:28:55,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:55,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 122 [2025-02-08 08:28:55,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:55,681 INFO L124 PetriNetUnfolderBase]: 1371/3145 cut-off events. [2025-02-08 08:28:55,681 INFO L125 PetriNetUnfolderBase]: For 19695/19699 co-relation queries the response was YES. [2025-02-08 08:28:55,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13121 conditions, 3145 events. 1371/3145 cut-off events. For 19695/19699 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 21929 event pairs, 672 based on Foata normal form. 102/2847 useless extension candidates. Maximal degree in co-relation 12350. Up to 987 conditions per place. [2025-02-08 08:28:55,698 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 174 selfloop transitions, 33 changer transitions 0/224 dead transitions. [2025-02-08 08:28:55,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 224 transitions, 2697 flow [2025-02-08 08:28:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:28:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:28:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 260 transitions. [2025-02-08 08:28:55,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26639344262295084 [2025-02-08 08:28:55,700 INFO L175 Difference]: Start difference. First operand has 148 places, 180 transitions, 1926 flow. Second operand 8 states and 260 transitions. [2025-02-08 08:28:55,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 224 transitions, 2697 flow [2025-02-08 08:28:55,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 224 transitions, 2538 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-02-08 08:28:55,732 INFO L231 Difference]: Finished difference. Result has 152 places, 186 transitions, 1962 flow [2025-02-08 08:28:55,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1962, PETRI_PLACES=152, PETRI_TRANSITIONS=186} [2025-02-08 08:28:55,732 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 32 predicate places. [2025-02-08 08:28:55,732 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 186 transitions, 1962 flow [2025-02-08 08:28:55,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 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:28:55,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:55,733 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:55,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 08:28:55,733 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:55,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash 694611266, now seen corresponding path program 1 times [2025-02-08 08:28:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:55,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736784699] [2025-02-08 08:28:55,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:55,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:28:55,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:28:55,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:55,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 08:28:55,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736784699] [2025-02-08 08:28:55,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736784699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:55,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:55,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:55,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467938929] [2025-02-08 08:28:55,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:55,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:55,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:55,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:55,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 122 [2025-02-08 08:28:55,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 186 transitions, 1962 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:28:55,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:55,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 122 [2025-02-08 08:28:55,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:56,345 INFO L124 PetriNetUnfolderBase]: 1254/2949 cut-off events. [2025-02-08 08:28:56,346 INFO L125 PetriNetUnfolderBase]: For 18148/18152 co-relation queries the response was YES. [2025-02-08 08:28:56,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12252 conditions, 2949 events. 1254/2949 cut-off events. For 18148/18152 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20428 event pairs, 668 based on Foata normal form. 2/2625 useless extension candidates. Maximal degree in co-relation 11486. Up to 1754 conditions per place. [2025-02-08 08:28:56,361 INFO L140 encePairwiseOnDemand]: 120/122 looper letters, 175 selfloop transitions, 4 changer transitions 0/197 dead transitions. [2025-02-08 08:28:56,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 197 transitions, 2454 flow [2025-02-08 08:28:56,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-02-08 08:28:56,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39344262295081966 [2025-02-08 08:28:56,362 INFO L175 Difference]: Start difference. First operand has 152 places, 186 transitions, 1962 flow. Second operand 3 states and 144 transitions. [2025-02-08 08:28:56,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 197 transitions, 2454 flow [2025-02-08 08:28:56,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 197 transitions, 2409 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 08:28:56,387 INFO L231 Difference]: Finished difference. Result has 149 places, 185 transitions, 1927 flow [2025-02-08 08:28:56,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1927, PETRI_PLACES=149, PETRI_TRANSITIONS=185} [2025-02-08 08:28:56,388 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 29 predicate places. [2025-02-08 08:28:56,388 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 185 transitions, 1927 flow [2025-02-08 08:28:56,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:28:56,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:56,388 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:56,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 08:28:56,388 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:56,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash 694611267, now seen corresponding path program 1 times [2025-02-08 08:28:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:56,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806680820] [2025-02-08 08:28:56,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:56,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:28:56,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:28:56,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:56,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 08:28:56,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806680820] [2025-02-08 08:28:56,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806680820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:56,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:56,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:28:56,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800374525] [2025-02-08 08:28:56,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:56,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:56,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:56,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:56,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:56,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 122 [2025-02-08 08:28:56,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 185 transitions, 1927 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:28:56,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:56,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 122 [2025-02-08 08:28:56,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:56,937 INFO L124 PetriNetUnfolderBase]: 1137/2746 cut-off events. [2025-02-08 08:28:56,937 INFO L125 PetriNetUnfolderBase]: For 15889/15893 co-relation queries the response was YES. [2025-02-08 08:28:56,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11438 conditions, 2746 events. 1137/2746 cut-off events. For 15889/15893 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 18922 event pairs, 627 based on Foata normal form. 2/2521 useless extension candidates. Maximal degree in co-relation 10668. Up to 1754 conditions per place. [2025-02-08 08:28:56,954 INFO L140 encePairwiseOnDemand]: 120/122 looper letters, 174 selfloop transitions, 4 changer transitions 0/196 dead transitions. [2025-02-08 08:28:56,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 196 transitions, 2413 flow [2025-02-08 08:28:56,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2025-02-08 08:28:56,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3907103825136612 [2025-02-08 08:28:56,955 INFO L175 Difference]: Start difference. First operand has 149 places, 185 transitions, 1927 flow. Second operand 3 states and 143 transitions. [2025-02-08 08:28:56,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 196 transitions, 2413 flow [2025-02-08 08:28:56,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 196 transitions, 2409 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:56,983 INFO L231 Difference]: Finished difference. Result has 149 places, 184 transitions, 1929 flow [2025-02-08 08:28:56,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1929, PETRI_PLACES=149, PETRI_TRANSITIONS=184} [2025-02-08 08:28:56,984 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 29 predicate places. [2025-02-08 08:28:56,984 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 184 transitions, 1929 flow [2025-02-08 08:28:56,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:28:56,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:56,984 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:56,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 08:28:56,984 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:56,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash -664272683, now seen corresponding path program 1 times [2025-02-08 08:28:56,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:56,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713275162] [2025-02-08 08:28:56,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:56,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:57,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:28:57,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:28:57,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:57,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:57,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:57,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713275162] [2025-02-08 08:28:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713275162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:57,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:57,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:28:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333259311] [2025-02-08 08:28:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:57,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:28:57,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:57,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:28:57,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:28:57,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 122 [2025-02-08 08:28:57,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 184 transitions, 1929 flow. Second operand has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 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:28:57,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:57,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 122 [2025-02-08 08:28:57,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:58,193 INFO L124 PetriNetUnfolderBase]: 1062/2622 cut-off events. [2025-02-08 08:28:58,193 INFO L125 PetriNetUnfolderBase]: For 14801/14805 co-relation queries the response was YES. [2025-02-08 08:28:58,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10856 conditions, 2622 events. 1062/2622 cut-off events. For 14801/14805 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18198 event pairs, 537 based on Foata normal form. 56/2452 useless extension candidates. Maximal degree in co-relation 10551. Up to 1008 conditions per place. [2025-02-08 08:28:58,207 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 164 selfloop transitions, 38 changer transitions 5/223 dead transitions. [2025-02-08 08:28:58,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 223 transitions, 2684 flow [2025-02-08 08:28:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:28:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:28:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 278 transitions. [2025-02-08 08:28:58,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25318761384335153 [2025-02-08 08:28:58,208 INFO L175 Difference]: Start difference. First operand has 149 places, 184 transitions, 1929 flow. Second operand 9 states and 278 transitions. [2025-02-08 08:28:58,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 223 transitions, 2684 flow [2025-02-08 08:28:58,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 223 transitions, 2660 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-02-08 08:28:58,232 INFO L231 Difference]: Finished difference. Result has 158 places, 183 transitions, 2035 flow [2025-02-08 08:28:58,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2035, PETRI_PLACES=158, PETRI_TRANSITIONS=183} [2025-02-08 08:28:58,233 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 38 predicate places. [2025-02-08 08:28:58,233 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 183 transitions, 2035 flow [2025-02-08 08:28:58,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 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:28:58,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:58,233 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:58,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 08:28:58,233 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash 58115543, now seen corresponding path program 1 times [2025-02-08 08:28:58,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:58,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567735393] [2025-02-08 08:28:58,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:58,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:58,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:28:58,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:28:58,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:58,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 08:28:58,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:58,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567735393] [2025-02-08 08:28:58,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567735393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:58,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:58,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:28:58,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40162450] [2025-02-08 08:28:58,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:58,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:28:58,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:58,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:28:58,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:28:58,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 122 [2025-02-08 08:28:58,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 183 transitions, 2035 flow. Second operand has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 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:28:58,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:58,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 122 [2025-02-08 08:28:58,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:59,337 INFO L124 PetriNetUnfolderBase]: 901/2307 cut-off events. [2025-02-08 08:28:59,338 INFO L125 PetriNetUnfolderBase]: For 14651/14651 co-relation queries the response was YES. [2025-02-08 08:28:59,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10023 conditions, 2307 events. 901/2307 cut-off events. For 14651/14651 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 15569 event pairs, 400 based on Foata normal form. 37/2118 useless extension candidates. Maximal degree in co-relation 8362. Up to 1143 conditions per place. [2025-02-08 08:28:59,351 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 114 selfloop transitions, 62 changer transitions 20/212 dead transitions. [2025-02-08 08:28:59,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 212 transitions, 2751 flow [2025-02-08 08:28:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:28:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:28:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions. [2025-02-08 08:28:59,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24180327868852458 [2025-02-08 08:28:59,352 INFO L175 Difference]: Start difference. First operand has 158 places, 183 transitions, 2035 flow. Second operand 8 states and 236 transitions. [2025-02-08 08:28:59,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 212 transitions, 2751 flow [2025-02-08 08:28:59,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 212 transitions, 2697 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 08:28:59,380 INFO L231 Difference]: Finished difference. Result has 157 places, 173 transitions, 2014 flow [2025-02-08 08:28:59,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2014, PETRI_PLACES=157, PETRI_TRANSITIONS=173} [2025-02-08 08:28:59,380 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 37 predicate places. [2025-02-08 08:28:59,380 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 173 transitions, 2014 flow [2025-02-08 08:28:59,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 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:28:59,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:59,381 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:59,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-08 08:28:59,381 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr454REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-02-08 08:28:59,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:59,381 INFO L85 PathProgramCache]: Analyzing trace with hash 23352779, now seen corresponding path program 1 times [2025-02-08 08:28:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:59,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016359028] [2025-02-08 08:28:59,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:59,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:59,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:28:59,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:28:59,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:59,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 08:28:59,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:59,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016359028] [2025-02-08 08:28:59,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016359028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:59,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:59,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:28:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248907701] [2025-02-08 08:28:59,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:59,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:59,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:59,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:59,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:59,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 122 [2025-02-08 08:28:59,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 173 transitions, 2014 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:28:59,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:59,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 122 [2025-02-08 08:28:59,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:59,525 INFO L124 PetriNetUnfolderBase]: 112/276 cut-off events. [2025-02-08 08:28:59,526 INFO L125 PetriNetUnfolderBase]: For 5682/5682 co-relation queries the response was YES. [2025-02-08 08:28:59,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 276 events. 112/276 cut-off events. For 5682/5682 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1068 event pairs, 28 based on Foata normal form. 53/328 useless extension candidates. Maximal degree in co-relation 1494. Up to 123 conditions per place. [2025-02-08 08:28:59,527 INFO L140 encePairwiseOnDemand]: 120/122 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2025-02-08 08:28:59,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 68 transitions, 831 flow [2025-02-08 08:28:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-02-08 08:28:59,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3114754098360656 [2025-02-08 08:28:59,528 INFO L175 Difference]: Start difference. First operand has 157 places, 173 transitions, 2014 flow. Second operand 3 states and 114 transitions. [2025-02-08 08:28:59,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 68 transitions, 831 flow [2025-02-08 08:28:59,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 570 flow, removed 16 selfloop flow, removed 37 redundant places. [2025-02-08 08:28:59,531 INFO L231 Difference]: Finished difference. Result has 70 places, 0 transitions, 0 flow [2025-02-08 08:28:59,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=70, PETRI_TRANSITIONS=0} [2025-02-08 08:28:59,532 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -50 predicate places. [2025-02-08 08:28:59,532 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 0 transitions, 0 flow [2025-02-08 08:28:59,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr474REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr475REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr472REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr473REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr470REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr471REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr468REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2025-02-08 08:28:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr469REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr466REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr467REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr464REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr465REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr462REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr463REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr460REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr461REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr458REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr456REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr457REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr454REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr455REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr448REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr449REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr452REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr453REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr450REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr451REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 75 remaining) [2025-02-08 08:28:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (21 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2025-02-08 08:28:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2025-02-08 08:28:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2025-02-08 08:28:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2025-02-08 08:28:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2025-02-08 08:28:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location StealerErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2025-02-08 08:28:59,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-08 08:28:59,535 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:59,539 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-02-08 08:28:59,539 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:28:59,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:28:59 BasicIcfg [2025-02-08 08:28:59,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:28:59,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:28:59,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:28:59,546 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:28:59,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:28:13" (3/4) ... [2025-02-08 08:28:59,547 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:28:59,550 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure Stealer [2025-02-08 08:28:59,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2025-02-08 08:28:59,555 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-08 08:28:59,555 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 08:28:59,555 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:28:59,555 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:28:59,634 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:28:59,635 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:28:59,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:28:59,636 INFO L158 Benchmark]: Toolchain (without parser) took 51073.05ms. Allocated memory was 142.6MB in the beginning and 956.3MB in the end (delta: 813.7MB). Free memory was 108.1MB in the beginning and 379.5MB in the end (delta: -271.4MB). Peak memory consumption was 544.9MB. Max. memory is 16.1GB. [2025-02-08 08:28:59,636 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:28:59,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 915.91ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 48.0MB in the end (delta: 59.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 08:28:59,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.82ms. Allocated memory is still 142.6MB. Free memory was 48.0MB in the beginning and 103.6MB in the end (delta: -55.6MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-02-08 08:28:59,638 INFO L158 Benchmark]: Boogie Preprocessor took 197.65ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 89.4MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:28:59,638 INFO L158 Benchmark]: IcfgBuilder took 3578.68ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 89.4MB in the beginning and 103.8MB in the end (delta: -14.4MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2025-02-08 08:28:59,638 INFO L158 Benchmark]: TraceAbstraction took 46176.13ms. Allocated memory was 176.2MB in the beginning and 956.3MB in the end (delta: 780.1MB). Free memory was 102.7MB in the beginning and 383.8MB in the end (delta: -281.1MB). Peak memory consumption was 496.1MB. Max. memory is 16.1GB. [2025-02-08 08:28:59,638 INFO L158 Benchmark]: Witness Printer took 89.24ms. Allocated memory is still 956.3MB. Free memory was 383.8MB in the beginning and 379.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:28:59,640 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 915.91ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 48.0MB in the end (delta: 59.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.82ms. Allocated memory is still 142.6MB. Free memory was 48.0MB in the beginning and 103.6MB in the end (delta: -55.6MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 197.65ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 89.4MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 3578.68ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 89.4MB in the beginning and 103.8MB in the end (delta: -14.4MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. * TraceAbstraction took 46176.13ms. Allocated memory was 176.2MB in the beginning and 956.3MB in the end (delta: 780.1MB). Free memory was 102.7MB in the beginning and 383.8MB in the end (delta: -281.1MB). Peak memory consumption was 496.1MB. Max. memory is 16.1GB. * Witness Printer took 89.24ms. Allocated memory is still 956.3MB. Free memory was 383.8MB in the beginning and 379.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1944]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 116 locations, 65 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.0s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1373 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1028 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3641 IncrementalHoareTripleChecker+Invalid, 3775 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 50 mSDtfsCounter, 3641 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=531occurred in iteration=13, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 232 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 1736 SizeOfPredicates, 8 NumberOfNonLiveVariables, 731 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 113/126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 134 locations, 75 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.0s, OverallIterations: 30, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3658 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2970 mSDsluCounter, 328 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10205 IncrementalHoareTripleChecker+Invalid, 10593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 152 mSDtfsCounter, 10205 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2035occurred in iteration=28, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 656 NumberOfCodeBlocks, 656 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 4866 SizeOfPredicates, 8 NumberOfNonLiveVariables, 731 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 413/430 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 520 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:28:59,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE