./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:07:06,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:07:06,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:07:06,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:07:06,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:07:06,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:07:06,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:07:06,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:07:06,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:07:06,736 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:07:06,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:07:06,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:07:06,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:07:06,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:07:06,737 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:07:06,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:07:06,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:07:06,737 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:07:06,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:07:06,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:07:06,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:07:06,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:07:06,737 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:07:06,737 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:07:06,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:07:06,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:07:06,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:07:06,738 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:07:06,738 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:07:06,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:07:06,738 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:07:06,738 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:07:06,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:07:06,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:07:06,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:07:06,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:07:06,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:07:06,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:07:06,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:07:06,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:07:06,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:07:06,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:07:06,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:07:06,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:07:06,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:07:06,739 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2025-03-04 07:07:06,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:07:06,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:07:06,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:07:06,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:07:06,984 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:07:06,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2025-03-04 07:07:08,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b59e9a0a/83d3ea533c6a43e5a8cd858516ac3cd4/FLAGf9d33d295 [2025-03-04 07:07:08,494 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:07:08,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2025-03-04 07:07:08,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b59e9a0a/83d3ea533c6a43e5a8cd858516ac3cd4/FLAGf9d33d295 [2025-03-04 07:07:08,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b59e9a0a/83d3ea533c6a43e5a8cd858516ac3cd4 [2025-03-04 07:07:08,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:07:08,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:07:08,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:07:08,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:07:08,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:07:08,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:07:08" (1/1) ... [2025-03-04 07:07:08,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c17987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:08, skipping insertion in model container [2025-03-04 07:07:08,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:07:08" (1/1) ... [2025-03-04 07:07:08,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:07:09,069 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,098 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,103 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,106 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,112 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,129 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,130 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,131 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,131 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,133 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,135 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,135 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,136 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,139 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:09,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:07:09,157 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2025-03-04 07:07:09,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@30010648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:09, skipping insertion in model container [2025-03-04 07:07:09,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:07:09,158 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-04 07:07:09,161 INFO L158 Benchmark]: Toolchain (without parser) took 376.17ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 100.8MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:07:09,161 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:07:09,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.49ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 100.8MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:07:09,163 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.13ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.49ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 100.8MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:07:10,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:07:10,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-03-04 07:07:10,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:07:10,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:07:10,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:07:10,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:07:10,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:07:10,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:07:10,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:07:10,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:07:10,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:07:10,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:07:10,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:07:10,882 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:07:10,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:07:10,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:07:10,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:07:10,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:07:10,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:07:10,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:07:10,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:07:10,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:07:10,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:07:10,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:07:10,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:07:10,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:07:10,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:07:10,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:07:10,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:07:10,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:07:10,884 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:07:10,885 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:07:10,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:07:10,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:07:10,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:07:10,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:07:10,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2025-03-04 07:07:11,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:07:11,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:07:11,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:07:11,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:07:11,115 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:07:11,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2025-03-04 07:07:12,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244ac844e/f92a9a9b4ca74562b975e9c82267f12f/FLAG896a6f74f [2025-03-04 07:07:12,545 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:07:12,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2025-03-04 07:07:12,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244ac844e/f92a9a9b4ca74562b975e9c82267f12f/FLAG896a6f74f [2025-03-04 07:07:12,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244ac844e/f92a9a9b4ca74562b975e9c82267f12f [2025-03-04 07:07:12,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:07:12,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:07:12,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:07:12,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:07:12,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:07:12,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:07:12" (1/1) ... [2025-03-04 07:07:12,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9c0ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:12, skipping insertion in model container [2025-03-04 07:07:12,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:07:12" (1/1) ... [2025-03-04 07:07:12,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:07:12,868 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,898 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,902 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,904 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,909 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,940 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,940 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,942 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,942 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,944 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,945 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,946 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,946 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,949 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:12,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:07:12,968 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-04 07:07:12,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:07:13,006 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,022 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,024 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,025 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,028 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,041 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,041 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,043 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,043 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,044 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,045 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,045 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,046 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,047 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:13,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:07:13,052 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:07:13,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:07:13,137 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:07:13,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13 WrapperNode [2025-03-04 07:07:13,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:07:13,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:07:13,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:07:13,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:07:13,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,209 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 973 [2025-03-04 07:07:13,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:07:13,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:07:13,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:07:13,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:07:13,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,277 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [217, 2, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [50, 0, 4]. [2025-03-04 07:07:13,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:07:13,339 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:07:13,339 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:07:13,339 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:07:13,340 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (1/1) ... [2025-03-04 07:07:13,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:07:13,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:13,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:07:13,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:07:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:07:13,383 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:07:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 07:07:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 07:07:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 07:07:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:07:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:07:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 07:07:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 07:07:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 07:07:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 07:07:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 07:07:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 07:07:13,385 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 07:07:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:07:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:07:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:07:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:07:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:07:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 07:07:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:07:13,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:07:13,561 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:07:13,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:07:20,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 07:07:20,188 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-04 07:07:20,189 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:07:20,201 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:07:20,202 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:07:20,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:07:20 BoogieIcfgContainer [2025-03-04 07:07:20,203 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:07:20,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:07:20,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:07:20,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:07:20,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:07:12" (1/3) ... [2025-03-04 07:07:20,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657d8b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:07:20, skipping insertion in model container [2025-03-04 07:07:20,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:13" (2/3) ... [2025-03-04 07:07:20,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657d8b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:07:20, skipping insertion in model container [2025-03-04 07:07:20,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:07:20" (3/3) ... [2025-03-04 07:07:20,211 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2025-03-04 07:07:20,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:07:20,222 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test7-1.i that has 5 procedures, 199 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-03-04 07:07:20,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:07:20,266 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;@624fb27f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:07:20,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:07:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 181 states have (on average 1.6629834254143647) internal successors, (301), 184 states have internal predecessors, (301), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 07:07:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:07:20,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:20,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:07:20,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:20,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1139225275, now seen corresponding path program 1 times [2025-03-04 07:07:20,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:20,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743062464] [2025-03-04 07:07:20,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:07:20,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:20,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:20,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:20,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:07:20,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:07:20,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:07:20,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:07:20,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:20,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 07:07:20,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:07:20,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:07:20,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:20,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743062464] [2025-03-04 07:07:20,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743062464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:07:20,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:07:20,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:07:20,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954596341] [2025-03-04 07:07:20,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:07:20,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:07:20,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:20,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:07:20,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:07:20,461 INFO L87 Difference]: Start difference. First operand has 191 states, 181 states have (on average 1.6629834254143647) internal successors, (301), 184 states have internal predecessors, (301), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:07:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:20,479 INFO L93 Difference]: Finished difference Result 188 states and 243 transitions. [2025-03-04 07:07:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:07:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 07:07:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:20,486 INFO L225 Difference]: With dead ends: 188 [2025-03-04 07:07:20,487 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 07:07:20,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:07:20,492 INFO L435 NwaCegarLoop]: 243 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, 243 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:20,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:07:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 07:07:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-04 07:07:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 178 states have (on average 1.3089887640449438) internal successors, (233), 180 states have internal predecessors, (233), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:07:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2025-03-04 07:07:20,533 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 8 [2025-03-04 07:07:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:20,533 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2025-03-04 07:07:20,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:07:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2025-03-04 07:07:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:07:20,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:20,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:07:20,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:07:20,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:20,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:20,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1246593164, now seen corresponding path program 1 times [2025-03-04 07:07:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:20,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215485781] [2025-03-04 07:07:20,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:07:20,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:20,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:20,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:07:20,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:07:20,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:07:20,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:07:20,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:20,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:07:20,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:20,897 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:07:20,898 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:07:20,899 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:07:20,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-04 07:07:20,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:07:20,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-03-04 07:07:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:07:20,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:07:20,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:20,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215485781] [2025-03-04 07:07:20,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215485781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:07:20,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:07:20,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:07:20,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425611062] [2025-03-04 07:07:20,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:07:20,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:07:20,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:20,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:07:20,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:07:20,994 INFO L87 Difference]: Start difference. First operand 186 states and 241 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:07:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:21,640 INFO L93 Difference]: Finished difference Result 360 states and 471 transitions. [2025-03-04 07:07:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:07:21,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:07:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:21,642 INFO L225 Difference]: With dead ends: 360 [2025-03-04 07:07:21,642 INFO L226 Difference]: Without dead ends: 360 [2025-03-04 07:07:21,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:07:21,643 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 219 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:21,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 655 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:07:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-04 07:07:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 188. [2025-03-04 07:07:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 180 states have (on average 1.3055555555555556) internal successors, (235), 182 states have internal predecessors, (235), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:07:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 243 transitions. [2025-03-04 07:07:21,652 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 243 transitions. Word has length 10 [2025-03-04 07:07:21,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:21,653 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 243 transitions. [2025-03-04 07:07:21,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:07:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 243 transitions. [2025-03-04 07:07:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 07:07:21,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:21,654 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:07:21,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:07:21,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:21,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1088803930, now seen corresponding path program 1 times [2025-03-04 07:07:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:21,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087996541] [2025-03-04 07:07:21,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:07:21,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:21,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:21,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:21,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:07:22,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 07:07:22,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 07:07:22,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:07:22,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:22,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:07:22,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:07:22,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:07:22,411 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:22,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087996541] [2025-03-04 07:07:22,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087996541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:07:22,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:07:22,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:07:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932146307] [2025-03-04 07:07:22,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:07:22,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:07:22,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:22,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:07:22,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:07:22,412 INFO L87 Difference]: Start difference. First operand 188 states and 243 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:07:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:22,787 INFO L93 Difference]: Finished difference Result 292 states and 381 transitions. [2025-03-04 07:07:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:07:22,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2025-03-04 07:07:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:22,788 INFO L225 Difference]: With dead ends: 292 [2025-03-04 07:07:22,788 INFO L226 Difference]: Without dead ends: 292 [2025-03-04 07:07:22,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:07:22,789 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 99 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:22,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 498 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:07:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-04 07:07:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2025-03-04 07:07:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 281 states have (on average 1.3167259786476868) internal successors, (370), 283 states have internal predecessors, (370), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:07:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 378 transitions. [2025-03-04 07:07:22,813 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 378 transitions. Word has length 64 [2025-03-04 07:07:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:22,814 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 378 transitions. [2025-03-04 07:07:22,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:07:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 378 transitions. [2025-03-04 07:07:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 07:07:22,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:22,815 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] [2025-03-04 07:07:22,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:07:23,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:23,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:23,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:23,017 INFO L85 PathProgramCache]: Analyzing trace with hash -656722730, now seen corresponding path program 1 times [2025-03-04 07:07:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381796763] [2025-03-04 07:07:23,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:07:23,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:23,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:23,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:23,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:07:23,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 07:07:23,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 07:07:23,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:07:23,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:23,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:07:23,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:07:23,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:07:23,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381796763] [2025-03-04 07:07:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381796763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:07:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:07:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:07:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786679871] [2025-03-04 07:07:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:07:23,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:07:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:23,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:07:23,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:07:23,554 INFO L87 Difference]: Start difference. First operand 289 states and 378 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:27,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:07:31,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:07:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:33,269 INFO L93 Difference]: Finished difference Result 375 states and 491 transitions. [2025-03-04 07:07:33,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:07:33,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 79 [2025-03-04 07:07:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:33,272 INFO L225 Difference]: With dead ends: 375 [2025-03-04 07:07:33,272 INFO L226 Difference]: Without dead ends: 375 [2025-03-04 07:07:33,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:07:33,272 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 475 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:33,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 421 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2025-03-04 07:07:33,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-04 07:07:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2025-03-04 07:07:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 364 states have (on average 1.3186813186813187) internal successors, (480), 366 states have internal predecessors, (480), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:07:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 488 transitions. [2025-03-04 07:07:33,295 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 488 transitions. Word has length 79 [2025-03-04 07:07:33,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:33,296 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 488 transitions. [2025-03-04 07:07:33,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 488 transitions. [2025-03-04 07:07:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 07:07:33,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:33,298 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:07:33,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:07:33,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:33,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:33,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash 250028671, now seen corresponding path program 1 times [2025-03-04 07:07:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:33,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411589301] [2025-03-04 07:07:33,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:07:33,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:33,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:33,503 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:33,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:07:33,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 07:07:33,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 07:07:33,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:07:33,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:33,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:07:33,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:07:33,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:07:33,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:33,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411589301] [2025-03-04 07:07:33,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411589301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:07:33,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:07:33,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:07:33,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824190436] [2025-03-04 07:07:33,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:07:33,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:07:33,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:33,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:07:33,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:07:33,840 INFO L87 Difference]: Start difference. First operand 372 states and 488 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:33,928 INFO L93 Difference]: Finished difference Result 378 states and 478 transitions. [2025-03-04 07:07:33,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:07:33,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 1 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 81 [2025-03-04 07:07:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:33,934 INFO L225 Difference]: With dead ends: 378 [2025-03-04 07:07:33,934 INFO L226 Difference]: Without dead ends: 378 [2025-03-04 07:07:33,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:07:33,934 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 30 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:33,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 617 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:07:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-04 07:07:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-03-04 07:07:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 370 states have (on average 1.2702702702702702) internal successors, (470), 372 states have internal predecessors, (470), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:07:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 478 transitions. [2025-03-04 07:07:33,943 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 478 transitions. Word has length 81 [2025-03-04 07:07:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:33,943 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 478 transitions. [2025-03-04 07:07:33,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 478 transitions. [2025-03-04 07:07:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 07:07:33,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:33,945 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:07:33,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:07:34,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:34,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:34,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash -380437672, now seen corresponding path program 1 times [2025-03-04 07:07:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250336591] [2025-03-04 07:07:34,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:07:34,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:34,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:34,148 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:34,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:07:34,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 07:07:34,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 07:07:34,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:07:34,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:34,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:07:34,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:07:34,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:07:34,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:34,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250336591] [2025-03-04 07:07:34,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250336591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:07:34,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:07:34,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:07:34,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855329525] [2025-03-04 07:07:34,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:07:34,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:07:34,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:34,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:07:34,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:07:34,526 INFO L87 Difference]: Start difference. First operand 378 states and 478 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:34,560 INFO L93 Difference]: Finished difference Result 381 states and 482 transitions. [2025-03-04 07:07:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:07:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2025-03-04 07:07:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:34,563 INFO L225 Difference]: With dead ends: 381 [2025-03-04 07:07:34,564 INFO L226 Difference]: Without dead ends: 381 [2025-03-04 07:07:34,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:07:34,564 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:34,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 677 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:07:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-04 07:07:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-03-04 07:07:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 372 states have (on average 1.271505376344086) internal successors, (473), 375 states have internal predecessors, (473), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:07:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 482 transitions. [2025-03-04 07:07:34,573 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 482 transitions. Word has length 81 [2025-03-04 07:07:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:34,573 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 482 transitions. [2025-03-04 07:07:34,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 482 transitions. [2025-03-04 07:07:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 07:07:34,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:34,574 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] [2025-03-04 07:07:34,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:07:34,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:34,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:34,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2126645580, now seen corresponding path program 1 times [2025-03-04 07:07:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:34,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [786710809] [2025-03-04 07:07:34,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:07:34,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:34,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:34,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:07:34,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 07:07:35,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 07:07:35,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:07:35,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:35,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:07:35,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:07:35,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:07:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:07:35,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786710809] [2025-03-04 07:07:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786710809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:07:35,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:07:35,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 07:07:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467648198] [2025-03-04 07:07:35,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:07:35,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:07:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:35,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:07:35,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:07:35,218 INFO L87 Difference]: Start difference. First operand 381 states and 482 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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-03-04 07:07:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:35,347 INFO L93 Difference]: Finished difference Result 392 states and 499 transitions. [2025-03-04 07:07:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:07:35,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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 83 [2025-03-04 07:07:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:35,349 INFO L225 Difference]: With dead ends: 392 [2025-03-04 07:07:35,349 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 07:07:35,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:07:35,350 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 5 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:35,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 677 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:07:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 07:07:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2025-03-04 07:07:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 380 states have (on average 1.2815789473684212) internal successors, (487), 383 states have internal predecessors, (487), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:07:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 497 transitions. [2025-03-04 07:07:35,357 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 497 transitions. Word has length 83 [2025-03-04 07:07:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:35,357 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 497 transitions. [2025-03-04 07:07:35,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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-03-04 07:07:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 497 transitions. [2025-03-04 07:07:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 07:07:35,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:35,358 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] [2025-03-04 07:07:35,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:07:35,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:35,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:35,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:35,563 INFO L85 PathProgramCache]: Analyzing trace with hash 562804664, now seen corresponding path program 2 times [2025-03-04 07:07:35,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:35,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575777860] [2025-03-04 07:07:35,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:07:35,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:35,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:35,566 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:35,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:07:35,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-04 07:07:35,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 87 statements. [2025-03-04 07:07:35,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:07:35,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:35,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:07:35,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:35,793 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:07:35,797 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:07:35,797 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:07:35,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-04 07:07:35,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:07:35,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-03-04 07:07:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 07:07:35,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:07:35,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575777860] [2025-03-04 07:07:35,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575777860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:07:35,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:07:35,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:07:35,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646075339] [2025-03-04 07:07:35,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:07:35,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:07:35,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:35,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:07:35,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:07:35,877 INFO L87 Difference]: Start difference. First operand 390 states and 497 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:36,331 INFO L93 Difference]: Finished difference Result 532 states and 683 transitions. [2025-03-04 07:07:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:07:36,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 87 [2025-03-04 07:07:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:36,333 INFO L225 Difference]: With dead ends: 532 [2025-03-04 07:07:36,333 INFO L226 Difference]: Without dead ends: 532 [2025-03-04 07:07:36,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:07:36,334 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 201 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:36,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 667 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:07:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-04 07:07:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 392. [2025-03-04 07:07:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 382 states have (on average 1.280104712041885) internal successors, (489), 385 states have internal predecessors, (489), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:07:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 499 transitions. [2025-03-04 07:07:36,341 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 499 transitions. Word has length 87 [2025-03-04 07:07:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:36,341 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 499 transitions. [2025-03-04 07:07:36,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 499 transitions. [2025-03-04 07:07:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 07:07:36,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:36,343 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:07:36,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:07:36,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:36,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:36,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash 102347593, now seen corresponding path program 1 times [2025-03-04 07:07:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:36,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75562135] [2025-03-04 07:07:36,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:07:36,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:36,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:36,546 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:36,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:07:36,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 07:07:36,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 07:07:36,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:07:36,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:36,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:07:36,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 07:07:36,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:07:36,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:36,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75562135] [2025-03-04 07:07:36,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75562135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:07:36,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:07:36,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:07:36,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313598960] [2025-03-04 07:07:36,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:07:36,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:07:36,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:36,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:07:36,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:07:36,919 INFO L87 Difference]: Start difference. First operand 392 states and 499 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:37,030 INFO L93 Difference]: Finished difference Result 452 states and 559 transitions. [2025-03-04 07:07:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:07:37,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 129 [2025-03-04 07:07:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:37,032 INFO L225 Difference]: With dead ends: 452 [2025-03-04 07:07:37,032 INFO L226 Difference]: Without dead ends: 452 [2025-03-04 07:07:37,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:07:37,032 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 8 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:37,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 405 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:07:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-04 07:07:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2025-03-04 07:07:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 442 states have (on average 1.242081447963801) internal successors, (549), 445 states have internal predecessors, (549), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:07:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 559 transitions. [2025-03-04 07:07:37,043 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 559 transitions. Word has length 129 [2025-03-04 07:07:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:37,043 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 559 transitions. [2025-03-04 07:07:37,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 559 transitions. [2025-03-04 07:07:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 07:07:37,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:37,045 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:07:37,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:07:37,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:37,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:37,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash 357084138, now seen corresponding path program 1 times [2025-03-04 07:07:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269872003] [2025-03-04 07:07:37,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:07:37,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:37,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:37,252 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:37,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:07:37,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 07:07:37,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 07:07:37,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:07:37,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:37,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:07:37,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 07:07:37,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:07:37,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:37,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269872003] [2025-03-04 07:07:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269872003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:07:37,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:07:37,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:07:37,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447693890] [2025-03-04 07:07:37,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:07:37,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:07:37,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:37,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:07:37,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:07:37,666 INFO L87 Difference]: Start difference. First operand 452 states and 559 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:37,772 INFO L93 Difference]: Finished difference Result 401 states and 475 transitions. [2025-03-04 07:07:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:07:37,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 129 [2025-03-04 07:07:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:37,774 INFO L225 Difference]: With dead ends: 401 [2025-03-04 07:07:37,774 INFO L226 Difference]: Without dead ends: 401 [2025-03-04 07:07:37,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:07:37,775 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 32 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:37,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 580 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:07:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-04 07:07:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-03-04 07:07:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 391 states have (on average 1.1892583120204603) internal successors, (465), 394 states have internal predecessors, (465), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:07:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 475 transitions. [2025-03-04 07:07:37,781 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 475 transitions. Word has length 129 [2025-03-04 07:07:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:37,781 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 475 transitions. [2025-03-04 07:07:37,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:07:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 475 transitions. [2025-03-04 07:07:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 07:07:37,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:37,782 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:07:37,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:07:37,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:37,983 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:37,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash -778431421, now seen corresponding path program 1 times [2025-03-04 07:07:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:37,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226765743] [2025-03-04 07:07:37,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:07:37,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:37,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:37,987 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:37,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:07:38,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 07:07:38,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 07:07:38,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:07:38,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:38,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:07:38,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:07:38,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:07:38,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-03-04 07:07:38,541 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:38,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226765743] [2025-03-04 07:07:38,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226765743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:07:38,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:07:38,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-04 07:07:38,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156090381] [2025-03-04 07:07:38,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:07:38,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:07:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:38,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:07:38,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:07:38,543 INFO L87 Difference]: Start difference. First operand 401 states and 475 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:07:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:07:38,767 INFO L93 Difference]: Finished difference Result 409 states and 485 transitions. [2025-03-04 07:07:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:07:38,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 129 [2025-03-04 07:07:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:07:38,769 INFO L225 Difference]: With dead ends: 409 [2025-03-04 07:07:38,769 INFO L226 Difference]: Without dead ends: 407 [2025-03-04 07:07:38,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:07:38,770 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 6 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:07:38,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1496 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:07:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-04 07:07:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2025-03-04 07:07:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 395 states have (on average 1.1924050632911392) internal successors, (471), 398 states have internal predecessors, (471), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:07:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 480 transitions. [2025-03-04 07:07:38,777 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 480 transitions. Word has length 129 [2025-03-04 07:07:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:07:38,777 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 480 transitions. [2025-03-04 07:07:38,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:07:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 480 transitions. [2025-03-04 07:07:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 07:07:38,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:07:38,778 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:07:38,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:07:38,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:38,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:07:38,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:07:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 694434435, now seen corresponding path program 2 times [2025-03-04 07:07:38,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:07:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846751461] [2025-03-04 07:07:38,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:07:38,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:07:38,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:38,982 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:07:38,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:07:39,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-04 07:07:39,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 07:07:39,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:07:39,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:39,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:07:39,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:39,472 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:07:39,472 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:07:39,473 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:07:39,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-04 07:07:40,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:07:40,787 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 162 treesize of output 71 [2025-03-04 07:07:40,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:07:40,878 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 98 treesize of output 58 [2025-03-04 07:07:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 07:07:40,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:07:41,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:07:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846751461] [2025-03-04 07:07:41,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846751461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:07:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [177827097] [2025-03-04 07:07:41,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:07:41,118 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:07:41,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:07:41,140 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:07:41,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-03-04 07:07:41,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-04 07:07:41,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 07:07:41,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:07:41,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:07:41,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:07:42,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:07:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 40 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:07:42,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:07:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:07:42,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [177827097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:07:42,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:07:42,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2025-03-04 07:07:42,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299135626] [2025-03-04 07:07:42,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:07:42,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:07:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:07:42,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:07:42,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:07:42,759 INFO L87 Difference]: Start difference. First operand 405 states and 480 transitions. Second operand has 23 states, 23 states have (on average 8.869565217391305) internal successors, (204), 23 states have internal predecessors, (204), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:07:49,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:07:54,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:07:58,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:02,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:06,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:10,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:14,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:18,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:22,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:26,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:30,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:34,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:38,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:43,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:08:47,118 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]