./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 3061b6dc 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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:09:26,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:09:26,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:09:26,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:09:26,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:09:26,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:09:26,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:09:26,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:09:26,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:09:26,712 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:09:26,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:09:26,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:09:26,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:09:26,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:09:26,718 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:09:26,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:09:26,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:09:26,719 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:09:26,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:09:26,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:09:26,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:09:26,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:09:26,724 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:09:26,724 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:09:26,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:09:26,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:09:26,725 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:09:26,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:09:26,725 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:09:26,725 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:09:26,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:09:26,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:09:26,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:09:26,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:09:26,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:09:26,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:09:26,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:09:26,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:09:26,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:09:26,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:09:26,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:09:26,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:09:26,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:09:26,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:09:26,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:09:26,730 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-19 06:09:27,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:09:27,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:09:27,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:09:27,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:09:27,047 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:09:27,049 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-19 06:09:28,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:09:28,895 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:09:28,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-19 06:09:28,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30330c462/51e9b251e762403e9917184e8bfd4d5b/FLAG527eb4e3f [2024-11-19 06:09:28,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30330c462/51e9b251e762403e9917184e8bfd4d5b [2024-11-19 06:09:28,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:09:28,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:09:28,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:09:28,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:09:28,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:09:28,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:09:28" (1/1) ... [2024-11-19 06:09:28,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645fcaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:28, skipping insertion in model container [2024-11-19 06:09:28,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:09:28" (1/1) ... [2024-11-19 06:09:29,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:09:29,426 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-19 06:09:29,427 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-19 06:09:29,428 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-19 06:09:29,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:09:29,474 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-19 06:09:29,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5399e49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:29, skipping insertion in model container [2024-11-19 06:09:29,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:09:29,475 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:09:29,477 INFO L158 Benchmark]: Toolchain (without parser) took 534.06ms. Allocated memory is still 159.4MB. Free memory was 99.9MB in the beginning and 82.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:09:29,478 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 119.2MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:09:29,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.04ms. Allocated memory is still 159.4MB. Free memory was 99.9MB in the beginning and 82.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:09:29,480 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.68ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 119.2MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.04ms. Allocated memory is still 159.4MB. Free memory was 99.9MB in the beginning and 82.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. 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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:09:31,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:09:31,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:09:31,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:09:31,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:09:31,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:09:31,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:09:31,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:09:31,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:09:31,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:09:31,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:09:31,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:09:31,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:09:31,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:09:31,713 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:09:31,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:09:31,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:09:31,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:09:31,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:09:31,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:09:31,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:09:31,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:09:31,719 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:09:31,720 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:09:31,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:09:31,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:09:31,720 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:09:31,721 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:09:31,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:09:31,721 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:09:31,722 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:09:31,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:09:31,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:09:31,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:09:31,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:09:31,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:09:31,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:09:31,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:09:31,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:09:31,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:09:31,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:09:31,725 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:09:31,726 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:09:31,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:09:31,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:09:31,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:09:31,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:09:31,727 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-19 06:09:32,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:09:32,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:09:32,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:09:32,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:09:32,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:09:32,110 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-19 06:09:33,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:09:33,884 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:09:33,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-19 06:09:33,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc823939/b25e9c56c2aa4708a135fa7959e56d22/FLAG9ba014cbb [2024-11-19 06:09:33,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc823939/b25e9c56c2aa4708a135fa7959e56d22 [2024-11-19 06:09:33,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:09:33,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:09:33,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:09:33,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:09:33,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:09:33,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:09:33" (1/1) ... [2024-11-19 06:09:33,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a66d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:33, skipping insertion in model container [2024-11-19 06:09:33,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:09:33" (1/1) ... [2024-11-19 06:09:34,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:09:34,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:09:34,511 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:09:34,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:09:34,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:09:34,579 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:09:34,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:09:34,695 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:09:34,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34 WrapperNode [2024-11-19 06:09:34,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:09:34,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:09:34,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:09:34,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:09:34,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,758 INFO L138 Inliner]: procedures = 235, calls = 76, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 120 [2024-11-19 06:09:34,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:09:34,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:09:34,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:09:34,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:09:34,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,816 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-19 06:09:34,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:09:34,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:09:34,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:09:34,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:09:34,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (1/1) ... [2024-11-19 06:09:34,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:09:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:34,905 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-19 06:09:34,909 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-19 06:09:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:09:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:09:34,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:09:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:09:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-11-19 06:09:34,961 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-11-19 06:09:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:09:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:09:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:09:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:09:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:09:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:09:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:09:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-19 06:09:34,962 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-19 06:09:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-19 06:09:34,962 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-19 06:09:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:09:34,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:09:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:09:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:09:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-19 06:09:34,963 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-19 06:09:34,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:09:34,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:09:35,171 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:09:35,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:09:35,740 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2024-11-19 06:09:35,741 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:09:35,756 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:09:35,757 INFO L316 CfgBuilder]: Removed 41 assume(true) statements. [2024-11-19 06:09:35,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:09:35 BoogieIcfgContainer [2024-11-19 06:09:35,758 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:09:35,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:09:35,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:09:35,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:09:35,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:09:33" (1/3) ... [2024-11-19 06:09:35,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219f4931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:09:35, skipping insertion in model container [2024-11-19 06:09:35,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:34" (2/3) ... [2024-11-19 06:09:35,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219f4931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:09:35, skipping insertion in model container [2024-11-19 06:09:35,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:09:35" (3/3) ... [2024-11-19 06:09:35,765 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2024-11-19 06:09:35,779 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:09:35,779 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:09:35,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:09:35,830 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;@31c914bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:09:35,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:09:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 112 states have internal predecessors, (160), 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-19 06:09:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:09:35,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:35,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:35,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:35,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:35,855 INFO L85 PathProgramCache]: Analyzing trace with hash 949299624, now seen corresponding path program 1 times [2024-11-19 06:09:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:09:35,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280591014] [2024-11-19 06:09:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:35,868 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-19 06:09:35,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:09:35,871 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-19 06:09:35,873 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-19 06:09:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:36,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:09:36,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:36,035 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-19 06:09:36,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:09:36,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:09:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280591014] [2024-11-19 06:09:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280591014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:36,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:09:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:09:36,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934624513] [2024-11-19 06:09:36,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:36,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:09:36,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:09:36,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:09:36,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:09:36,072 INFO L87 Difference]: Start difference. First operand has 122 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 112 states have internal predecessors, (160), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-19 06:09:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:36,097 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2024-11-19 06:09:36,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:09:36,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (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 11 [2024-11-19 06:09:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:36,108 INFO L225 Difference]: With dead ends: 117 [2024-11-19 06:09:36,108 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 06:09:36,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:09:36,114 INFO L432 NwaCegarLoop]: 139 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, 139 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-19 06:09:36,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:09:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 06:09:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-19 06:09:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 104 states have internal predecessors, (110), 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-19 06:09:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2024-11-19 06:09:36,168 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 11 [2024-11-19 06:09:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:36,169 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2024-11-19 06:09:36,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (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-19 06:09:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2024-11-19 06:09:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:09:36,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:36,171 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-19 06:09:36,176 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-19 06:09:36,374 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-19 06:09:36,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:36,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1891587604, now seen corresponding path program 1 times [2024-11-19 06:09:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:09:36,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387682772] [2024-11-19 06:09:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:36,377 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-19 06:09:36,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:09:36,381 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-19 06:09:36,382 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-19 06:09:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:36,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:09:36,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:36,657 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-19 06:09:36,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:09:36,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:09:36,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387682772] [2024-11-19 06:09:36,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387682772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:36,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:09:36,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:09:36,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113946159] [2024-11-19 06:09:36,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:36,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:09:36,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:09:36,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:09:36,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:09:36,663 INFO L87 Difference]: Start difference. First operand 115 states and 137 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-19 06:09:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:36,922 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2024-11-19 06:09:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:09:36,923 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-19 06:09:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:36,925 INFO L225 Difference]: With dead ends: 114 [2024-11-19 06:09:36,925 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 06:09:36,926 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-19 06:09:36,927 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 179 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:36,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 264 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:09:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 06:09:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-19 06:09:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 103 states have internal predecessors, (109), 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-19 06:09:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2024-11-19 06:09:36,947 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 23 [2024-11-19 06:09:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:36,948 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2024-11-19 06:09:36,948 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-19 06:09:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2024-11-19 06:09:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:09:36,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:36,949 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-19 06:09:36,958 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 (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:09:37,152 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-19 06:09:37,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:37,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1913163680, now seen corresponding path program 1 times [2024-11-19 06:09:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:09:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754840115] [2024-11-19 06:09:37,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:37,156 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-19 06:09:37,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:09:37,159 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-19 06:09:37,161 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-19 06:09:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:37,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 06:09:37,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:37,417 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:09:37,418 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-19 06:09:37,485 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-19 06:09:37,516 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-19 06:09:37,568 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-19 06:09:37,577 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-19 06:09:37,658 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-19 06:09:37,658 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-19 06:09:37,736 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-19 06:09:37,754 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-19 06:09:37,807 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-19 06:09:37,832 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-19 06:09:37,897 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-19 06:09:40,109 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-19 06:09:40,110 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-19 06:09:40,161 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-19 06:09:40,914 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-19 06:09:40,914 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-19 06:09:42,727 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select |c_#memory_$Pointer$#1.base| (_ bv3 32)))) (or (exists ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_arrayElimArr_2) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_1) (_ bv3 32) v_arrayElimArr_2) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_7| (_ bv3 32)) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) (_ bv3 32))) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse0) (= (select v_arrayElimArr_2 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select v_DerPreprocessor_13 |v_list_add___list_add_~new#1.offset_7|)) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_12) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_13) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_13 (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|)) (_ bv3 32)))) (exists ((|v_list_add___list_add_~next#1.base_7| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_8 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) (_ bv3 32) v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_7| |v_list_add___list_add_~next#1.base_7|) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) (_ bv3 32))) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse0) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| |v_list_add___list_add_~next#1.base_7|)) (not (= (_ bv3 32) |v_list_add___list_add_~next#1.base_7|)))))) (not (= (_ bv3 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (_ bv3 32) |c_~#gl_list~0.base|)) is different from true [2024-11-19 06:09:42,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:09:42,775 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-19 06:09:42,786 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-19 06:09:42,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:09:42,797 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-19 06:09:42,803 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-19 06:09:42,834 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-19 06:09:42,835 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-19 06:09:42,844 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-19 06:09:42,915 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-19 06:09:42,931 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-19 06:09:42,937 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-19 06:09:43,323 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-19 06:09:43,373 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-19 06:09:43,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:09:43,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:09:43,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754840115] [2024-11-19 06:09:43,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754840115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:43,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:09:43,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:09:43,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934861530] [2024-11-19 06:09:43,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:43,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:09:43,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:09:43,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:09:43,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=4, NotChecked=16, Total=110 [2024-11-19 06:09:43,380 INFO L87 Difference]: Start difference. First operand 114 states and 135 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-19 06:09:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:49,434 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2024-11-19 06:09:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:09:49,435 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-19 06:09:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:49,438 INFO L225 Difference]: With dead ends: 216 [2024-11-19 06:09:49,438 INFO L226 Difference]: Without dead ends: 216 [2024-11-19 06:09:49,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=82, Invalid=216, Unknown=12, NotChecked=32, Total=342 [2024-11-19 06:09:49,439 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 475 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 71 mSolverCounterUnsat, 135 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 135 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:49,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 520 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 406 Invalid, 135 Unknown, 253 Unchecked, 4.8s Time] [2024-11-19 06:09:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-19 06:09:49,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 183. [2024-11-19 06:09:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 153 states have (on average 1.2418300653594772) internal successors, (190), 168 states have internal predecessors, (190), 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-19 06:09:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 222 transitions. [2024-11-19 06:09:49,455 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 222 transitions. Word has length 26 [2024-11-19 06:09:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:49,455 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 222 transitions. [2024-11-19 06:09:49,456 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-19 06:09:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 222 transitions. [2024-11-19 06:09:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:09:49,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:49,457 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-19 06:09:49,463 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-19 06:09:49,660 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-19 06:09:49,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:49,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1706864921, now seen corresponding path program 1 times [2024-11-19 06:09:49,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:09:49,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776582820] [2024-11-19 06:09:49,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:49,662 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-19 06:09:49,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:09:49,663 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-19 06:09:49,664 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-19 06:09:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:49,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 06:09:49,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:49,940 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:09:49,941 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-19 06:09:49,989 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-19 06:09:49,997 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-19 06:09:50,205 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-19 06:09:50,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 45 treesize of output 47 [2024-11-19 06:09:50,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:09:50,321 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-19 06:09:50,325 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-19 06:09:50,528 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-19 06:09:50,562 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-19 06:09:50,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:09:50,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:09:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776582820] [2024-11-19 06:09:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776582820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:09:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:09:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104004179] [2024-11-19 06:09:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:09:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:09:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:09:50,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2024-11-19 06:09:50,564 INFO L87 Difference]: Start difference. First operand 183 states and 222 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-19 06:09:53,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:09:58,453 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-19 06:10:03,381 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-19 06:10:07,581 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-19 06:10:11,606 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-19 06:10:15,790 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-19 06:10:19,817 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-19 06:10:23,911 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-19 06:10:27,932 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-19 06:10:32,093 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-19 06:10:36,117 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-19 06:10:41,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:10:45,166 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-19 06:10:49,200 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-19 06:10:53,218 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-19 06:10:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:55,113 INFO L93 Difference]: Finished difference Result 293 states and 350 transitions. [2024-11-19 06:10:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:10:55,114 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-19 06:10:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:55,115 INFO L225 Difference]: With dead ends: 293 [2024-11-19 06:10:55,115 INFO L226 Difference]: Without dead ends: 293 [2024-11-19 06:10:55,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=208, Unknown=8, NotChecked=0, Total=272 [2024-11-19 06:10:55,116 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 233 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 34 mSolverCounterUnsat, 118 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 118 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:55,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 465 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 960 Invalid, 118 Unknown, 0 Unchecked, 64.2s Time] [2024-11-19 06:10:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-19 06:10:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2024-11-19 06:10:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 230 states have (on average 1.2347826086956522) internal successors, (284), 246 states have internal predecessors, (284), 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-19 06:10:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 326 transitions. [2024-11-19 06:10:55,138 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 326 transitions. Word has length 29 [2024-11-19 06:10:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:55,138 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 326 transitions. [2024-11-19 06:10:55,139 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-19 06:10:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 326 transitions. [2024-11-19 06:10:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:10:55,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:55,140 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] [2024-11-19 06:10:55,147 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-19 06:10:55,340 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-19 06:10:55,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:55,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1462457616, now seen corresponding path program 1 times [2024-11-19 06:10:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:10:55,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928720169] [2024-11-19 06:10:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:55,341 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-19 06:10:55,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:10:55,343 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-19 06:10:55,344 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-19 06:10:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:55,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 06:10:55,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:55,681 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:10:55,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:10:55,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 11 [2024-11-19 06:10:55,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 11 [2024-11-19 06:10:57,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 53 treesize of output 50 [2024-11-19 06:10:57,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 58 treesize of output 57 [2024-11-19 06:10:58,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:58,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 23 treesize of output 14 [2024-11-19 06:10:58,129 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 28 treesize of output 26 [2024-11-19 06:11:00,617 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 35 treesize of output 15 [2024-11-19 06:11:00,753 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-19 06:11:00,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:11:00,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:11:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928720169] [2024-11-19 06:11:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928720169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:11:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:11:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:11:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206908620] [2024-11-19 06:11:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:11:00,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:11:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:11:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:11:00,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:11:00,755 INFO L87 Difference]: Start difference. First operand 268 states and 326 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 7 states have internal predecessors, (28), 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)