./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:47:56,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:47:56,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-10 14:47:56,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:47:56,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:47:56,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:47:56,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:47:56,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:47:56,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:47:56,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:47:56,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:47:56,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:47:56,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:47:56,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:47:56,737 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:47:56,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:47:56,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:47:56,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:47:56,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:47:56,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:47:56,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:47:56,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:47:56,742 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:47:56,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:47:56,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:47:56,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:47:56,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:47:56,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:47:56,743 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:47:56,743 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:47:56,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:47:56,744 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:47:56,744 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:47:56,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:47:56,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:47:56,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:47:56,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:47:56,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:47:56,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:47:56,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:47:56,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:47:56,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:47:56,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:47:56,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:47:56,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:47:56,748 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-10 14:47:56,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:47:56,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:47:56,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:47:56,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:47:56,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:47:56,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-10 14:47:58,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:47:58,529 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:47:58,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-10 14:47:58,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf7b465e/f4ecb4d525bb40779b44a89c934f252a/FLAG632175fb9 [2024-11-10 14:47:58,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf7b465e/f4ecb4d525bb40779b44a89c934f252a [2024-11-10 14:47:58,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:47:58,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:47:58,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:47:58,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:47:58,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:47:58,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:47:58" (1/1) ... [2024-11-10 14:47:58,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4003fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:47:58, skipping insertion in model container [2024-11-10 14:47:58,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:47:58" (1/1) ... [2024-11-10 14:47:58,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:47:59,303 WARN L610 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-10 14:47:59,307 WARN L610 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-10 14:47:59,308 WARN L610 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-10 14:47:59,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:47:59,342 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) [2024-11-10 14:47:59,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@57f70d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:47:59, skipping insertion in model container [2024-11-10 14:47:59,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:47:59,343 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 14:47:59,345 INFO L158 Benchmark]: Toolchain (without parser) took 457.05ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 81.2MB in the beginning and 176.7MB in the end (delta: -95.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-10 14:47:59,345 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory was 105.2MB in the beginning and 105.1MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:47:59,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.97ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 80.9MB in the beginning and 176.7MB in the end (delta: -95.8MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-10 14:47:59,348 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.16ms. Allocated memory is still 155.2MB. Free memory was 105.2MB in the beginning and 105.1MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.97ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 80.9MB in the beginning and 176.7MB in the end (delta: -95.8MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: 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/11.0.12-open/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.5.800.v20200727-1323.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/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:48:01,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:48:01,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-10 14:48:01,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:48:01,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:48:01,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:48:01,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:48:01,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:48:01,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:48:01,260 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:48:01,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:48:01,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:48:01,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:48:01,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:48:01,262 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:48:01,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:48:01,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:48:01,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:48:01,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:48:01,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:48:01,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:48:01,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:48:01,266 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:48:01,267 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:48:01,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:48:01,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:48:01,270 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:48:01,270 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 14:48:01,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:48:01,270 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 14:48:01,270 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:48:01,270 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:48:01,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:48:01,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:48:01,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:48:01,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:48:01,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:48:01,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:48:01,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:48:01,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:48:01,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:48:01,273 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 14:48:01,273 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 14:48:01,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:48:01,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:48:01,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:48:01,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:48:01,274 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-10 14:48:01,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:48:01,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:48:01,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:48:01,562 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:48:01,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:48:01,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-10 14:48:02,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:48:03,191 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:48:03,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-10 14:48:03,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3967cc87/115189dde47f44ed874c17e731952b94/FLAG21eb6b356 [2024-11-10 14:48:03,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3967cc87/115189dde47f44ed874c17e731952b94 [2024-11-10 14:48:03,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:48:03,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:48:03,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:48:03,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:48:03,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:48:03,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:48:03" (1/1) ... [2024-11-10 14:48:03,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b7b82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:03, skipping insertion in model container [2024-11-10 14:48:03,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:48:03" (1/1) ... [2024-11-10 14:48:03,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:48:04,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:48:04,247 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 14:48:04,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:48:04,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:48:04,309 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:48:04,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:48:04,405 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:48:04,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04 WrapperNode [2024-11-10 14:48:04,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:48:04,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:48:04,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:48:04,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:48:04,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,457 INFO L138 Inliner]: procedures = 235, calls = 76, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 116 [2024-11-10 14:48:04,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:48:04,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:48:04,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:48:04,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:48:04,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,527 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-11-10 14:48:04,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:48:04,551 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:48:04,551 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:48:04,551 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:48:04,552 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (1/1) ... [2024-11-10 14:48:04,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:48:04,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:04,584 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) [2024-11-10 14:48:04,587 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 [2024-11-10 14:48:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 14:48:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 14:48:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 14:48:04,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 14:48:04,622 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-11-10 14:48:04,622 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-11-10 14:48:04,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:48:04,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 14:48:04,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 14:48:04,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 14:48:04,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 14:48:04,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 14:48:04,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 14:48:04,623 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-10 14:48:04,623 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-10 14:48:04,623 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-10 14:48:04,623 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-10 14:48:04,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:48:04,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:48:04,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 14:48:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 14:48:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-10 14:48:04,624 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-10 14:48:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:48:04,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:48:04,746 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:48:04,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:48:04,788 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc #t~mem54; [2024-11-10 14:48:05,145 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2024-11-10 14:48:05,145 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:48:05,162 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:48:05,162 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:48:05,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:05 BoogieIcfgContainer [2024-11-10 14:48:05,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:48:05,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:48:05,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:48:05,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:48:05,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:48:03" (1/3) ... [2024-11-10 14:48:05,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e7921d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:48:05, skipping insertion in model container [2024-11-10 14:48:05,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:04" (2/3) ... [2024-11-10 14:48:05,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e7921d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:48:05, skipping insertion in model container [2024-11-10 14:48:05,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:05" (3/3) ... [2024-11-10 14:48:05,172 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2024-11-10 14:48:05,186 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:48:05,186 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 14:48:05,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:48:05,233 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;@5a4bc89d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:48:05,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 14:48:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 100 states have (on average 1.68) internal successors, (168), 120 states have internal predecessors, (168), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 14:48:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 14:48:05,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:05,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:05,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:05,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1360552379, now seen corresponding path program 1 times [2024-11-10 14:48:05,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:48:05,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180433819] [2024-11-10 14:48:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:05,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:48:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:48:05,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:48:05,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 14:48:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:05,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 14:48:05,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:05,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:48:05,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:48:05,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180433819] [2024-11-10 14:48:05,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180433819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:05,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:05,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:48:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213321899] [2024-11-10 14:48:05,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:05,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:48:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:48:05,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:48:05,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:48:05,412 INFO L87 Difference]: Start difference. First operand has 130 states, 100 states have (on average 1.68) internal successors, (168), 120 states have internal predecessors, (168), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:05,430 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2024-11-10 14:48:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:48:05,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-10 14:48:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:05,437 INFO L225 Difference]: With dead ends: 125 [2024-11-10 14:48:05,437 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 14:48:05,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:48:05,441 INFO L432 NwaCegarLoop]: 147 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, 147 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 [2024-11-10 14:48:05,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:48:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 14:48:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-10 14:48:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.21875) internal successors, (117), 111 states have internal predecessors, (117), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 14:48:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2024-11-10 14:48:05,473 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 12 [2024-11-10 14:48:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:05,473 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2024-11-10 14:48:05,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2024-11-10 14:48:05,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 14:48:05,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:05,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:05,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 14:48:05,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:48:05,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:05,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:05,677 INFO L85 PathProgramCache]: Analyzing trace with hash 978780852, now seen corresponding path program 1 times [2024-11-10 14:48:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:48:05,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278375975] [2024-11-10 14:48:05,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:05,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:48:05,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:48:05,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:48:05,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 14:48:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:05,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:48:05,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:05,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:48:05,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:48:05,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278375975] [2024-11-10 14:48:05,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278375975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:05,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:05,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:48:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34319809] [2024-11-10 14:48:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:05,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:48:05,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:48:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:48:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:48:05,862 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 14:48:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:05,982 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2024-11-10 14:48:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:48:05,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-10 14:48:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:05,984 INFO L225 Difference]: With dead ends: 121 [2024-11-10 14:48:05,984 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 14:48:05,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:48:05,985 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 194 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:05,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 278 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:48:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 14:48:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-10 14:48:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 110 states have internal predecessors, (116), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 14:48:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2024-11-10 14:48:05,993 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 23 [2024-11-10 14:48:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:05,994 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2024-11-10 14:48:05,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 14:48:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2024-11-10 14:48:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 14:48:05,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:05,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:06,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 14:48:06,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:48:06,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:06,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1025860648, now seen corresponding path program 1 times [2024-11-10 14:48:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:48:06,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879823206] [2024-11-10 14:48:06,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:06,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:48:06,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:48:06,204 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:48:06,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 14:48:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:06,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 14:48:06,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:06,448 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 14:48:06,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 14:48:06,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-10 14:48:06,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2024-11-10 14:48:06,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-10 14:48:06,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2024-11-10 14:48:06,649 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-10 14:48:06,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2024-11-10 14:48:06,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-10 14:48:06,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2024-11-10 14:48:06,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-10 14:48:06,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2024-11-10 14:48:06,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2024-11-10 14:48:09,339 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-10 14:48:09,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2024-11-10 14:48:09,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2024-11-10 14:48:10,153 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-10 14:48:10,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2024-11-10 14:48:11,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:48:11,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 78 [2024-11-10 14:48:11,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2024-11-10 14:48:11,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:48:11,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 65 [2024-11-10 14:48:11,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-10 14:48:11,500 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-10 14:48:11,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 72 [2024-11-10 14:48:11,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2024-11-10 14:48:11,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-10 14:48:11,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-10 14:48:11,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-10 14:48:11,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-10 14:48:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:11,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:48:11,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:48:11,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879823206] [2024-11-10 14:48:11,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879823206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:11,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:11,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 14:48:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226033658] [2024-11-10 14:48:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:11,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:48:11,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:48:11,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:48:11,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=82, Unknown=2, NotChecked=0, Total=110 [2024-11-10 14:48:11,851 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 14:48:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:19,536 INFO L93 Difference]: Finished difference Result 232 states and 271 transitions. [2024-11-10 14:48:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:48:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-10 14:48:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:19,539 INFO L225 Difference]: With dead ends: 232 [2024-11-10 14:48:19,539 INFO L226 Difference]: Without dead ends: 232 [2024-11-10 14:48:19,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=245, Unknown=11, NotChecked=0, Total=342 [2024-11-10 14:48:19,539 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 412 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 47 mSolverCounterUnsat, 227 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 227 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:19,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 534 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 405 Invalid, 227 Unknown, 0 Unchecked, 6.9s Time] [2024-11-10 14:48:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-10 14:48:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 197. [2024-11-10 14:48:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 167 states have (on average 1.221556886227545) internal successors, (204), 182 states have internal predecessors, (204), 23 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 14:48:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 236 transitions. [2024-11-10 14:48:19,569 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 236 transitions. Word has length 26 [2024-11-10 14:48:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:19,569 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 236 transitions. [2024-11-10 14:48:19,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 14:48:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 236 transitions. [2024-11-10 14:48:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 14:48:19,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:19,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:19,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 14:48:19,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:48:19,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1223721903, now seen corresponding path program 1 times [2024-11-10 14:48:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:48:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409765398] [2024-11-10 14:48:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:19,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:48:19,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:48:19,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:48:19,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 14:48:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:19,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-10 14:48:19,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:48:19,943 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 14:48:19,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 14:48:19,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 14:48:19,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 14:48:20,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-11-10 14:48:20,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2024-11-10 14:48:20,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:48:20,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2024-11-10 14:48:20,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2024-11-10 14:48:20,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-10 14:48:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:48:20,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:48:20,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:48:20,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409765398] [2024-11-10 14:48:20,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409765398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:20,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:20,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 14:48:20,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912645004] [2024-11-10 14:48:20,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:20,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:48:20,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:48:20,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:48:20,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2024-11-10 14:48:20,339 INFO L87 Difference]: Start difference. First operand 197 states and 236 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 14:48:25,572 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] [2024-11-10 14:48:29,753 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] [2024-11-10 14:48:33,864 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] [2024-11-10 14:48:37,874 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] [2024-11-10 14:48:41,931 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] [2024-11-10 14:48:45,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 14:48:50,021 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] [2024-11-10 14:48:54,080 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] [2024-11-10 14:48:58,089 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] [2024-11-10 14:49:02,534 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] [2024-11-10 14:49:06,577 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] [2024-11-10 14:49:10,586 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] [2024-11-10 14:49:14,976 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] [2024-11-10 14:49:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:49:15,572 INFO L93 Difference]: Finished difference Result 314 states and 371 transitions. [2024-11-10 14:49:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:49:15,573 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-10 14:49:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:49:15,575 INFO L225 Difference]: With dead ends: 314 [2024-11-10 14:49:15,575 INFO L226 Difference]: Without dead ends: 314 [2024-11-10 14:49:15,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=208, Unknown=8, NotChecked=0, Total=272 [2024-11-10 14:49:15,576 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 255 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 34 mSolverCounterUnsat, 127 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 127 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:49:15,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 487 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1013 Invalid, 127 Unknown, 0 Unchecked, 55.0s Time] [2024-11-10 14:49:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-10 14:49:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 288. [2024-11-10 14:49:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 250 states have (on average 1.216) internal successors, (304), 266 states have internal predecessors, (304), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 14:49:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 346 transitions. [2024-11-10 14:49:15,607 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 346 transitions. Word has length 29 [2024-11-10 14:49:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:49:15,609 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 346 transitions. [2024-11-10 14:49:15,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 14:49:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 346 transitions. [2024-11-10 14:49:15,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 14:49:15,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:49:15,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:49:15,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 14:49:15,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:49:15,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:49:15,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:49:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1624611535, now seen corresponding path program 1 times [2024-11-10 14:49:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:49:15,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966860476] [2024-11-10 14:49:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:49:15,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:49:15,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:49:15,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:49:15,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 14:49:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:49:15,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 14:49:15,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:49:16,015 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 14:49:16,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 14:49:16,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 14:49:16,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 14:49:16,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-10 14:49:16,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-10 14:49:16,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2024-11-10 14:49:17,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2024-11-10 14:49:17,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2024-11-10 14:49:17,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-10 14:49:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:49:17,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:49:17,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:49:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966860476] [2024-11-10 14:49:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966860476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:49:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:49:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 14:49:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583485169] [2024-11-10 14:49:17,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:49:17,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:49:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:49:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:49:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=108, Unknown=1, NotChecked=0, Total=132 [2024-11-10 14:49:17,923 INFO L87 Difference]: Start difference. First operand 288 states and 346 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 14:49:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:49:21,816 INFO L93 Difference]: Finished difference Result 313 states and 369 transitions. [2024-11-10 14:49:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:49:21,817 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-10 14:49:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:49:21,820 INFO L225 Difference]: With dead ends: 313 [2024-11-10 14:49:21,820 INFO L226 Difference]: Without dead ends: 313 [2024-11-10 14:49:21,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=248, Unknown=1, NotChecked=0, Total=306 [2024-11-10 14:49:21,821 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 300 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-10 14:49:21,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 569 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-10 14:49:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-10 14:49:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 288. [2024-11-10 14:49:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 250 states have (on average 1.212) internal successors, (303), 266 states have internal predecessors, (303), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 14:49:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 345 transitions. [2024-11-10 14:49:21,841 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 345 transitions. Word has length 33 [2024-11-10 14:49:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:49:21,841 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 345 transitions. [2024-11-10 14:49:21,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 14:49:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 345 transitions. [2024-11-10 14:49:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 14:49:21,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:49:21,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:49:21,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 14:49:22,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:49:22,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:49:22,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:49:22,044 INFO L85 PathProgramCache]: Analyzing trace with hash -82803839, now seen corresponding path program 1 times [2024-11-10 14:49:22,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:49:22,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601560650] [2024-11-10 14:49:22,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:49:22,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:49:22,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:49:22,046 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:49:22,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 14:49:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:49:22,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 14:49:22,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:49:22,304 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 14:49:22,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 14:49:22,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 14:49:22,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 14:49:23,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2024-11-10 14:49:23,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2024-11-10 14:49:23,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-10 14:49:23,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2024-11-10 14:49:23,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-10 14:49:23,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2024-11-10 14:49:23,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:49:23,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:49:23,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2024-11-10 14:49:23,468 INFO L349 Elim1Store]: treesize reduction 32, result has 13.5 percent of original size [2024-11-10 14:49:23,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 99 [2024-11-10 14:49:23,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2024-11-10 14:49:23,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2024-11-10 14:49:23,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2024-11-10 14:49:24,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2024-11-10 14:49:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:49:24,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:49:24,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:49:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601560650] [2024-11-10 14:49:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601560650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:49:24,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:49:24,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 14:49:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236206725] [2024-11-10 14:49:24,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:49:24,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:49:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:49:24,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:49:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-10 14:49:24,376 INFO L87 Difference]: Start difference. First operand 288 states and 345 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 14:49:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:49:32,242 INFO L93 Difference]: Finished difference Result 312 states and 367 transitions. [2024-11-10 14:49:32,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 14:49:32,243 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-10 14:49:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:49:32,244 INFO L225 Difference]: With dead ends: 312 [2024-11-10 14:49:32,244 INFO L226 Difference]: Without dead ends: 312 [2024-11-10 14:49:32,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-10 14:49:32,245 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 291 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 28 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-10 14:49:32,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 579 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1087 Invalid, 6 Unknown, 0 Unchecked, 7.3s Time] [2024-11-10 14:49:32,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-10 14:49:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 288. [2024-11-10 14:49:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 250 states have (on average 1.208) internal successors, (302), 266 states have internal predecessors, (302), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 14:49:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 344 transitions. [2024-11-10 14:49:32,252 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 344 transitions. Word has length 36 [2024-11-10 14:49:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:49:32,252 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 344 transitions. [2024-11-10 14:49:32,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 14:49:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 344 transitions. [2024-11-10 14:49:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 14:49:32,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:49:32,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:49:32,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 14:49:32,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:49:32,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:49:32,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:49:32,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1180524878, now seen corresponding path program 1 times [2024-11-10 14:49:32,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:49:32,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208711644] [2024-11-10 14:49:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:49:32,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:49:32,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:49:32,456 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:49:32,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 14:49:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:49:32,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 14:49:32,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:49:32,677 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 14:49:32,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 14:49:32,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 14:49:32,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 14:49:34,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2024-11-10 14:49:34,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2024-11-10 14:49:34,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-10 14:49:34,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2024-11-10 14:49:34,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:49:34,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-10 14:49:34,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2024-11-10 14:49:34,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:49:34,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2024-11-10 14:49:34,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2024-11-10 14:49:34,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2024-11-10 14:49:35,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2024-11-10 14:49:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:49:35,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:49:35,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:49:35,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208711644] [2024-11-10 14:49:35,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208711644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:49:35,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:49:35,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 14:49:35,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292597470] [2024-11-10 14:49:35,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:49:35,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:49:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:49:35,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:49:35,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-10 14:49:35,806 INFO L87 Difference]: Start difference. First operand 288 states and 344 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)