./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/ldv-memsafety/memleaks_test17_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 143a30a80a62e6cad7506820b1f96be933051e37975b620c656decb608437802 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:06,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:06,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:06,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:06,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:06,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:06,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:06,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:06,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:06,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:06,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:06,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:06,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:06,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:06,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:06,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:06,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:06,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:06,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:06,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:06,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:06,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:06,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:06,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:06,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:06,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:06,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:06,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:06,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:06,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:06,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:06,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:06,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:06,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:06,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:06,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:06,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:06,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:06,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:06,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:06,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:06,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:51:06,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:06,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:06,106 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:06,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:06,107 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:06,107 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:06,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:06,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:06,108 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:06,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:06,109 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:06,109 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:06,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:06,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:06,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:06,110 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:06,110 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:06,110 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:06,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:06,110 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:06,110 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:06,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:06,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:06,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:06,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:06,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:06,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:06,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:06,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:51:06,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:51:06,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 143a30a80a62e6cad7506820b1f96be933051e37975b620c656decb608437802 [2022-02-20 23:51:06,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:06,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:06,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:06,355 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:06,355 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:06,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i [2022-02-20 23:51:06,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d3ef2a8/eba9fea069464734b17be4e5ae71257b/FLAG8fa458bfb [2022-02-20 23:51:06,717 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:06,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i [2022-02-20 23:51:06,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d3ef2a8/eba9fea069464734b17be4e5ae71257b/FLAG8fa458bfb [2022-02-20 23:51:07,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d3ef2a8/eba9fea069464734b17be4e5ae71257b [2022-02-20 23:51:07,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:07,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:07,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:07,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:07,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:07,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:07" (1/1) ... [2022-02-20 23:51:07,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d8509e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:07, skipping insertion in model container [2022-02-20 23:51:07,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:07" (1/1) ... [2022-02-20 23:51:07,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:07,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:07,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:07,546 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-02-20 23:51:07,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5ad7280d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:07, skipping insertion in model container [2022-02-20 23:51:07,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:07,547 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:51:07,549 INFO L158 Benchmark]: Toolchain (without parser) took 407.55ms. Allocated memory is still 107.0MB. Free memory was 66.3MB in the beginning and 75.9MB in the end (delta: -9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:51:07,550 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:51:07,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.80ms. Allocated memory is still 107.0MB. Free memory was 66.0MB in the beginning and 75.9MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:51:07,552 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.80ms. Allocated memory is still 107.0MB. Free memory was 66.0MB in the beginning and 75.9MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/ldv-memsafety/memleaks_test17_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 143a30a80a62e6cad7506820b1f96be933051e37975b620c656decb608437802 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:08,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:08,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:08,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:08,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:08,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:09,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:09,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:09,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:09,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:09,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:09,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:09,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:09,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:09,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:09,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:09,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:09,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:09,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:09,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:09,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:09,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:09,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:09,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:09,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:09,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:09,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:09,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:09,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:09,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:09,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:09,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:09,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:09,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:09,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:09,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:09,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:09,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:09,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:09,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:09,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:09,051 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:51:09,081 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:09,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:09,082 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:09,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:09,083 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:09,083 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:09,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:09,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:09,085 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:09,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:09,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:09,085 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:09,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:09,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:09,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:09,086 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:09,086 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:09,086 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:09,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:09,086 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:09,087 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:51:09,087 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:51:09,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:09,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:09,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:09,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:09,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:09,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:09,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:09,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:09,088 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:51:09,088 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:51:09,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:51:09,089 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 143a30a80a62e6cad7506820b1f96be933051e37975b620c656decb608437802 [2022-02-20 23:51:09,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:09,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:09,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:09,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:09,374 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:09,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i [2022-02-20 23:51:09,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1016cd6/efc71f3160a7448594a12fda91db104f/FLAG2df67acea [2022-02-20 23:51:09,853 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:09,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i [2022-02-20 23:51:09,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1016cd6/efc71f3160a7448594a12fda91db104f/FLAG2df67acea [2022-02-20 23:51:09,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1016cd6/efc71f3160a7448594a12fda91db104f [2022-02-20 23:51:09,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:09,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:09,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:09,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:09,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:09,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:09" (1/1) ... [2022-02-20 23:51:09,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce9cb24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:09, skipping insertion in model container [2022-02-20 23:51:09,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:09" (1/1) ... [2022-02-20 23:51:09,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:09,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:10,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:10,254 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:51:10,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:10,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:10,315 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:51:10,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:10,400 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:51:10,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10 WrapperNode [2022-02-20 23:51:10,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:10,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:10,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:51:10,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:51:10,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (1/1) ... [2022-02-20 23:51:10,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (1/1) ... [2022-02-20 23:51:10,453 INFO L137 Inliner]: procedures = 167, calls = 78, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 86 [2022-02-20 23:51:10,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:10,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:51:10,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:51:10,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:51:10,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (1/1) ... [2022-02-20 23:51:10,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (1/1) ... [2022-02-20 23:51:10,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (1/1) ... [2022-02-20 23:51:10,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (1/1) ... [2022-02-20 23:51:10,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (1/1) ... [2022-02-20 23:51:10,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (1/1) ... [2022-02-20 23:51:10,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (1/1) ... [2022-02-20 23:51:10,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:51:10,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:51:10,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:51:10,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:51:10,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (1/1) ... [2022-02-20 23:51:10,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:10,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:51:10,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:51:10,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:51:10,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:51:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:51:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:51:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:51:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:51:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:51:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:51:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:51:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:51:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:51:10,659 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:51:10,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:51:10,992 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:51:10,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:51:10,996 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:51:10,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:10 BoogieIcfgContainer [2022-02-20 23:51:10,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:51:10,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:51:10,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:51:11,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:51:11,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:51:09" (1/3) ... [2022-02-20 23:51:11,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1faba43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:11, skipping insertion in model container [2022-02-20 23:51:11,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:10" (2/3) ... [2022-02-20 23:51:11,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1faba43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:11, skipping insertion in model container [2022-02-20 23:51:11,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:10" (3/3) ... [2022-02-20 23:51:11,003 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-1.i [2022-02-20 23:51:11,006 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:51:11,006 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-02-20 23:51:11,030 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:51:11,034 INFO L339 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:51:11,034 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-02-20 23:51:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.763157894736842) internal successors, (67), 56 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:11,049 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:11,049 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:11,049 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:11,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1738627285, now seen corresponding path program 1 times [2022-02-20 23:51:11,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:11,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762037777] [2022-02-20 23:51:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:11,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:11,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:11,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:11,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:51:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:11,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:51:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:11,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:11,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {63#true} is VALID [2022-02-20 23:51:11,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {63#true} is VALID [2022-02-20 23:51:11,225 INFO L272 TraceCheckUtils]: 2: Hoare triple {63#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {63#true} is VALID [2022-02-20 23:51:11,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {63#true} ~size := #in~size; {63#true} is VALID [2022-02-20 23:51:11,226 INFO L290 TraceCheckUtils]: 4: Hoare triple {63#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {80#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {80#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {80#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,227 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {80#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {63#true} #118#return; {87#(not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {87#(not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {91#(not (= |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {91#(not (= |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 32)))} assume entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32; {64#false} is VALID [2022-02-20 23:51:11,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {64#false} assume { :end_inline_entry_point } true; {64#false} is VALID [2022-02-20 23:51:11,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {64#false} assume !(#valid == main_old_#valid#1); {64#false} is VALID [2022-02-20 23:51:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:11,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:11,230 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:11,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762037777] [2022-02-20 23:51:11,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762037777] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:11,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:11,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:11,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479110189] [2022-02-20 23:51:11,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:11,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:11,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:11,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:11,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:11,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:11,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:11,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:11,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:11,282 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.763157894736842) internal successors, (67), 56 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:11,716 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-02-20 23:51:11,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:11,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2022-02-20 23:51:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2022-02-20 23:51:11,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 138 transitions. [2022-02-20 23:51:11,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:11,856 INFO L225 Difference]: With dead ends: 114 [2022-02-20 23:51:11,856 INFO L226 Difference]: Without dead ends: 110 [2022-02-20 23:51:11,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:11,862 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 55 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:11,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 234 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-20 23:51:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 62. [2022-02-20 23:51:11,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:11,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:11,892 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:11,893 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:11,900 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2022-02-20 23:51:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2022-02-20 23:51:11,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:11,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:11,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 110 states. [2022-02-20 23:51:11,902 INFO L87 Difference]: Start difference. First operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 110 states. [2022-02-20 23:51:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:11,906 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2022-02-20 23:51:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2022-02-20 23:51:11,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:11,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:11,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:11,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-02-20 23:51:11,911 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 11 [2022-02-20 23:51:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:11,911 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-02-20 23:51:11,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-02-20 23:51:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:11,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:11,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:11,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:12,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:12,124 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1738628211, now seen corresponding path program 1 times [2022-02-20 23:51:12,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:12,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191593632] [2022-02-20 23:51:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:12,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:12,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:12,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:12,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:51:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:12,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:51:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:12,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:12,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:12,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {496#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {496#true} is VALID [2022-02-20 23:51:12,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {496#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {496#true} is VALID [2022-02-20 23:51:12,247 INFO L272 TraceCheckUtils]: 2: Hoare triple {496#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {496#true} is VALID [2022-02-20 23:51:12,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {496#true} ~size := #in~size; {496#true} is VALID [2022-02-20 23:51:12,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {496#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {513#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:12,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {513#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:12,250 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {513#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {496#true} #118#return; {520#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:12,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {520#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {524#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:12,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {524#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:12,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {524#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:12,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~array~0#1.base]); {497#false} is VALID [2022-02-20 23:51:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:12,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:12,252 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:12,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191593632] [2022-02-20 23:51:12,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191593632] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:12,253 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:12,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:51:12,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626369045] [2022-02-20 23:51:12,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:12,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:12,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:12,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:12,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:12,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:12,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:12,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:12,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:12,265 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:12,737 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-02-20 23:51:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:12,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-02-20 23:51:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-02-20 23:51:12,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 113 transitions. [2022-02-20 23:51:12,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:12,849 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:51:12,849 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:51:12,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:12,850 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 35 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:12,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 158 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:51:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:51:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2022-02-20 23:51:12,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:12,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 75 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 70 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:12,855 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 75 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 70 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:12,855 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 75 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 70 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:12,863 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-02-20 23:51:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-02-20 23:51:12,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:12,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:12,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 70 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 97 states. [2022-02-20 23:51:12,865 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 70 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 97 states. [2022-02-20 23:51:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:12,868 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-02-20 23:51:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-02-20 23:51:12,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:12,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:12,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:12,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 70 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2022-02-20 23:51:12,871 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 11 [2022-02-20 23:51:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:12,872 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2022-02-20 23:51:12,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2022-02-20 23:51:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:12,873 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:12,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:12,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:13,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:13,082 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:13,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:13,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1738628210, now seen corresponding path program 1 times [2022-02-20 23:51:13,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:13,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328202708] [2022-02-20 23:51:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:13,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:13,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:13,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:13,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:51:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:13,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:51:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:13,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:13,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:13,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {899#true} is VALID [2022-02-20 23:51:13,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {907#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:13,303 INFO L272 TraceCheckUtils]: 2: Hoare triple {907#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {899#true} is VALID [2022-02-20 23:51:13,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {899#true} ~size := #in~size; {914#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:13,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {914#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {918#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:13,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {918#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {918#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:13,306 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {918#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {907#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #118#return; {925#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv40 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:13,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {925#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv40 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {929#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:13,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {933#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:13,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {933#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {933#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:13,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {933#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)))); {900#false} is VALID [2022-02-20 23:51:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:13,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:13,309 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:13,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328202708] [2022-02-20 23:51:13,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328202708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:13,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:13,310 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:51:13,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151552896] [2022-02-20 23:51:13,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:13,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:13,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:13,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:13,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:13,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:51:13,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:13,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:51:13,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:51:13,324 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:14,488 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-02-20 23:51:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:51:14,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2022-02-20 23:51:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:14,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2022-02-20 23:51:14,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 122 transitions. [2022-02-20 23:51:14,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:14,619 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:51:14,619 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:51:14,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:51:14,627 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 108 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:14,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 408 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:51:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:51:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2022-02-20 23:51:14,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:14,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 105 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 100 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:14,644 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 105 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 100 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:14,645 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 105 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 100 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:14,651 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-02-20 23:51:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2022-02-20 23:51:14,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:14,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:14,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 100 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 127 states. [2022-02-20 23:51:14,655 INFO L87 Difference]: Start difference. First operand has 105 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 100 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 127 states. [2022-02-20 23:51:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:14,661 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-02-20 23:51:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2022-02-20 23:51:14,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:14,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:14,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:14,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 100 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 137 transitions. [2022-02-20 23:51:14,666 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 137 transitions. Word has length 11 [2022-02-20 23:51:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:14,667 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 137 transitions. [2022-02-20 23:51:14,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 137 transitions. [2022-02-20 23:51:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:14,667 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:14,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:14,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:14,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:14,879 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:14,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:14,880 INFO L85 PathProgramCache]: Analyzing trace with hash -851123604, now seen corresponding path program 1 times [2022-02-20 23:51:14,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:14,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418743493] [2022-02-20 23:51:14,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:14,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:14,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:14,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:14,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:51:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:14,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:51:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:14,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:14,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {1433#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1433#true} is VALID [2022-02-20 23:51:14,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1433#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:14,978 INFO L272 TraceCheckUtils]: 2: Hoare triple {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {1445#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:14,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {1445#(= |old(#valid)| |#valid|)} ~size := #in~size; {1445#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:14,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {1445#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1445#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:14,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {1445#(= |old(#valid)| |#valid|)} assume true; {1445#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:14,980 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1445#(= |old(#valid)| |#valid|)} {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #118#return; {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:14,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:14,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32; {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:14,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:14,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {1441#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {1434#false} is VALID [2022-02-20 23:51:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:14,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:14,982 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:14,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418743493] [2022-02-20 23:51:14,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418743493] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:14,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:14,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:51:14,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111815006] [2022-02-20 23:51:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:14,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:14,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:14,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:14,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:14,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:51:14,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:14,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:51:14,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:51:14,991 INFO L87 Difference]: Start difference. First operand 105 states and 137 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:15,371 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2022-02-20 23:51:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:51:15,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-02-20 23:51:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-02-20 23:51:15,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 122 transitions. [2022-02-20 23:51:15,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:15,469 INFO L225 Difference]: With dead ends: 148 [2022-02-20 23:51:15,469 INFO L226 Difference]: Without dead ends: 146 [2022-02-20 23:51:15,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:51:15,470 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 46 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:15,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 162 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-20 23:51:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 105. [2022-02-20 23:51:15,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:15,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 105 states, 83 states have (on average 1.5662650602409638) internal successors, (130), 100 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:15,476 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 105 states, 83 states have (on average 1.5662650602409638) internal successors, (130), 100 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:15,476 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 105 states, 83 states have (on average 1.5662650602409638) internal successors, (130), 100 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:15,479 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-02-20 23:51:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-02-20 23:51:15,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:15,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:15,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 83 states have (on average 1.5662650602409638) internal successors, (130), 100 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 146 states. [2022-02-20 23:51:15,480 INFO L87 Difference]: Start difference. First operand has 105 states, 83 states have (on average 1.5662650602409638) internal successors, (130), 100 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 146 states. [2022-02-20 23:51:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:15,483 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-02-20 23:51:15,483 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-02-20 23:51:15,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:15,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:15,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:15,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.5662650602409638) internal successors, (130), 100 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2022-02-20 23:51:15,486 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 11 [2022-02-20 23:51:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:15,487 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2022-02-20 23:51:15,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2022-02-20 23:51:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:15,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:15,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:15,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:15,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:15,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash -851124530, now seen corresponding path program 1 times [2022-02-20 23:51:15,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:15,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785463586] [2022-02-20 23:51:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:15,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:15,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:15,698 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:15,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:51:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:15,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:51:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:15,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:15,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {2014#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2014#true} is VALID [2022-02-20 23:51:15,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {2014#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {2014#true} is VALID [2022-02-20 23:51:15,799 INFO L272 TraceCheckUtils]: 2: Hoare triple {2014#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {2014#true} is VALID [2022-02-20 23:51:15,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {2014#true} ~size := #in~size; {2014#true} is VALID [2022-02-20 23:51:15,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {2014#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2031#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:15,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {2031#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {2031#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:15,803 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2031#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {2014#true} #118#return; {2038#(and (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:15,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {2038#(and (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {2042#(and (= |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:15,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {2042#(and (= |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {2015#false} is VALID [2022-02-20 23:51:15,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {2015#false} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {2015#false} is VALID [2022-02-20 23:51:15,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {2015#false} assume !(1bv1 == #valid[entry_point_~array~0#1.base]); {2015#false} is VALID [2022-02-20 23:51:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:15,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:15,806 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:15,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785463586] [2022-02-20 23:51:15,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785463586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:15,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:15,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:15,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759164566] [2022-02-20 23:51:15,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:15,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:15,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:15,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:15,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:15,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:15,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:15,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:15,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:15,816 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:16,097 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2022-02-20 23:51:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-02-20 23:51:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-02-20 23:51:16,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-02-20 23:51:16,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:16,151 INFO L225 Difference]: With dead ends: 89 [2022-02-20 23:51:16,151 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:51:16,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:16,152 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:16,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:51:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-02-20 23:51:16,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:16,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 83 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:16,155 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 83 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:16,156 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 83 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:16,157 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2022-02-20 23:51:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-02-20 23:51:16,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:16,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:16,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 83 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 87 states. [2022-02-20 23:51:16,158 INFO L87 Difference]: Start difference. First operand has 87 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 83 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 87 states. [2022-02-20 23:51:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:16,160 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2022-02-20 23:51:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-02-20 23:51:16,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:16,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:16,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:16,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 83 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2022-02-20 23:51:16,163 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 11 [2022-02-20 23:51:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:16,163 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2022-02-20 23:51:16,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-02-20 23:51:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:51:16,163 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:16,163 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:16,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:16,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:16,368 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:16,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1832553715, now seen corresponding path program 1 times [2022-02-20 23:51:16,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:16,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722990898] [2022-02-20 23:51:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:16,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:16,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:16,369 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:16,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:51:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:16,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:51:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:16,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:16,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:16,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2401#true} is VALID [2022-02-20 23:51:16,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {2409#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:16,592 INFO L272 TraceCheckUtils]: 2: Hoare triple {2409#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {2401#true} is VALID [2022-02-20 23:51:16,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {2401#true} ~size := #in~size; {2416#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:16,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {2416#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2420#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:16,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {2420#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {2420#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:16,595 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2420#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {2409#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #118#return; {2427#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv40 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:16,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {2427#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv40 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {2431#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:16,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {2431#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {2435#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:16,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {2435#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {2435#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:16,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {2435#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {2435#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:16,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {2435#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {2445#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:16,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {2445#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {2445#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:16,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {2445#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)))); {2402#false} is VALID [2022-02-20 23:51:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:16,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:17,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {2452#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)))); {2402#false} is VALID [2022-02-20 23:51:17,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {2452#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {2452#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} is VALID [2022-02-20 23:51:17,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {2459#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {2452#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} is VALID [2022-02-20 23:51:17,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {2459#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {2459#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} is VALID [2022-02-20 23:51:17,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {2459#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {2459#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} is VALID [2022-02-20 23:51:17,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {2469#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {2459#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} is VALID [2022-02-20 23:51:17,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {2473#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_#t~ret44#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret44#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret44#1.offset|) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {2469#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} is VALID [2022-02-20 23:51:17,734 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2481#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))))} {2477#(bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))} #118#return; {2473#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_#t~ret44#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret44#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret44#1.offset|) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)))} is VALID [2022-02-20 23:51:17,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {2481#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))))} assume true; {2481#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))))} is VALID [2022-02-20 23:51:17,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {2488#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))) (bvule (_ bv8 32) ldv_malloc_~size))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2481#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))))} is VALID [2022-02-20 23:51:17,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {2401#true} ~size := #in~size; {2488#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))) (bvule (_ bv8 32) ldv_malloc_~size))} is VALID [2022-02-20 23:51:17,738 INFO L272 TraceCheckUtils]: 2: Hoare triple {2477#(bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {2401#true} is VALID [2022-02-20 23:51:17,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {2477#(bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-20 23:51:17,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2401#true} is VALID [2022-02-20 23:51:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:17,739 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:17,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722990898] [2022-02-20 23:51:17,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722990898] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:17,739 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:17,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-02-20 23:51:17,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160959892] [2022-02-20 23:51:17,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:17,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2022-02-20 23:51:17,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:17,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:18,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:18,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:51:18,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:18,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:51:18,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:51:18,209 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:21,166 INFO L93 Difference]: Finished difference Result 204 states and 233 transitions. [2022-02-20 23:51:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:51:21,166 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2022-02-20 23:51:21,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2022-02-20 23:51:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2022-02-20 23:51:21,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 204 transitions. [2022-02-20 23:51:21,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:21,479 INFO L225 Difference]: With dead ends: 204 [2022-02-20 23:51:21,480 INFO L226 Difference]: Without dead ends: 204 [2022-02-20 23:51:21,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:51:21,480 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 429 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:21,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 470 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 285 Invalid, 0 Unknown, 73 Unchecked, 0.8s Time] [2022-02-20 23:51:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-02-20 23:51:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 96. [2022-02-20 23:51:21,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:21,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 96 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 92 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:21,501 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 96 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 92 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:21,501 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 96 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 92 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:21,509 INFO L93 Difference]: Finished difference Result 204 states and 233 transitions. [2022-02-20 23:51:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 233 transitions. [2022-02-20 23:51:21,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:21,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:21,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 92 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 204 states. [2022-02-20 23:51:21,510 INFO L87 Difference]: Start difference. First operand has 96 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 92 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 204 states. [2022-02-20 23:51:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:21,516 INFO L93 Difference]: Finished difference Result 204 states and 233 transitions. [2022-02-20 23:51:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 233 transitions. [2022-02-20 23:51:21,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:21,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:21,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:21,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 92 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2022-02-20 23:51:21,520 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 14 [2022-02-20 23:51:21,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:21,520 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2022-02-20 23:51:21,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2022-02-20 23:51:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:51:21,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:21,521 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:21,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:21,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:21,727 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:21,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash -68910454, now seen corresponding path program 1 times [2022-02-20 23:51:21,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:21,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021613065] [2022-02-20 23:51:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:21,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:21,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:21,729 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:21,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:51:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:21,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:51:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:21,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:21,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {3219#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3219#true} is VALID [2022-02-20 23:51:21,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {3219#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {3227#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:21,892 INFO L272 TraceCheckUtils]: 2: Hoare triple {3227#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {3219#true} is VALID [2022-02-20 23:51:21,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {3219#true} ~size := #in~size; {3219#true} is VALID [2022-02-20 23:51:21,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {3219#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3219#true} is VALID [2022-02-20 23:51:21,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {3219#true} assume true; {3219#true} is VALID [2022-02-20 23:51:21,893 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3219#true} {3227#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #118#return; {3227#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:21,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {3227#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3227#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:21,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {3227#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {3249#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:21,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {3249#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3249#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:21,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {3249#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3249#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:21,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {3249#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3259#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)))} is VALID [2022-02-20 23:51:21,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {3259#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3259#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)))} is VALID [2022-02-20 23:51:21,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {3259#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3259#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)))} is VALID [2022-02-20 23:51:21,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {3259#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3269#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|))} is VALID [2022-02-20 23:51:21,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {3269#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|))} assume !~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3220#false} is VALID [2022-02-20 23:51:21,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {3220#false} assume { :begin_inline_alloc_unsafe_17 } true;alloc_unsafe_17_#in~array#1.base, alloc_unsafe_17_#in~array#1.offset, alloc_unsafe_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_unsafe_17_#res#1;havoc alloc_unsafe_17_#t~ret39#1.base, alloc_unsafe_17_#t~ret39#1.offset, alloc_unsafe_17_#t~post38#1, alloc_unsafe_17_#t~mem41#1.base, alloc_unsafe_17_#t~mem41#1.offset, alloc_unsafe_17_#t~post40#1, alloc_unsafe_17_~array#1.base, alloc_unsafe_17_~array#1.offset, alloc_unsafe_17_~len#1, alloc_unsafe_17_~p~0#1.base, alloc_unsafe_17_~p~0#1.offset, alloc_unsafe_17_~i~0#1, alloc_unsafe_17_~j~0#1;alloc_unsafe_17_~array#1.base, alloc_unsafe_17_~array#1.offset := alloc_unsafe_17_#in~array#1.base, alloc_unsafe_17_#in~array#1.offset;alloc_unsafe_17_~len#1 := alloc_unsafe_17_#in~len#1;havoc alloc_unsafe_17_~p~0#1.base, alloc_unsafe_17_~p~0#1.offset;alloc_unsafe_17_~i~0#1 := 0bv32;havoc alloc_unsafe_17_~j~0#1; {3220#false} is VALID [2022-02-20 23:51:21,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {3220#false} assume !~bvslt32(alloc_unsafe_17_~i~0#1, alloc_unsafe_17_~len#1); {3220#false} is VALID [2022-02-20 23:51:21,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {3220#false} alloc_unsafe_17_~j~0#1 := ~bvsub32(alloc_unsafe_17_~i~0#1, 1bv32); {3220#false} is VALID [2022-02-20 23:51:21,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {3220#false} assume !!~bvsge32(alloc_unsafe_17_~j~0#1, 0bv32); {3220#false} is VALID [2022-02-20 23:51:21,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {3220#false} assume !(1bv1 == #valid[alloc_unsafe_17_~array#1.base]); {3220#false} is VALID [2022-02-20 23:51:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:21,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:22,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {3220#false} assume !(1bv1 == #valid[alloc_unsafe_17_~array#1.base]); {3220#false} is VALID [2022-02-20 23:51:22,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {3220#false} assume !!~bvsge32(alloc_unsafe_17_~j~0#1, 0bv32); {3220#false} is VALID [2022-02-20 23:51:22,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {3220#false} alloc_unsafe_17_~j~0#1 := ~bvsub32(alloc_unsafe_17_~i~0#1, 1bv32); {3220#false} is VALID [2022-02-20 23:51:22,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {3220#false} assume !~bvslt32(alloc_unsafe_17_~i~0#1, alloc_unsafe_17_~len#1); {3220#false} is VALID [2022-02-20 23:51:22,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {3220#false} assume { :begin_inline_alloc_unsafe_17 } true;alloc_unsafe_17_#in~array#1.base, alloc_unsafe_17_#in~array#1.offset, alloc_unsafe_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_unsafe_17_#res#1;havoc alloc_unsafe_17_#t~ret39#1.base, alloc_unsafe_17_#t~ret39#1.offset, alloc_unsafe_17_#t~post38#1, alloc_unsafe_17_#t~mem41#1.base, alloc_unsafe_17_#t~mem41#1.offset, alloc_unsafe_17_#t~post40#1, alloc_unsafe_17_~array#1.base, alloc_unsafe_17_~array#1.offset, alloc_unsafe_17_~len#1, alloc_unsafe_17_~p~0#1.base, alloc_unsafe_17_~p~0#1.offset, alloc_unsafe_17_~i~0#1, alloc_unsafe_17_~j~0#1;alloc_unsafe_17_~array#1.base, alloc_unsafe_17_~array#1.offset := alloc_unsafe_17_#in~array#1.base, alloc_unsafe_17_#in~array#1.offset;alloc_unsafe_17_~len#1 := alloc_unsafe_17_#in~len#1;havoc alloc_unsafe_17_~p~0#1.base, alloc_unsafe_17_~p~0#1.offset;alloc_unsafe_17_~i~0#1 := 0bv32;havoc alloc_unsafe_17_~j~0#1; {3220#false} is VALID [2022-02-20 23:51:22,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {3303#(bvslt |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)} assume !~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3220#false} is VALID [2022-02-20 23:51:22,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {3307#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3303#(bvslt |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:22,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {3307#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3307#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:22,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {3307#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3307#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:22,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {3317#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3307#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:22,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {3317#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3317#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:22,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {3317#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3317#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:22,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {3327#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {3317#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:22,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {3327#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3327#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:22,051 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3219#true} {3327#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} #118#return; {3327#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:22,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {3219#true} assume true; {3219#true} is VALID [2022-02-20 23:51:22,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {3219#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3219#true} is VALID [2022-02-20 23:51:22,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {3219#true} ~size := #in~size; {3219#true} is VALID [2022-02-20 23:51:22,052 INFO L272 TraceCheckUtils]: 2: Hoare triple {3327#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {3219#true} is VALID [2022-02-20 23:51:22,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {3219#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {3327#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:22,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {3219#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3219#true} is VALID [2022-02-20 23:51:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:22,060 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:22,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021613065] [2022-02-20 23:51:22,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021613065] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:22,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:22,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-20 23:51:22,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559383656] [2022-02-20 23:51:22,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:22,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-02-20 23:51:22,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:22,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:22,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:22,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:51:22,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:22,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:51:22,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:51:22,127 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:22,674 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-02-20 23:51:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:51:22,675 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-02-20 23:51:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2022-02-20 23:51:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2022-02-20 23:51:22,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 84 transitions. [2022-02-20 23:51:22,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:22,761 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:51:22,761 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:51:22,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:51:22,761 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 139 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:22,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 264 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:51:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-02-20 23:51:22,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:22,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 101 states, 80 states have (on average 1.4875) internal successors, (119), 97 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:22,764 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 101 states, 80 states have (on average 1.4875) internal successors, (119), 97 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:22,764 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 101 states, 80 states have (on average 1.4875) internal successors, (119), 97 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:22,766 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-02-20 23:51:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2022-02-20 23:51:22,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:22,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:22,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 80 states have (on average 1.4875) internal successors, (119), 97 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 102 states. [2022-02-20 23:51:22,767 INFO L87 Difference]: Start difference. First operand has 101 states, 80 states have (on average 1.4875) internal successors, (119), 97 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 102 states. [2022-02-20 23:51:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:22,769 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-02-20 23:51:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2022-02-20 23:51:22,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:22,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:22,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:22,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:22,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.4875) internal successors, (119), 97 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2022-02-20 23:51:22,771 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 21 [2022-02-20 23:51:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:22,771 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2022-02-20 23:51:22,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-02-20 23:51:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:51:22,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:22,772 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:22,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:22,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:22,978 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:22,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:22,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1435873458, now seen corresponding path program 2 times [2022-02-20 23:51:22,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:22,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812647163] [2022-02-20 23:51:22,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:51:22,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:22,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:22,980 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:22,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:51:23,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:51:23,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:51:23,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:51:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:23,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:23,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:23,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {3764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3764#true} is VALID [2022-02-20 23:51:23,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {3764#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {3772#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:23,406 INFO L272 TraceCheckUtils]: 2: Hoare triple {3772#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {3764#true} is VALID [2022-02-20 23:51:23,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {3764#true} ~size := #in~size; {3779#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:23,407 INFO L290 TraceCheckUtils]: 4: Hoare triple {3779#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3783#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {3783#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {3783#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,408 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3783#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {3772#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #118#return; {3790#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)))} is VALID [2022-02-20 23:51:23,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {3790#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3794#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {3794#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {3798#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {3798#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3798#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {3798#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3798#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {3798#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3808#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {3808#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3808#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {3808#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3808#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {3808#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3818#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {3818#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3818#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {3818#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3818#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {3818#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3828#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {3828#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3828#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {3828#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3828#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {3828#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3838#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {3838#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3842#(and (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:23,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {3842#(and (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)))); {3765#false} is VALID [2022-02-20 23:51:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:23,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:24,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {3846#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)))); {3765#false} is VALID [2022-02-20 23:51:24,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {3850#(or (not (bvslt |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3846#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} is VALID [2022-02-20 23:51:25,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {3854#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3850#(or (not (bvslt |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} is VALID [2022-02-20 23:51:25,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {3854#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3854#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:25,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {3854#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3854#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:26,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {3864#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3854#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:26,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {3864#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3864#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} is VALID [2022-02-20 23:51:26,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {3864#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3864#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} is VALID [2022-02-20 23:51:26,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {3874#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3864#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} is VALID [2022-02-20 23:51:26,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {3874#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3874#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:26,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {3874#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3874#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:27,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {3884#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {3874#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:27,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {3884#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {3884#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))))} is VALID [2022-02-20 23:51:27,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {3884#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3884#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))))} is VALID [2022-02-20 23:51:27,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {3894#(or (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {3884#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))))} is VALID [2022-02-20 23:51:27,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {3898#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_#t~ret44#1.offset|) (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv20 32)))) (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3894#(or (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:27,785 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3906#(or (and (bvule (bvadd (_ bv16 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv20 32))) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv20 32)) (select |#length| |ldv_malloc_#res.base|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} {3902#(or (bvule (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} #118#return; {3898#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_#t~ret44#1.offset|) (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv20 32)))) (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:27,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {3906#(or (and (bvule (bvadd (_ bv16 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv20 32))) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv20 32)) (select |#length| |ldv_malloc_#res.base|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} assume true; {3906#(or (and (bvule (bvadd (_ bv16 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv20 32))) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv20 32)) (select |#length| |ldv_malloc_#res.base|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} is VALID [2022-02-20 23:51:27,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {3913#(or (bvule (_ bv20 32) ldv_malloc_~size) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3906#(or (and (bvule (bvadd (_ bv16 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv20 32))) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv20 32)) (select |#length| |ldv_malloc_#res.base|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} is VALID [2022-02-20 23:51:27,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {3764#true} ~size := #in~size; {3913#(or (bvule (_ bv20 32) ldv_malloc_~size) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} is VALID [2022-02-20 23:51:27,788 INFO L272 TraceCheckUtils]: 2: Hoare triple {3902#(or (bvule (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {3764#true} is VALID [2022-02-20 23:51:27,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {3764#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {3902#(or (bvule (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:27,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {3764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3764#true} is VALID [2022-02-20 23:51:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:27,789 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:27,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812647163] [2022-02-20 23:51:27,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812647163] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:27,789 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:27,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2022-02-20 23:51:27,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566067807] [2022-02-20 23:51:27,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:27,790 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-02-20 23:51:27,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:27,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:30,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:30,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 23:51:30,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 23:51:30,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:51:30,798 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:38,174 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-02-20 23:51:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:51:38,174 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-02-20 23:51:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 144 transitions. [2022-02-20 23:51:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 144 transitions. [2022-02-20 23:51:38,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 144 transitions. [2022-02-20 23:51:38,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:38,434 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:51:38,434 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:51:38,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2022-02-20 23:51:38,435 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 384 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:38,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 622 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 465 Invalid, 0 Unknown, 95 Unchecked, 1.7s Time] [2022-02-20 23:51:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:51:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2022-02-20 23:51:38,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:38,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 114 states, 93 states have (on average 1.4516129032258065) internal successors, (135), 110 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:38,438 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 114 states, 93 states have (on average 1.4516129032258065) internal successors, (135), 110 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:38,438 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 114 states, 93 states have (on average 1.4516129032258065) internal successors, (135), 110 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:38,440 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-02-20 23:51:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-02-20 23:51:38,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:38,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:38,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 93 states have (on average 1.4516129032258065) internal successors, (135), 110 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 132 states. [2022-02-20 23:51:38,442 INFO L87 Difference]: Start difference. First operand has 114 states, 93 states have (on average 1.4516129032258065) internal successors, (135), 110 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 132 states. [2022-02-20 23:51:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:38,444 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-02-20 23:51:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-02-20 23:51:38,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:38,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:38,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:38,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.4516129032258065) internal successors, (135), 110 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-02-20 23:51:38,446 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 23 [2022-02-20 23:51:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:38,447 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-02-20 23:51:38,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-02-20 23:51:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:51:38,447 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:38,447 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:38,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:38,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:38,655 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:38,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1424196022, now seen corresponding path program 2 times [2022-02-20 23:51:38,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:38,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130498830] [2022-02-20 23:51:38,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:51:38,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:38,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:38,657 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:38,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:51:38,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:51:38,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:51:38,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:51:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:38,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:38,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:38,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {4454#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {4454#true} is VALID [2022-02-20 23:51:38,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {4454#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {4454#true} is VALID [2022-02-20 23:51:38,833 INFO L272 TraceCheckUtils]: 2: Hoare triple {4454#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {4454#true} is VALID [2022-02-20 23:51:38,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {4454#true} ~size := #in~size; {4454#true} is VALID [2022-02-20 23:51:38,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {4454#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {4471#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:38,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {4471#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {4471#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:38,835 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4471#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {4454#true} #118#return; {4478#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {4478#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {4482#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume { :begin_inline_alloc_unsafe_17 } true;alloc_unsafe_17_#in~array#1.base, alloc_unsafe_17_#in~array#1.offset, alloc_unsafe_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_unsafe_17_#res#1;havoc alloc_unsafe_17_#t~ret39#1.base, alloc_unsafe_17_#t~ret39#1.offset, alloc_unsafe_17_#t~post38#1, alloc_unsafe_17_#t~mem41#1.base, alloc_unsafe_17_#t~mem41#1.offset, alloc_unsafe_17_#t~post40#1, alloc_unsafe_17_~array#1.base, alloc_unsafe_17_~array#1.offset, alloc_unsafe_17_~len#1, alloc_unsafe_17_~p~0#1.base, alloc_unsafe_17_~p~0#1.offset, alloc_unsafe_17_~i~0#1, alloc_unsafe_17_~j~0#1;alloc_unsafe_17_~array#1.base, alloc_unsafe_17_~array#1.offset := alloc_unsafe_17_#in~array#1.base, alloc_unsafe_17_#in~array#1.offset;alloc_unsafe_17_~len#1 := alloc_unsafe_17_#in~len#1;havoc alloc_unsafe_17_~p~0#1.base, alloc_unsafe_17_~p~0#1.offset;alloc_unsafe_17_~i~0#1 := 0bv32;havoc alloc_unsafe_17_~j~0#1; {4546#(= (select |#valid| |ULTIMATE.start_alloc_unsafe_17_~array#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {4546#(= (select |#valid| |ULTIMATE.start_alloc_unsafe_17_~array#1.base|) (_ bv1 1))} assume !~bvslt32(alloc_unsafe_17_~i~0#1, alloc_unsafe_17_~len#1); {4546#(= (select |#valid| |ULTIMATE.start_alloc_unsafe_17_~array#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {4546#(= (select |#valid| |ULTIMATE.start_alloc_unsafe_17_~array#1.base|) (_ bv1 1))} alloc_unsafe_17_~j~0#1 := ~bvsub32(alloc_unsafe_17_~i~0#1, 1bv32); {4546#(= (select |#valid| |ULTIMATE.start_alloc_unsafe_17_~array#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {4546#(= (select |#valid| |ULTIMATE.start_alloc_unsafe_17_~array#1.base|) (_ bv1 1))} assume !!~bvsge32(alloc_unsafe_17_~j~0#1, 0bv32); {4546#(= (select |#valid| |ULTIMATE.start_alloc_unsafe_17_~array#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {4546#(= (select |#valid| |ULTIMATE.start_alloc_unsafe_17_~array#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[alloc_unsafe_17_~array#1.base]); {4455#false} is VALID [2022-02-20 23:51:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 23:51:38,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:38,847 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:38,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130498830] [2022-02-20 23:51:38,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130498830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:38,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:38,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:38,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611858872] [2022-02-20 23:51:38,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:38,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-20 23:51:38,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:38,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:38,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:38,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:51:38,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:38,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:51:38,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:51:38,864 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:39,429 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2022-02-20 23:51:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:51:39,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-20 23:51:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-02-20 23:51:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-02-20 23:51:39,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 126 transitions. [2022-02-20 23:51:39,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:39,532 INFO L225 Difference]: With dead ends: 156 [2022-02-20 23:51:39,532 INFO L226 Difference]: Without dead ends: 156 [2022-02-20 23:51:39,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:39,534 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:39,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 196 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:51:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-20 23:51:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 118. [2022-02-20 23:51:39,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:39,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 118 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 114 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:39,543 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 118 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 114 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:39,544 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 118 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 114 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:39,551 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2022-02-20 23:51:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 185 transitions. [2022-02-20 23:51:39,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:39,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:39,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 114 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 156 states. [2022-02-20 23:51:39,556 INFO L87 Difference]: Start difference. First operand has 118 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 114 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 156 states. [2022-02-20 23:51:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:39,559 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2022-02-20 23:51:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 185 transitions. [2022-02-20 23:51:39,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:39,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:39,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:39,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 114 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2022-02-20 23:51:39,562 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 33 [2022-02-20 23:51:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:39,562 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2022-02-20 23:51:39,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-02-20 23:51:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:51:39,563 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:39,563 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:39,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:39,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:39,769 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1424196021, now seen corresponding path program 1 times [2022-02-20 23:51:39,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:39,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157063718] [2022-02-20 23:51:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:39,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:39,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:39,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:39,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:51:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:39,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:51:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:39,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:40,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {5146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5146#true} is VALID [2022-02-20 23:51:40,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {5146#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {5154#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,062 INFO L272 TraceCheckUtils]: 2: Hoare triple {5154#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {5146#true} is VALID [2022-02-20 23:51:40,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {5146#true} ~size := #in~size; {5146#true} is VALID [2022-02-20 23:51:40,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {5146#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5146#true} is VALID [2022-02-20 23:51:40,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {5146#true} assume true; {5146#true} is VALID [2022-02-20 23:51:40,063 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5146#true} {5154#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #118#return; {5154#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {5154#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5154#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {5154#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {5176#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:40,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {5176#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5176#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:40,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {5176#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5176#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:40,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {5176#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5186#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} is VALID [2022-02-20 23:51:40,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {5186#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5186#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} is VALID [2022-02-20 23:51:40,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {5186#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5186#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} is VALID [2022-02-20 23:51:40,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {5186#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5196#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))))} is VALID [2022-02-20 23:51:40,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {5196#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5196#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))))} is VALID [2022-02-20 23:51:40,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {5196#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5196#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))))} is VALID [2022-02-20 23:51:40,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {5196#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5206#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} is VALID [2022-02-20 23:51:40,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {5206#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5206#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} is VALID [2022-02-20 23:51:40,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {5206#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5206#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} is VALID [2022-02-20 23:51:40,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {5206#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5216#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967292 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} is VALID [2022-02-20 23:51:40,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {5216#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967292 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5216#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967292 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} is VALID [2022-02-20 23:51:40,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {5216#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967292 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5216#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967292 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} is VALID [2022-02-20 23:51:40,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {5216#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvadd (_ bv4294967292 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5226#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)))} is VALID [2022-02-20 23:51:40,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {5226#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5226#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)))} is VALID [2022-02-20 23:51:40,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {5226#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5226#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)))} is VALID [2022-02-20 23:51:40,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {5226#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5236#(and (= (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)))} is VALID [2022-02-20 23:51:40,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {5236#(and (= (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)))} assume !~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5147#false} is VALID [2022-02-20 23:51:40,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {5147#false} assume { :begin_inline_alloc_unsafe_17 } true;alloc_unsafe_17_#in~array#1.base, alloc_unsafe_17_#in~array#1.offset, alloc_unsafe_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_unsafe_17_#res#1;havoc alloc_unsafe_17_#t~ret39#1.base, alloc_unsafe_17_#t~ret39#1.offset, alloc_unsafe_17_#t~post38#1, alloc_unsafe_17_#t~mem41#1.base, alloc_unsafe_17_#t~mem41#1.offset, alloc_unsafe_17_#t~post40#1, alloc_unsafe_17_~array#1.base, alloc_unsafe_17_~array#1.offset, alloc_unsafe_17_~len#1, alloc_unsafe_17_~p~0#1.base, alloc_unsafe_17_~p~0#1.offset, alloc_unsafe_17_~i~0#1, alloc_unsafe_17_~j~0#1;alloc_unsafe_17_~array#1.base, alloc_unsafe_17_~array#1.offset := alloc_unsafe_17_#in~array#1.base, alloc_unsafe_17_#in~array#1.offset;alloc_unsafe_17_~len#1 := alloc_unsafe_17_#in~len#1;havoc alloc_unsafe_17_~p~0#1.base, alloc_unsafe_17_~p~0#1.offset;alloc_unsafe_17_~i~0#1 := 0bv32;havoc alloc_unsafe_17_~j~0#1; {5147#false} is VALID [2022-02-20 23:51:40,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {5147#false} assume !~bvslt32(alloc_unsafe_17_~i~0#1, alloc_unsafe_17_~len#1); {5147#false} is VALID [2022-02-20 23:51:40,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {5147#false} alloc_unsafe_17_~j~0#1 := ~bvsub32(alloc_unsafe_17_~i~0#1, 1bv32); {5147#false} is VALID [2022-02-20 23:51:40,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {5147#false} assume !!~bvsge32(alloc_unsafe_17_~j~0#1, 0bv32); {5147#false} is VALID [2022-02-20 23:51:40,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {5147#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(alloc_unsafe_17_~array#1.offset, ~bvmul32(4bv32, alloc_unsafe_17_~j~0#1))), #length[alloc_unsafe_17_~array#1.base]) && ~bvule32(~bvadd32(alloc_unsafe_17_~array#1.offset, ~bvmul32(4bv32, alloc_unsafe_17_~j~0#1)), ~bvadd32(4bv32, ~bvadd32(alloc_unsafe_17_~array#1.offset, ~bvmul32(4bv32, alloc_unsafe_17_~j~0#1))))) && ~bvule32(0bv32, ~bvadd32(alloc_unsafe_17_~array#1.offset, ~bvmul32(4bv32, alloc_unsafe_17_~j~0#1)))); {5147#false} is VALID [2022-02-20 23:51:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:40,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:40,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {5147#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(alloc_unsafe_17_~array#1.offset, ~bvmul32(4bv32, alloc_unsafe_17_~j~0#1))), #length[alloc_unsafe_17_~array#1.base]) && ~bvule32(~bvadd32(alloc_unsafe_17_~array#1.offset, ~bvmul32(4bv32, alloc_unsafe_17_~j~0#1)), ~bvadd32(4bv32, ~bvadd32(alloc_unsafe_17_~array#1.offset, ~bvmul32(4bv32, alloc_unsafe_17_~j~0#1))))) && ~bvule32(0bv32, ~bvadd32(alloc_unsafe_17_~array#1.offset, ~bvmul32(4bv32, alloc_unsafe_17_~j~0#1)))); {5147#false} is VALID [2022-02-20 23:51:40,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {5147#false} assume !!~bvsge32(alloc_unsafe_17_~j~0#1, 0bv32); {5147#false} is VALID [2022-02-20 23:51:40,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {5147#false} alloc_unsafe_17_~j~0#1 := ~bvsub32(alloc_unsafe_17_~i~0#1, 1bv32); {5147#false} is VALID [2022-02-20 23:51:40,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {5147#false} assume !~bvslt32(alloc_unsafe_17_~i~0#1, alloc_unsafe_17_~len#1); {5147#false} is VALID [2022-02-20 23:51:40,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {5147#false} assume { :begin_inline_alloc_unsafe_17 } true;alloc_unsafe_17_#in~array#1.base, alloc_unsafe_17_#in~array#1.offset, alloc_unsafe_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_unsafe_17_#res#1;havoc alloc_unsafe_17_#t~ret39#1.base, alloc_unsafe_17_#t~ret39#1.offset, alloc_unsafe_17_#t~post38#1, alloc_unsafe_17_#t~mem41#1.base, alloc_unsafe_17_#t~mem41#1.offset, alloc_unsafe_17_#t~post40#1, alloc_unsafe_17_~array#1.base, alloc_unsafe_17_~array#1.offset, alloc_unsafe_17_~len#1, alloc_unsafe_17_~p~0#1.base, alloc_unsafe_17_~p~0#1.offset, alloc_unsafe_17_~i~0#1, alloc_unsafe_17_~j~0#1;alloc_unsafe_17_~array#1.base, alloc_unsafe_17_~array#1.offset := alloc_unsafe_17_#in~array#1.base, alloc_unsafe_17_#in~array#1.offset;alloc_unsafe_17_~len#1 := alloc_unsafe_17_#in~len#1;havoc alloc_unsafe_17_~p~0#1.base, alloc_unsafe_17_~p~0#1.offset;alloc_unsafe_17_~i~0#1 := 0bv32;havoc alloc_unsafe_17_~j~0#1; {5147#false} is VALID [2022-02-20 23:51:40,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {5270#(bvslt |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)} assume !~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5147#false} is VALID [2022-02-20 23:51:40,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {5274#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5270#(bvslt |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {5274#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5274#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {5274#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5274#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {5284#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5274#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {5284#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5284#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {5284#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5284#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {5294#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5284#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {5294#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5294#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {5294#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5294#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {5304#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5294#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {5304#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5304#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {5304#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5304#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {5314#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5304#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {5314#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5314#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {5314#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5314#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {5324#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5314#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {5324#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5324#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {5324#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5324#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {5334#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {5324#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {5334#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5334#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,484 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5146#true} {5334#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} #118#return; {5334#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {5146#true} assume true; {5146#true} is VALID [2022-02-20 23:51:40,484 INFO L290 TraceCheckUtils]: 4: Hoare triple {5146#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5146#true} is VALID [2022-02-20 23:51:40,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {5146#true} ~size := #in~size; {5146#true} is VALID [2022-02-20 23:51:40,484 INFO L272 TraceCheckUtils]: 2: Hoare triple {5334#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {5146#true} is VALID [2022-02-20 23:51:40,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {5146#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {5334#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:40,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {5146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5146#true} is VALID [2022-02-20 23:51:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:40,485 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:40,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157063718] [2022-02-20 23:51:40,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157063718] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:40,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:40,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-02-20 23:51:40,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553771611] [2022-02-20 23:51:40,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:40,485 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-02-20 23:51:40,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:40,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:40,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:40,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:51:40,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:40,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:51:40,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:51:40,643 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:41,706 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-02-20 23:51:41,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:51:41,706 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-02-20 23:51:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-02-20 23:51:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-02-20 23:51:41,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 95 transitions. [2022-02-20 23:51:41,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:41,804 INFO L225 Difference]: With dead ends: 118 [2022-02-20 23:51:41,804 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 23:51:41,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:51:41,805 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 159 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:41,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 427 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:51:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 23:51:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-02-20 23:51:41,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:41,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 97 states have (on average 1.422680412371134) internal successors, (138), 114 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:41,808 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 97 states have (on average 1.422680412371134) internal successors, (138), 114 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:41,808 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 97 states have (on average 1.422680412371134) internal successors, (138), 114 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:41,810 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-02-20 23:51:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2022-02-20 23:51:41,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:41,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:41,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 97 states have (on average 1.422680412371134) internal successors, (138), 114 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 118 states. [2022-02-20 23:51:41,810 INFO L87 Difference]: Start difference. First operand has 118 states, 97 states have (on average 1.422680412371134) internal successors, (138), 114 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 118 states. [2022-02-20 23:51:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:41,812 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-02-20 23:51:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2022-02-20 23:51:41,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:41,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:41,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:41,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.422680412371134) internal successors, (138), 114 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 143 transitions. [2022-02-20 23:51:41,814 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 143 transitions. Word has length 33 [2022-02-20 23:51:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:41,814 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 143 transitions. [2022-02-20 23:51:41,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2022-02-20 23:51:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:51:41,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:41,815 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:41,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-02-20 23:51:42,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:42,022 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:51:42,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2030306542, now seen corresponding path program 3 times [2022-02-20 23:51:42,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:42,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616582530] [2022-02-20 23:51:42,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:51:42,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:42,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:42,024 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:42,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:51:42,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-20 23:51:42,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:51:42,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:51:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:42,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:42,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:42,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {5836#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5836#true} is VALID [2022-02-20 23:51:42,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {5836#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {5844#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:42,969 INFO L272 TraceCheckUtils]: 2: Hoare triple {5844#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {5836#true} is VALID [2022-02-20 23:51:42,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {5836#true} ~size := #in~size; {5851#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:42,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {5851#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5855#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {5855#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {5855#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,972 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5855#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {5844#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #118#return; {5862#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)))} is VALID [2022-02-20 23:51:42,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {5862#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5866#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {5866#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {5870#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {5870#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5870#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {5870#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5870#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {5870#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5880#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {5880#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5880#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {5880#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5880#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {5880#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5890#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {5890#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5890#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {5890#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5890#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {5890#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5900#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {5900#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5900#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {5900#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5900#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {5900#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5910#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {5910#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5910#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {5910#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5910#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {5910#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5920#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {5920#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5920#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {5920#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5920#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {5920#(and (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5930#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv5 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {5930#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv5 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5930#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv5 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {5930#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv5 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5930#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv5 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {5930#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv5 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5940#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)))} is VALID [2022-02-20 23:51:42,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {5940#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5940#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)))} is VALID [2022-02-20 23:51:42,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {5940#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5940#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)))} is VALID [2022-02-20 23:51:42,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {5940#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5950#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {5950#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5950#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {5950#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5950#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {5950#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5960#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {5960#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5960#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {5960#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5960#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {5960#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~2#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5970#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:42,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {5970#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv4294967294 32))) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5837#false} is VALID [2022-02-20 23:51:42,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {5837#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)))); {5837#false} is VALID [2022-02-20 23:51:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:42,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:48,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {5977#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)))); {5837#false} is VALID [2022-02-20 23:51:48,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {5981#(or (not (bvslt |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5977#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))))} is VALID [2022-02-20 23:51:48,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {5985#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5981#(or (not (bvslt |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} is VALID [2022-02-20 23:51:48,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {5989#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5985#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:48,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {5989#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5989#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} is VALID [2022-02-20 23:51:50,908 WARN L290 TraceCheckUtils]: 35: Hoare triple {5996#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5989#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} is UNKNOWN [2022-02-20 23:51:50,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {5996#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {5996#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} is VALID [2022-02-20 23:51:50,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {5996#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {5996#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} is VALID [2022-02-20 23:51:52,915 WARN L290 TraceCheckUtils]: 32: Hoare triple {6006#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {5996#(or (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))))} is UNKNOWN [2022-02-20 23:51:52,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {6006#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {6006#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:52,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {6006#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {6006#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:54,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {6016#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {6006#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:54,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {6016#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {6016#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} is VALID [2022-02-20 23:51:54,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {6016#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {6016#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} is VALID [2022-02-20 23:51:56,461 WARN L290 TraceCheckUtils]: 26: Hoare triple {6026#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {6016#(or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv12 32)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} is UNKNOWN [2022-02-20 23:51:56,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {6026#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {6026#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:56,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {6026#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {6026#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:58,465 WARN L290 TraceCheckUtils]: 23: Hoare triple {6036#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {6026#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is UNKNOWN [2022-02-20 23:51:58,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {6036#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {6036#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} is VALID [2022-02-20 23:51:58,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {6036#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {6036#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} is VALID [2022-02-20 23:52:00,473 WARN L290 TraceCheckUtils]: 20: Hoare triple {6046#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {6036#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv20 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))))} is UNKNOWN [2022-02-20 23:52:00,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {6046#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {6046#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))))} is VALID [2022-02-20 23:52:00,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {6046#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {6046#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))))} is VALID [2022-02-20 23:52:02,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {6056#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {6046#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv24 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))))} is VALID [2022-02-20 23:52:02,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {6056#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {6056#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:52:02,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {6056#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {6056#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:52:03,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {6066#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {6056#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:52:03,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {6066#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {6066#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:52:03,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {6066#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {6066#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:52:05,975 WARN L290 TraceCheckUtils]: 11: Hoare triple {6076#(or (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := ~bvadd32(1bv32, entry_point_#t~post45#1);havoc entry_point_#t~post45#1; {6066#(or (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv32 32)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is UNKNOWN [2022-02-20 23:52:05,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {6076#(or (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~2#1)), 4bv32); srcloc: L787 {6076#(or (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:52:05,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {6076#(or (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {6076#(or (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:52:05,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {6086#(or (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32)))) (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !(entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32);entry_point_~i~2#1 := 0bv32; {6076#(or (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)))) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~2#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~2#1|) (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:52:05,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {6090#(or (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_#t~ret44#1.offset|) (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv40 32)))) (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|))))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {6086#(or (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32)))) (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:52:05,985 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6098#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|) |ldv_malloc_#in~size|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|)))) (and (bvule (bvadd |ldv_malloc_#res.offset| (_ bv44 32)) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (bvadd |ldv_malloc_#res.offset| (_ bv44 32)))) (not (bvule (bvadd (_ bv36 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv40 32)))) (not (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (select |#length| |ldv_malloc_#res.base|))))} {6094#(or (not (bvule (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))) (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (bvule (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} #118#return; {6090#(or (not (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_#t~ret44#1.offset|) (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv40 32)))) (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|))) (not (bvule (bvadd |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv40 32)) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|))))} is VALID [2022-02-20 23:52:05,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {6098#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|) |ldv_malloc_#in~size|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|)))) (and (bvule (bvadd |ldv_malloc_#res.offset| (_ bv44 32)) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (bvadd |ldv_malloc_#res.offset| (_ bv44 32)))) (not (bvule (bvadd (_ bv36 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv40 32)))) (not (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (select |#length| |ldv_malloc_#res.base|))))} assume true; {6098#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|) |ldv_malloc_#in~size|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|)))) (and (bvule (bvadd |ldv_malloc_#res.offset| (_ bv44 32)) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (bvadd |ldv_malloc_#res.offset| (_ bv44 32)))) (not (bvule (bvadd (_ bv36 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv40 32)))) (not (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (select |#length| |ldv_malloc_#res.base|))))} is VALID [2022-02-20 23:52:05,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {6105#(or (bvule (_ bv44 32) ldv_malloc_~size) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|) |ldv_malloc_#in~size|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|)))) (not (bvule (_ bv40 32) ldv_malloc_~size)))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6098#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|) |ldv_malloc_#in~size|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|)))) (and (bvule (bvadd |ldv_malloc_#res.offset| (_ bv44 32)) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (bvadd |ldv_malloc_#res.offset| (_ bv44 32)))) (not (bvule (bvadd (_ bv36 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv40 32)))) (not (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (select |#length| |ldv_malloc_#res.base|))))} is VALID [2022-02-20 23:52:05,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {5836#true} ~size := #in~size; {6105#(or (bvule (_ bv44 32) ldv_malloc_~size) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|) |ldv_malloc_#in~size|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_14|)))) (not (bvule (_ bv40 32) ldv_malloc_~size)))} is VALID [2022-02-20 23:52:05,989 INFO L272 TraceCheckUtils]: 2: Hoare triple {6094#(or (not (bvule (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))) (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (bvule (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {5836#true} is VALID [2022-02-20 23:52:05,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {5836#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10bv32; {6094#(or (not (bvule (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))) (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (bvule (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:52:05,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {5836#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5836#true} is VALID [2022-02-20 23:52:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:05,991 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:05,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616582530] [2022-02-20 23:52:05,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616582530] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:52:05,991 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:52:05,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2022-02-20 23:52:05,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763097901] [2022-02-20 23:52:05,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:52:05,992 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-02-20 23:52:05,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:05,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 36 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)