./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:01:16,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:01:16,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-06 10:01:16,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:01:16,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:01:16,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:01:16,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:01:16,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:01:16,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:01:16,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:01:16,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:01:16,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:01:16,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:01:16,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:01:16,904 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:01:16,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:01:16,905 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:01:16,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:01:16,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 10:01:16,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:01:16,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:01:16,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:01:16,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:01:16,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:01:16,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:01:16,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:01:16,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:01:16,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:01:16,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:01:16,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:01:16,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:01:16,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:01:16,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:01:16,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:01:16,907 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-memcleanup) ) 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 -> f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 [2025-02-06 10:01:17,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:01:17,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:01:17,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:01:17,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:01:17,149 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:01:17,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2025-02-06 10:01:18,316 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/993c44e9c/5b1b7c1b6d864a778a2ca24be2325160/FLAG304e81abe [2025-02-06 10:01:18,671 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:01:18,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2025-02-06 10:01:18,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/993c44e9c/5b1b7c1b6d864a778a2ca24be2325160/FLAG304e81abe [2025-02-06 10:01:18,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/993c44e9c/5b1b7c1b6d864a778a2ca24be2325160 [2025-02-06 10:01:18,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:01:18,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:01:18,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:01:18,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:01:18,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:01:18,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:01:18" (1/1) ... [2025-02-06 10:01:18,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eaa85da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:18, skipping insertion in model container [2025-02-06 10:01:18,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:01:18" (1/1) ... [2025-02-06 10:01:18,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:01:19,038 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-06 10:01:19,066 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-06 10:01:19,069 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-06 10:01:19,071 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-06 10:01:19,077 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-06 10:01:19,108 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-06 10:01:19,109 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-06 10:01:19,110 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-06 10:01:19,110 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-06 10:01:19,112 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-06 10:01:19,114 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-06 10:01:19,114 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-06 10:01:19,115 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-06 10:01:19,117 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-06 10:01:19,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:01:19,130 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-06 10:01:19,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@45f279d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:19, skipping insertion in model container [2025-02-06 10:01:19,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:01:19,134 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-02-06 10:01:19,135 INFO L158 Benchmark]: Toolchain (without parser) took 430.33ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 84.6MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:01:19,136 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:01:19,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.60ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 84.6MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:01:19,137 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.29ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.60ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 84.6MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 747]: 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/uthash-2.0.2/uthash_SFH_test3-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:01:20,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:01:20,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-02-06 10:01:20,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:01:20,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:01:20,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:01:20,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:01:20,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:01:20,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:01:20,960 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:01:20,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:01:20,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:01:20,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:01:20,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:01:20,960 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:01:20,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:01:20,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:01:20,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:01:20,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:01:20,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:01:20,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:01:20,963 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 10:01:20,963 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 10:01:20,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:01:20,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:01:20,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:01:20,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:01:20,963 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-memcleanup) ) 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 -> f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 [2025-02-06 10:01:21,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:01:21,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:01:21,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:01:21,195 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:01:21,195 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:01:21,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2025-02-06 10:01:22,344 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24e61febc/b5d02b7fd30e46b1a2ee6e0309d84023/FLAG9383ca4a8 [2025-02-06 10:01:22,625 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:01:22,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2025-02-06 10:01:22,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24e61febc/b5d02b7fd30e46b1a2ee6e0309d84023/FLAG9383ca4a8 [2025-02-06 10:01:22,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24e61febc/b5d02b7fd30e46b1a2ee6e0309d84023 [2025-02-06 10:01:22,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:01:22,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:01:22,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:01:22,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:01:22,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:01:22,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:01:22" (1/1) ... [2025-02-06 10:01:22,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73676a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:22, skipping insertion in model container [2025-02-06 10:01:22,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:01:22" (1/1) ... [2025-02-06 10:01:22,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:01:23,187 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-06 10:01:23,212 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-06 10:01:23,217 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-06 10:01:23,220 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-06 10:01:23,233 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-06 10:01:23,267 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-06 10:01:23,267 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-06 10:01:23,268 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-06 10:01:23,269 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-06 10:01:23,275 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-06 10:01:23,278 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-06 10:01:23,279 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-06 10:01:23,279 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-06 10:01:23,284 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-06 10:01:23,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:01:23,308 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-02-06 10:01:23,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:01:23,334 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-06 10:01:23,348 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-06 10:01:23,349 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-06 10:01:23,353 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-06 10:01:23,357 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-06 10:01:23,384 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-06 10:01:23,385 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-06 10:01:23,386 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-06 10:01:23,386 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-06 10:01:23,387 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-06 10:01:23,388 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-06 10:01:23,388 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-06 10:01:23,392 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-06 10:01:23,397 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-06 10:01:23,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:01:23,402 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:01:23,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:01:23,528 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:01:23,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23 WrapperNode [2025-02-06 10:01:23,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:01:23,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:01:23,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:01:23,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:01:23,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,587 INFO L138 Inliner]: procedures = 180, calls = 279, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1005 [2025-02-06 10:01:23,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:01:23,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:01:23,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:01:23,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:01:23,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,657 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 219, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-02-06 10:01:23,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:01:23,739 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:01:23,739 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:01:23,739 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:01:23,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (1/1) ... [2025-02-06 10:01:23,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:01:23,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:23,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:01:23,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:01:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 10:01:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 10:01:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 10:01:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 10:01:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 10:01:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 10:01:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 10:01:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 10:01:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 10:01:23,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 10:01:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 10:01:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 10:01:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 10:01:23,793 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 10:01:23,793 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 10:01:23,793 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 10:01:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 10:01:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:01:23,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:01:23,980 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:01:23,981 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:01:31,331 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 10:01:31,402 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-02-06 10:01:31,402 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:01:31,415 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:01:31,417 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:01:31,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:01:31 BoogieIcfgContainer [2025-02-06 10:01:31,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:01:31,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:01:31,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:01:31,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:01:31,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:01:22" (1/3) ... [2025-02-06 10:01:31,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b759c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:01:31, skipping insertion in model container [2025-02-06 10:01:31,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:01:23" (2/3) ... [2025-02-06 10:01:31,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b759c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:01:31, skipping insertion in model container [2025-02-06 10:01:31,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:01:31" (3/3) ... [2025-02-06 10:01:31,430 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test3-1.i [2025-02-06 10:01:31,445 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:01:31,446 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test3-1.i that has 6 procedures, 216 locations, 1 initial locations, 38 loop locations, and 2 error locations. [2025-02-06 10:01:31,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:01:31,504 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;@62ab10da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:01:31,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 10:01:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 192 states have (on average 1.65625) internal successors, (318), 201 states have internal predecessors, (318), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 10:01:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:01:31,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:31,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:31,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:31,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash -669185383, now seen corresponding path program 1 times [2025-02-06 10:01:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:31,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1681459431] [2025-02-06 10:01:31,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:01:31,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:31,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:31,546 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-06 10:01:31,547 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-06 10:01:31,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:01:31,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:01:31,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:01:31,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:31,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 10:01:31,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:01:31,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:01:31,709 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:31,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681459431] [2025-02-06 10:01:31,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681459431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:01:31,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:01:31,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:01:31,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11446589] [2025-02-06 10:01:31,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:01:31,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:01:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:31,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:01:31,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:01:31,735 INFO L87 Difference]: Start difference. First operand has 208 states, 192 states have (on average 1.65625) internal successors, (318), 201 states have internal predecessors, (318), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:01:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:01:31,756 INFO L93 Difference]: Finished difference Result 206 states and 271 transitions. [2025-02-06 10:01:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:01:31,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2025-02-06 10:01:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:01:31,763 INFO L225 Difference]: With dead ends: 206 [2025-02-06 10:01:31,763 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 10:01:31,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:01:31,766 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:01:31,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:01:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 10:01:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-06 10:01:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 190 states have (on average 1.3210526315789475) internal successors, (251), 197 states have internal predecessors, (251), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 10:01:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 269 transitions. [2025-02-06 10:01:31,819 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 269 transitions. Word has length 8 [2025-02-06 10:01:31,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:01:31,819 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 269 transitions. [2025-02-06 10:01:31,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:01:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 269 transitions. [2025-02-06 10:01:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:01:31,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:31,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:31,827 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-06 10:01:32,021 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-06 10:01:32,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:32,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash -579943541, now seen corresponding path program 1 times [2025-02-06 10:01:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:32,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670447649] [2025-02-06 10:01:32,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:01:32,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:32,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:32,025 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-06 10:01:32,026 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-06 10:01:32,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:01:32,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:01:32,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:01:32,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:32,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:01:32,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:32,242 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:01:32,242 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:01:32,243 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:01:32,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-02-06 10:01:32,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:01:32,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-02-06 10:01:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:01:32,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:01:32,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670447649] [2025-02-06 10:01:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670447649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:01:32,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:01:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:01:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395934040] [2025-02-06 10:01:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:01:32,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:01:32,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:32,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:01:32,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:01:32,381 INFO L87 Difference]: Start difference. First operand 204 states and 269 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:01:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:01:32,990 INFO L93 Difference]: Finished difference Result 391 states and 522 transitions. [2025-02-06 10:01:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:01:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2025-02-06 10:01:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:01:32,994 INFO L225 Difference]: With dead ends: 391 [2025-02-06 10:01:32,994 INFO L226 Difference]: Without dead ends: 391 [2025-02-06 10:01:32,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:01:32,995 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 233 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:01:32,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 739 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:01:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-06 10:01:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 206. [2025-02-06 10:01:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 192 states have (on average 1.3177083333333333) internal successors, (253), 199 states have internal predecessors, (253), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 10:01:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 271 transitions. [2025-02-06 10:01:33,014 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 271 transitions. Word has length 10 [2025-02-06 10:01:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:01:33,015 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 271 transitions. [2025-02-06 10:01:33,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:01:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 271 transitions. [2025-02-06 10:01:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 10:01:33,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:33,017 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:33,024 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-06 10:01:33,218 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-06 10:01:33,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:33,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash 910323505, now seen corresponding path program 1 times [2025-02-06 10:01:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:33,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650432917] [2025-02-06 10:01:33,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:01:33,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:33,223 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-06 10:01:33,224 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-06 10:01:33,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:01:33,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:01:33,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:01:33,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:33,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 10:01:33,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:01:33,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:01:33,943 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:33,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650432917] [2025-02-06 10:01:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650432917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:01:33,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:01:33,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:01:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680509830] [2025-02-06 10:01:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:01:33,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:01:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:33,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:01:33,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:01:33,945 INFO L87 Difference]: Start difference. First operand 206 states and 271 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:01:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:01:34,491 INFO L93 Difference]: Finished difference Result 312 states and 411 transitions. [2025-02-06 10:01:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:01:34,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) Word has length 65 [2025-02-06 10:01:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:01:34,498 INFO L225 Difference]: With dead ends: 312 [2025-02-06 10:01:34,498 INFO L226 Difference]: Without dead ends: 312 [2025-02-06 10:01:34,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:01:34,499 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 100 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:01:34,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 555 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:01:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-06 10:01:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2025-02-06 10:01:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 295 states have (on average 1.3220338983050848) internal successors, (390), 302 states have internal predecessors, (390), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 10:01:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 408 transitions. [2025-02-06 10:01:34,509 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 408 transitions. Word has length 65 [2025-02-06 10:01:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:01:34,509 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 408 transitions. [2025-02-06 10:01:34,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:01:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 408 transitions. [2025-02-06 10:01:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 10:01:34,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:34,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:34,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:01:34,712 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-06 10:01:34,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:34,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:34,713 INFO L85 PathProgramCache]: Analyzing trace with hash -180930756, now seen corresponding path program 1 times [2025-02-06 10:01:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924972341] [2025-02-06 10:01:34,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:01:34,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:34,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:34,716 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-06 10:01:34,717 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-06 10:01:34,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 10:01:34,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 10:01:34,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:01:34,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:35,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:01:35,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:01:35,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:01:35,188 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:35,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924972341] [2025-02-06 10:01:35,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924972341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:01:35,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:01:35,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:01:35,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346589972] [2025-02-06 10:01:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:01:35,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:01:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:35,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:01:35,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:01:35,189 INFO L87 Difference]: Start difference. First operand 309 states and 408 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:01:39,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:01:43,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:01:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:01:46,011 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2025-02-06 10:01:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:01:46,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2025-02-06 10:01:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:01:46,015 INFO L225 Difference]: With dead ends: 407 [2025-02-06 10:01:46,015 INFO L226 Difference]: Without dead ends: 407 [2025-02-06 10:01:46,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:01:46,015 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 490 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:01:46,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 501 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 2 Unknown, 0 Unchecked, 10.8s Time] [2025-02-06 10:01:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-06 10:01:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 393. [2025-02-06 10:01:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 379 states have (on average 1.3218997361477574) internal successors, (501), 386 states have internal predecessors, (501), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 10:01:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 519 transitions. [2025-02-06 10:01:46,032 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 519 transitions. Word has length 80 [2025-02-06 10:01:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:01:46,033 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 519 transitions. [2025-02-06 10:01:46,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:01:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 519 transitions. [2025-02-06 10:01:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 10:01:46,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:46,034 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:46,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:01:46,235 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-06 10:01:46,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:46,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1213206342, now seen corresponding path program 1 times [2025-02-06 10:01:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:46,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647700585] [2025-02-06 10:01:46,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:01:46,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:46,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:46,238 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-06 10:01:46,239 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-06 10:01:46,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 10:01:46,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 10:01:46,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:01:46,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:46,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 10:01:46,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:01:46,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:01:46,614 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:46,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647700585] [2025-02-06 10:01:46,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647700585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:01:46,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:01:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:01:46,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455511271] [2025-02-06 10:01:46,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:01:46,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:01:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:46,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:01:46,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:01:46,615 INFO L87 Difference]: Start difference. First operand 393 states and 519 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:01:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:01:46,778 INFO L93 Difference]: Finished difference Result 399 states and 509 transitions. [2025-02-06 10:01:46,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:01:46,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2025-02-06 10:01:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:01:46,780 INFO L225 Difference]: With dead ends: 399 [2025-02-06 10:01:46,780 INFO L226 Difference]: Without dead ends: 399 [2025-02-06 10:01:46,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:01:46,782 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 30 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:01:46,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 701 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:01:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-06 10:01:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-02-06 10:01:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 385 states have (on average 1.2753246753246754) internal successors, (491), 392 states have internal predecessors, (491), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 10:01:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 509 transitions. [2025-02-06 10:01:46,794 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 509 transitions. Word has length 86 [2025-02-06 10:01:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:01:46,795 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 509 transitions. [2025-02-06 10:01:46,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:01:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 509 transitions. [2025-02-06 10:01:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 10:01:46,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:46,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:46,811 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-06 10:01:47,000 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-06 10:01:47,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:47,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:47,001 INFO L85 PathProgramCache]: Analyzing trace with hash -452865121, now seen corresponding path program 1 times [2025-02-06 10:01:47,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:47,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455621263] [2025-02-06 10:01:47,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:01:47,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:47,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:47,009 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-06 10:01:47,010 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-06 10:01:47,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 10:01:47,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 10:01:47,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:01:47,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:47,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 10:01:47,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:01:47,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:01:47,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:47,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455621263] [2025-02-06 10:01:47,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455621263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:01:47,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:01:47,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:01:47,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707647182] [2025-02-06 10:01:47,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:01:47,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:01:47,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:47,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:01:47,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:01:47,381 INFO L87 Difference]: Start difference. First operand 399 states and 509 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:01:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:01:47,440 INFO L93 Difference]: Finished difference Result 402 states and 513 transitions. [2025-02-06 10:01:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:01:47,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2025-02-06 10:01:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:01:47,443 INFO L225 Difference]: With dead ends: 402 [2025-02-06 10:01:47,443 INFO L226 Difference]: Without dead ends: 402 [2025-02-06 10:01:47,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 83 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-06 10:01:47,444 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:01:47,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 761 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:01:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-06 10:01:47,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-02-06 10:01:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 387 states have (on average 1.276485788113695) internal successors, (494), 395 states have internal predecessors, (494), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-06 10:01:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 513 transitions. [2025-02-06 10:01:47,454 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 513 transitions. Word has length 86 [2025-02-06 10:01:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:01:47,454 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 513 transitions. [2025-02-06 10:01:47,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:01:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 513 transitions. [2025-02-06 10:01:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 10:01:47,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:47,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:47,470 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-06 10:01:47,658 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-06 10:01:47,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:47,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash -774490501, now seen corresponding path program 1 times [2025-02-06 10:01:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:47,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510181456] [2025-02-06 10:01:47,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:01:47,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:47,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:47,661 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-06 10:01:47,662 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-06 10:01:47,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 10:01:47,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 10:01:47,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:01:47,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:47,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:01:48,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:48,014 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:01:48,015 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:01:48,015 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:01:48,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-02-06 10:01:48,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:01:48,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-02-06 10:01:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:01:48,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:01:48,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:48,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510181456] [2025-02-06 10:01:48,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510181456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:01:48,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:01:48,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:01:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368346067] [2025-02-06 10:01:48,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:01:48,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:01:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:48,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:01:48,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:01:48,151 INFO L87 Difference]: Start difference. First operand 402 states and 513 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:01:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:01:48,711 INFO L93 Difference]: Finished difference Result 545 states and 699 transitions. [2025-02-06 10:01:48,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:01:48,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2025-02-06 10:01:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:01:48,713 INFO L225 Difference]: With dead ends: 545 [2025-02-06 10:01:48,713 INFO L226 Difference]: Without dead ends: 545 [2025-02-06 10:01:48,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:01:48,714 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 203 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:01:48,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 751 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:01:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-06 10:01:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 404. [2025-02-06 10:01:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 389 states have (on average 1.275064267352185) internal successors, (496), 397 states have internal predecessors, (496), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-06 10:01:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 515 transitions. [2025-02-06 10:01:48,722 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 515 transitions. Word has length 88 [2025-02-06 10:01:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:01:48,722 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 515 transitions. [2025-02-06 10:01:48,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:01:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 515 transitions. [2025-02-06 10:01:48,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 10:01:48,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:48,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:48,735 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-06 10:01:48,924 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-06 10:01:48,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:48,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:48,924 INFO L85 PathProgramCache]: Analyzing trace with hash 381557914, now seen corresponding path program 1 times [2025-02-06 10:01:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:48,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [523995289] [2025-02-06 10:01:48,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:01:48,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:48,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:48,927 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-06 10:01:48,928 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-06 10:01:49,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 10:01:49,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 10:01:49,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:01:49,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:49,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 10:01:49,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:01:49,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:01:49,361 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:49,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523995289] [2025-02-06 10:01:49,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523995289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:01:49,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:01:49,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:01:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256371214] [2025-02-06 10:01:49,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:01:49,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:01:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:49,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:01:49,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:01:49,362 INFO L87 Difference]: Start difference. First operand 404 states and 515 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:01:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:01:49,524 INFO L93 Difference]: Finished difference Result 413 states and 500 transitions. [2025-02-06 10:01:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:01:49,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 127 [2025-02-06 10:01:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:01:49,531 INFO L225 Difference]: With dead ends: 413 [2025-02-06 10:01:49,531 INFO L226 Difference]: Without dead ends: 413 [2025-02-06 10:01:49,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:01:49,532 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 30 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:01:49,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 668 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:01:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-06 10:01:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-02-06 10:01:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 398 states have (on average 1.2085427135678393) internal successors, (481), 406 states have internal predecessors, (481), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-06 10:01:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 500 transitions. [2025-02-06 10:01:49,542 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 500 transitions. Word has length 127 [2025-02-06 10:01:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:01:49,542 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 500 transitions. [2025-02-06 10:01:49,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:01:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 500 transitions. [2025-02-06 10:01:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 10:01:49,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:49,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:49,557 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-06 10:01:49,744 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-06 10:01:49,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:49,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash -753957645, now seen corresponding path program 1 times [2025-02-06 10:01:49,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:49,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745809431] [2025-02-06 10:01:49,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:01:49,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:49,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:49,747 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-06 10:01:49,748 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-06 10:01:50,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 10:01:50,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 10:01:50,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:01:50,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:50,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:01:50,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:01:50,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:01:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:01:50,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:50,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745809431] [2025-02-06 10:01:50,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745809431] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:01:50,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:01:50,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-06 10:01:50,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32392169] [2025-02-06 10:01:50,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:01:50,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:01:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:50,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:01:50,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:01:50,408 INFO L87 Difference]: Start difference. First operand 413 states and 500 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:01:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:01:50,581 INFO L93 Difference]: Finished difference Result 424 states and 517 transitions. [2025-02-06 10:01:50,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:01:50,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2025-02-06 10:01:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:01:50,584 INFO L225 Difference]: With dead ends: 424 [2025-02-06 10:01:50,584 INFO L226 Difference]: Without dead ends: 424 [2025-02-06 10:01:50,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:01:50,584 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 5 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:01:50,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 968 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:01:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-02-06 10:01:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2025-02-06 10:01:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 406 states have (on average 1.2192118226600985) internal successors, (495), 414 states have internal predecessors, (495), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-06 10:01:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 515 transitions. [2025-02-06 10:01:50,592 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 515 transitions. Word has length 127 [2025-02-06 10:01:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:01:50,592 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 515 transitions. [2025-02-06 10:01:50,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:01:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 515 transitions. [2025-02-06 10:01:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 10:01:50,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:50,594 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:50,607 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-06 10:01:50,794 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-06 10:01:50,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:50,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash 679952239, now seen corresponding path program 2 times [2025-02-06 10:01:50,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:50,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418693809] [2025-02-06 10:01:50,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:01:50,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:50,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:50,798 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-06 10:01:50,799 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-06 10:01:51,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-02-06 10:01:51,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 10:01:51,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:01:51,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:51,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:01:51,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:01:51,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:01:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:01:51,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418693809] [2025-02-06 10:01:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418693809] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:01:51,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:01:51,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-06 10:01:51,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301483718] [2025-02-06 10:01:51,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:01:51,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:01:51,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:51,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:01:51,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:01:51,401 INFO L87 Difference]: Start difference. First operand 422 states and 515 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:01:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:01:51,657 INFO L93 Difference]: Finished difference Result 430 states and 525 transitions. [2025-02-06 10:01:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:01:51,657 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 131 [2025-02-06 10:01:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:01:51,659 INFO L225 Difference]: With dead ends: 430 [2025-02-06 10:01:51,659 INFO L226 Difference]: Without dead ends: 428 [2025-02-06 10:01:51,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:01:51,660 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 5 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:01:51,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 976 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:01:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-06 10:01:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2025-02-06 10:01:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 410 states have (on average 1.221951219512195) internal successors, (501), 418 states have internal predecessors, (501), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-06 10:01:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 520 transitions. [2025-02-06 10:01:51,668 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 520 transitions. Word has length 131 [2025-02-06 10:01:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:01:51,668 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 520 transitions. [2025-02-06 10:01:51,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:01:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 520 transitions. [2025-02-06 10:01:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 10:01:51,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:01:51,669 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:01:51,684 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-06 10:01:51,874 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-06 10:01:51,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:01:51,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:01:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1042418735, now seen corresponding path program 3 times [2025-02-06 10:01:51,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:01:51,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710309976] [2025-02-06 10:01:51,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:01:51,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:01:51,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:01:51,877 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-06 10:01:51,887 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-06 10:01:52,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 135 statements into 6 equivalence classes. [2025-02-06 10:01:52,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 118 of 135 statements. [2025-02-06 10:01:52,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 10:01:52,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:01:52,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 10:01:52,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:01:52,313 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:01:52,313 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:01:52,314 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:01:52,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-02-06 10:01:53,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:01:53,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 87 [2025-02-06 10:01:53,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:01:53,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 74 [2025-02-06 10:01:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-06 10:01:53,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:01:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-06 10:01:54,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:01:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710309976] [2025-02-06 10:01:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710309976] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:01:54,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:01:54,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-02-06 10:01:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303246053] [2025-02-06 10:01:54,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:01:54,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:01:54,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:01:54,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:01:54,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:01:54,782 INFO L87 Difference]: Start difference. First operand 426 states and 520 transitions. Second operand has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 12 states have internal predecessors, (185), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:01:59,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:03,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:07,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:11,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:16,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:20,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:24,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:28,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:32,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:36,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:40,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:44,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:48,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:52,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:02:56,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]