./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 816e37c4bcf3aac0429d508c13e4e6eeab848e29c3869a32879e05a2b79a73a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:12:28,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:12:28,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:12:28,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:12:28,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:12:28,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:12:28,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:12:28,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:12:28,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:12:28,984 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:12:28,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:12:28,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:12:28,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:12:28,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:12:28,985 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:12:28,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:12:28,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:12:28,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:12:28,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:12:28,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:12:28,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:12:28,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:12:28,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:12:28,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:12:28,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:12:28,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:12:28,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:12:28,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:12:28,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:12:28,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:12:28,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:12:28,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:12:28,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:12:28,989 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 816e37c4bcf3aac0429d508c13e4e6eeab848e29c3869a32879e05a2b79a73a3 [2025-03-04 07:12:29,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:12:29,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:12:29,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:12:29,192 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:12:29,192 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:12:29,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i [2025-03-04 07:12:30,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51050f244/36a3e05a9c254ac9b53af73b144e06db/FLAG47be368f4 [2025-03-04 07:12:30,617 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:12:30,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i [2025-03-04 07:12:30,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51050f244/36a3e05a9c254ac9b53af73b144e06db/FLAG47be368f4 [2025-03-04 07:12:30,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51050f244/36a3e05a9c254ac9b53af73b144e06db [2025-03-04 07:12:30,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:12:30,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:12:30,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:12:30,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:12:30,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:12:30,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:12:30" (1/1) ... [2025-03-04 07:12:30,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4f920a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:30, skipping insertion in model container [2025-03-04 07:12:30,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:12:30" (1/1) ... [2025-03-04 07:12:30,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:12:31,255 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,286 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,290 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,294 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,303 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,331 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,332 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,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-03-04 07:12:31,335 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,341 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,343 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,344 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,344 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,345 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:31,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-03-04 07:12:31,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:12:31,370 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-03-04 07:12:31,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@677407e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:31, skipping insertion in model container [2025-03-04 07:12:31,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:12:31,371 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-04 07:12:31,372 INFO L158 Benchmark]: Toolchain (without parser) took 478.52ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 83.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:12:31,373 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:12:31,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.86ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 83.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:12:31,374 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.18ms. Allocated memory is still 201.3MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.86ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 83.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 833]: 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 816e37c4bcf3aac0429d508c13e4e6eeab848e29c3869a32879e05a2b79a73a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:12:33,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:12:33,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-03-04 07:12:33,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:12:33,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:12:33,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:12:33,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:12:33,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:12:33,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:12:33,141 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:12:33,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:12:33,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:12:33,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:12:33,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:12:33,142 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:12:33,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:12:33,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:12:33,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:12:33,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:12:33,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:12:33,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:12:33,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:12:33,142 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:12:33,142 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:12:33,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:12:33,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:12:33,143 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:12:33,143 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:12:33,143 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:12:33,143 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:12:33,143 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:12:33,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:12:33,143 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:12:33,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:12:33,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:12:33,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:12:33,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:12:33,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:12:33,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:12:33,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:12:33,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:12:33,145 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:12:33,145 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:12:33,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:12:33,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:12:33,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:12:33,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:12:33,145 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 816e37c4bcf3aac0429d508c13e4e6eeab848e29c3869a32879e05a2b79a73a3 [2025-03-04 07:12:33,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:12:33,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:12:33,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:12:33,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:12:33,383 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:12:33,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i [2025-03-04 07:12:34,597 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cdf01c4e/96a3117098ce4bcbb98936401a3a42a2/FLAGf1f132479 [2025-03-04 07:12:34,866 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:12:34,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-2.i [2025-03-04 07:12:34,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cdf01c4e/96a3117098ce4bcbb98936401a3a42a2/FLAGf1f132479 [2025-03-04 07:12:34,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cdf01c4e/96a3117098ce4bcbb98936401a3a42a2 [2025-03-04 07:12:34,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:12:34,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:12:34,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:12:34,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:12:34,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:12:34,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:12:34" (1/1) ... [2025-03-04 07:12:34,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3786552b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:34, skipping insertion in model container [2025-03-04 07:12:34,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:12:34" (1/1) ... [2025-03-04 07:12:34,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:12:35,258 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,286 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,289 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,292 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,303 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,331 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,331 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,333 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,333 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,335 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,336 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,337 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,338 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,338 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,341 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:12:35,354 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-04 07:12:35,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:12:35,393 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,404 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,405 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,407 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,411 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,432 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,432 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,437 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,438 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,439 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,443 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,447 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,447 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,448 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,453 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:12:35,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:12:35,466 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:12:35,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:12:35,582 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:12:35,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35 WrapperNode [2025-03-04 07:12:35,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:12:35,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:12:35,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:12:35,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:12:35,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,649 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1018 [2025-03-04 07:12:35,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:12:35,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:12:35,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:12:35,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:12:35,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,757 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 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, 4, 50]. [2025-03-04 07:12:35,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:12:35,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:12:35,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:12:35,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:12:35,826 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (1/1) ... [2025-03-04 07:12:35,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:12:35,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:35,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:12:35,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:12:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:12:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:12:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 07:12:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 07:12:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 07:12:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:12:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:12:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 07:12:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 07:12:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 07:12:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 07:12:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 07:12:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 07:12:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 07:12:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:12:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:12:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:12:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:12:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 07:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 07:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 07:12:35,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 07:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:12:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:12:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:12:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:12:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:12:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:12:35,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:12:36,054 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:12:36,057 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:12:42,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: 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-03-04 07:12:42,906 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-03-04 07:12:42,906 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:12:42,917 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:12:42,917 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:12:42,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:12:42 BoogieIcfgContainer [2025-03-04 07:12:42,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:12:42,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:12:42,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:12:42,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:12:42,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:12:34" (1/3) ... [2025-03-04 07:12:42,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ccb1bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:12:42, skipping insertion in model container [2025-03-04 07:12:42,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:12:35" (2/3) ... [2025-03-04 07:12:42,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ccb1bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:12:42, skipping insertion in model container [2025-03-04 07:12:42,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:12:42" (3/3) ... [2025-03-04 07:12:42,927 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-2.i [2025-03-04 07:12:42,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:12:42,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test2-2.i that has 6 procedures, 218 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-03-04 07:12:42,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:12:42,976 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;@2f53ff83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:12:42,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:12:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 194 states have (on average 1.6597938144329898) internal successors, (322), 203 states have internal predecessors, (322), 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-03-04 07:12:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:12:42,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:42,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:42,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:42,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1351928925, now seen corresponding path program 1 times [2025-03-04 07:12:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:12:43,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [202800092] [2025-03-04 07:12:43,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:43,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:43,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:43,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:43,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:12:43,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:12:43,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:12:43,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:43,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:43,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 07:12:43,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:12:43,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:43,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:12:43,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202800092] [2025-03-04 07:12:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202800092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:43,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:12:43,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848884939] [2025-03-04 07:12:43,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:43,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:12:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:12:43,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:12:43,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:12:43,193 INFO L87 Difference]: Start difference. First operand has 210 states, 194 states have (on average 1.6597938144329898) internal successors, (322), 203 states have internal predecessors, (322), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:12:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:43,220 INFO L93 Difference]: Finished difference Result 208 states and 275 transitions. [2025-03-04 07:12:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:12:43,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:12:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:43,227 INFO L225 Difference]: With dead ends: 208 [2025-03-04 07:12:43,228 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 07:12:43,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-03-04 07:12:43,232 INFO L435 NwaCegarLoop]: 275 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, 275 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-03-04 07:12:43,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:12:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 07:12:43,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 07:12:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 192 states have (on average 1.328125) internal successors, (255), 199 states have internal predecessors, (255), 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-03-04 07:12:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 273 transitions. [2025-03-04 07:12:43,271 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 273 transitions. Word has length 11 [2025-03-04 07:12:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:43,271 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 273 transitions. [2025-03-04 07:12:43,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:12:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 273 transitions. [2025-03-04 07:12:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:12:43,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:43,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:43,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:12:43,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:43,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:43,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash -356431499, now seen corresponding path program 1 times [2025-03-04 07:12:43,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:12:43,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191143217] [2025-03-04 07:12:43,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:43,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:43,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:43,481 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:43,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:12:43,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:12:43,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:12:43,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:43,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:43,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:12:43,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:12:43,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:43,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:12:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191143217] [2025-03-04 07:12:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191143217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:43,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:43,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:12:43,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3601698] [2025-03-04 07:12:43,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:43,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:12:43,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:12:43,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:12:43,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:12:43,689 INFO L87 Difference]: Start difference. First operand 206 states and 273 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:12:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:44,275 INFO L93 Difference]: Finished difference Result 332 states and 445 transitions. [2025-03-04 07:12:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:12:44,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-03-04 07:12:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:44,278 INFO L225 Difference]: With dead ends: 332 [2025-03-04 07:12:44,278 INFO L226 Difference]: Without dead ends: 332 [2025-03-04 07:12:44,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-03-04 07:12:44,279 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 152 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:44,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 508 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:12:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-04 07:12:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 302. [2025-03-04 07:12:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 283 states have (on average 1.3356890459363957) internal successors, (378), 295 states have internal predecessors, (378), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:12:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 406 transitions. [2025-03-04 07:12:44,293 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 406 transitions. Word has length 12 [2025-03-04 07:12:44,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:44,293 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 406 transitions. [2025-03-04 07:12:44,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:12:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 406 transitions. [2025-03-04 07:12:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:12:44,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:44,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:44,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:12:44,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:44,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:44,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash -356401708, now seen corresponding path program 1 times [2025-03-04 07:12:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:12:44,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363468680] [2025-03-04 07:12:44,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:44,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:44,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:44,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:44,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:12:44,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:12:44,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:12:44,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:44,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:44,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:12:44,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:44,650 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:12:44,651 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:12:44,652 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:12:44,661 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-03-04 07:12:44,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:12:44,720 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-03-04 07:12:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:12:44,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:44,734 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:12:44,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363468680] [2025-03-04 07:12:44,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363468680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:44,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:44,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:12:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408433836] [2025-03-04 07:12:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:44,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:12:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:12:44,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:12:44,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:12:44,736 INFO L87 Difference]: Start difference. First operand 302 states and 406 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:12:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:45,163 INFO L93 Difference]: Finished difference Result 466 states and 635 transitions. [2025-03-04 07:12:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:12:45,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-03-04 07:12:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:45,166 INFO L225 Difference]: With dead ends: 466 [2025-03-04 07:12:45,167 INFO L226 Difference]: Without dead ends: 466 [2025-03-04 07:12:45,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-03-04 07:12:45,167 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 234 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 747 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:45,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 747 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:12:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-04 07:12:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 301. [2025-03-04 07:12:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 282 states have (on average 1.3333333333333333) internal successors, (376), 294 states have internal predecessors, (376), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:12:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 404 transitions. [2025-03-04 07:12:45,194 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 404 transitions. Word has length 12 [2025-03-04 07:12:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:45,194 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 404 transitions. [2025-03-04 07:12:45,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:12:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 404 transitions. [2025-03-04 07:12:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 07:12:45,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:45,198 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] [2025-03-04 07:12:45,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:12:45,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:45,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:45,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:45,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1034951777, now seen corresponding path program 1 times [2025-03-04 07:12:45,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:12:45,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967076960] [2025-03-04 07:12:45,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:45,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:45,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:45,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:45,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:12:45,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 07:12:45,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 07:12:45,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:45,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:45,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:12:45,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:12:45,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:45,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:12:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967076960] [2025-03-04 07:12:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967076960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:45,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:45,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:12:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038848690] [2025-03-04 07:12:45,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:45,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:12:45,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:12:45,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:12:45,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:12:45,775 INFO L87 Difference]: Start difference. First operand 301 states and 404 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-03-04 07:12:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:45,888 INFO L93 Difference]: Finished difference Result 341 states and 444 transitions. [2025-03-04 07:12:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:12:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 81 [2025-03-04 07:12:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:45,892 INFO L225 Difference]: With dead ends: 341 [2025-03-04 07:12:45,892 INFO L226 Difference]: Without dead ends: 341 [2025-03-04 07:12:45,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 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-03-04 07:12:45,893 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 8 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:45,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 491 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:12:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-04 07:12:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-03-04 07:12:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 322 states have (on average 1.2919254658385093) internal successors, (416), 334 states have internal predecessors, (416), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:12:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 444 transitions. [2025-03-04 07:12:45,905 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 444 transitions. Word has length 81 [2025-03-04 07:12:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:45,905 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 444 transitions. [2025-03-04 07:12:45,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-03-04 07:12:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 444 transitions. [2025-03-04 07:12:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 07:12:45,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:45,906 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] [2025-03-04 07:12:45,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:12:46,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:46,107 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:46,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:46,108 INFO L85 PathProgramCache]: Analyzing trace with hash -746548158, now seen corresponding path program 1 times [2025-03-04 07:12:46,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:12:46,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814637247] [2025-03-04 07:12:46,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:46,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:46,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:46,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:46,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:12:46,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 07:12:46,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 07:12:46,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:46,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:46,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:12:46,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:12:46,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:46,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:12:46,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814637247] [2025-03-04 07:12:46,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814637247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:46,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:46,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:12:46,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426577069] [2025-03-04 07:12:46,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:46,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:12:46,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:12:46,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:12:46,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:12:46,642 INFO L87 Difference]: Start difference. First operand 341 states and 444 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-03-04 07:12:50,936 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-03-04 07:12:54,940 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 [] [2025-03-04 07:12:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:56,054 INFO L93 Difference]: Finished difference Result 354 states and 451 transitions. [2025-03-04 07:12:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:12:56,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 81 [2025-03-04 07:12:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:56,056 INFO L225 Difference]: With dead ends: 354 [2025-03-04 07:12:56,056 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 07:12:56,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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-03-04 07:12:56,057 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 447 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:56,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 456 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2025-03-04 07:12:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 07:12:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 286. [2025-03-04 07:12:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 272 states have (on average 1.2647058823529411) internal successors, (344), 279 states have internal predecessors, (344), 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-03-04 07:12:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 362 transitions. [2025-03-04 07:12:56,067 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 362 transitions. Word has length 81 [2025-03-04 07:12:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:56,068 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 362 transitions. [2025-03-04 07:12:56,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-03-04 07:12:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 362 transitions. [2025-03-04 07:12:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 07:12:56,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:56,072 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, 1, 1, 1, 1] [2025-03-04 07:12:56,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:12:56,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:56,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:56,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash 646554451, now seen corresponding path program 1 times [2025-03-04 07:12:56,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:12:56,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198709420] [2025-03-04 07:12:56,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:56,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:56,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:56,276 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:56,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:12:56,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 07:12:56,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 07:12:56,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:56,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:56,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:12:56,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:12:56,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:56,670 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:12:56,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198709420] [2025-03-04 07:12:56,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198709420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:56,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:56,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:12:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375484393] [2025-03-04 07:12:56,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:56,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:12:56,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:12:56,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:12:56,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:12:56,672 INFO L87 Difference]: Start difference. First operand 286 states and 362 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-03-04 07:12:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:56,760 INFO L93 Difference]: Finished difference Result 252 states and 306 transitions. [2025-03-04 07:12:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:12:56,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 90 [2025-03-04 07:12:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:56,762 INFO L225 Difference]: With dead ends: 252 [2025-03-04 07:12:56,762 INFO L226 Difference]: Without dead ends: 252 [2025-03-04 07:12:56,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 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-03-04 07:12:56,763 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 32 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:56,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 703 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:12:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-04 07:12:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-04 07:12:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 238 states have (on average 1.2100840336134453) internal successors, (288), 245 states have internal predecessors, (288), 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-03-04 07:12:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 306 transitions. [2025-03-04 07:12:56,770 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 306 transitions. Word has length 90 [2025-03-04 07:12:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:56,771 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 306 transitions. [2025-03-04 07:12:56,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-03-04 07:12:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 306 transitions. [2025-03-04 07:12:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 07:12:56,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:56,773 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, 1, 1, 1, 1] [2025-03-04 07:12:56,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:12:56,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:56,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:56,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:56,974 INFO L85 PathProgramCache]: Analyzing trace with hash -567169382, now seen corresponding path program 1 times [2025-03-04 07:12:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:12:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [202353565] [2025-03-04 07:12:56,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:56,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:56,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:56,976 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:56,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:12:57,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 07:12:57,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 07:12:57,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:57,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:57,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:12:57,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:12:57,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:57,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:12:57,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202353565] [2025-03-04 07:12:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202353565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:57,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:12:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513894030] [2025-03-04 07:12:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:57,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:12:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:12:57,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:12:57,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:12:57,321 INFO L87 Difference]: Start difference. First operand 252 states and 306 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-03-04 07:13:01,728 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-03-04 07:13:05,737 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-03-04 07:13:08,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:13:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:13:09,130 INFO L93 Difference]: Finished difference Result 254 states and 308 transitions. [2025-03-04 07:13:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:13:09,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 90 [2025-03-04 07:13:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:13:09,135 INFO L225 Difference]: With dead ends: 254 [2025-03-04 07:13:09,135 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 07:13:09,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 87 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-03-04 07:13:09,136 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 219 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:13:09,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 470 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2025-03-04 07:13:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 07:13:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2025-03-04 07:13:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 239 states have (on average 1.209205020920502) internal successors, (289), 246 states have internal predecessors, (289), 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-03-04 07:13:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2025-03-04 07:13:09,141 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 90 [2025-03-04 07:13:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:13:09,141 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2025-03-04 07:13:09,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-03-04 07:13:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2025-03-04 07:13:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 07:13:09,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:13:09,142 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, 1, 1, 1, 1] [2025-03-04 07:13:09,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:13:09,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:09,346 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:13:09,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:13:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash -567139591, now seen corresponding path program 1 times [2025-03-04 07:13:09,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:13:09,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1653852178] [2025-03-04 07:13:09,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:13:09,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:09,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:13:09,349 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:13:09,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:13:09,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 07:13:09,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 07:13:09,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:13:09,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:13:09,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:13:09,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:13:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:13:09,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:13:09,733 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:13:09,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653852178] [2025-03-04 07:13:09,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653852178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:13:09,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:13:09,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:13:09,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218840968] [2025-03-04 07:13:09,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:13:09,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:13:09,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:13:09,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:13:09,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:13:09,734 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:13:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:13:09,761 INFO L93 Difference]: Finished difference Result 256 states and 311 transitions. [2025-03-04 07:13:09,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:13:09,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2025-03-04 07:13:09,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:13:09,763 INFO L225 Difference]: With dead ends: 256 [2025-03-04 07:13:09,764 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 07:13:09,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 87 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-03-04 07:13:09,765 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 0 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 767 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-03-04 07:13:09,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 767 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:13:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 07:13:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-04 07:13:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 241 states have (on average 1.2116182572614107) internal successors, (292), 249 states have internal predecessors, (292), 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-03-04 07:13:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 311 transitions. [2025-03-04 07:13:09,770 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 311 transitions. Word has length 90 [2025-03-04 07:13:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:13:09,770 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 311 transitions. [2025-03-04 07:13:09,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:13:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 311 transitions. [2025-03-04 07:13:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 07:13:09,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:13:09,771 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] [2025-03-04 07:13:09,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:13:09,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:09,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:13:09,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:13:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash 356831645, now seen corresponding path program 1 times [2025-03-04 07:13:09,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:13:09,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204098406] [2025-03-04 07:13:09,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:13:09,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:09,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:13:09,977 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:13:09,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:13:10,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 07:13:10,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 07:13:10,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:13:10,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:13:10,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:13:10,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:13:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:13:10,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:13:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:13:10,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:13:10,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204098406] [2025-03-04 07:13:10,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204098406] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:13:10,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:13:10,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 07:13:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212825386] [2025-03-04 07:13:10,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:13:10,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:13:10,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:13:10,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:13:10,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:13:10,467 INFO L87 Difference]: Start difference. First operand 256 states and 311 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:13:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:13:10,578 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2025-03-04 07:13:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:13:10,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 92 [2025-03-04 07:13:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:13:10,580 INFO L225 Difference]: With dead ends: 267 [2025-03-04 07:13:10,580 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 07:13:10,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:13:10,581 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 5 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:13:10,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 767 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:13:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 07:13:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2025-03-04 07:13:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 249 states have (on average 1.2289156626506024) internal successors, (306), 257 states have internal predecessors, (306), 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-03-04 07:13:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 326 transitions. [2025-03-04 07:13:10,588 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 326 transitions. Word has length 92 [2025-03-04 07:13:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:13:10,589 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 326 transitions. [2025-03-04 07:13:10,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:13:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 326 transitions. [2025-03-04 07:13:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 07:13:10,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:13:10,590 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] [2025-03-04 07:13:10,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:13:10,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:10,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:13:10,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:13:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1928091559, now seen corresponding path program 2 times [2025-03-04 07:13:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:13:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264474641] [2025-03-04 07:13:10,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:13:10,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:10,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:13:10,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:13:10,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:13:11,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-04 07:13:11,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 96 statements. [2025-03-04 07:13:11,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:13:11,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:13:11,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:13:11,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:13:11,065 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:13:11,066 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:13:11,066 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:13:11,068 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-03-04 07:13:11,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:13:11,119 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-03-04 07:13:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 07:13:11,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:13:11,140 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:13:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264474641] [2025-03-04 07:13:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264474641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:13:11,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:13:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:13:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161532059] [2025-03-04 07:13:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:13:11,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:13:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:13:11,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:13:11,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:13:11,142 INFO L87 Difference]: Start difference. First operand 265 states and 326 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-03-04 07:13:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:13:11,566 INFO L93 Difference]: Finished difference Result 374 states and 477 transitions. [2025-03-04 07:13:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:13:11,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 96 [2025-03-04 07:13:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:13:11,568 INFO L225 Difference]: With dead ends: 374 [2025-03-04 07:13:11,568 INFO L226 Difference]: Without dead ends: 374 [2025-03-04 07:13:11,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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-03-04 07:13:11,568 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 181 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:13:11,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 704 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:13:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-04 07:13:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 267. [2025-03-04 07:13:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 251 states have (on average 1.2270916334661355) internal successors, (308), 259 states have internal predecessors, (308), 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-03-04 07:13:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 328 transitions. [2025-03-04 07:13:11,574 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 328 transitions. Word has length 96 [2025-03-04 07:13:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:13:11,574 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 328 transitions. [2025-03-04 07:13:11,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-03-04 07:13:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 328 transitions. [2025-03-04 07:13:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 07:13:11,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:13:11,575 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] [2025-03-04 07:13:11,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:13:11,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:11,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:13:11,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:13:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1062384966, now seen corresponding path program 1 times [2025-03-04 07:13:11,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:13:11,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490809039] [2025-03-04 07:13:11,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:13:11,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:11,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:13:11,778 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:13:11,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:13:12,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 07:13:12,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 07:13:12,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:13:12,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:13:12,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:13:12,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:13:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 07:13:12,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:13:12,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:13:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490809039] [2025-03-04 07:13:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490809039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:13:12,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:13:12,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:13:12,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107922204] [2025-03-04 07:13:12,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:13:12,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:13:12,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:13:12,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:13:12,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:13:12,173 INFO L87 Difference]: Start difference. First operand 267 states and 328 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-03-04 07:13:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:13:12,254 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2025-03-04 07:13:12,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:13:12,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 129 [2025-03-04 07:13:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:13:12,256 INFO L225 Difference]: With dead ends: 270 [2025-03-04 07:13:12,256 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 07:13:12,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-03-04 07:13:12,256 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 30 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 674 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-03-04 07:13:12,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 674 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:13:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 07:13:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-04 07:13:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 254 states have (on average 1.1929133858267718) internal successors, (303), 262 states have internal predecessors, (303), 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-03-04 07:13:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 323 transitions. [2025-03-04 07:13:12,260 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 323 transitions. Word has length 129 [2025-03-04 07:13:12,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:13:12,260 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 323 transitions. [2025-03-04 07:13:12,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-03-04 07:13:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 323 transitions. [2025-03-04 07:13:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 07:13:12,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:13:12,261 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] [2025-03-04 07:13:12,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:13:12,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:12,462 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:13:12,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:13:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2097066771, now seen corresponding path program 1 times [2025-03-04 07:13:12,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:13:12,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884443692] [2025-03-04 07:13:12,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:13:12,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:12,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:13:12,465 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:13:12,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:13:12,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 07:13:12,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 07:13:12,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:13:12,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:13:12,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:13:12,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:13:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:13:12,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:13:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:13:13,082 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:13:13,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884443692] [2025-03-04 07:13:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884443692] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:13:13,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:13:13,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-04 07:13:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744832378] [2025-03-04 07:13:13,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:13:13,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:13:13,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:13:13,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:13:13,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:13:13,084 INFO L87 Difference]: Start difference. First operand 270 states and 323 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-03-04 07:13:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:13:13,327 INFO L93 Difference]: Finished difference Result 278 states and 333 transitions. [2025-03-04 07:13:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:13:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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 129 [2025-03-04 07:13:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:13:13,329 INFO L225 Difference]: With dead ends: 278 [2025-03-04 07:13:13,329 INFO L226 Difference]: Without dead ends: 276 [2025-03-04 07:13:13,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 248 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-03-04 07:13:13,330 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 6 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:13:13,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 983 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:13:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-04 07:13:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2025-03-04 07:13:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 258 states have (on average 1.197674418604651) internal successors, (309), 266 states have internal predecessors, (309), 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-03-04 07:13:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 328 transitions. [2025-03-04 07:13:13,336 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 328 transitions. Word has length 129 [2025-03-04 07:13:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:13:13,336 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 328 transitions. [2025-03-04 07:13:13,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-03-04 07:13:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 328 transitions. [2025-03-04 07:13:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 07:13:13,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:13:13,338 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] [2025-03-04 07:13:13,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:13:13,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:13,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:13:13,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:13:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash -982840621, now seen corresponding path program 2 times [2025-03-04 07:13:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:13:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26266553] [2025-03-04 07:13:13,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:13:13,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:13:13,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:13:13,541 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:13:13,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:13:13,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-04 07:13:13,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 07:13:13,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:13:13,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:13:13,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:13:14,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:13:14,005 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:13:14,006 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:13:14,006 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:13:14,007 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-03-04 07:13:15,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:13:15,423 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-03-04 07:13:15,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:13:15,514 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-03-04 07:13:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 07:13:15,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:13:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 07:13:15,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:13:15,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26266553] [2025-03-04 07:13:15,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26266553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:13:15,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:13:15,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-04 07:13:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919015405] [2025-03-04 07:13:15,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:13:15,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:13:15,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:13:15,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:13:15,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:13:15,951 INFO L87 Difference]: Start difference. First operand 274 states and 328 transitions. Second operand has 12 states, 12 states have (on average 15.166666666666666) internal successors, (182), 12 states have internal predecessors, (182), 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-03-04 07:13:20,321 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-03-04 07:13:24,457 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-03-04 07:13:28,656 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-03-04 07:13:32,811 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-03-04 07:13:36,879 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-03-04 07:13:40,894 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-03-04 07:13:44,922 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-03-04 07:13:49,105 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-03-04 07:13:53,234 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-03-04 07:13:57,252 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-03-04 07:14:01,362 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-03-04 07:14:05,551 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-03-04 07:14:09,645 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]