./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:54:37,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:54:37,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 05:54:37,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:54:37,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:54:37,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:54:37,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:54:37,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:54:37,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:54:37,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:54:37,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:54:37,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:54:37,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:54:37,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:54:37,254 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:54:37,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:54:37,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:54:37,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:54:37,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:54:37,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:54:37,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:54:37,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:54:37,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:54:37,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:54:37,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:54:37,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:54:37,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:54:37,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:54:37,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:54:37,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:54:37,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:54:37,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:54:37,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:54:37,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:54:37,258 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 [2025-02-08 05:54:37,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:54:37,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:54:37,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:54:37,505 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:54:37,506 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:54:37,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2025-02-08 05:54:38,577 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f851dceb7/0d50aa1f63904d8899703df72ab2098d/FLAG24666a2d9 [2025-02-08 05:54:38,883 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:54:38,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2025-02-08 05:54:38,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f851dceb7/0d50aa1f63904d8899703df72ab2098d/FLAG24666a2d9 [2025-02-08 05:54:38,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f851dceb7/0d50aa1f63904d8899703df72ab2098d [2025-02-08 05:54:38,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:54:38,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:54:38,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:54:38,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:54:38,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:54:38,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:54:38" (1/1) ... [2025-02-08 05:54:38,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67198954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:38, skipping insertion in model container [2025-02-08 05:54:38,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:54:38" (1/1) ... [2025-02-08 05:54:38,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:54:39,192 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,218 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,221 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,224 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,228 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,254 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,257 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,259 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,259 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,260 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,262 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,263 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,264 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,264 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,267 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:39,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:54:39,285 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2025-02-08 05:54:39,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@19076ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:39, skipping insertion in model container [2025-02-08 05:54:39,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:54:39,287 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-02-08 05:54:39,291 INFO L158 Benchmark]: Toolchain (without parser) took 373.41ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 84.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:54:39,291 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:54:39,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.80ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 84.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:54:39,292 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.80ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 84.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:54:40,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:54:41,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-02-08 05:54:41,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:54:41,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:54:41,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:54:41,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:54:41,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:54:41,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:54:41,073 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:54:41,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:54:41,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:54:41,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:54:41,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:54:41,074 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:54:41,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:54:41,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:54:41,074 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:54:41,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:54:41,075 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:54:41,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:54:41,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:54:41,076 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:54:41,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:54:41,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:54:41,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:54:41,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:54:41,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:54:41,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:54:41,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:54:41,077 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 05:54:41,077 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 05:54:41,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:54:41,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:54:41,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:54:41,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:54:41,077 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 [2025-02-08 05:54:41,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:54:41,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:54:41,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:54:41,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:54:41,332 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:54:41,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2025-02-08 05:54:42,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d52eccc6/a1849329bf5f448191b80b4cafc834cb/FLAGe0c9decf5 [2025-02-08 05:54:42,778 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:54:42,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2025-02-08 05:54:42,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d52eccc6/a1849329bf5f448191b80b4cafc834cb/FLAGe0c9decf5 [2025-02-08 05:54:42,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d52eccc6/a1849329bf5f448191b80b4cafc834cb [2025-02-08 05:54:42,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:54:42,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:54:42,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:54:42,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:54:42,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:54:42,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:54:42" (1/1) ... [2025-02-08 05:54:42,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193c4203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:42, skipping insertion in model container [2025-02-08 05:54:42,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:54:42" (1/1) ... [2025-02-08 05:54:42,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:54:43,161 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,195 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,202 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,204 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,210 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,253 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,253 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,257 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,257 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,259 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,262 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,266 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,267 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,267 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,273 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:54:43,303 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-02-08 05:54:43,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:54:43,352 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,363 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,367 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,369 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,375 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,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-02-08 05:54:43,394 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,395 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,395 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,396 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,399 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,400 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,401 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,401 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,402 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:54:43,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:54:43,412 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:54:43,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:54:43,510 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:54:43,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43 WrapperNode [2025-02-08 05:54:43,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:54:43,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:54:43,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:54:43,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:54:43,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,601 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1018 [2025-02-08 05:54:43,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:54:43,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:54:43,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:54:43,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:54:43,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,678 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-02-08 05:54:43,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:54:43,749 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:54:43,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:54:43,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:54:43,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (1/1) ... [2025-02-08 05:54:43,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:54:43,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:43,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:54:43,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:54:43,797 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 05:54:43,798 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 05:54:43,798 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 05:54:43,798 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 05:54:43,798 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:54:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 05:54:43,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 05:54:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:54:43,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:54:43,950 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:54:43,952 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:54:50,984 INFO L1324 $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-02-08 05:54:51,047 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2025-02-08 05:54:51,048 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:54:51,060 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:54:51,060 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:54:51,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:54:51 BoogieIcfgContainer [2025-02-08 05:54:51,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:54:51,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:54:51,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:54:51,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:54:51,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:54:42" (1/3) ... [2025-02-08 05:54:51,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c62714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:54:51, skipping insertion in model container [2025-02-08 05:54:51,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:54:43" (2/3) ... [2025-02-08 05:54:51,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c62714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:54:51, skipping insertion in model container [2025-02-08 05:54:51,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:54:51" (3/3) ... [2025-02-08 05:54:51,070 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-2.i [2025-02-08 05:54:51,083 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:54:51,084 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test2-2.i that has 6 procedures, 218 locations, 1 initial locations, 38 loop locations, and 2 error locations. [2025-02-08 05:54:51,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:54:51,120 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;@d853ba1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:54:51,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:54:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 193 states have (on average 1.6632124352331605) internal successors, (321), 202 states have internal predecessors, (321), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 05:54:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 05:54:51,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:51,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:51,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash 835621862, now seen corresponding path program 1 times [2025-02-08 05:54:51,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:54:51,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825615641] [2025-02-08 05:54:51,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:51,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:51,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:51,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:51,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:54:51,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 05:54:51,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 05:54:51,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:51,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:51,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 05:54:51,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:54:51,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:51,306 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:54:51,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825615641] [2025-02-08 05:54:51,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825615641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:51,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:54:51,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:54:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767799259] [2025-02-08 05:54:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:51,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:54:51,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:54:51,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:54:51,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:54:51,328 INFO L87 Difference]: Start difference. First operand has 210 states, 193 states have (on average 1.6632124352331605) internal successors, (321), 202 states have internal predecessors, (321), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-02-08 05:54:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:51,354 INFO L93 Difference]: Finished difference Result 208 states and 274 transitions. [2025-02-08 05:54:51,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:54:51,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2025-02-08 05:54:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:51,360 INFO L225 Difference]: With dead ends: 208 [2025-02-08 05:54:51,360 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 05:54:51,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:54:51,366 INFO L435 NwaCegarLoop]: 274 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, 274 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:51,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:54:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 05:54:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-08 05:54:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 196 states have internal predecessors, (252), 10 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2025-02-08 05:54:51,405 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 10 [2025-02-08 05:54:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:51,406 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2025-02-08 05:54:51,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-02-08 05:54:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2025-02-08 05:54:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 05:54:51,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:51,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:51,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:54:51,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:51,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:51,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:51,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1225649204, now seen corresponding path program 1 times [2025-02-08 05:54:51,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:54:51,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604024335] [2025-02-08 05:54:51,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:51,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:51,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:51,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:51,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:54:51,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 05:54:51,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 05:54:51,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:51,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:51,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 05:54:51,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:54:51,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:51,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:54:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604024335] [2025-02-08 05:54:51,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604024335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:51,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:54:51,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:54:51,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473194017] [2025-02-08 05:54:51,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:51,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:54:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:54:51,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:54:51,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:54:51,844 INFO L87 Difference]: Start difference. First operand 203 states and 265 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:54:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:52,695 INFO L93 Difference]: Finished difference Result 329 states and 432 transitions. [2025-02-08 05:54:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:54:52,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-02-08 05:54:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:52,699 INFO L225 Difference]: With dead ends: 329 [2025-02-08 05:54:52,699 INFO L226 Difference]: Without dead ends: 329 [2025-02-08 05:54:52,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:54:52,700 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 152 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 492 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.8s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:52,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 492 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 05:54:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-08 05:54:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 294. [2025-02-08 05:54:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 281 states have (on average 1.3345195729537367) internal successors, (375), 287 states have internal predecessors, (375), 10 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 388 transitions. [2025-02-08 05:54:52,712 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 388 transitions. Word has length 11 [2025-02-08 05:54:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:52,712 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 388 transitions. [2025-02-08 05:54:52,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:54:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 388 transitions. [2025-02-08 05:54:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 05:54:52,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:52,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:52,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:54:52,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:52,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:52,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1225678995, now seen corresponding path program 1 times [2025-02-08 05:54:52,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:54:52,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1490485060] [2025-02-08 05:54:52,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:52,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:52,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:52,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:52,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:54:53,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 05:54:53,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 05:54:53,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:53,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:53,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:54:53,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:53,047 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:54:53,048 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:54:53,048 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:54:53,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-02-08 05:54:53,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:54:53,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-02-08 05:54:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:54:53,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:53,159 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:54:53,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490485060] [2025-02-08 05:54:53,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490485060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:53,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:54:53,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:54:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412315221] [2025-02-08 05:54:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:53,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:54:53,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:54:53,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:54:53,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:54:53,160 INFO L87 Difference]: Start difference. First operand 294 states and 388 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:54:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:53,569 INFO L93 Difference]: Finished difference Result 450 states and 599 transitions. [2025-02-08 05:54:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:54:53,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-02-08 05:54:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:53,571 INFO L225 Difference]: With dead ends: 450 [2025-02-08 05:54:53,572 INFO L226 Difference]: Without dead ends: 450 [2025-02-08 05:54:53,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:54:53,572 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 234 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 723 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-02-08 05:54:53,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 723 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 05:54:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-08 05:54:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 293. [2025-02-08 05:54:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 280 states have (on average 1.332142857142857) internal successors, (373), 286 states have internal predecessors, (373), 10 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 386 transitions. [2025-02-08 05:54:53,583 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 386 transitions. Word has length 11 [2025-02-08 05:54:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:53,583 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 386 transitions. [2025-02-08 05:54:53,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:54:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 386 transitions. [2025-02-08 05:54:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 05:54:53,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:53,585 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-02-08 05:54:53,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 05:54:53,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:53,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:53,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:53,786 INFO L85 PathProgramCache]: Analyzing trace with hash 783873220, now seen corresponding path program 1 times [2025-02-08 05:54:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:54:53,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234509907] [2025-02-08 05:54:53,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:53,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:53,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:53,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:53,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 05:54:53,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:54:54,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:54:54,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:54,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:54,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:54:54,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:54:54,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:54,272 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:54:54,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234509907] [2025-02-08 05:54:54,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234509907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:54,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:54:54,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:54:54,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703579830] [2025-02-08 05:54:54,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:54,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:54:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:54:54,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:54:54,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:54:54,275 INFO L87 Difference]: Start difference. First operand 293 states and 386 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-02-08 05:54:58,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 05:55:02,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 05:55:04,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 05:55:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:55:04,683 INFO L93 Difference]: Finished difference Result 312 states and 404 transitions. [2025-02-08 05:55:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:55:04,685 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-02-08 05:55:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:55:04,686 INFO L225 Difference]: With dead ends: 312 [2025-02-08 05:55:04,686 INFO L226 Difference]: Without dead ends: 312 [2025-02-08 05:55:04,686 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-02-08 05:55:04,687 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 446 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:55:04,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 444 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2025-02-08 05:55:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-08 05:55:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 244. [2025-02-08 05:55:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 237 states have internal predecessors, (302), 10 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:55:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 315 transitions. [2025-02-08 05:55:04,695 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 315 transitions. Word has length 81 [2025-02-08 05:55:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:55:04,696 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 315 transitions. [2025-02-08 05:55:04,696 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-02-08 05:55:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 315 transitions. [2025-02-08 05:55:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 05:55:04,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:55:04,698 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-02-08 05:55:04,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 05:55:04,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:04,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:55:04,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:55:04,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2113358575, now seen corresponding path program 1 times [2025-02-08 05:55:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:55:04,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728123264] [2025-02-08 05:55:04,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:55:04,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:04,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:55:04,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:55:04,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 05:55:05,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:55:05,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:55:05,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:55:05,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:55:05,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 05:55:05,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:55:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 05:55:05,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:55:05,212 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:55:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728123264] [2025-02-08 05:55:05,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728123264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:55:05,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:55:05,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:55:05,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521940788] [2025-02-08 05:55:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:55:05,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:55:05,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:55:05,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:55:05,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:55:05,214 INFO L87 Difference]: Start difference. First operand 244 states and 315 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-02-08 05:55:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:55:05,297 INFO L93 Difference]: Finished difference Result 250 states and 305 transitions. [2025-02-08 05:55:05,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:55:05,298 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-02-08 05:55:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:55:05,299 INFO L225 Difference]: With dead ends: 250 [2025-02-08 05:55:05,299 INFO L226 Difference]: Without dead ends: 250 [2025-02-08 05:55:05,299 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-02-08 05:55:05,299 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 30 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:55:05,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 683 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:55:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-08 05:55:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2025-02-08 05:55:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 237 states have (on average 1.2320675105485233) internal successors, (292), 243 states have internal predecessors, (292), 10 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:55:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2025-02-08 05:55:05,308 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 90 [2025-02-08 05:55:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:55:05,308 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2025-02-08 05:55:05,308 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-02-08 05:55:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2025-02-08 05:55:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 05:55:05,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:55:05,311 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-02-08 05:55:05,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 05:55:05,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:05,511 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:55:05,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:55:05,512 INFO L85 PathProgramCache]: Analyzing trace with hash 967884888, now seen corresponding path program 1 times [2025-02-08 05:55:05,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:55:05,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151709487] [2025-02-08 05:55:05,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:55:05,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:05,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:55:05,514 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:55:05,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 05:55:05,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:55:05,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:55:05,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:55:05,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:55:05,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 05:55:05,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:55:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:55:05,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:55:05,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:55:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151709487] [2025-02-08 05:55:05,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151709487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:55:05,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:55:05,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:55:05,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340854257] [2025-02-08 05:55:05,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:55:05,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:55:05,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:55:05,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:55:05,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:55:05,901 INFO L87 Difference]: Start difference. First operand 250 states and 305 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-02-08 05:55:10,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 05:55:14,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 05:55:17,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 05:55:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:55:17,585 INFO L93 Difference]: Finished difference Result 252 states and 307 transitions. [2025-02-08 05:55:17,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:55:17,586 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-02-08 05:55:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:55:17,588 INFO L225 Difference]: With dead ends: 252 [2025-02-08 05:55:17,588 INFO L226 Difference]: Without dead ends: 252 [2025-02-08 05:55:17,588 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-02-08 05:55:17,588 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 219 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2025-02-08 05:55:17,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 456 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2025-02-08 05:55:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-08 05:55:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2025-02-08 05:55:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 238 states have (on average 1.23109243697479) internal successors, (293), 244 states have internal predecessors, (293), 10 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:55:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 306 transitions. [2025-02-08 05:55:17,593 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 306 transitions. Word has length 90 [2025-02-08 05:55:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:55:17,593 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 306 transitions. [2025-02-08 05:55:17,593 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-02-08 05:55:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 306 transitions. [2025-02-08 05:55:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 05:55:17,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:55:17,598 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-02-08 05:55:17,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 05:55:17,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:17,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:55:17,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:55:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash 967914679, now seen corresponding path program 1 times [2025-02-08 05:55:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:55:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347645245] [2025-02-08 05:55:17,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:55:17,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:55:17,801 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:55:17,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 05:55:18,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:55:18,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:55:18,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:55:18,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:55:18,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 05:55:18,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:55:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:55:18,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:55:18,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:55:18,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347645245] [2025-02-08 05:55:18,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347645245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:55:18,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:55:18,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:55:18,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344666505] [2025-02-08 05:55:18,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:55:18,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:55:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:55:18,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:55:18,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:55:18,149 INFO L87 Difference]: Start difference. First operand 251 states and 306 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-02-08 05:55:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:55:18,186 INFO L93 Difference]: Finished difference Result 254 states and 310 transitions. [2025-02-08 05:55:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:55:18,187 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-02-08 05:55:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:55:18,189 INFO L225 Difference]: With dead ends: 254 [2025-02-08 05:55:18,189 INFO L226 Difference]: Without dead ends: 254 [2025-02-08 05:55:18,189 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-02-08 05:55:18,190 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:55:18,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 743 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:55:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-08 05:55:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-02-08 05:55:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 240 states have (on average 1.2333333333333334) internal successors, (296), 247 states have internal predecessors, (296), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:55:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 310 transitions. [2025-02-08 05:55:18,195 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 310 transitions. Word has length 90 [2025-02-08 05:55:18,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:55:18,195 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 310 transitions. [2025-02-08 05:55:18,195 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-02-08 05:55:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 310 transitions. [2025-02-08 05:55:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-08 05:55:18,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:55:18,196 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-02-08 05:55:18,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 05:55:18,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:18,397 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:55:18,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:55:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1268601051, now seen corresponding path program 1 times [2025-02-08 05:55:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:55:18,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207429775] [2025-02-08 05:55:18,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:55:18,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:18,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:55:18,399 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:55:18,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 05:55:18,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:55:18,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:55:18,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:55:18,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:55:18,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:55:18,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:55:18,733 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:55:18,733 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:55:18,734 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:55:18,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-02-08 05:55:18,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:55:18,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-02-08 05:55:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:55:18,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:55:18,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:55:18,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207429775] [2025-02-08 05:55:18,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207429775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:55:18,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:55:18,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:55:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051502528] [2025-02-08 05:55:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:55:18,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:55:18,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:55:18,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:55:18,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:55:18,807 INFO L87 Difference]: Start difference. First operand 254 states and 310 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-02-08 05:55:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:55:19,195 INFO L93 Difference]: Finished difference Result 362 states and 454 transitions. [2025-02-08 05:55:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:55:19,195 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 92 [2025-02-08 05:55:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:55:19,197 INFO L225 Difference]: With dead ends: 362 [2025-02-08 05:55:19,197 INFO L226 Difference]: Without dead ends: 362 [2025-02-08 05:55:19,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:55:19,197 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 181 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 728 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-02-08 05:55:19,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 728 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 05:55:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-08 05:55:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 256. [2025-02-08 05:55:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 242 states have (on average 1.2314049586776858) internal successors, (298), 249 states have internal predecessors, (298), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:55:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 312 transitions. [2025-02-08 05:55:19,202 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 312 transitions. Word has length 92 [2025-02-08 05:55:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:55:19,202 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 312 transitions. [2025-02-08 05:55:19,202 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-02-08 05:55:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 312 transitions. [2025-02-08 05:55:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-08 05:55:19,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:55:19,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:55:19,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 05:55:19,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:19,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:55:19,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:55:19,407 INFO L85 PathProgramCache]: Analyzing trace with hash 900666720, now seen corresponding path program 1 times [2025-02-08 05:55:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:55:19,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087581779] [2025-02-08 05:55:19,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:55:19,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:19,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:55:19,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:55:19,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 05:55:19,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 05:55:19,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 05:55:19,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:55:19,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:55:19,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 05:55:19,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:55:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 05:55:19,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:55:19,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:55:19,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087581779] [2025-02-08 05:55:19,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087581779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:55:19,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:55:19,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:55:19,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539946936] [2025-02-08 05:55:19,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:55:19,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:55:19,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:55:19,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:55:19,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:55:19,787 INFO L87 Difference]: Start difference. First operand 256 states and 312 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:55:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:55:19,872 INFO L93 Difference]: Finished difference Result 259 states and 307 transitions. [2025-02-08 05:55:19,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:55:19,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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 126 [2025-02-08 05:55:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:55:19,874 INFO L225 Difference]: With dead ends: 259 [2025-02-08 05:55:19,874 INFO L226 Difference]: Without dead ends: 259 [2025-02-08 05:55:19,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:55:19,875 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 30 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:55:19,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 650 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:55:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-08 05:55:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-02-08 05:55:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 245 states have (on average 1.1959183673469387) internal successors, (293), 252 states have internal predecessors, (293), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:55:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 307 transitions. [2025-02-08 05:55:19,880 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 307 transitions. Word has length 126 [2025-02-08 05:55:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:55:19,880 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 307 transitions. [2025-02-08 05:55:19,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:55:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 307 transitions. [2025-02-08 05:55:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-08 05:55:19,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:55:19,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:55:19,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 05:55:20,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:20,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:55:20,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:55:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash -234848839, now seen corresponding path program 1 times [2025-02-08 05:55:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:55:20,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832737291] [2025-02-08 05:55:20,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:55:20,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:20,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:55:20,088 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:55:20,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 05:55:20,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 05:55:20,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 05:55:20,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:55:20,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:55:20,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:55:20,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:55:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:55:20,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:55:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:55:20,548 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:55:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832737291] [2025-02-08 05:55:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832737291] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:55:20,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:55:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-08 05:55:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351947189] [2025-02-08 05:55:20,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:55:20,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:55:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:55:20,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:55:20,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:55:20,550 INFO L87 Difference]: Start difference. First operand 259 states and 307 transitions. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 05:55:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:55:20,688 INFO L93 Difference]: Finished difference Result 270 states and 324 transitions. [2025-02-08 05:55:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:55:20,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2025-02-08 05:55:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:55:20,690 INFO L225 Difference]: With dead ends: 270 [2025-02-08 05:55:20,690 INFO L226 Difference]: Without dead ends: 270 [2025-02-08 05:55:20,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 244 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-02-08 05:55:20,690 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:55:20,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 710 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:55:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-08 05:55:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2025-02-08 05:55:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 253 states have (on average 1.2134387351778657) internal successors, (307), 260 states have internal predecessors, (307), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 05:55:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 322 transitions. [2025-02-08 05:55:20,695 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 322 transitions. Word has length 126 [2025-02-08 05:55:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:55:20,696 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 322 transitions. [2025-02-08 05:55:20,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 05:55:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 322 transitions. [2025-02-08 05:55:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-08 05:55:20,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:55:20,697 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:55:20,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 05:55:20,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:20,898 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:55:20,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:55:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash -578591243, now seen corresponding path program 2 times [2025-02-08 05:55:20,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:55:20,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398987206] [2025-02-08 05:55:20,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:55:20,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:20,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:55:20,900 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:55:20,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 05:55:21,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-02-08 05:55:21,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 05:55:21,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:55:21,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:55:21,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:55:21,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:55:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 05:55:21,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:55:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 05:55:21,541 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:55:21,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398987206] [2025-02-08 05:55:21,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398987206] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:55:21,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:55:21,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-08 05:55:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202275930] [2025-02-08 05:55:21,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:55:21,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:55:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:55:21,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:55:21,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:55:21,542 INFO L87 Difference]: Start difference. First operand 268 states and 322 transitions. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 05:55:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:55:21,751 INFO L93 Difference]: Finished difference Result 276 states and 332 transitions. [2025-02-08 05:55:21,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 05:55:21,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 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 130 [2025-02-08 05:55:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:55:21,752 INFO L225 Difference]: With dead ends: 276 [2025-02-08 05:55:21,752 INFO L226 Difference]: Without dead ends: 274 [2025-02-08 05:55:21,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:55:21,753 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 5 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:55:21,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1184 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:55:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-08 05:55:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2025-02-08 05:55:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 257 states have (on average 1.2178988326848248) internal successors, (313), 264 states have internal predecessors, (313), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:55:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 327 transitions. [2025-02-08 05:55:21,757 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 327 transitions. Word has length 130 [2025-02-08 05:55:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:55:21,757 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 327 transitions. [2025-02-08 05:55:21,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 05:55:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 327 transitions. [2025-02-08 05:55:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-08 05:55:21,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:55:21,758 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:55:21,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 05:55:21,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:21,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:55:21,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:55:21,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1912437301, now seen corresponding path program 3 times [2025-02-08 05:55:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:55:21,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122656773] [2025-02-08 05:55:21,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:55:21,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:55:21,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:55:21,962 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:55:21,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 05:55:22,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 6 equivalence classes. [2025-02-08 05:55:22,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 117 of 134 statements. [2025-02-08 05:55:22,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 05:55:22,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:55:22,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 05:55:22,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:55:22,407 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:55:22,407 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:55:22,408 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:55:22,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-02-08 05:55:24,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:55:24,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 87 [2025-02-08 05:55:24,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:55:24,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 74 [2025-02-08 05:55:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-08 05:55:24,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:55:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-08 05:55:24,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:55:24,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122656773] [2025-02-08 05:55:24,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122656773] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:55:24,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:55:24,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2025-02-08 05:55:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671243124] [2025-02-08 05:55:24,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:55:24,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 05:55:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:55:24,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 05:55:24,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:55:24,548 INFO L87 Difference]: Start difference. First operand 272 states and 327 transitions. Second operand has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 05:55:28,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:55:33,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:55:37,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:55:41,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:55:45,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:55:49,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:55:53,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:55:57,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:56:01,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:56:06,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:56:10,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:56:14,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:56:18,352 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]