./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-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_1-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 b6787eb3a37902efa71d2cd0d9e143f31d9492f6d095b3afd518dba74579db5b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:05,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:05,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:05,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:05,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:05,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:05,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:05,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:05,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:05,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:05,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:05,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:05,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:05,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:05,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:05,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:05,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:05,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:05,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:05,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:05,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:05,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:05,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:05,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:05,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:05,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:05,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:05,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:05,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:05,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:05,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:05,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:05,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:05,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:05,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:05,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:05,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:05,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:05,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:05,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:05,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:05,604 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:05,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:05,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:05,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:05,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:05,649 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:05,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:05,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:05,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:05,650 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:05,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:05,651 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:05,652 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:05,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:05,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:05,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:05,652 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:05,652 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:05,652 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:05,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:05,653 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:05,653 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:05,653 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:05,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:05,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:05,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:05,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:05,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:05,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:05,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:51:05,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:51:05,655 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 -> b6787eb3a37902efa71d2cd0d9e143f31d9492f6d095b3afd518dba74579db5b [2022-02-20 23:51:05,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:05,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:05,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:05,915 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:05,915 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:05,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2022-02-20 23:51:05,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2168d946/f8c522c1fda04a11b66e872f2be0df3c/FLAGca4a15d06 [2022-02-20 23:51:06,364 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:06,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2022-02-20 23:51:06,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2168d946/f8c522c1fda04a11b66e872f2be0df3c/FLAGca4a15d06 [2022-02-20 23:51:06,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2168d946/f8c522c1fda04a11b66e872f2be0df3c [2022-02-20 23:51:06,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:06,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:06,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:06,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:06,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:06,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:06" (1/1) ... [2022-02-20 23:51:06,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7071eff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06, skipping insertion in model container [2022-02-20 23:51:06,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:06" (1/1) ... [2022-02-20 23:51:06,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:06,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:07,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:07,111 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,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f1ca1db 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,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:07,113 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,115 INFO L158 Benchmark]: Toolchain (without parser) took 365.59ms. Allocated memory is still 102.8MB. Free memory was 74.4MB in the beginning and 69.9MB in the end (delta: 4.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-02-20 23:51:07,115 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 57.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:51:07,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.44ms. Allocated memory is still 102.8MB. Free memory was 74.2MB in the beginning and 70.1MB in the end (delta: 4.1MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-02-20 23:51:07,117 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.15ms. Allocated memory is still 102.8MB. Free memory is still 57.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.44ms. Allocated memory is still 102.8MB. Free memory was 74.2MB in the beginning and 70.1MB in the end (delta: 4.1MB). Peak memory consumption was 7.2MB. 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_1-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 b6787eb3a37902efa71d2cd0d9e143f31d9492f6d095b3afd518dba74579db5b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:08,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:08,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:08,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:08,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:08,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:08,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:08,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:08,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:08,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:08,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:08,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:08,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:08,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:08,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:08,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:08,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:08,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:08,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:08,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:08,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:08,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:08,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:08,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:08,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:08,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:08,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:08,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:08,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:08,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:08,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:08,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:08,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:08,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:08,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:08,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:08,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:08,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:08,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:08,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:08,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:08,800 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:08,825 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:08,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:08,830 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:08,830 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:08,831 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:08,831 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:08,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:08,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:08,833 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:08,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:08,834 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:08,834 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:08,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:08,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:08,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:08,834 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:08,835 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:08,835 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:08,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:08,835 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:08,835 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:51:08,835 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:51:08,835 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:08,835 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:08,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:08,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:08,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:08,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:08,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:08,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:08,837 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:51:08,837 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:51:08,837 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:51:08,837 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 -> b6787eb3a37902efa71d2cd0d9e143f31d9492f6d095b3afd518dba74579db5b [2022-02-20 23:51:09,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:09,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:09,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:09,161 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:09,161 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:09,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2022-02-20 23:51:09,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc494e1c/8bbbf361623344c69b551f16615b41fe/FLAG46bebe06c [2022-02-20 23:51:09,640 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:09,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2022-02-20 23:51:09,662 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc494e1c/8bbbf361623344c69b551f16615b41fe/FLAG46bebe06c [2022-02-20 23:51:09,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc494e1c/8bbbf361623344c69b551f16615b41fe [2022-02-20 23:51:09,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:09,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:09,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:09,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:09,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:09,685 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,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fb12ab 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,687 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,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:09,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:10,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:10,127 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:51:10,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:10,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:10,200 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:51:10,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:10,286 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:51:10,286 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,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:10,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:10,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:51:10,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:51:10,292 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,313 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,330 INFO L137 Inliner]: procedures = 167, calls = 78, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 85 [2022-02-20 23:51:10,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:10,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:51:10,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:51:10,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:51:10,339 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,339 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,343 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,343 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,350 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,353 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,354 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,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:51:10,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:51:10,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:51:10,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:51:10,357 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,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:10,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:51:10,391 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,394 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,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:51:10,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:51:10,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:51:10,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:51:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:51:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:51:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:51:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:51:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:51:10,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:51:10,499 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:51:10,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:51:10,899 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:51:10,904 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:51:10,904 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:51:10,905 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,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:51:10,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:51:10,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:51:10,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:51:10,909 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:10,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ab3d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:10, skipping insertion in model container [2022-02-20 23:51:10,909 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:10,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ab3d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:10, skipping insertion in model container [2022-02-20 23:51:10,910 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:10,911 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1-1.i [2022-02-20 23:51:10,914 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:51:10,915 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-02-20 23:51:10,942 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:51:10,946 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:10,946 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-02-20 23:51:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 54 states have internal predecessors, (65), 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:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:10,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:10,963 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:10,963 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash 67903625, now seen corresponding path program 1 times [2022-02-20 23:51:10,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:10,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309563406] [2022-02-20 23:51:10,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:10,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:10,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:10,978 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,000 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,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:11,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:51:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:11,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:11,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#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); {61#true} is VALID [2022-02-20 23:51:11,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#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; {61#true} is VALID [2022-02-20 23:51:11,200 INFO L272 TraceCheckUtils]: 2: Hoare triple {61#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {61#true} is VALID [2022-02-20 23:51:11,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {61#true} ~size := #in~size; {61#true} is VALID [2022-02-20 23:51:11,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {61#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; {78#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {78#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {78#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,203 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {78#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {61#true} #117#return; {85#(not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {85#(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; {89#(not (= |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {89#(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; {62#false} is VALID [2022-02-20 23:51:11,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#false} assume { :end_inline_entry_point } true; {62#false} is VALID [2022-02-20 23:51:11,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#false} assume !(#valid == main_old_#valid#1); {62#false} is VALID [2022-02-20 23:51:11,206 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,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:11,207 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:11,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309563406] [2022-02-20 23:51:11,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309563406] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:11,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:11,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:11,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126220435] [2022-02-20 23:51:11,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:11,213 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,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:11,217 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,234 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,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:11,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:11,258 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 54 states have internal predecessors, (65), 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,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:11,667 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-02-20 23:51:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:11,668 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,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:11,669 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,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2022-02-20 23:51:11,675 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,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2022-02-20 23:51:11,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 134 transitions. [2022-02-20 23:51:11,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:11,807 INFO L225 Difference]: With dead ends: 111 [2022-02-20 23:51:11,807 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 23:51:11,809 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,816 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 53 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:11,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 242 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 23:51:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2022-02-20 23:51:11,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:11,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 60 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 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,850 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 60 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 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,851 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 60 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 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,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:11,863 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2022-02-20 23:51:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-02-20 23:51:11,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:11,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:11,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 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 107 states. [2022-02-20 23:51:11,867 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 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 107 states. [2022-02-20 23:51:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:11,880 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2022-02-20 23:51:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-02-20 23:51:11,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:11,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:11,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:11,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 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,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-02-20 23:51:11,890 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 11 [2022-02-20 23:51:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:11,891 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-02-20 23:51:11,891 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,891 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-02-20 23:51:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:11,895 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:11,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:11,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:51:12,101 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,102 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 67902731, now seen corresponding path program 1 times [2022-02-20 23:51:12,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:12,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891584060] [2022-02-20 23:51:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:12,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:12,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:12,105 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,107 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,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:12,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:51:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:12,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:12,185 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,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#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); {483#true} is VALID [2022-02-20 23:51:12,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#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; {483#true} is VALID [2022-02-20 23:51:12,213 INFO L272 TraceCheckUtils]: 2: Hoare triple {483#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {483#true} is VALID [2022-02-20 23:51:12,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#true} ~size := #in~size; {483#true} is VALID [2022-02-20 23:51:12,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#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; {500#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:12,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {500#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {500#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:12,216 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {500#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {483#true} #117#return; {507#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:12,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(= (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; {511#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:12,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {511#(= (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; {511#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:12,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {511#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {511#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:12,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {511#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~array~0#1.base]); {484#false} is VALID [2022-02-20 23:51:12,217 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,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:12,218 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:12,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891584060] [2022-02-20 23:51:12,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891584060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:12,218 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:12,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:51:12,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564490776] [2022-02-20 23:51:12,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:12,219 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,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:12,220 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,228 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,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:12,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:12,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:12,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:12,229 INFO L87 Difference]: Start difference. First operand 60 states and 68 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,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:12,663 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2022-02-20 23:51:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:12,663 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,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:12,663 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,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-02-20 23:51:12,665 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,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-02-20 23:51:12,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2022-02-20 23:51:12,770 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:12,772 INFO L225 Difference]: With dead ends: 82 [2022-02-20 23:51:12,772 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 23:51:12,772 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,773 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 22 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:12,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 166 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 23:51:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2022-02-20 23:51:12,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:12,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 62 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 57 states have internal predecessors, (66), 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,780 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 62 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 57 states have internal predecessors, (66), 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,781 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 62 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 57 states have internal predecessors, (66), 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,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:12,783 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2022-02-20 23:51:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-02-20 23:51:12,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:12,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:12,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 57 states have internal predecessors, (66), 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 82 states. [2022-02-20 23:51:12,785 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 57 states have internal predecessors, (66), 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 82 states. [2022-02-20 23:51:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:12,787 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2022-02-20 23:51:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-02-20 23:51:12,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:12,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:12,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:12,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 57 states have internal predecessors, (66), 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,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-02-20 23:51:12,790 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 11 [2022-02-20 23:51:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:12,790 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-02-20 23:51:12,791 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,791 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-02-20 23:51:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:12,791 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:12,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:12,801 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:12,998 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:12,998 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash 67902732, now seen corresponding path program 1 times [2022-02-20 23:51:13,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:13,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266705604] [2022-02-20 23:51:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:13,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:13,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:13,001 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,005 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,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:13,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:51:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:13,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:13,083 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,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {828#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); {828#true} is VALID [2022-02-20 23:51:13,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {828#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; {836#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:13,201 INFO L272 TraceCheckUtils]: 2: Hoare triple {836#(= |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)); {828#true} is VALID [2022-02-20 23:51:13,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {828#true} ~size := #in~size; {843#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:13,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#(= 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; {847#(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,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {847#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {847#(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,204 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {847#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {836#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #117#return; {854#(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,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {854#(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; {858#(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,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(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; {862#(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,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {862#(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); {862#(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,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {862#(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)))); {829#false} is VALID [2022-02-20 23:51:13,206 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,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:13,206 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:13,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266705604] [2022-02-20 23:51:13,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266705604] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:13,207 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:13,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:51:13,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752071200] [2022-02-20 23:51:13,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:13,207 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,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:13,207 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,222 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,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:51:13,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:13,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:51:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:51:13,223 INFO L87 Difference]: Start difference. First operand 62 states and 72 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,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:14,539 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-02-20 23:51:14,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:51:14,539 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,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:14,540 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,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-02-20 23:51:14,542 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,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-02-20 23:51:14,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-02-20 23:51:14,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:14,688 INFO L225 Difference]: With dead ends: 89 [2022-02-20 23:51:14,689 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 23:51:14,689 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,690 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 88 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:14,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 345 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:51:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 23:51:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2022-02-20 23:51:14,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:14,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 64 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 59 states have internal predecessors, (68), 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,694 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 64 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 59 states have internal predecessors, (68), 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,694 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 64 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 59 states have internal predecessors, (68), 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,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:14,696 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-02-20 23:51:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2022-02-20 23:51:14,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:14,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:14,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 59 states have internal predecessors, (68), 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 89 states. [2022-02-20 23:51:14,703 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 59 states have internal predecessors, (68), 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 89 states. [2022-02-20 23:51:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:14,705 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-02-20 23:51:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2022-02-20 23:51:14,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:14,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:14,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:14,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 59 states have internal predecessors, (68), 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,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2022-02-20 23:51:14,708 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 11 [2022-02-20 23:51:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:14,708 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2022-02-20 23:51:14,708 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,708 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-02-20 23:51:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:14,709 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:14,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:14,729 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,915 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,916 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:14,916 INFO L85 PathProgramCache]: Analyzing trace with hash 955407306, now seen corresponding path program 1 times [2022-02-20 23:51:14,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:14,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218550458] [2022-02-20 23:51:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:14,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:14,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:14,918 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,919 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,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:14,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:51:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:14,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:14,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {1207#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); {1207#true} is VALID [2022-02-20 23:51:14,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1207#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; {1215#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:14,988 INFO L272 TraceCheckUtils]: 2: Hoare triple {1215#(= |#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)); {1219#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:14,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {1219#(= |old(#valid)| |#valid|)} ~size := #in~size; {1219#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:14,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {1219#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1219#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:14,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#(= |old(#valid)| |#valid|)} assume true; {1219#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:14,990 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1219#(= |old(#valid)| |#valid|)} {1215#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #117#return; {1215#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:14,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {1215#(= |#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; {1215#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:14,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {1215#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume entry_point_~array~0#1.base == 0bv32 && entry_point_~array~0#1.offset == 0bv32; {1215#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:14,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {1215#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {1215#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:14,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {1215#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {1208#false} is VALID [2022-02-20 23:51:14,991 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,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:14,991 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:14,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218550458] [2022-02-20 23:51:14,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218550458] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:14,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:14,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:51:14,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645734206] [2022-02-20 23:51:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:14,992 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,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:14,993 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,999 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,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:51:14,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:15,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:51:15,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:51:15,000 INFO L87 Difference]: Start difference. First operand 64 states and 74 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,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:15,419 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-02-20 23:51:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:51:15,420 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,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:15,420 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,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-02-20 23:51:15,422 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,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-02-20 23:51:15,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-02-20 23:51:15,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:15,532 INFO L225 Difference]: With dead ends: 104 [2022-02-20 23:51:15,532 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 23:51:15,532 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,533 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:15,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 180 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:15,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 23:51:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 80. [2022-02-20 23:51:15,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:15,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 80 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 74 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:51:15,537 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 80 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 74 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:51:15,538 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 80 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 74 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:51:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:15,540 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-02-20 23:51:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2022-02-20 23:51:15,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:15,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:15,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 74 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Second operand 101 states. [2022-02-20 23:51:15,541 INFO L87 Difference]: Start difference. First operand has 80 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 74 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Second operand 101 states. [2022-02-20 23:51:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:15,543 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-02-20 23:51:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2022-02-20 23:51:15,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:15,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:15,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:15,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 74 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:51:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2022-02-20 23:51:15,546 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 11 [2022-02-20 23:51:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:15,546 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2022-02-20 23:51:15,547 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,547 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-02-20 23:51:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:15,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:15,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:15,565 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,753 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,754 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:15,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:15,754 INFO L85 PathProgramCache]: Analyzing trace with hash 955406412, now seen corresponding path program 1 times [2022-02-20 23:51:15,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:15,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655747719] [2022-02-20 23:51:15,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:15,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:15,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:15,756 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,759 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,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:15,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:51:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:15,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:15,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#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); {1629#true} is VALID [2022-02-20 23:51:15,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {1629#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; {1629#true} is VALID [2022-02-20 23:51:15,858 INFO L272 TraceCheckUtils]: 2: Hoare triple {1629#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {1629#true} is VALID [2022-02-20 23:51:15,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {1629#true} ~size := #in~size; {1629#true} is VALID [2022-02-20 23:51:15,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {1629#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1646#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:15,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {1646#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {1646#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:15,862 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1646#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {1629#true} #117#return; {1653#(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,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {1653#(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; {1657#(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,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {1657#(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; {1630#false} is VALID [2022-02-20 23:51:15,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {1630#false} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {1630#false} is VALID [2022-02-20 23:51:15,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {1630#false} assume !(1bv1 == #valid[entry_point_~array~0#1.base]); {1630#false} is VALID [2022-02-20 23:51:15,864 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,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:15,864 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:15,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655747719] [2022-02-20 23:51:15,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655747719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:15,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:15,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:15,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026151590] [2022-02-20 23:51:15,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:15,865 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,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:15,865 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,873 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,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:15,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:15,874 INFO L87 Difference]: Start difference. First operand 80 states and 98 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,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:16,172 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-02-20 23:51:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:16,172 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,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:16,173 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,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-02-20 23:51:16,174 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,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-02-20 23:51:16,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-02-20 23:51:16,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:16,238 INFO L225 Difference]: With dead ends: 61 [2022-02-20 23:51:16,238 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 23:51:16,239 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,239 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:16,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 23:51:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-02-20 23:51:16,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:16,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 55 states have internal predecessors, (60), 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,242 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 55 states have internal predecessors, (60), 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,242 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 55 states have internal predecessors, (60), 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,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:16,244 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-02-20 23:51:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-02-20 23:51:16,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:16,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:16,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 55 states have internal predecessors, (60), 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 59 states. [2022-02-20 23:51:16,245 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 55 states have internal predecessors, (60), 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 59 states. [2022-02-20 23:51:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:16,246 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-02-20 23:51:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-02-20 23:51:16,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:16,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:16,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:16,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 55 states have internal predecessors, (60), 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,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-02-20 23:51:16,248 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 11 [2022-02-20 23:51:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:16,248 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-02-20 23:51:16,248 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,248 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-02-20 23:51:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:51:16,249 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:16,249 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:16,271 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,455 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,456 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:16,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:16,456 INFO L85 PathProgramCache]: Analyzing trace with hash -39339339, now seen corresponding path program 1 times [2022-02-20 23:51:16,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:16,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294719432] [2022-02-20 23:51:16,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:16,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:16,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:16,460 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,462 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,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:16,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:51:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:16,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:16,538 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,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {1904#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); {1904#true} is VALID [2022-02-20 23:51:16,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {1904#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; {1912#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:16,706 INFO L272 TraceCheckUtils]: 2: Hoare triple {1912#(= |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)); {1904#true} is VALID [2022-02-20 23:51:16,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {1904#true} ~size := #in~size; {1919#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:16,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {1919#(= 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; {1923#(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,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {1923#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {1923#(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,709 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1923#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {1912#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #117#return; {1930#(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,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {1930#(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; {1934#(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,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {1934#(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; {1938#(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,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#(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); {1938#(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,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {1938#(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: L789 {1938#(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,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {1938#(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; {1948#(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,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {1948#(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); {1948#(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,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {1948#(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)))); {1905#false} is VALID [2022-02-20 23:51:16,712 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,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:17,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {1955#(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)))); {1905#false} is VALID [2022-02-20 23:51:17,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {1955#(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); {1955#(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,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {1962#(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; {1955#(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,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {1962#(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: L789 {1962#(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,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {1962#(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); {1962#(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,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {1972#(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; {1962#(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,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {1976#(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; {1972#(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,940 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1984#(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|))))))} {1980#(bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))} #117#return; {1976#(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,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {1984#(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; {1984#(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,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {1991#(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; {1984#(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,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {1904#true} ~size := #in~size; {1991#(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,951 INFO L272 TraceCheckUtils]: 2: Hoare triple {1980#(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)); {1904#true} is VALID [2022-02-20 23:51:17,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {1904#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; {1980#(bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-20 23:51:17,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {1904#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); {1904#true} is VALID [2022-02-20 23:51:17,952 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,952 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:17,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294719432] [2022-02-20 23:51:17,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294719432] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:17,952 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:17,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-02-20 23:51:17,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866912504] [2022-02-20 23:51:17,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:17,953 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,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:17,953 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,405 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,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:51:18,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:51:18,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:51:18,406 INFO L87 Difference]: Start difference. First operand 59 states and 65 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:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:20,779 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2022-02-20 23:51:20,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:51:20,779 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:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:20,779 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:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2022-02-20 23:51:20,781 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:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2022-02-20 23:51:20,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 148 transitions. [2022-02-20 23:51:20,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:20,993 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:51:20,993 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:51:20,993 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:20,993 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 265 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:20,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 401 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 177 Invalid, 0 Unknown, 75 Unchecked, 0.6s Time] [2022-02-20 23:51:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:51:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 68. [2022-02-20 23:51:20,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:20,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 68 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 64 states have internal predecessors, (71), 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:20,997 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 68 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 64 states have internal predecessors, (71), 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:20,997 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 68 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 64 states have internal predecessors, (71), 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:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:20,999 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2022-02-20 23:51:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2022-02-20 23:51:21,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:21,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:21,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 64 states have internal predecessors, (71), 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 127 states. [2022-02-20 23:51:21,000 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 64 states have internal predecessors, (71), 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 127 states. [2022-02-20 23:51:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:21,005 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2022-02-20 23:51:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2022-02-20 23:51:21,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:21,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:21,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:21,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 64 states have internal predecessors, (71), 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,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-02-20 23:51:21,008 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 14 [2022-02-20 23:51:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:21,008 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-02-20 23:51:21,009 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,009 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-02-20 23:51:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:51:21,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:21,009 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:21,018 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,216 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,216 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:21,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1216843566, now seen corresponding path program 1 times [2022-02-20 23:51:21,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:21,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980183172] [2022-02-20 23:51:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:21,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:21,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:21,218 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,219 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,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:21,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:51:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:21,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:21,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {2463#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); {2463#true} is VALID [2022-02-20 23:51:21,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {2463#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; {2471#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:21,372 INFO L272 TraceCheckUtils]: 2: Hoare triple {2471#(= |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)); {2463#true} is VALID [2022-02-20 23:51:21,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {2463#true} ~size := #in~size; {2463#true} is VALID [2022-02-20 23:51:21,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {2463#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; {2463#true} is VALID [2022-02-20 23:51:21,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {2463#true} assume true; {2463#true} is VALID [2022-02-20 23:51:21,373 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2463#true} {2471#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #117#return; {2471#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:21,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {2471#(= |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; {2471#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:21,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {2471#(= |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; {2493#(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,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {2493#(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); {2493#(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,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {2493#(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: L789 {2493#(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,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {2493#(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; {2503#(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,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {2503#(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); {2503#(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,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {2503#(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: L789 {2503#(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,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {2503#(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; {2513#(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,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {2513#(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); {2464#false} is VALID [2022-02-20 23:51:21,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {2464#false} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {2464#false} is VALID [2022-02-20 23:51:21,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {2464#false} assume !~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {2464#false} is VALID [2022-02-20 23:51:21,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {2464#false} alloc_17_#res#1 := 0bv32; {2464#false} is VALID [2022-02-20 23:51:21,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {2464#false} entry_point_#t~ret46#1 := alloc_17_#res#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret46#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem43#1.base, free_17_#t~mem43#1.offset, free_17_#t~post42#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0bv32; {2464#false} is VALID [2022-02-20 23:51:21,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {2464#false} assume !!~bvslt32(free_17_~i~1#1, free_17_~len#1); {2464#false} is VALID [2022-02-20 23:51:21,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {2464#false} assume !(1bv1 == #valid[free_17_~array#1.base]); {2464#false} is VALID [2022-02-20 23:51:21,381 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,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:21,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {2464#false} assume !(1bv1 == #valid[free_17_~array#1.base]); {2464#false} is VALID [2022-02-20 23:51:21,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {2464#false} assume !!~bvslt32(free_17_~i~1#1, free_17_~len#1); {2464#false} is VALID [2022-02-20 23:51:21,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {2464#false} entry_point_#t~ret46#1 := alloc_17_#res#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret46#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem43#1.base, free_17_#t~mem43#1.offset, free_17_#t~post42#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0bv32; {2464#false} is VALID [2022-02-20 23:51:21,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {2464#false} alloc_17_#res#1 := 0bv32; {2464#false} is VALID [2022-02-20 23:51:21,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {2464#false} assume !~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {2464#false} is VALID [2022-02-20 23:51:21,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {2464#false} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {2464#false} is VALID [2022-02-20 23:51:21,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {2553#(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); {2464#false} is VALID [2022-02-20 23:51:21,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(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; {2553#(bvslt |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:21,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {2557#(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: L789 {2557#(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:21,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(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); {2557#(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:21,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {2567#(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; {2557#(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:21,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {2567#(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: L789 {2567#(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:21,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {2567#(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); {2567#(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:21,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {2577#(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; {2567#(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:21,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {2577#(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; {2577#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:21,582 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2463#true} {2577#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} #117#return; {2577#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:21,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {2463#true} assume true; {2463#true} is VALID [2022-02-20 23:51:21,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {2463#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; {2463#true} is VALID [2022-02-20 23:51:21,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {2463#true} ~size := #in~size; {2463#true} is VALID [2022-02-20 23:51:21,583 INFO L272 TraceCheckUtils]: 2: Hoare triple {2577#(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)); {2463#true} is VALID [2022-02-20 23:51:21,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {2463#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; {2577#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:21,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {2463#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); {2463#true} is VALID [2022-02-20 23:51:21,586 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,586 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:21,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980183172] [2022-02-20 23:51:21,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980183172] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:21,587 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:21,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-20 23:51:21,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624078911] [2022-02-20 23:51:21,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:21,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 22 [2022-02-20 23:51:21,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:21,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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:21,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:21,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:51:21,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:21,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:51:21,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:51:21,650 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:22,151 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-02-20 23:51:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:51:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 22 [2022-02-20 23:51:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-02-20 23:51:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-02-20 23:51:22,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 82 transitions. [2022-02-20 23:51:22,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:22,230 INFO L225 Difference]: With dead ends: 74 [2022-02-20 23:51:22,230 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 23:51:22,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 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,230 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 76 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:22,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 218 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 23:51:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-02-20 23:51:22,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:22,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 73 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 69 states have internal predecessors, (75), 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,233 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 73 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 69 states have internal predecessors, (75), 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,233 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 73 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 69 states have internal predecessors, (75), 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,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:22,234 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-02-20 23:51:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-02-20 23:51:22,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:22,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:22,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 69 states have internal predecessors, (75), 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 74 states. [2022-02-20 23:51:22,235 INFO L87 Difference]: Start difference. First operand has 73 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 69 states have internal predecessors, (75), 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 74 states. [2022-02-20 23:51:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:22,236 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-02-20 23:51:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-02-20 23:51:22,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:22,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:22,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:22,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 69 states have internal predecessors, (75), 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,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-02-20 23:51:22,238 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 22 [2022-02-20 23:51:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:22,239 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-02-20 23:51:22,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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,239 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-02-20 23:51:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:51:22,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:22,239 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:22,254 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,445 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,446 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:22,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1294433228, now seen corresponding path program 2 times [2022-02-20 23:51:22,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:22,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035500638] [2022-02-20 23:51:22,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:51:22,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:22,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:22,448 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,449 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:22,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:51:22,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:51:22,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:51:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:22,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:22,569 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:22,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {2902#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); {2902#true} is VALID [2022-02-20 23:51:22,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#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; {2910#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:22,987 INFO L272 TraceCheckUtils]: 2: Hoare triple {2910#(= |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)); {2902#true} is VALID [2022-02-20 23:51:22,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {2902#true} ~size := #in~size; {2917#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:22,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {2917#(= 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; {2921#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:22,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {2921#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:22,989 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2921#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {2910#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #117#return; {2928#(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:22,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {2928#(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; {2932#(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:22,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {2932#(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; {2936#(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:22,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {2936#(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); {2936#(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:22,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {2936#(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: L789 {2936#(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:22,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {2936#(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; {2946#(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:22,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {2946#(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); {2946#(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:22,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {2946#(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: L789 {2946#(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:22,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {2946#(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; {2956#(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:22,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {2956#(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); {2956#(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:22,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {2956#(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: L789 {2956#(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:22,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {2956#(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; {2966#(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:22,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {2966#(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); {2966#(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:22,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {2966#(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: L789 {2966#(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:22,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {2966#(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; {2976#(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:22,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {2976#(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); {2980#(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:22,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {2980#(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)))); {2903#false} is VALID [2022-02-20 23:51:22,998 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:22,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:24,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {2984#(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)))); {2903#false} is VALID [2022-02-20 23:51:24,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {2988#(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); {2984#(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,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(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; {2988#(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,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {2992#(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: L789 {2992#(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,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {2992#(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); {2992#(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,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {3002#(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; {2992#(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,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {3002#(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: L789 {3002#(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,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {3002#(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); {3002#(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:27,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {3012#(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; {3002#(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:27,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {3012#(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: L789 {3012#(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,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {3012#(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); {3012#(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,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {3022#(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; {3012#(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,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {3022#(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: L789 {3022#(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,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {3022#(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); {3022#(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,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {3032#(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; {3022#(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,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {3036#(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; {3032#(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,970 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3044#(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|)))))} {3040#(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|)))} #117#return; {3036#(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,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {3044#(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; {3044#(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,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {3051#(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; {3044#(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,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {2902#true} ~size := #in~size; {3051#(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,974 INFO L272 TraceCheckUtils]: 2: Hoare triple {3040#(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)); {2902#true} is VALID [2022-02-20 23:51:27,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#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; {3040#(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,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {2902#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); {2902#true} is VALID [2022-02-20 23:51:27,975 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,975 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:27,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035500638] [2022-02-20 23:51:27,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035500638] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:27,975 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:27,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2022-02-20 23:51:27,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600027864] [2022-02-20 23:51:27,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:27,976 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,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:27,976 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:31,220 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:31,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 23:51:31,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:31,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 23:51:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:51:31,221 INFO L87 Difference]: Start difference. First operand 73 states and 80 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:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:37,860 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2022-02-20 23:51:37,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:51:37,860 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:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:37,864 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:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 124 transitions. [2022-02-20 23:51:37,871 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:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 124 transitions. [2022-02-20 23:51:37,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 124 transitions. [2022-02-20 23:51:38,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:38,108 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:51:38,108 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:51:38,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2022-02-20 23:51:38,109 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 290 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:38,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 585 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 367 Invalid, 0 Unknown, 71 Unchecked, 1.4s Time] [2022-02-20 23:51:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:51:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2022-02-20 23:51:38,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:38,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 86 states, 66 states have (on average 1.378787878787879) internal successors, (91), 82 states have internal predecessors, (91), 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,113 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 86 states, 66 states have (on average 1.378787878787879) internal successors, (91), 82 states have internal predecessors, (91), 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,113 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 86 states, 66 states have (on average 1.378787878787879) internal successors, (91), 82 states have internal predecessors, (91), 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,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:38,115 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2022-02-20 23:51:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2022-02-20 23:51:38,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:38,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:38,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 66 states have (on average 1.378787878787879) internal successors, (91), 82 states have internal predecessors, (91), 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 105 states. [2022-02-20 23:51:38,116 INFO L87 Difference]: Start difference. First operand has 86 states, 66 states have (on average 1.378787878787879) internal successors, (91), 82 states have internal predecessors, (91), 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 105 states. [2022-02-20 23:51:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:38,118 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2022-02-20 23:51:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2022-02-20 23:51:38,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:38,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:38,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:38,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.378787878787879) internal successors, (91), 82 states have internal predecessors, (91), 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,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-02-20 23:51:38,127 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 23 [2022-02-20 23:51:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:38,127 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-02-20 23:51:38,127 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,128 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-02-20 23:51:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:51:38,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:38,129 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:38,150 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,336 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,337 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1064458770, now seen corresponding path program 2 times [2022-02-20 23:51:38,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:38,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130387486] [2022-02-20 23:51:38,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:51:38,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:38,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:38,339 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,340 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,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:51:38,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:51:38,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:51:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:38,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:38,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {3483#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); {3483#true} is VALID [2022-02-20 23:51:38,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {3483#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; {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,498 INFO L272 TraceCheckUtils]: 2: Hoare triple {3491#(= |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)); {3483#true} is VALID [2022-02-20 23:51:38,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {3483#true} ~size := #in~size; {3483#true} is VALID [2022-02-20 23:51:38,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {3483#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; {3483#true} is VALID [2022-02-20 23:51:38,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {3483#true} assume true; {3483#true} is VALID [2022-02-20 23:51:38,500 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3483#true} {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #117#return; {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {3491#(= |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; {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {3491#(= |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; {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {3491#(= |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: L789 {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {3491#(= |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; {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {3491#(= |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: L789 {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {3491#(= |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; {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {3491#(= |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: L789 {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {3491#(= |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; {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {3491#(= |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: L789 {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {3491#(= |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; {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {3491#(= |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: L789 {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {3491#(= |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; {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {3491#(= |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: L789 {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {3491#(= |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; {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !~bvslt32(entry_point_~i~2#1, entry_point_~len~0#1); {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:38,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {3491#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {3573#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (_ bv10 32) |ULTIMATE.start_alloc_17_~len#1|))} is VALID [2022-02-20 23:51:38,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (_ bv10 32) |ULTIMATE.start_alloc_17_~len#1|))} assume !~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {3484#false} is VALID [2022-02-20 23:51:38,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {3484#false} alloc_17_#res#1 := 0bv32; {3484#false} is VALID [2022-02-20 23:51:38,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {3484#false} entry_point_#t~ret46#1 := alloc_17_#res#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret46#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem43#1.base, free_17_#t~mem43#1.offset, free_17_#t~post42#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0bv32; {3484#false} is VALID [2022-02-20 23:51:38,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {3484#false} assume !!~bvslt32(free_17_~i~1#1, free_17_~len#1); {3484#false} is VALID [2022-02-20 23:51:38,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {3484#false} assume !(1bv1 == #valid[free_17_~array#1.base]); {3484#false} is VALID [2022-02-20 23:51:38,512 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,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:38,512 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:38,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130387486] [2022-02-20 23:51:38,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130387486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:38,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:38,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:51:38,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974397075] [2022-02-20 23:51:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:38,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 34 [2022-02-20 23:51:38,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:38,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:38,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:51:38,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:38,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:51:38,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:51:38,532 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:38,744 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-02-20 23:51:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:51:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 34 [2022-02-20 23:51:38,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-02-20 23:51:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-02-20 23:51:38,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 105 transitions. [2022-02-20 23:51:38,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:38,844 INFO L225 Difference]: With dead ends: 126 [2022-02-20 23:51:38,844 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 23:51:38,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:38,845 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 125 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:38,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 111 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 23:51:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 87. [2022-02-20 23:51:38,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:38,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 87 states, 67 states have (on average 1.373134328358209) internal successors, (92), 83 states have internal predecessors, (92), 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,847 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 87 states, 67 states have (on average 1.373134328358209) internal successors, (92), 83 states have internal predecessors, (92), 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,848 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 87 states, 67 states have (on average 1.373134328358209) internal successors, (92), 83 states have internal predecessors, (92), 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,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:38,850 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-02-20 23:51:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2022-02-20 23:51:38,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:38,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:38,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 67 states have (on average 1.373134328358209) internal successors, (92), 83 states have internal predecessors, (92), 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 126 states. [2022-02-20 23:51:38,851 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.373134328358209) internal successors, (92), 83 states have internal predecessors, (92), 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 126 states. [2022-02-20 23:51:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:38,854 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-02-20 23:51:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2022-02-20 23:51:38,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:38,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:38,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:38,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.373134328358209) internal successors, (92), 83 states have internal predecessors, (92), 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,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2022-02-20 23:51:38,857 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 34 [2022-02-20 23:51:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:38,857 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2022-02-20 23:51:38,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,858 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2022-02-20 23:51:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 23:51:38,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:38,859 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:38,881 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,065 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,065 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:39,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash 391656853, now seen corresponding path program 1 times [2022-02-20 23:51:39,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:39,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619218289] [2022-02-20 23:51:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:39,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:39,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:39,067 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,069 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,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:39,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:51:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:39,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:39,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {4055#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); {4055#true} is VALID [2022-02-20 23:51:39,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {4055#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; {4063#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:39,365 INFO L272 TraceCheckUtils]: 2: Hoare triple {4063#(= |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)); {4055#true} is VALID [2022-02-20 23:51:39,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {4055#true} ~size := #in~size; {4055#true} is VALID [2022-02-20 23:51:39,365 INFO L290 TraceCheckUtils]: 4: Hoare triple {4055#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; {4055#true} is VALID [2022-02-20 23:51:39,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {4055#true} assume true; {4055#true} is VALID [2022-02-20 23:51:39,366 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4055#true} {4063#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #117#return; {4063#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:39,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {4063#(= |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; {4063#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:39,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {4063#(= |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; {4085#(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:39,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {4085#(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); {4085#(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:39,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {4085#(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: L789 {4085#(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:39,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {4085#(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; {4095#(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:39,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {4095#(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); {4095#(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:39,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {4095#(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: L789 {4095#(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:39,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {4095#(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; {4105#(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:39,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {4105#(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); {4105#(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:39,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {4105#(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: L789 {4105#(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:39,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {4105#(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; {4115#(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:39,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {4115#(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); {4115#(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:39,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {4115#(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: L789 {4115#(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:39,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {4115#(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; {4125#(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:39,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {4125#(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); {4125#(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:39,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {4125#(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: L789 {4125#(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:39,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {4125#(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; {4135#(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:39,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {4135#(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); {4135#(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:39,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {4135#(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: L789 {4135#(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:39,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {4135#(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; {4145#(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:39,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {4145#(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); {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {4056#false} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {4056#false} assume !!~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L272 TraceCheckUtils]: 30: Hoare triple {4056#false} call alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc(4bv32); {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {4056#false} ~size := #in~size; {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {4056#false} 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; {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {4056#false} assume true; {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4056#false} {4056#false} #119#return; {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {4056#false} alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {4056#false} assume !(alloc_17_~p~0#1.base == 0bv32 && alloc_17_~p~0#1.offset == 0bv32); {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {4056#false} assume !(1bv1 == #valid[alloc_17_~array#1.base]); {4056#false} is VALID [2022-02-20 23:51:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:39,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:39,666 INFO L290 TraceCheckUtils]: 37: Hoare triple {4056#false} assume !(1bv1 == #valid[alloc_17_~array#1.base]); {4056#false} is VALID [2022-02-20 23:51:39,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {4056#false} assume !(alloc_17_~p~0#1.base == 0bv32 && alloc_17_~p~0#1.offset == 0bv32); {4056#false} is VALID [2022-02-20 23:51:39,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {4056#false} alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; {4056#false} is VALID [2022-02-20 23:51:39,666 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4055#true} {4056#false} #119#return; {4056#false} is VALID [2022-02-20 23:51:39,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {4055#true} assume true; {4055#true} is VALID [2022-02-20 23:51:39,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {4055#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; {4055#true} is VALID [2022-02-20 23:51:39,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {4055#true} ~size := #in~size; {4055#true} is VALID [2022-02-20 23:51:39,667 INFO L272 TraceCheckUtils]: 30: Hoare triple {4056#false} call alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc(4bv32); {4055#true} is VALID [2022-02-20 23:51:39,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {4056#false} assume !!~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {4056#false} is VALID [2022-02-20 23:51:39,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {4056#false} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {4056#false} is VALID [2022-02-20 23:51:39,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {4209#(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); {4056#false} is VALID [2022-02-20 23:51:39,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {4213#(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; {4209#(bvslt |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:39,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {4213#(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: L789 {4213#(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:39,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {4213#(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); {4213#(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:39,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {4223#(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; {4213#(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:39,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {4223#(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: L789 {4223#(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:39,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {4223#(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); {4223#(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:39,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {4233#(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; {4223#(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:39,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {4233#(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: L789 {4233#(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:39,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {4233#(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); {4233#(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:39,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {4243#(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; {4233#(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:39,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {4243#(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: L789 {4243#(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:39,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {4243#(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); {4243#(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:39,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {4253#(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; {4243#(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:39,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {4253#(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: L789 {4253#(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:39,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {4253#(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); {4253#(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:39,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {4263#(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; {4253#(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:39,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {4263#(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: L789 {4263#(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:39,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {4263#(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); {4263#(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:39,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {4273#(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; {4263#(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:39,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {4273#(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; {4273#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:39,815 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4055#true} {4273#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} #117#return; {4273#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:39,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {4055#true} assume true; {4055#true} is VALID [2022-02-20 23:51:39,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {4055#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; {4055#true} is VALID [2022-02-20 23:51:39,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {4055#true} ~size := #in~size; {4055#true} is VALID [2022-02-20 23:51:39,815 INFO L272 TraceCheckUtils]: 2: Hoare triple {4273#(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)); {4055#true} is VALID [2022-02-20 23:51:39,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {4055#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; {4273#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:39,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {4055#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); {4055#true} is VALID [2022-02-20 23:51:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:51:39,816 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:39,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619218289] [2022-02-20 23:51:39,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619218289] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:39,816 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:39,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-02-20 23:51:39,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394681338] [2022-02-20 23:51:39,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-02-20 23:51:39,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:39,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:51:39,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:39,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:51:39,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:39,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:51:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:51:39,994 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:51:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:41,187 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-02-20 23:51:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:51:41,187 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-02-20 23:51:41,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:51:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 93 transitions. [2022-02-20 23:51:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:51:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 93 transitions. [2022-02-20 23:51:41,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 93 transitions. [2022-02-20 23:51:41,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:41,283 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:51:41,283 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:51:41,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 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,283 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 157 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:41,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 411 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:51:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:51:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-02-20 23:51:41,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:41,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 83 states have internal predecessors, (88), 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,286 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 83 states have internal predecessors, (88), 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,287 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 83 states have internal predecessors, (88), 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,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:41,288 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-02-20 23:51:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-02-20 23:51:41,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:41,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:41,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 83 states have internal predecessors, (88), 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:41,289 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 83 states have internal predecessors, (88), 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:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:41,294 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-02-20 23:51:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-02-20 23:51:41,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:41,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:41,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:41,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 83 states have internal predecessors, (88), 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,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-02-20 23:51:41,296 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 38 [2022-02-20 23:51:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:41,296 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-02-20 23:51:41,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:51:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-02-20 23:51:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:51:41,297 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:41,297 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:41,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:41,503 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:41,504 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-20 23:51:41,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:41,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1227509228, now seen corresponding path program 3 times [2022-02-20 23:51:41,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:41,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800482959] [2022-02-20 23:51:41,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:51:41,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:41,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:41,506 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:41,507 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:41,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-20 23:51:41,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:51:41,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:51:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:41,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:41,700 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,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {4651#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); {4651#true} is VALID [2022-02-20 23:51:42,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {4651#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; {4659#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:42,530 INFO L272 TraceCheckUtils]: 2: Hoare triple {4659#(= |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)); {4651#true} is VALID [2022-02-20 23:51:42,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {4651#true} ~size := #in~size; {4666#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:42,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {4666#(= 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; {4670#(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,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {4670#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {4670#(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,532 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4670#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {4659#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #117#return; {4677#(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,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {4677#(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; {4681#(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,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {4681#(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; {4685#(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,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {4685#(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); {4685#(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,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {4685#(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: L789 {4685#(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,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {4685#(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; {4695#(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,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#(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); {4695#(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,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {4695#(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: L789 {4695#(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,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {4695#(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; {4705#(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,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {4705#(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); {4705#(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,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {4705#(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: L789 {4705#(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,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {4705#(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; {4715#(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,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {4715#(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); {4715#(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,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {4715#(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: L789 {4715#(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,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {4715#(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; {4725#(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,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {4725#(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); {4725#(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,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {4725#(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: L789 {4725#(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,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {4725#(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; {4735#(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,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {4735#(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); {4735#(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,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {4735#(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: L789 {4735#(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,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {4735#(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; {4745#(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,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {4745#(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); {4745#(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,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {4745#(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: L789 {4745#(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,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {4745#(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; {4755#(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,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {4755#(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); {4755#(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,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {4755#(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: L789 {4755#(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,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {4755#(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; {4765#(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,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {4765#(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); {4765#(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,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {4765#(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: L789 {4765#(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,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {4765#(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; {4775#(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,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {4775#(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); {4775#(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,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {4775#(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: L789 {4775#(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,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {4775#(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; {4785#(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,547 INFO L290 TraceCheckUtils]: 39: Hoare triple {4785#(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); {4652#false} is VALID [2022-02-20 23:51:42,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {4652#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)))); {4652#false} is VALID [2022-02-20 23:51:42,547 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,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:48,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {4792#(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)))); {4652#false} is VALID [2022-02-20 23:51:48,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {4796#(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); {4792#(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,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {4800#(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; {4796#(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,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {4804#(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: L789 {4800#(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,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {4804#(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); {4804#(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,805 WARN L290 TraceCheckUtils]: 35: Hoare triple {4811#(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; {4804#(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,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {4811#(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: L789 {4811#(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,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {4811#(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); {4811#(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,814 WARN L290 TraceCheckUtils]: 32: Hoare triple {4821#(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; {4811#(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,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {4821#(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: L789 {4821#(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,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {4821#(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); {4821#(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,822 WARN L290 TraceCheckUtils]: 29: Hoare triple {4831#(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; {4821#(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 UNKNOWN [2022-02-20 23:51:54,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {4831#(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: L789 {4831#(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,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {4831#(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); {4831#(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,831 WARN L290 TraceCheckUtils]: 26: Hoare triple {4841#(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; {4831#(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,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {4841#(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: L789 {4841#(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,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {4841#(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); {4841#(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,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {4851#(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; {4841#(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,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {4851#(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: L789 {4851#(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,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {4851#(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); {4851#(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,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {4861#(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; {4851#(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,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {4861#(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: L789 {4861#(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,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {4861#(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); {4861#(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,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {4871#(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; {4861#(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,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {4871#(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: L789 {4871#(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,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {4871#(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); {4871#(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:04,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {4881#(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; {4871#(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:04,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {4881#(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: L789 {4881#(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:04,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {4881#(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); {4881#(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:06,172 WARN L290 TraceCheckUtils]: 11: Hoare triple {4891#(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; {4881#(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:06,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {4891#(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: L789 {4891#(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:06,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {4891#(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); {4891#(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:06,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {4901#(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; {4891#(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:06,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {4905#(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; {4901#(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:06,185 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4913#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))) (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|))))} {4909#(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|)))} #117#return; {4905#(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:06,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {4913#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))) (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; {4913#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))) (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:06,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {4920#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))) (bvule (_ bv44 32) ldv_malloc_~size) (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; {4913#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))) (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:06,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {4651#true} ~size := #in~size; {4920#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (and (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (bvule (_ bv40 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))) (bvule (_ bv44 32) ldv_malloc_~size) (not (bvule (_ bv40 32) ldv_malloc_~size)))} is VALID [2022-02-20 23:52:06,190 INFO L272 TraceCheckUtils]: 2: Hoare triple {4909#(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)); {4651#true} is VALID [2022-02-20 23:52:06,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {4651#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; {4909#(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:06,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {4651#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); {4651#true} is VALID [2022-02-20 23:52:06,191 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:06,191 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:06,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800482959] [2022-02-20 23:52:06,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800482959] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:52:06,191 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:52:06,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2022-02-20 23:52:06,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277609434] [2022-02-20 23:52:06,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:52:06,192 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:06,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:06,192 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)