./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_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/ldv-memsafety/memleaks_test23_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 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:30:31,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:30:31,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:30:31,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:30:31,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:30:31,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:30:31,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:30:31,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:30:31,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:30:31,855 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:30:31,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:30:31,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:30:31,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:30:31,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:30:31,856 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:30:31,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:30:31,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:30:31,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:30:31,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:30:31,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:30:31,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:30:31,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:30:31,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:30:31,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:30:31,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:30:31,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:30:31,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:30:31,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:30:31,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:30:31,858 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2025-02-08 06:30:32,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:30:32,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:30:32,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:30:32,106 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:30:32,106 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:30:32,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2025-02-08 06:30:33,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a68bdc2e/6491c072643c4f9d860a996fcd7c6a45/FLAGa79f47787 [2025-02-08 06:30:33,451 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:30:33,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2025-02-08 06:30:33,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a68bdc2e/6491c072643c4f9d860a996fcd7c6a45/FLAGa79f47787 [2025-02-08 06:30:33,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a68bdc2e/6491c072643c4f9d860a996fcd7c6a45 [2025-02-08 06:30:33,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:30:33,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:30:33,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:30:33,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:30:33,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:30:33,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:30:33" (1/1) ... [2025-02-08 06:30:33,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58686f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:33, skipping insertion in model container [2025-02-08 06:30:33,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:30:33" (1/1) ... [2025-02-08 06:30:33,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:30:34,019 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:30:34,082 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:30:34,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:30:34,103 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2025-02-08 06:30:34,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f230c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:34, skipping insertion in model container [2025-02-08 06:30:34,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:30:34,104 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-02-08 06:30:34,106 INFO L158 Benchmark]: Toolchain (without parser) took 342.05ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 97.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:30:34,107 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:30:34,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.11ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 97.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:30:34,108 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.11ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 97.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/ldv-memsafety/memleaks_test23_2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:30:35,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:30:35,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 06:30:35,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:30:35,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:30:35,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:30:35,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:30:35,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:30:35,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:30:35,852 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:30:35,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:30:35,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:30:35,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:30:35,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:30:35,853 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:30:35,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:30:35,853 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:30:35,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:30:35,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:30:35,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:30:35,853 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:30:35,853 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:30:35,853 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:30:35,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:30:35,854 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:30:35,854 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 06:30:35,854 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 06:30:35,854 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:30:35,854 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:30:35,854 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:30:35,854 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:30:35,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:30:35,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:30:35,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:30:35,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:30:35,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:30:35,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:30:35,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:30:35,856 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 06:30:35,856 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 06:30:35,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:30:35,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:30:35,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:30:35,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:30:35,856 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2025-02-08 06:30:36,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:30:36,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:30:36,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:30:36,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:30:36,107 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:30:36,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2025-02-08 06:30:37,290 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1b349fd3/44bd0fc621214cefba8b4cab0f5d1b0b/FLAG3a8ca4ca6 [2025-02-08 06:30:37,547 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:30:37,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2025-02-08 06:30:37,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1b349fd3/44bd0fc621214cefba8b4cab0f5d1b0b/FLAG3a8ca4ca6 [2025-02-08 06:30:37,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1b349fd3/44bd0fc621214cefba8b4cab0f5d1b0b [2025-02-08 06:30:37,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:30:37,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:30:37,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:30:37,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:30:37,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:30:37,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:30:37" (1/1) ... [2025-02-08 06:30:37,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e95dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:37, skipping insertion in model container [2025-02-08 06:30:37,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:30:37" (1/1) ... [2025-02-08 06:30:37,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:30:38,093 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:30:38,140 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:30:38,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:30:38,160 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-02-08 06:30:38,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:30:38,192 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:30:38,226 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:30:38,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:30:38,235 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:30:38,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:30:38,318 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:30:38,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38 WrapperNode [2025-02-08 06:30:38,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:30:38,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:30:38,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:30:38,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:30:38,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,366 INFO L138 Inliner]: procedures = 175, calls = 121, calls flagged for inlining = 30, calls inlined = 15, statements flattened = 203 [2025-02-08 06:30:38,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:30:38,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:30:38,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:30:38,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:30:38,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,408 INFO L175 MemorySlicer]: Split 37 memory accesses to 4 slices as follows [2, 1, 29, 5]. 78 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2, 0]. The 17 writes are split as follows [0, 0, 13, 4]. [2025-02-08 06:30:38,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:30:38,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:30:38,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:30:38,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:30:38,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (1/1) ... [2025-02-08 06:30:38,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:30:38,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:38,472 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 06:30:38,478 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 06:30:38,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-08 06:30:38,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-08 06:30:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-08 06:30:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-08 06:30:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2025-02-08 06:30:38,495 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2025-02-08 06:30:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-02-08 06:30:38,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-02-08 06:30:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-08 06:30:38,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-08 06:30:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:30:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:30:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2025-02-08 06:30:38,496 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2025-02-08 06:30:38,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-08 06:30:38,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-08 06:30:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:30:38,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:30:38,646 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:30:38,647 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:30:38,894 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2025-02-08 06:30:38,903 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: havoc #t~malloc13#1.base, #t~malloc13#1.offset; [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L795: assume { :begin_inline_ldv_list_add_tail } true;ldv_list_add_tail_#in~new#1.base, ldv_list_add_tail_#in~new#1.offset, ldv_list_add_tail_#in~head#1.base, ldv_list_add_tail_#in~head#1.offset := hid_register_report_~report~0#1.base, hid_register_report_~report~0#1.offset, hid_register_report_~report_enum~0#1.base, ~bvadd~32(4bv32, hid_register_report_~report_enum~0#1.offset);havoc ldv_list_add_tail_#t~mem15#1.base, ldv_list_add_tail_#t~mem15#1.offset, ldv_list_add_tail_~new#1.base, ldv_list_add_tail_~new#1.offset, ldv_list_add_tail_~head#1.base, ldv_list_add_tail_~head#1.offset;ldv_list_add_tail_~new#1.base, ldv_list_add_tail_~new#1.offset := ldv_list_add_tail_#in~new#1.base, ldv_list_add_tail_#in~new#1.offset;ldv_list_add_tail_~head#1.base, ldv_list_add_tail_~head#1.offset := ldv_list_add_tail_#in~head#1.base, ldv_list_add_tail_#in~head#1.offset; [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L795-1: SUMMARY for call write~$Pointer$#2(hid_register_report_~report~0#1.base, hid_register_report_~report~0#1.offset, hid_register_report_~report_enum~0#1.base, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1)), 4bv32); srcloc: null [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L795-1: assume !(1bv1 == #valid[hid_register_report_~report_enum~0#1.base]); [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L795-1: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1))), #length[hid_register_report_~report_enum~0#1.base]) && ~bvule~32(~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1)), ~bvadd~32(4bv32, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1))))) && ~bvule~32(0bv32, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1)))); [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L853: assume 0bv32 == probe_23_~p~1#1.base || 1bv1 == #valid[probe_23_~p~1#1.base];call ULTIMATE.dealloc(probe_23_~p~1#1.base, probe_23_~p~1#1.offset);probe_23_#res#1 := probe_23_~ret~0#1; [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L853: assume !(0bv32 == probe_23_~p~1#1.base || 1bv1 == #valid[probe_23_~p~1#1.base]); [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L853-1: assume ~bvult~32(probe_23_~p~1#1.base, #StackHeapBarrier); [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L853-1: assume !~bvult~32(probe_23_~p~1#1.base, #StackHeapBarrier); [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L853-2: assume 0bv32 == probe_23_~p~1#1.offset; [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L853-2: assume !(0bv32 == probe_23_~p~1#1.offset); [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L788: hid_register_report_~report_enum~0#1.base, hid_register_report_~report_enum~0#1.offset := hid_register_report_#t~mem46#1.base, hid_register_report_#t~mem46#1.offset;havoc hid_register_report_#t~mem46#1.base, hid_register_report_#t~mem46#1.offset;havoc hid_register_report_~report~0#1.base, hid_register_report_~report~0#1.offset; [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L788-1: SUMMARY for call hid_register_report_#t~mem46#1.base, hid_register_report_#t~mem46#1.offset := read~$Pointer$#2(hid_register_report_~device#1.base, hid_register_report_~device#1.offset, 4bv32); srcloc: null [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L788-1: assume !(1bv1 == #valid[hid_register_report_~device#1.base]); [2025-02-08 06:30:39,231 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L788-1: assume !((~bvule~32(~bvadd~32(4bv32, hid_register_report_~device#1.offset), #length[hid_register_report_~device#1.base]) && ~bvule~32(hid_register_report_~device#1.offset, ~bvadd~32(4bv32, hid_register_report_~device#1.offset))) && ~bvule~32(0bv32, hid_register_report_~device#1.offset)); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L813: call ULTIMATE.dealloc(hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset);havoc hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset; [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L830: assume 0bv32 == hid_open_report_~parser~0#1.base || 1bv1 == #valid[hid_open_report_~parser~0#1.base];call ULTIMATE.dealloc(hid_open_report_~parser~0#1.base, hid_open_report_~parser~0#1.offset);hid_open_report_#res#1 := 0bv32;call ULTIMATE.dealloc(hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset);havoc hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset; [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L830: assume !(0bv32 == hid_open_report_~parser~0#1.base || 1bv1 == #valid[hid_open_report_~parser~0#1.base]); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L830-1: assume ~bvult~32(hid_open_report_~parser~0#1.base, #StackHeapBarrier); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L830-1: assume !~bvult~32(hid_open_report_~parser~0#1.base, #StackHeapBarrier); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L830-2: assume 0bv32 == hid_open_report_~parser~0#1.offset; [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L830-2: assume !(0bv32 == hid_open_report_~parser~0#1.offset); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L781: havoc fetch_item_#t~nondet43#1; [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L781-1: SUMMARY for call write~intINTTYPE4#3(0bv32, fetch_item_~item#1.base, fetch_item_~item#1.offset, 4bv32); srcloc: null [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L781-1: assume !(1bv1 == #valid[fetch_item_~item#1.base]); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L781-1: assume !((~bvule~32(~bvadd~32(4bv32, fetch_item_~item#1.offset), #length[fetch_item_~item#1.base]) && ~bvule~32(fetch_item_~item#1.offset, ~bvadd~32(4bv32, fetch_item_~item#1.offset))) && ~bvule~32(0bv32, fetch_item_~item#1.offset)); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L790: assume hid_register_report_#t~mem47#1.base != 0bv32 || hid_register_report_#t~mem47#1.offset != 0bv32;havoc hid_register_report_#t~mem47#1.base, hid_register_report_#t~mem47#1.offset; [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L790: assume !(hid_register_report_#t~mem47#1.base != 0bv32 || hid_register_report_#t~mem47#1.offset != 0bv32);havoc hid_register_report_#t~mem47#1.base, hid_register_report_#t~mem47#1.offset; [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L790-1: SUMMARY for call hid_register_report_#t~mem47#1.base, hid_register_report_#t~mem47#1.offset := read~$Pointer$#2(hid_register_report_~report_enum~0#1.base, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1)), 4bv32); srcloc: null [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L790-1: assume !(1bv1 == #valid[hid_register_report_~report_enum~0#1.base]); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L790-1: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1))), #length[hid_register_report_~report_enum~0#1.base]) && ~bvule~32(~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1)), ~bvadd~32(4bv32, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1))))) && ~bvule~32(0bv32, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1)))); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L782: havoc fetch_item_#t~nondet43#1;havoc fetch_item_#t~nondet44#1; [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L782-1: SUMMARY for call write~intINTTYPE4#3(fetch_item_#t~nondet43#1, fetch_item_~item#1.base, ~bvadd~32(4bv32, fetch_item_~item#1.offset), 4bv32); srcloc: null [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L782-1: assume !(1bv1 == #valid[fetch_item_~item#1.base]); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L782-1: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, fetch_item_~item#1.offset)), #length[fetch_item_~item#1.base]) && ~bvule~32(~bvadd~32(4bv32, fetch_item_~item#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, fetch_item_~item#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, fetch_item_~item#1.offset))); [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L824: assume true;assume { :begin_inline_fetch_item } true;fetch_item_#in~item#1.base, fetch_item_#in~item#1.offset := hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset;havoc fetch_item_#res#1;havoc fetch_item_#t~nondet42#1, fetch_item_#t~nondet43#1, fetch_item_#t~nondet44#1, fetch_item_#t~nondet45#1, fetch_item_~item#1.base, fetch_item_~item#1.offset;fetch_item_~item#1.base, fetch_item_~item#1.offset := fetch_item_#in~item#1.base, fetch_item_#in~item#1.offset;havoc fetch_item_#t~nondet42#1; [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L824: assume !true; [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L824-1: assume 4294967295bv32 != hid_open_report_#t~ret61#1;havoc hid_open_report_#t~ret61#1; [2025-02-08 06:30:39,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L824-1: assume !(4294967295bv32 != hid_open_report_#t~ret61#1);havoc hid_open_report_#t~ret61#1; [2025-02-08 06:30:39,233 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L791-1: hid_register_report_#res#1.base, hid_register_report_#res#1.offset := hid_register_report_#t~mem48#1.base, hid_register_report_#t~mem48#1.offset;havoc hid_register_report_#t~mem48#1.base, hid_register_report_#t~mem48#1.offset; [2025-02-08 06:30:39,233 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L824-2: hid_open_report_#t~ret61#1 := fetch_item_#res#1;havoc fetch_item_#t~nondet42#1, fetch_item_#t~nondet43#1, fetch_item_#t~nondet44#1, fetch_item_#t~nondet45#1, fetch_item_~item#1.base, fetch_item_~item#1.offset;havoc fetch_item_#in~item#1.base, fetch_item_#in~item#1.offset;assume { :end_inline_fetch_item } true; [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L791-2: SUMMARY for call hid_register_report_#t~mem48#1.base, hid_register_report_#t~mem48#1.offset := read~$Pointer$#2(hid_register_report_~report_enum~0#1.base, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1)), 4bv32); srcloc: null [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L791-2: assume !(1bv1 == #valid[hid_register_report_~report_enum~0#1.base]); [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L791-2: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1))), #length[hid_register_report_~report_enum~0#1.base]) && ~bvule~32(~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1)), ~bvadd~32(4bv32, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1))))) && ~bvule~32(0bv32, ~bvadd~32(~bvadd~32(12bv32, hid_register_report_~report_enum~0#1.offset), ~bvmul~32(4bv32, hid_register_report_~id#1)))); [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L783: havoc fetch_item_#t~nondet44#1;havoc fetch_item_#t~nondet45#1; [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L783-1: SUMMARY for call write~intINTTYPE4#3(fetch_item_#t~nondet44#1, fetch_item_~item#1.base, ~bvadd~32(8bv32, fetch_item_~item#1.offset), 4bv32); srcloc: null [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L783-1: assume !(1bv1 == #valid[fetch_item_~item#1.base]); [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L783-1: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, fetch_item_~item#1.offset)), #length[fetch_item_~item#1.base]) && ~bvule~32(~bvadd~32(8bv32, fetch_item_~item#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, fetch_item_~item#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, fetch_item_~item#1.offset))); [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L833: SUMMARY for call free_reports(hid_open_report_#t~mem66#1.base, hid_open_report_#t~mem66#1.offset); srcloc: null [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L833-1: SUMMARY for call hid_open_report_#t~mem66#1.base, hid_open_report_#t~mem66#1.offset := read~$Pointer$#2(hid_open_report_~device#1.base, hid_open_report_~device#1.offset, 4bv32); srcloc: null [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L833-1: assume !(1bv1 == #valid[hid_open_report_~device#1.base]); [2025-02-08 06:30:39,234 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L833-1: assume !((~bvule~32(~bvadd~32(4bv32, hid_open_report_~device#1.offset), #length[hid_open_report_~device#1.base]) && ~bvule~32(hid_open_report_~device#1.offset, ~bvadd~32(4bv32, hid_open_report_~device#1.offset))) && ~bvule~32(0bv32, hid_open_report_~device#1.offset)); [2025-02-08 06:30:39,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L800: hid_parser_main_#t~ret52#1.base, hid_parser_main_#t~ret52#1.offset := hid_register_report_#res#1.base, hid_register_report_#res#1.offset;havoc hid_register_report_#t~mem46#1.base, hid_register_report_#t~mem46#1.offset, hid_register_report_#t~mem47#1.base, hid_register_report_#t~mem47#1.offset, hid_register_report_#t~mem48#1.base, hid_register_report_#t~mem48#1.offset, hid_register_report_#t~ret49#1.base, hid_register_report_#t~ret49#1.offset, hid_register_report_~device#1.base, hid_register_report_~device#1.offset, hid_register_report_~id#1, hid_register_report_~report_enum~0#1.base, hid_register_report_~report_enum~0#1.offset, hid_register_report_~report~0#1.base, hid_register_report_~report~0#1.offset;havoc hid_register_report_#in~device#1.base, hid_register_report_#in~device#1.offset, hid_register_report_#in~id#1;assume { :end_inline_hid_register_report } true;hid_parser_main_~report~1#1.base, hid_parser_main_~report~1#1.offset := hid_parser_main_#t~ret52#1.base, hid_parser_main_#t~ret52#1.offset;havoc hid_parser_main_#t~mem50#1.base, hid_parser_main_#t~mem50#1.offset;havoc hid_parser_main_#t~mem51#1;havoc hid_parser_main_#t~ret52#1.base, hid_parser_main_#t~ret52#1.offset;hid_parser_main_#res#1 := (if hid_parser_main_~report~1#1.base != 0bv32 || hid_parser_main_~report~1#1.offset != 0bv32 then 1bv32 else 0bv32); [2025-02-08 06:30:39,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L800-1: assume { :begin_inline_hid_register_report } true;hid_register_report_#in~device#1.base, hid_register_report_#in~device#1.offset, hid_register_report_#in~id#1 := hid_parser_main_#t~mem50#1.base, hid_parser_main_#t~mem50#1.offset, hid_parser_main_#t~mem51#1;havoc hid_register_report_#res#1.base, hid_register_report_#res#1.offset;havoc hid_register_report_#t~mem46#1.base, hid_register_report_#t~mem46#1.offset, hid_register_report_#t~mem47#1.base, hid_register_report_#t~mem47#1.offset, hid_register_report_#t~mem48#1.base, hid_register_report_#t~mem48#1.offset, hid_register_report_#t~ret49#1.base, hid_register_report_#t~ret49#1.offset, hid_register_report_~device#1.base, hid_register_report_~device#1.offset, hid_register_report_~id#1, hid_register_report_~report_enum~0#1.base, hid_register_report_~report_enum~0#1.offset, hid_register_report_~report~0#1.base, hid_register_report_~report~0#1.offset;hid_register_report_~device#1.base, hid_register_report_~device#1.offset := hid_register_report_#in~device#1.base, hid_register_report_#in~device#1.offset;hid_register_report_~id#1 := hid_register_report_#in~id#1; [2025-02-08 06:30:39,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#t~ret72#1 := hid_parser_main_#res#1;havoc hid_parser_main_#t~mem50#1.base, hid_parser_main_#t~mem50#1.offset, hid_parser_main_#t~mem51#1, hid_parser_main_#t~ret52#1.base, hid_parser_main_#t~ret52#1.offset, hid_parser_main_~parser#1.base, hid_parser_main_~parser#1.offset, hid_parser_main_~item#1.base, hid_parser_main_~item#1.offset, hid_parser_main_~report~1#1.base, hid_parser_main_~report~1#1.offset;havoc hid_parser_main_#in~parser#1.base, hid_parser_main_#in~parser#1.offset, hid_parser_main_#in~item#1.base, hid_parser_main_#in~item#1.offset;assume { :end_inline_hid_parser_main } true;##fun~$Pointer$~X~$Pointer$~TO~C_INT_#res#1 := ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#t~ret72#1;havoc ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#t~ret72#1; [2025-02-08 06:30:39,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L800-2: SUMMARY for call hid_parser_main_#t~mem51#1 := read~intINTTYPE4#2(hid_parser_main_~parser#1.base, ~bvadd~32(4bv32, hid_parser_main_~parser#1.offset), 4bv32); srcloc: null [2025-02-08 06:30:39,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L800-2: assume !(1bv1 == #valid[hid_parser_main_~parser#1.base]); [2025-02-08 06:30:39,235 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L800-2: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, hid_parser_main_~parser#1.offset)), #length[hid_parser_main_~parser#1.base]) && ~bvule~32(~bvadd~32(4bv32, hid_parser_main_~parser#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, hid_parser_main_~parser#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, hid_parser_main_~parser#1.offset))); [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L800-3: SUMMARY for call hid_parser_main_#t~mem50#1.base, hid_parser_main_#t~mem50#1.offset := read~$Pointer$#2(hid_parser_main_~parser#1.base, hid_parser_main_~parser#1.offset, 4bv32); srcloc: null [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L800-3: assume !(1bv1 == #valid[hid_parser_main_~parser#1.base]); [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L800-3: assume !((~bvule~32(~bvadd~32(4bv32, hid_parser_main_~parser#1.offset), #length[hid_parser_main_~parser#1.base]) && ~bvule~32(hid_parser_main_~parser#1.offset, ~bvadd~32(4bv32, hid_parser_main_~parser#1.offset))) && ~bvule~32(0bv32, hid_parser_main_~parser#1.offset)); [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L825: assume 0bv32 != hid_open_report_#t~ret65#1;havoc hid_open_report_#t~mem63#1;havoc hid_open_report_#t~mem64#1.base, hid_open_report_#t~mem64#1.offset;havoc hid_open_report_#t~ret65#1; [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L825: assume !(0bv32 != hid_open_report_#t~ret65#1);havoc hid_open_report_#t~mem63#1;havoc hid_open_report_#t~mem64#1.base, hid_open_report_#t~mem64#1.offset;havoc hid_open_report_#t~ret65#1; [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-1: hid_open_report_#t~ret65#1 := ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#res#1;havoc ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~parser#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~parser#1.offset, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~item#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~item#1.offset, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#t~ret72#1;havoc ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~parser#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~parser#1.offset, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~item#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~item#1.offset, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~#fp#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~#fp#1.offset;assume { :end_inline_##fun~$Pointer$~X~$Pointer$~TO~C_INT } true; [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L792: hid_register_report_~report~0#1.base, hid_register_report_~report~0#1.offset := hid_register_report_#t~ret49#1.base, hid_register_report_#t~ret49#1.offset;havoc hid_register_report_#t~ret49#1.base, hid_register_report_#t~ret49#1.offset; [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L792-1: SUMMARY for call hid_register_report_#t~ret49#1.base, hid_register_report_#t~ret49#1.offset := ldv_zalloc(8bv32); srcloc: null [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-2: assume { :begin_inline_##fun~$Pointer$~X~$Pointer$~TO~C_INT } true;##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~parser#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~parser#1.offset, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~item#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~item#1.offset, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~#fp#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~#fp#1.offset := hid_open_report_~parser~0#1.base, hid_open_report_~parser~0#1.offset, hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset, hid_open_report_#t~mem64#1.base, hid_open_report_#t~mem64#1.offset;havoc ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#res#1;havoc ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~parser#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~parser#1.offset, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~item#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~item#1.offset, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#t~ret72#1;##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~parser#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~parser#1.offset := ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~parser#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~parser#1.offset;##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~item#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~item#1.offset := ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~item#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#in~item#1.offset;assume { :begin_inline_hid_parser_main } true;hid_parser_main_#in~parser#1.base, hid_parser_main_#in~parser#1.offset, hid_parser_main_#in~item#1.base, hid_parser_main_#in~item#1.offset := ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~parser#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~parser#1.offset, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~item#1.base, ##fun~$Pointer$~X~$Pointer$~TO~C_INT_#~item#1.offset;havoc hid_parser_main_#res#1;havoc hid_parser_main_#t~mem50#1.base, hid_parser_main_#t~mem50#1.offset, hid_parser_main_#t~mem51#1, hid_parser_main_#t~ret52#1.base, hid_parser_main_#t~ret52#1.offset, hid_parser_main_~parser#1.base, hid_parser_main_~parser#1.offset, hid_parser_main_~item#1.base, hid_parser_main_~item#1.offset, hid_parser_main_~report~1#1.base, hid_parser_main_~report~1#1.offset;hid_parser_main_~parser#1.base, hid_parser_main_~parser#1.offset := hid_parser_main_#in~parser#1.base, hid_parser_main_#in~parser#1.offset;hid_parser_main_~item#1.base, hid_parser_main_~item#1.offset := hid_parser_main_#in~item#1.base, hid_parser_main_#in~item#1.offset; [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-3: SUMMARY for call hid_open_report_#t~mem64#1.base, hid_open_report_#t~mem64#1.offset := read~$Pointer$#1(~#dispatch_type~0.base, ~bvadd~32(~#dispatch_type~0.offset, ~bvmul~32(4bv32, hid_open_report_#t~mem63#1)), 4bv32); srcloc: null [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-3: assume !(1bv1 == #valid[~#dispatch_type~0.base]); [2025-02-08 06:30:39,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-3: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(~#dispatch_type~0.offset, ~bvmul~32(4bv32, hid_open_report_#t~mem63#1))), #length[~#dispatch_type~0.base]) && ~bvule~32(~bvadd~32(~#dispatch_type~0.offset, ~bvmul~32(4bv32, hid_open_report_#t~mem63#1)), ~bvadd~32(4bv32, ~bvadd~32(~#dispatch_type~0.offset, ~bvmul~32(4bv32, hid_open_report_#t~mem63#1))))) && ~bvule~32(0bv32, ~bvadd~32(~#dispatch_type~0.offset, ~bvmul~32(4bv32, hid_open_report_#t~mem63#1)))); [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-4: SUMMARY for call hid_open_report_#t~mem63#1 := read~intINTTYPE4#3(hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset, 4bv32); srcloc: null [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-4: assume !(1bv1 == #valid[hid_open_report_~#item~0#1.base]); [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-4: assume !((~bvule~32(~bvadd~32(4bv32, hid_open_report_~#item~0#1.offset), #length[hid_open_report_~#item~0#1.base]) && ~bvule~32(hid_open_report_~#item~0#1.offset, ~bvadd~32(4bv32, hid_open_report_~#item~0#1.offset))) && ~bvule~32(0bv32, hid_open_report_~#item~0#1.offset)); [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L784: havoc fetch_item_#t~nondet45#1;fetch_item_#res#1 := 0bv32; [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L784-1: SUMMARY for call write~intINTTYPE4#3(fetch_item_#t~nondet45#1, fetch_item_~item#1.base, ~bvadd~32(12bv32, fetch_item_~item#1.offset), 4bv32); srcloc: null [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L784-1: assume !(1bv1 == #valid[fetch_item_~item#1.base]); [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L784-1: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(12bv32, fetch_item_~item#1.offset)), #length[fetch_item_~item#1.base]) && ~bvule~32(~bvadd~32(12bv32, fetch_item_~item#1.offset), ~bvadd~32(4bv32, ~bvadd~32(12bv32, fetch_item_~item#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(12bv32, fetch_item_~item#1.offset))); [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L834: assume 0bv32 == hid_open_report_~parser~0#1.base || 1bv1 == #valid[hid_open_report_~parser~0#1.base];call ULTIMATE.dealloc(hid_open_report_~parser~0#1.base, hid_open_report_~parser~0#1.offset);hid_open_report_#res#1 := 4294967295bv32;call ULTIMATE.dealloc(hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset);havoc hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset; [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L834: assume !(0bv32 == hid_open_report_~parser~0#1.base || 1bv1 == #valid[hid_open_report_~parser~0#1.base]); [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L834-1: assume ~bvult~32(hid_open_report_~parser~0#1.base, #StackHeapBarrier); [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L834-1: assume !~bvult~32(hid_open_report_~parser~0#1.base, #StackHeapBarrier); [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L834-2: assume 0bv32 == hid_open_report_~parser~0#1.offset; [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L834-2: assume !(0bv32 == hid_open_report_~parser~0#1.offset); [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L793: assume hid_register_report_~report~0#1.base == 0bv32 && hid_register_report_~report~0#1.offset == 0bv32;hid_register_report_#res#1.base, hid_register_report_#res#1.offset := 0bv32, 0bv32; [2025-02-08 06:30:39,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L793: assume !(hid_register_report_~report~0#1.base == 0bv32 && hid_register_report_~report~0#1.offset == 0bv32); [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc ldv_list_add_tail_#t~mem15#1.base, ldv_list_add_tail_#t~mem15#1.offset;havoc ldv_list_add_tail_#t~mem15#1.base, ldv_list_add_tail_#t~mem15#1.offset, ldv_list_add_tail_~new#1.base, ldv_list_add_tail_~new#1.offset, ldv_list_add_tail_~head#1.base, ldv_list_add_tail_~head#1.offset;havoc ldv_list_add_tail_#in~new#1.base, ldv_list_add_tail_#in~new#1.offset, ldv_list_add_tail_#in~head#1.base, ldv_list_add_tail_#in~head#1.offset;assume { :end_inline_ldv_list_add_tail } true;hid_register_report_#res#1.base, hid_register_report_#res#1.offset := hid_register_report_~report~0#1.base, hid_register_report_~report~0#1.offset; [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L819: havoc hid_open_report_#t~ret60#1;havoc hid_open_report_#t~ret60#1; [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-1: SUMMARY for call __ldv_list_add(ldv_list_add_tail_~new#1.base, ldv_list_add_tail_~new#1.offset, ldv_list_add_tail_#t~mem15#1.base, ldv_list_add_tail_#t~mem15#1.offset, ldv_list_add_tail_~head#1.base, ldv_list_add_tail_~head#1.offset); srcloc: null [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L819-1: SUMMARY for call write~intINTTYPE4#2(hid_open_report_#t~ret60#1, hid_open_report_~parser~0#1.base, ~bvadd~32(4bv32, hid_open_report_~parser~0#1.offset), 4bv32); srcloc: null [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L819-1: assume !(1bv1 == #valid[hid_open_report_~parser~0#1.base]); [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L819-1: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, hid_open_report_~parser~0#1.offset)), #length[hid_open_report_~parser~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, hid_open_report_~parser~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, hid_open_report_~parser~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, hid_open_report_~parser~0#1.offset))); [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-2: SUMMARY for call ldv_list_add_tail_#t~mem15#1.base, ldv_list_add_tail_#t~mem15#1.offset := read~$Pointer$#2(ldv_list_add_tail_~head#1.base, ~bvadd~32(4bv32, ldv_list_add_tail_~head#1.offset), 4bv32); srcloc: null [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-2: assume !(1bv1 == #valid[ldv_list_add_tail_~head#1.base]); [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-2: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, ldv_list_add_tail_~head#1.offset)), #length[ldv_list_add_tail_~head#1.base]) && ~bvule~32(~bvadd~32(4bv32, ldv_list_add_tail_~head#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, ldv_list_add_tail_~head#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, ldv_list_add_tail_~head#1.offset))); [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L819-2: hid_open_report_#t~ret60#1 := ldv_positive_#res#1;havoc ldv_positive_#t~nondet4#1, ldv_positive_~r~1#1;assume { :end_inline_ldv_positive } true; [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L778: assume 0bv32 != fetch_item_#t~nondet42#1;havoc fetch_item_#t~nondet42#1;fetch_item_#res#1 := 4294967295bv32; [2025-02-08 06:30:39,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L778: assume !(0bv32 != fetch_item_#t~nondet42#1);havoc fetch_item_#t~nondet42#1; [2025-02-08 06:30:39,260 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-08 06:30:39,260 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:30:39,271 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:30:39,271 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:30:39,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:30:39 BoogieIcfgContainer [2025-02-08 06:30:39,272 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:30:39,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:30:39,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:30:39,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:30:39,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:30:37" (1/3) ... [2025-02-08 06:30:39,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7e9f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:30:39, skipping insertion in model container [2025-02-08 06:30:39,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:30:38" (2/3) ... [2025-02-08 06:30:39,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7e9f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:30:39, skipping insertion in model container [2025-02-08 06:30:39,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:30:39" (3/3) ... [2025-02-08 06:30:39,278 INFO L128 eAbstractionObserver]: Analyzing ICFG memleaks_test23_2.i [2025-02-08 06:30:39,289 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:30:39,290 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG memleaks_test23_2.i that has 7 procedures, 113 locations, 1 initial locations, 2 loop locations, and 80 error locations. [2025-02-08 06:30:39,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:30:39,323 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;@5c75e5dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:30:39,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2025-02-08 06:30:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 87 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:30:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:30:39,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:39,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:39,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:39,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash -158378764, now seen corresponding path program 1 times [2025-02-08 06:30:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:39,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164332510] [2025-02-08 06:30:39,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:39,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:39,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:39,343 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 06:30:39,344 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 06:30:39,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:30:39,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:30:39,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:39,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:39,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 06:30:39,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:39,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-02-08 06:30:39,560 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 06:30:39,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:39,560 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:39,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164332510] [2025-02-08 06:30:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164332510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:39,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:39,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:30:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091159932] [2025-02-08 06:30:39,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:39,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:30:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:39,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:30:39,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:30:39,587 INFO L87 Difference]: Start difference. First operand has 98 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 87 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:39,862 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2025-02-08 06:30:39,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:30:39,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 06:30:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:39,867 INFO L225 Difference]: With dead ends: 112 [2025-02-08 06:30:39,868 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 06:30:39,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:30:39,871 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 9 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:39,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 370 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:30:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 06:30:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2025-02-08 06:30:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 88 states have internal predecessors, (94), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 06:30:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2025-02-08 06:30:39,896 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 11 [2025-02-08 06:30:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:39,896 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2025-02-08 06:30:39,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2025-02-08 06:30:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:30:39,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:39,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:39,903 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 06:30:40,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:40,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:40,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:40,101 INFO L85 PathProgramCache]: Analyzing trace with hash -158378763, now seen corresponding path program 1 times [2025-02-08 06:30:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:40,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429142274] [2025-02-08 06:30:40,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:40,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:40,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:40,104 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 06:30:40,105 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 06:30:40,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:30:40,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:30:40,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:40,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:40,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 06:30:40,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:40,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:30:40,273 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 06:30:40,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:40,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:40,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429142274] [2025-02-08 06:30:40,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429142274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:40,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:40,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:30:40,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69552523] [2025-02-08 06:30:40,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:40,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:30:40,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:40,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:30:40,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:30:40,276 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:40,540 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2025-02-08 06:30:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:30:40,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 06:30:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:40,542 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:30:40,542 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:30:40,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:30:40,542 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:40,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 453 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:30:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:30:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2025-02-08 06:30:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 88 states have internal predecessors, (92), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 06:30:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2025-02-08 06:30:40,548 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 11 [2025-02-08 06:30:40,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:40,548 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2025-02-08 06:30:40,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2025-02-08 06:30:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:30:40,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:40,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:40,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:30:40,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:40,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:40,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1584431571, now seen corresponding path program 1 times [2025-02-08 06:30:40,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:40,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135711216] [2025-02-08 06:30:40,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:40,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:40,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:40,751 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 06:30:40,753 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 06:30:40,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:30:40,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:30:40,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:40,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:40,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 06:30:40,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:40,867 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 06:30:40,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:40,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135711216] [2025-02-08 06:30:40,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135711216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:40,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:40,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:30:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184044535] [2025-02-08 06:30:40,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:40,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:30:40,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:40,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:30:40,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:40,868 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:40,897 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2025-02-08 06:30:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:30:40,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 06:30:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:40,900 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:30:40,900 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:30:40,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:40,900 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:40,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:30:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:30:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 06:30:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 80 states have internal predecessors, (84), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:30:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2025-02-08 06:30:40,910 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 11 [2025-02-08 06:30:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:40,910 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2025-02-08 06:30:40,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2025-02-08 06:30:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:30:40,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:40,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:40,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:30:41,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:41,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:41,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash -158547549, now seen corresponding path program 1 times [2025-02-08 06:30:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:41,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026540226] [2025-02-08 06:30:41,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:41,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:41,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:41,114 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 06:30:41,115 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 06:30:41,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:30:41,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:30:41,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:41,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:41,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:30:41,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:41,205 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 06:30:41,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:41,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:41,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026540226] [2025-02-08 06:30:41,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026540226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:41,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:41,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:30:41,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794715632] [2025-02-08 06:30:41,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:41,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:30:41,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:41,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:30:41,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:41,206 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:41,223 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2025-02-08 06:30:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:30:41,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 06:30:41,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:41,224 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:30:41,224 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:30:41,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:41,225 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:41,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 342 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:30:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:30:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 06:30:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 80 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:30:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2025-02-08 06:30:41,236 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 11 [2025-02-08 06:30:41,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:41,238 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2025-02-08 06:30:41,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2025-02-08 06:30:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:30:41,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:41,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:41,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:30:41,439 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 [2025-02-08 06:30:41,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:41,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:41,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1584262786, now seen corresponding path program 1 times [2025-02-08 06:30:41,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:41,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819140157] [2025-02-08 06:30:41,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:41,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:41,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:41,442 INFO L229 MonitoredProcess]: Starting monitored process 6 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 06:30:41,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:30:41,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:30:41,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:30:41,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:41,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:41,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:30:41,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:41,520 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 06:30:41,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:41,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:41,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819140157] [2025-02-08 06:30:41,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819140157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:41,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:41,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:30:41,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144116915] [2025-02-08 06:30:41,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:41,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:30:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:41,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:30:41,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:41,521 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:41,543 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2025-02-08 06:30:41,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:30:41,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 06:30:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:41,545 INFO L225 Difference]: With dead ends: 94 [2025-02-08 06:30:41,546 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 06:30:41,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:41,546 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:41,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 330 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:30:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 06:30:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-08 06:30:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 82 states have internal predecessors, (85), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:30:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2025-02-08 06:30:41,552 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 11 [2025-02-08 06:30:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:41,553 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2025-02-08 06:30:41,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2025-02-08 06:30:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:30:41,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:41,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:41,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:30:41,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:41,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:41,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1867506738, now seen corresponding path program 1 times [2025-02-08 06:30:41,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:41,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616199404] [2025-02-08 06:30:41,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:41,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:41,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:41,757 INFO L229 MonitoredProcess]: Starting monitored process 7 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 06:30:41,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:30:41,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:30:41,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:30:41,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:41,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:41,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:30:41,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:41,825 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 06:30:41,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:41,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616199404] [2025-02-08 06:30:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616199404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:41,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:30:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406920275] [2025-02-08 06:30:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:41,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:30:41,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:41,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:30:41,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:30:41,826 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:41,937 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2025-02-08 06:30:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:30:41,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 06:30:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:41,939 INFO L225 Difference]: With dead ends: 106 [2025-02-08 06:30:41,940 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:30:41,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:30:41,940 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:41,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 140 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:30:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:30:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2025-02-08 06:30:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 77 states have internal predecessors, (79), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:30:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2025-02-08 06:30:41,946 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 12 [2025-02-08 06:30:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:41,946 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2025-02-08 06:30:41,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:30:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2025-02-08 06:30:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:30:41,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:41,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:41,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:30:42,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:42,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:42,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1002952727, now seen corresponding path program 1 times [2025-02-08 06:30:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:42,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716912941] [2025-02-08 06:30:42,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:42,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:42,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:42,149 INFO L229 MonitoredProcess]: Starting monitored process 8 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 06:30:42,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:30:42,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:30:42,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:30:42,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:42,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:42,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 06:30:42,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:42,306 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-02-08 06:30:42,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-02-08 06:30:42,337 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 06:30:42,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:42,338 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716912941] [2025-02-08 06:30:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716912941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:42,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:30:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458130710] [2025-02-08 06:30:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:42,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:30:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:42,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:30:42,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:30:42,339 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:30:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:42,596 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2025-02-08 06:30:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:30:42,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-02-08 06:30:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:42,597 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:30:42,597 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:30:42,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:30:42,599 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 48 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:42,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 174 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:30:42,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:30:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2025-02-08 06:30:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 76 states have internal predecessors, (78), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:30:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2025-02-08 06:30:42,602 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 15 [2025-02-08 06:30:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:42,602 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2025-02-08 06:30:42,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:30:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2025-02-08 06:30:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:30:42,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:42,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:42,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 06:30:42,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:42,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:42,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1002952726, now seen corresponding path program 1 times [2025-02-08 06:30:42,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:42,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116798968] [2025-02-08 06:30:42,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:42,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:42,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:42,809 INFO L229 MonitoredProcess]: Starting monitored process 9 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 06:30:42,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:30:42,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:30:42,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:30:42,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:42,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:42,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 06:30:42,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:42,926 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2025-02-08 06:30:42,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:30:42,969 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 06:30:43,010 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 06:30:43,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:43,010 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:43,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116798968] [2025-02-08 06:30:43,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116798968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:43,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:43,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:30:43,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171779205] [2025-02-08 06:30:43,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:43,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:30:43,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:43,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:30:43,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2025-02-08 06:30:43,011 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:30:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:43,216 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2025-02-08 06:30:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:30:43,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-02-08 06:30:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:43,217 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:30:43,217 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 06:30:43,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=27, Unknown=1, NotChecked=10, Total=56 [2025-02-08 06:30:43,217 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:43,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 103 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 196 Invalid, 0 Unknown, 104 Unchecked, 0.2s Time] [2025-02-08 06:30:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 06:30:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2025-02-08 06:30:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 75 states have internal predecessors, (77), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:30:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2025-02-08 06:30:43,220 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 15 [2025-02-08 06:30:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:43,220 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2025-02-08 06:30:43,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:30:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2025-02-08 06:30:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:30:43,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:43,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:43,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 06:30:43,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:43,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:43,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash -464951486, now seen corresponding path program 1 times [2025-02-08 06:30:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31532374] [2025-02-08 06:30:43,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:43,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:43,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:43,426 INFO L229 MonitoredProcess]: Starting monitored process 10 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 06:30:43,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:30:43,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:30:43,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:30:43,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:43,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:43,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:30:43,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:43,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-02-08 06:30:43,544 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 06:30:43,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:43,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:43,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31532374] [2025-02-08 06:30:43,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31532374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:43,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:43,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:30:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842231065] [2025-02-08 06:30:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:43,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:30:43,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:43,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:30:43,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:43,545 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:30:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:43,642 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2025-02-08 06:30:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:30:43,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-02-08 06:30:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:43,642 INFO L225 Difference]: With dead ends: 85 [2025-02-08 06:30:43,642 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 06:30:43,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:43,643 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:43,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:30:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 06:30:43,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-08 06:30:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:30:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2025-02-08 06:30:43,645 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 23 [2025-02-08 06:30:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:43,645 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2025-02-08 06:30:43,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:30:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2025-02-08 06:30:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:30:43,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:43,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:43,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 06:30:43,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:43,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:43,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -464951485, now seen corresponding path program 1 times [2025-02-08 06:30:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503597261] [2025-02-08 06:30:43,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:43,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:43,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:43,852 INFO L229 MonitoredProcess]: Starting monitored process 11 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 06:30:43,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:30:43,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:30:43,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:30:43,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:43,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:43,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 06:30:43,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:43,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:30:43,977 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 06:30:43,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:43,977 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:43,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503597261] [2025-02-08 06:30:43,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503597261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:43,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:43,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:30:43,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877155750] [2025-02-08 06:30:43,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:43,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:30:43,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:43,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:30:43,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:43,978 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:30:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:44,085 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2025-02-08 06:30:44,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:30:44,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-02-08 06:30:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:44,086 INFO L225 Difference]: With dead ends: 84 [2025-02-08 06:30:44,086 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 06:30:44,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:44,086 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:44,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:30:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 06:30:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-08 06:30:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:30:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2025-02-08 06:30:44,089 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 23 [2025-02-08 06:30:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:44,089 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2025-02-08 06:30:44,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:30:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2025-02-08 06:30:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:30:44,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:30:44,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:44,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 06:30:44,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:44,290 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 77 more)] === [2025-02-08 06:30:44,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:30:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1064733001, now seen corresponding path program 1 times [2025-02-08 06:30:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:30:44,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1183961237] [2025-02-08 06:30:44,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:30:44,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:44,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:30:44,293 INFO L229 MonitoredProcess]: Starting monitored process 12 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 06:30:44,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:30:44,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:30:44,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:30:44,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:30:44,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:30:44,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:30:44,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:30:44,384 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 06:30:44,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:30:44,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:30:44,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183961237] [2025-02-08 06:30:44,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183961237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:30:44,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:30:44,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:30:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003047952] [2025-02-08 06:30:44,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:30:44,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:30:44,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:30:44,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:30:44,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:44,385 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:30:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:30:44,390 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2025-02-08 06:30:44,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:30:44,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-08 06:30:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:30:44,390 INFO L225 Difference]: With dead ends: 22 [2025-02-08 06:30:44,390 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:30:44,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:30:44,391 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:30:44,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:30:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:30:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:30:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 06:30:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:30:44,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2025-02-08 06:30:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:30:44,391 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:30:44,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:30:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:30:44,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:30:44,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (77 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location free_reportsErr3ASSERT_VIOLATIONMEMORY_FREE (76 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location free_reportsErr4ASSERT_VIOLATIONMEMORY_FREE (75 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location free_reportsErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location free_reportsErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location free_reportsErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location free_reportsErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_list_delErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_list_delErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __ldv_list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2025-02-08 06:30:44,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (50 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (49 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (48 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (47 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (42 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (41 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (40 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (39 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (38 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (37 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (34 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (33 of 80 remaining) [2025-02-08 06:30:44,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (32 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2025-02-08 06:30:44,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2025-02-08 06:30:44,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2025-02-08 06:30:44,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2025-02-08 06:30:44,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2025-02-08 06:30:44,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2025-02-08 06:30:44,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2025-02-08 06:30:44,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2025-02-08 06:30:44,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2025-02-08 06:30:44,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 80 remaining) [2025-02-08 06:30:44,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:30:44,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:30:44,600 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:30:44,601 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:30:44,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:30:44 BoogieIcfgContainer [2025-02-08 06:30:44,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:30:44,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:30:44,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:30:44,604 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:30:44,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:30:39" (3/4) ... [2025-02-08 06:30:44,606 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:30:44,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-02-08 06:30:44,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2025-02-08 06:30:44,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure free_reports [2025-02-08 06:30:44,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2025-02-08 06:30:44,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2025-02-08 06:30:44,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2025-02-08 06:30:44,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-02-08 06:30:44,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 06:30:44,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 06:30:44,680 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:30:44,680 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:30:44,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:30:44,681 INFO L158 Benchmark]: Toolchain (without parser) took 6831.50ms. Allocated memory is still 117.4MB. Free memory was 89.0MB in the beginning and 57.6MB in the end (delta: 31.4MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2025-02-08 06:30:44,681 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 83.9MB. Free memory was 60.7MB in the beginning and 60.7MB in the end (delta: 18.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:30:44,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.85ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 58.2MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 06:30:44,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.01ms. Allocated memory is still 117.4MB. Free memory was 58.2MB in the beginning and 55.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:30:44,682 INFO L158 Benchmark]: Boogie Preprocessor took 76.76ms. Allocated memory is still 117.4MB. Free memory was 55.5MB in the beginning and 50.3MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:30:44,682 INFO L158 Benchmark]: IcfgBuilder took 827.48ms. Allocated memory is still 117.4MB. Free memory was 50.2MB in the beginning and 46.4MB in the end (delta: 3.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-02-08 06:30:44,682 INFO L158 Benchmark]: TraceAbstraction took 5330.05ms. Allocated memory is still 117.4MB. Free memory was 45.8MB in the beginning and 64.9MB in the end (delta: -19.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:30:44,682 INFO L158 Benchmark]: Witness Printer took 76.61ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 57.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:30:44,683 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.38ms. Allocated memory is still 83.9MB. Free memory was 60.7MB in the beginning and 60.7MB in the end (delta: 18.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.85ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 58.2MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.01ms. Allocated memory is still 117.4MB. Free memory was 58.2MB in the beginning and 55.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.76ms. Allocated memory is still 117.4MB. Free memory was 55.5MB in the beginning and 50.3MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 827.48ms. Allocated memory is still 117.4MB. Free memory was 50.2MB in the beginning and 46.4MB in the end (delta: 3.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5330.05ms. Allocated memory is still 117.4MB. Free memory was 45.8MB in the beginning and 64.9MB in the end (delta: -19.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 76.61ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 57.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 808]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 808]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 808]: free always succeeds For all program executions holds that free 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: 866]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 839]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 839]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 839]: free always succeeds For all program executions holds that free 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: 853]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 853]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 853]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 834]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 834]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 834]: free always succeeds For all program executions holds that free 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: 830]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 830]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 830]: free always succeeds For all program executions holds that free 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 113 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 2823 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 104 IncrementalHoareTripleChecker+Unchecked, 2041 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1188 IncrementalHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 782 mSDtfsCounter, 1188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=1, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 38 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 159 ConstructedInterpolants, 4 QuantifiedInterpolants, 643 SizeOfPredicates, 8 NumberOfNonLiveVariables, 978 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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 80 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:30:44,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE