./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 02:49:16,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 02:49:16,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 02:49:16,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 02:49:16,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 02:49:16,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 02:49:16,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 02:49:16,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 02:49:16,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 02:49:16,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 02:49:16,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 02:49:16,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 02:49:16,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 02:49:16,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 02:49:16,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 02:49:16,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 02:49:16,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 02:49:16,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 02:49:16,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 02:49:16,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 02:49:16,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 02:49:16,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 02:49:16,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 02:49:16,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 02:49:16,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 02:49:16,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 02:49:16,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 02:49:16,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 02:49:16,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 02:49:16,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 02:49:16,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 02:49:16,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 02:49:16,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 02:49:16,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 02:49:16,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 02:49:16,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 02:49:16,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 02:49:16,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 02:49:16,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 02:49:16,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 02:49:16,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 02:49:16,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-02-21 02:49:16,860 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 02:49:16,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 02:49:16,861 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 02:49:16,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 02:49:16,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 02:49:16,861 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 02:49:16,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 02:49:16,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 02:49:16,862 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 02:49:16,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 02:49:16,863 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 02:49:16,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 02:49:16,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 02:49:16,863 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 02:49:16,864 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 02:49:16,864 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 02:49:16,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 02:49:16,864 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 02:49:16,864 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 02:49:16,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 02:49:16,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 02:49:16,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 02:49:16,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 02:49:16,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 02:49:16,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 02:49:16,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 02:49:16,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 02:49:16,866 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2022-02-21 02:49:17,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 02:49:17,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 02:49:17,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 02:49:17,088 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 02:49:17,088 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 02:49:17,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-02-21 02:49:17,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9d15184/9484555012644e7d879a8b391d51755e/FLAG5b1785da5 [2022-02-21 02:49:17,638 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 02:49:17,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-02-21 02:49:17,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9d15184/9484555012644e7d879a8b391d51755e/FLAG5b1785da5 [2022-02-21 02:49:18,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9d15184/9484555012644e7d879a8b391d51755e [2022-02-21 02:49:18,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 02:49:18,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 02:49:18,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:18,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 02:49:18,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 02:49:18,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:18" (1/1) ... [2022-02-21 02:49:18,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7850831d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:18, skipping insertion in model container [2022-02-21 02:49:18,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:18" (1/1) ... [2022-02-21 02:49:18,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 02:49:18,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 02:49:18,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-02-21 02:49:18,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:18,717 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-21 02:49:18,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6169afb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:18, skipping insertion in model container [2022-02-21 02:49:18,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:18,719 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-21 02:49:18,721 INFO L158 Benchmark]: Toolchain (without parser) took 588.82ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 60.2MB in the beginning and 93.8MB in the end (delta: -33.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 02:49:18,722 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 94.4MB. Free memory was 50.3MB in the beginning and 50.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 02:49:18,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.56ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 60.0MB in the beginning and 93.8MB in the end (delta: -33.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 02:49:18,724 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.61ms. Allocated memory is still 94.4MB. Free memory was 50.3MB in the beginning and 50.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.56ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 60.0MB in the beginning and 93.8MB in the end (delta: -33.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1515]: 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 02:49:20,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 02:49:20,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 02:49:20,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 02:49:20,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 02:49:20,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 02:49:20,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 02:49:20,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 02:49:20,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 02:49:20,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 02:49:20,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 02:49:20,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 02:49:20,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 02:49:20,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 02:49:20,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 02:49:20,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 02:49:20,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 02:49:20,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 02:49:20,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 02:49:20,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 02:49:20,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 02:49:20,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 02:49:20,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 02:49:20,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 02:49:20,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 02:49:20,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 02:49:20,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 02:49:20,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 02:49:20,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 02:49:20,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 02:49:20,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 02:49:20,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 02:49:20,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 02:49:20,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 02:49:20,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 02:49:20,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 02:49:20,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 02:49:20,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 02:49:20,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 02:49:20,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 02:49:20,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 02:49:20,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2022-02-21 02:49:20,455 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 02:49:20,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 02:49:20,456 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 02:49:20,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 02:49:20,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 02:49:20,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 02:49:20,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 02:49:20,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 02:49:20,459 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 02:49:20,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 02:49:20,460 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 02:49:20,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 02:49:20,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 02:49:20,460 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 02:49:20,460 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 02:49:20,460 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 02:49:20,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 02:49:20,461 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 02:49:20,461 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-21 02:49:20,461 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-21 02:49:20,461 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 02:49:20,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 02:49:20,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 02:49:20,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 02:49:20,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 02:49:20,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 02:49:20,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 02:49:20,469 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-21 02:49:20,469 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-21 02:49:20,469 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-21 02:49:20,469 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2022-02-21 02:49:20,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 02:49:20,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 02:49:20,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 02:49:20,784 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 02:49:20,784 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 02:49:20,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-02-21 02:49:20,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3f458c0/5eb2382c738d45c3b939efdf76d342ec/FLAG09e260346 [2022-02-21 02:49:21,291 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 02:49:21,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-02-21 02:49:21,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3f458c0/5eb2382c738d45c3b939efdf76d342ec/FLAG09e260346 [2022-02-21 02:49:21,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3f458c0/5eb2382c738d45c3b939efdf76d342ec [2022-02-21 02:49:21,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 02:49:21,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 02:49:21,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:21,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 02:49:21,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 02:49:21,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:21" (1/1) ... [2022-02-21 02:49:21,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21375f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:21, skipping insertion in model container [2022-02-21 02:49:21,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:21" (1/1) ... [2022-02-21 02:49:21,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 02:49:21,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 02:49:22,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-02-21 02:49:22,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:22,146 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-21 02:49:22,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 02:49:22,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-02-21 02:49:22,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:22,251 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 02:49:22,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-02-21 02:49:22,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:22,383 INFO L208 MainTranslator]: Completed translation [2022-02-21 02:49:22,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22 WrapperNode [2022-02-21 02:49:22,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:22,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 02:49:22,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 02:49:22,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 02:49:22,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (1/1) ... [2022-02-21 02:49:22,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (1/1) ... [2022-02-21 02:49:22,506 INFO L137 Inliner]: procedures = 353, calls = 114, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 386 [2022-02-21 02:49:22,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 02:49:22,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 02:49:22,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 02:49:22,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 02:49:22,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (1/1) ... [2022-02-21 02:49:22,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (1/1) ... [2022-02-21 02:49:22,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (1/1) ... [2022-02-21 02:49:22,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (1/1) ... [2022-02-21 02:49:22,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (1/1) ... [2022-02-21 02:49:22,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (1/1) ... [2022-02-21 02:49:22,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (1/1) ... [2022-02-21 02:49:22,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 02:49:22,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 02:49:22,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 02:49:22,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 02:49:22,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (1/1) ... [2022-02-21 02:49:22,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 02:49:22,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 02:49:22,624 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-21 02:49:22,635 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-21 02:49:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-21 02:49:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-21 02:49:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-21 02:49:22,656 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-21 02:49:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 02:49:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-21 02:49:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 02:49:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-21 02:49:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-21 02:49:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-02-21 02:49:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 02:49:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2022-02-21 02:49:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 02:49:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 02:49:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 02:49:22,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 02:49:22,954 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 02:49:22,956 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 02:49:23,851 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 02:49:23,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 02:49:23,858 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-21 02:49:23,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 02:49:23 BoogieIcfgContainer [2022-02-21 02:49:23,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 02:49:23,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 02:49:23,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 02:49:23,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 02:49:23,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 02:49:21" (1/3) ... [2022-02-21 02:49:23,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bced56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 02:49:23, skipping insertion in model container [2022-02-21 02:49:23,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:22" (2/3) ... [2022-02-21 02:49:23,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bced56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 02:49:23, skipping insertion in model container [2022-02-21 02:49:23,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 02:49:23" (3/3) ... [2022-02-21 02:49:23,866 INFO L111 eAbstractionObserver]: Analyzing ICFG basename-2.i [2022-02-21 02:49:23,869 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 02:49:23,869 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2022-02-21 02:49:23,904 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 02:49:23,910 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-21 02:49:23,910 INFO L340 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2022-02-21 02:49:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 147 states have (on average 1.945578231292517) internal successors, (286), 241 states have internal predecessors, (286), 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-21 02:49:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 02:49:23,937 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:23,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 02:49:23,938 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:49:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2022-02-21 02:49:23,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:23,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716153799] [2022-02-21 02:49:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:23,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:23,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:23,985 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-21 02:49:23,986 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-21 02:49:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:24,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 02:49:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:24,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:24,176 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-21 02:49:24,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {248#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {248#true} is VALID [2022-02-21 02:49:24,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {256#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:49:24,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~a~0#1.base]); {249#false} is VALID [2022-02-21 02:49:24,201 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-21 02:49:24,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:24,202 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:24,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716153799] [2022-02-21 02:49:24,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716153799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:24,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:24,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:49:24,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268827444] [2022-02-21 02:49:24,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 02:49:24,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:24,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:24,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:24,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:49:24,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:24,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:49:24,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:24,246 INFO L87 Difference]: Start difference. First operand has 245 states, 147 states have (on average 1.945578231292517) internal successors, (286), 241 states have internal predecessors, (286), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:25,371 INFO L93 Difference]: Finished difference Result 253 states and 287 transitions. [2022-02-21 02:49:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:49:25,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 02:49:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2022-02-21 02:49:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2022-02-21 02:49:25,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 301 transitions. [2022-02-21 02:49:25,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:25,757 INFO L225 Difference]: With dead ends: 253 [2022-02-21 02:49:25,757 INFO L226 Difference]: Without dead ends: 251 [2022-02-21 02:49:25,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:25,761 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 241 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:25,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 207 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 02:49:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-02-21 02:49:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2022-02-21 02:49:25,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:25,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 235 states, 142 states have (on average 1.8591549295774648) internal successors, (264), 231 states have internal predecessors, (264), 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-21 02:49:25,819 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 235 states, 142 states have (on average 1.8591549295774648) internal successors, (264), 231 states have internal predecessors, (264), 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-21 02:49:25,820 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 235 states, 142 states have (on average 1.8591549295774648) internal successors, (264), 231 states have internal predecessors, (264), 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-21 02:49:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:25,833 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2022-02-21 02:49:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 285 transitions. [2022-02-21 02:49:25,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:25,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:25,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 142 states have (on average 1.8591549295774648) internal successors, (264), 231 states have internal predecessors, (264), 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 251 states. [2022-02-21 02:49:25,842 INFO L87 Difference]: Start difference. First operand has 235 states, 142 states have (on average 1.8591549295774648) internal successors, (264), 231 states have internal predecessors, (264), 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 251 states. [2022-02-21 02:49:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:25,852 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2022-02-21 02:49:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 285 transitions. [2022-02-21 02:49:25,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:25,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:25,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:25,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 142 states have (on average 1.8591549295774648) internal successors, (264), 231 states have internal predecessors, (264), 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-21 02:49:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 268 transitions. [2022-02-21 02:49:25,863 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 268 transitions. Word has length 3 [2022-02-21 02:49:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:25,864 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 268 transitions. [2022-02-21 02:49:25,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 268 transitions. [2022-02-21 02:49:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 02:49:25,865 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:25,865 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 02:49:25,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-21 02:49:26,073 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-21 02:49:26,074 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:49:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2022-02-21 02:49:26,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:26,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037509191] [2022-02-21 02:49:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:26,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:26,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:26,080 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-21 02:49:26,081 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-21 02:49:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:26,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 02:49:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:26,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:26,210 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-21 02:49:26,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {1249#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {1249#true} is VALID [2022-02-21 02:49:26,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {1249#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {1257#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:26,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} assume !((~bvule64(~bvadd64(1bv64, ~bvadd64(10bv64, main_~a~0#1.offset)), #length[main_~a~0#1.base]) && ~bvule64(~bvadd64(10bv64, main_~a~0#1.offset), ~bvadd64(1bv64, ~bvadd64(10bv64, main_~a~0#1.offset)))) && ~bvule64(0bv64, ~bvadd64(10bv64, main_~a~0#1.offset))); {1250#false} is VALID [2022-02-21 02:49:26,221 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-21 02:49:26,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:26,221 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:26,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037509191] [2022-02-21 02:49:26,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037509191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:26,222 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:26,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:49:26,222 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84783501] [2022-02-21 02:49:26,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:26,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 02:49:26,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:26,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:26,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:26,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:49:26,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:26,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:49:26,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:26,240 INFO L87 Difference]: Start difference. First operand 235 states and 268 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:27,810 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2022-02-21 02:49:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:49:27,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 02:49:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2022-02-21 02:49:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2022-02-21 02:49:27,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 268 transitions. [2022-02-21 02:49:28,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:28,139 INFO L225 Difference]: With dead ends: 234 [2022-02-21 02:49:28,139 INFO L226 Difference]: Without dead ends: 234 [2022-02-21 02:49:28,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:28,140 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:28,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 430 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-21 02:49:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-21 02:49:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-02-21 02:49:28,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:28,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 234 states, 142 states have (on average 1.852112676056338) internal successors, (263), 230 states have internal predecessors, (263), 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-21 02:49:28,148 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 234 states, 142 states have (on average 1.852112676056338) internal successors, (263), 230 states have internal predecessors, (263), 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-21 02:49:28,148 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 234 states, 142 states have (on average 1.852112676056338) internal successors, (263), 230 states have internal predecessors, (263), 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-21 02:49:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:28,157 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2022-02-21 02:49:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2022-02-21 02:49:28,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:28,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:28,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 142 states have (on average 1.852112676056338) internal successors, (263), 230 states have internal predecessors, (263), 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 234 states. [2022-02-21 02:49:28,159 INFO L87 Difference]: Start difference. First operand has 234 states, 142 states have (on average 1.852112676056338) internal successors, (263), 230 states have internal predecessors, (263), 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 234 states. [2022-02-21 02:49:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:28,168 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2022-02-21 02:49:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2022-02-21 02:49:28,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:28,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:28,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:28,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 142 states have (on average 1.852112676056338) internal successors, (263), 230 states have internal predecessors, (263), 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-21 02:49:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2022-02-21 02:49:28,179 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 3 [2022-02-21 02:49:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:28,179 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2022-02-21 02:49:28,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2022-02-21 02:49:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 02:49:28,180 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:28,180 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 02:49:28,191 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-21 02:49:28,388 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-21 02:49:28,389 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:49:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113961, now seen corresponding path program 1 times [2022-02-21 02:49:28,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:28,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418824502] [2022-02-21 02:49:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:28,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:28,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:28,395 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-21 02:49:28,396 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-21 02:49:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:28,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:49:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:28,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:28,513 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-21 02:49:28,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {2196#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {2196#true} is VALID [2022-02-21 02:49:28,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {2196#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {2204#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:28,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {2204#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {2204#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:28,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {2204#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} main_~i~3#1 := 0bv32; {2211#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} is VALID [2022-02-21 02:49:28,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {2211#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {2211#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} is VALID [2022-02-21 02:49:28,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {2211#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} assume !((~bvule64(~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1))), #length[main_~a~0#1.base]) && ~bvule64(~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), ~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1))))) && ~bvule64(0bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)))); {2197#false} is VALID [2022-02-21 02:49:28,579 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-21 02:49:28,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:28,580 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:28,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418824502] [2022-02-21 02:49:28,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418824502] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:28,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:28,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 02:49:28,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469271182] [2022-02-21 02:49:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:28,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 02:49:28,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:28,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:28,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:28,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 02:49:28,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:28,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 02:49:28,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:49:28,595 INFO L87 Difference]: Start difference. First operand 234 states and 267 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:30,244 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2022-02-21 02:49:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 02:49:30,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 02:49:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-02-21 02:49:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-02-21 02:49:30,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 273 transitions. [2022-02-21 02:49:30,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:30,561 INFO L225 Difference]: With dead ends: 238 [2022-02-21 02:49:30,561 INFO L226 Difference]: Without dead ends: 238 [2022-02-21 02:49:30,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:49:30,562 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 17 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:30,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 431 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 02:49:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-21 02:49:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2022-02-21 02:49:30,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:30,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 236 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 232 states have internal predecessors, (265), 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-21 02:49:30,569 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 236 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 232 states have internal predecessors, (265), 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-21 02:49:30,569 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 236 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 232 states have internal predecessors, (265), 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-21 02:49:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:30,574 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2022-02-21 02:49:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 271 transitions. [2022-02-21 02:49:30,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:30,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:30,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 232 states have internal predecessors, (265), 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 238 states. [2022-02-21 02:49:30,576 INFO L87 Difference]: Start difference. First operand has 236 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 232 states have internal predecessors, (265), 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 238 states. [2022-02-21 02:49:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:30,580 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2022-02-21 02:49:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 271 transitions. [2022-02-21 02:49:30,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:30,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:30,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:30,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 232 states have internal predecessors, (265), 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-21 02:49:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 269 transitions. [2022-02-21 02:49:30,586 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 269 transitions. Word has length 6 [2022-02-21 02:49:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:30,586 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 269 transitions. [2022-02-21 02:49:30,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 269 transitions. [2022-02-21 02:49:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 02:49:30,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:30,587 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:30,600 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-21 02:49:30,796 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-21 02:49:30,797 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:49:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2080656212, now seen corresponding path program 1 times [2022-02-21 02:49:30,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:30,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001958105] [2022-02-21 02:49:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:30,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:30,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:30,800 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-21 02:49:30,802 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-21 02:49:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:30,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 02:49:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:30,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:30,940 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-21 02:49:31,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {3167#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {3167#true} is VALID [2022-02-21 02:49:31,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {3175#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:31,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {3175#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:31,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {3175#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} main_~i~3#1 := 0bv32; {3182#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} is VALID [2022-02-21 02:49:31,098 INFO L290 TraceCheckUtils]: 4: Hoare triple {3182#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {3182#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} is VALID [2022-02-21 02:49:31,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {3182#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {3182#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} is VALID [2022-02-21 02:49:31,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {3182#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} havoc main_#t~nondet118#1; {3182#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} is VALID [2022-02-21 02:49:31,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {3182#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~i~3#1| (_ bv0 32)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {3195#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32)))} is VALID [2022-02-21 02:49:31,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {3195#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {3195#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32)))} is VALID [2022-02-21 02:49:31,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {3195#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32)))} assume !((~bvule64(~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1))), #length[main_~a~0#1.base]) && ~bvule64(~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), ~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1))))) && ~bvule64(0bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)))); {3168#false} is VALID [2022-02-21 02:49:31,101 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-21 02:49:31,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 02:49:31,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {3202#(and (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !((~bvule64(~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1))), #length[main_~a~0#1.base]) && ~bvule64(~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), ~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1))))) && ~bvule64(0bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)))); {3168#false} is VALID [2022-02-21 02:49:31,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {3202#(and (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {3202#(and (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-21 02:49:31,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {3209#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {3202#(and (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~3#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-21 02:49:31,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {3209#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} havoc main_#t~nondet118#1; {3209#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-21 02:49:31,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {3209#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {3209#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-21 02:49:31,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {3209#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {3209#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-21 02:49:31,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {3222#(and (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} main_~i~3#1 := 0bv32; {3209#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-21 02:49:31,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {3222#(and (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {3222#(and (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} is VALID [2022-02-21 02:49:31,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {3222#(and (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} is VALID [2022-02-21 02:49:31,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {3167#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {3167#true} is VALID [2022-02-21 02:49:31,965 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-21 02:49:31,966 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:31,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001958105] [2022-02-21 02:49:31,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001958105] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 02:49:31,966 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 02:49:31,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-21 02:49:31,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932884133] [2022-02-21 02:49:31,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 02:49:31,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 02:49:31,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:31,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:32,005 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-21 02:49:32,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 02:49:32,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:32,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 02:49:32,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 02:49:32,006 INFO L87 Difference]: Start difference. First operand 236 states and 269 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:44,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:44,997 INFO L93 Difference]: Finished difference Result 242 states and 275 transitions. [2022-02-21 02:49:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 02:49:44,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 02:49:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 279 transitions. [2022-02-21 02:49:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 279 transitions. [2022-02-21 02:49:45,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 279 transitions. [2022-02-21 02:49:45,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:45,300 INFO L225 Difference]: With dead ends: 242 [2022-02-21 02:49:45,300 INFO L226 Difference]: Without dead ends: 242 [2022-02-21 02:49:45,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-21 02:49:45,301 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 46 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:45,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 772 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-02-21 02:49:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-02-21 02:49:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-02-21 02:49:45,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:45,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 242 states, 151 states have (on average 1.794701986754967) internal successors, (271), 238 states have internal predecessors, (271), 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-21 02:49:45,306 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 242 states, 151 states have (on average 1.794701986754967) internal successors, (271), 238 states have internal predecessors, (271), 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-21 02:49:45,306 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 242 states, 151 states have (on average 1.794701986754967) internal successors, (271), 238 states have internal predecessors, (271), 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-21 02:49:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:45,310 INFO L93 Difference]: Finished difference Result 242 states and 275 transitions. [2022-02-21 02:49:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 275 transitions. [2022-02-21 02:49:45,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:45,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:45,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 151 states have (on average 1.794701986754967) internal successors, (271), 238 states have internal predecessors, (271), 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 242 states. [2022-02-21 02:49:45,312 INFO L87 Difference]: Start difference. First operand has 242 states, 151 states have (on average 1.794701986754967) internal successors, (271), 238 states have internal predecessors, (271), 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 242 states. [2022-02-21 02:49:45,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:45,316 INFO L93 Difference]: Finished difference Result 242 states and 275 transitions. [2022-02-21 02:49:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 275 transitions. [2022-02-21 02:49:45,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:45,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:45,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:45,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 151 states have (on average 1.794701986754967) internal successors, (271), 238 states have internal predecessors, (271), 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-21 02:49:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 275 transitions. [2022-02-21 02:49:45,320 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 275 transitions. Word has length 10 [2022-02-21 02:49:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:45,321 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 275 transitions. [2022-02-21 02:49:45,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 275 transitions. [2022-02-21 02:49:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 02:49:45,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:45,321 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:45,334 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-21 02:49:45,531 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-21 02:49:45,532 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:49:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1026813049, now seen corresponding path program 1 times [2022-02-21 02:49:45,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:45,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807591885] [2022-02-21 02:49:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:45,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:45,535 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-21 02:49:45,536 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-21 02:49:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:45,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:49:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:45,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:45,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {4203#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {4203#true} is VALID [2022-02-21 02:49:45,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {4203#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {4203#true} is VALID [2022-02-21 02:49:45,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {4203#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {4203#true} is VALID [2022-02-21 02:49:45,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {4203#true} main_~i~3#1 := 0bv32; {4217#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:45,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {4217#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4217#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:45,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {4217#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {4217#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:45,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {4217#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} havoc main_#t~nondet118#1; {4217#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:45,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {4217#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {4230#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:45,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {4230#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4230#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:45,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {4230#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:45,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {4230#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} havoc main_#t~nondet118#1; {4230#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:45,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {4230#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {4243#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:45,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {4243#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4243#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:45,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {4243#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {4243#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:45,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {4243#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} havoc main_#t~nondet118#1; {4243#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:45,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {4243#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {4256#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv2 32))} is VALID [2022-02-21 02:49:45,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {4256#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv2 32))} assume !~bvslt32(main_~i~3#1, 10bv32); {4204#false} is VALID [2022-02-21 02:49:45,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {4204#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {4204#false} is VALID [2022-02-21 02:49:45,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {4204#false} assume !(1bv1 == #valid[~#bb_errno_location~0.base]); {4204#false} is VALID [2022-02-21 02:49:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 02:49:45,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 02:49:45,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {4204#false} assume !(1bv1 == #valid[~#bb_errno_location~0.base]); {4204#false} is VALID [2022-02-21 02:49:45,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {4204#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {4204#false} is VALID [2022-02-21 02:49:45,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {4272#(bvslt |ULTIMATE.start_main_~i~3#1| (_ bv10 32))} assume !~bvslt32(main_~i~3#1, 10bv32); {4204#false} is VALID [2022-02-21 02:49:45,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {4276#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {4272#(bvslt |ULTIMATE.start_main_~i~3#1| (_ bv10 32))} is VALID [2022-02-21 02:49:45,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {4276#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {4276#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {4276#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {4276#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {4276#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4276#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {4289#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {4276#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {4289#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {4289#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {4289#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {4289#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {4289#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4289#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {4302#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {4289#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {4302#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {4302#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {4302#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {4302#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {4302#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4302#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {4203#true} main_~i~3#1 := 0bv32; {4302#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {4203#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {4203#true} is VALID [2022-02-21 02:49:45,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {4203#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {4203#true} is VALID [2022-02-21 02:49:45,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {4203#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {4203#true} is VALID [2022-02-21 02:49:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 02:49:45,886 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:45,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807591885] [2022-02-21 02:49:45,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807591885] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 02:49:45,886 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 02:49:45,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-21 02:49:45,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340364451] [2022-02-21 02:49:45,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 02:49:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 02:49:45,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:45,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:45,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:45,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 02:49:45,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 02:49:45,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-21 02:49:45,931 INFO L87 Difference]: Start difference. First operand 242 states and 275 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:48,848 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2022-02-21 02:49:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 02:49:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 02:49:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 300 transitions. [2022-02-21 02:49:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 300 transitions. [2022-02-21 02:49:48,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 300 transitions. [2022-02-21 02:49:49,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:49,185 INFO L225 Difference]: With dead ends: 262 [2022-02-21 02:49:49,185 INFO L226 Difference]: Without dead ends: 262 [2022-02-21 02:49:49,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-02-21 02:49:49,186 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 27 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:49,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1317 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 02:49:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-02-21 02:49:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-02-21 02:49:49,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:49,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 262 states, 171 states have (on average 1.7017543859649122) internal successors, (291), 258 states have internal predecessors, (291), 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-21 02:49:49,190 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 262 states, 171 states have (on average 1.7017543859649122) internal successors, (291), 258 states have internal predecessors, (291), 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-21 02:49:49,190 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 262 states, 171 states have (on average 1.7017543859649122) internal successors, (291), 258 states have internal predecessors, (291), 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-21 02:49:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:49,202 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2022-02-21 02:49:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 295 transitions. [2022-02-21 02:49:49,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:49,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:49,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 262 states, 171 states have (on average 1.7017543859649122) internal successors, (291), 258 states have internal predecessors, (291), 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 262 states. [2022-02-21 02:49:49,215 INFO L87 Difference]: Start difference. First operand has 262 states, 171 states have (on average 1.7017543859649122) internal successors, (291), 258 states have internal predecessors, (291), 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 262 states. [2022-02-21 02:49:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:49,221 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2022-02-21 02:49:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 295 transitions. [2022-02-21 02:49:49,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:49,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:49,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:49,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 171 states have (on average 1.7017543859649122) internal successors, (291), 258 states have internal predecessors, (291), 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-21 02:49:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 295 transitions. [2022-02-21 02:49:49,228 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 295 transitions. Word has length 19 [2022-02-21 02:49:49,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:49,228 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 295 transitions. [2022-02-21 02:49:49,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 295 transitions. [2022-02-21 02:49:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-21 02:49:49,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:49,229 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:49,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-21 02:49:49,436 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-21 02:49:49,437 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:49:49,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:49,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1411098840, now seen corresponding path program 2 times [2022-02-21 02:49:49,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:49,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244612113] [2022-02-21 02:49:49,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 02:49:49,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:49,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:49,440 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-21 02:49:49,441 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-21 02:49:49,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 02:49:49,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 02:49:49,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:49:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:49,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:49,618 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-21 02:49:49,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-21 02:49:49,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {5377#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} main_~i~3#1 := 0bv32; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume !!~bvslt32(main_~i~3#1, 10bv32); {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} havoc main_#t~nondet118#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume !!~bvslt32(main_~i~3#1, 10bv32); {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} havoc main_#t~nondet118#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume !!~bvslt32(main_~i~3#1, 10bv32); {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} havoc main_#t~nondet118#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume !!~bvslt32(main_~i~3#1, 10bv32); {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} havoc main_#t~nondet118#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume !!~bvslt32(main_~i~3#1, 10bv32); {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} havoc main_#t~nondet118#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume !!~bvslt32(main_~i~3#1, 10bv32); {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} havoc main_#t~nondet118#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume !!~bvslt32(main_~i~3#1, 10bv32); {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} havoc main_#t~nondet118#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume !!~bvslt32(main_~i~3#1, 10bv32); {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} havoc main_#t~nondet118#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume !~bvslt32(main_~i~3#1, 10bv32); {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} is VALID [2022-02-21 02:49:49,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {5382#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))))} assume !(1bv1 == #valid[~#bb_errno_location~0.base]); {5378#false} is VALID [2022-02-21 02:49:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-02-21 02:49:49,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:49,925 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:49,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244612113] [2022-02-21 02:49:49,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244612113] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:49,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:49,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 02:49:49,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631755871] [2022-02-21 02:49:49,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:49,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-21 02:49:49,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:49,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:49,943 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-21 02:49:49,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:49:49,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:49,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:49:49,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:49,944 INFO L87 Difference]: Start difference. First operand 262 states and 295 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:50,856 INFO L93 Difference]: Finished difference Result 277 states and 311 transitions. [2022-02-21 02:49:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:49:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-21 02:49:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2022-02-21 02:49:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2022-02-21 02:49:50,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 283 transitions. [2022-02-21 02:49:51,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:51,241 INFO L225 Difference]: With dead ends: 277 [2022-02-21 02:49:51,241 INFO L226 Difference]: Without dead ends: 277 [2022-02-21 02:49:51,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:51,242 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 237 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:51,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 202 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 02:49:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-02-21 02:49:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2022-02-21 02:49:51,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:51,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 261 states, 171 states have (on average 1.695906432748538) internal successors, (290), 257 states have internal predecessors, (290), 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-21 02:49:51,246 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 261 states, 171 states have (on average 1.695906432748538) internal successors, (290), 257 states have internal predecessors, (290), 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-21 02:49:51,246 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 261 states, 171 states have (on average 1.695906432748538) internal successors, (290), 257 states have internal predecessors, (290), 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-21 02:49:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:51,268 INFO L93 Difference]: Finished difference Result 277 states and 311 transitions. [2022-02-21 02:49:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 311 transitions. [2022-02-21 02:49:51,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:51,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:51,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 171 states have (on average 1.695906432748538) internal successors, (290), 257 states have internal predecessors, (290), 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 277 states. [2022-02-21 02:49:51,277 INFO L87 Difference]: Start difference. First operand has 261 states, 171 states have (on average 1.695906432748538) internal successors, (290), 257 states have internal predecessors, (290), 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 277 states. [2022-02-21 02:49:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:51,282 INFO L93 Difference]: Finished difference Result 277 states and 311 transitions. [2022-02-21 02:49:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 311 transitions. [2022-02-21 02:49:51,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:51,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:51,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:51,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 171 states have (on average 1.695906432748538) internal successors, (290), 257 states have internal predecessors, (290), 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-21 02:49:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 294 transitions. [2022-02-21 02:49:51,295 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 294 transitions. Word has length 39 [2022-02-21 02:49:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:51,297 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 294 transitions. [2022-02-21 02:49:51,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 294 transitions. [2022-02-21 02:49:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-21 02:49:51,298 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:51,298 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:51,309 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-21 02:49:51,507 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-21 02:49:51,507 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:49:51,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:51,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1411098841, now seen corresponding path program 1 times [2022-02-21 02:49:51,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:51,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398122017] [2022-02-21 02:49:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:51,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:51,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:51,509 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-21 02:49:51,510 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-21 02:49:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:51,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 02:49:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:51,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:51,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {6588#true} is VALID [2022-02-21 02:49:51,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {6588#true} is VALID [2022-02-21 02:49:51,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {6588#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {6588#true} is VALID [2022-02-21 02:49:51,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {6588#true} main_~i~3#1 := 0bv32; {6602#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:51,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {6602#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6602#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:51,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {6602#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6602#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:51,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {6602#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} havoc main_#t~nondet118#1; {6602#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:51,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {6602#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6615#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:51,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {6615#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6615#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:51,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {6615#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6615#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:51,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {6615#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} havoc main_#t~nondet118#1; {6615#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:51,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {6615#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6628#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:51,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {6628#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6628#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:52,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {6628#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6628#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:52,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {6628#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} havoc main_#t~nondet118#1; {6628#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:52,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {6628#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6641#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} is VALID [2022-02-21 02:49:52,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {6641#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6641#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} is VALID [2022-02-21 02:49:52,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {6641#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6641#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} is VALID [2022-02-21 02:49:52,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {6641#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} havoc main_#t~nondet118#1; {6641#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} is VALID [2022-02-21 02:49:52,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {6641#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6654#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} is VALID [2022-02-21 02:49:52,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {6654#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} assume !!~bvslt32(main_~i~3#1, 10bv32); {6654#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} is VALID [2022-02-21 02:49:52,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {6654#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6654#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} is VALID [2022-02-21 02:49:52,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {6654#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} havoc main_#t~nondet118#1; {6654#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} is VALID [2022-02-21 02:49:52,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {6654#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6667#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} is VALID [2022-02-21 02:49:52,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {6667#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6667#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} is VALID [2022-02-21 02:49:52,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {6667#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6667#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} is VALID [2022-02-21 02:49:52,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {6667#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} havoc main_#t~nondet118#1; {6667#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} is VALID [2022-02-21 02:49:52,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {6667#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6680#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} is VALID [2022-02-21 02:49:52,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {6680#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6680#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} is VALID [2022-02-21 02:49:52,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {6680#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6680#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} is VALID [2022-02-21 02:49:52,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {6680#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} havoc main_#t~nondet118#1; {6680#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} is VALID [2022-02-21 02:49:52,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {6680#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6693#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} is VALID [2022-02-21 02:49:52,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {6693#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6693#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} is VALID [2022-02-21 02:49:52,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {6693#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6693#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} is VALID [2022-02-21 02:49:52,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {6693#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} havoc main_#t~nondet118#1; {6693#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} is VALID [2022-02-21 02:49:52,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {6693#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6706#(= |ULTIMATE.start_main_~i~3#1| (_ bv8 32))} is VALID [2022-02-21 02:49:52,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {6706#(= |ULTIMATE.start_main_~i~3#1| (_ bv8 32))} assume !~bvslt32(main_~i~3#1, 10bv32); {6589#false} is VALID [2022-02-21 02:49:52,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {6589#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {6589#false} is VALID [2022-02-21 02:49:52,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {6589#false} assume !((~bvule64(~bvadd64(4bv64, ~#bb_errno_location~0.offset), #length[~#bb_errno_location~0.base]) && ~bvule64(~#bb_errno_location~0.offset, ~bvadd64(4bv64, ~#bb_errno_location~0.offset))) && ~bvule64(0bv64, ~#bb_errno_location~0.offset)); {6589#false} is VALID [2022-02-21 02:49:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 02:49:52,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 02:49:52,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {6589#false} assume !((~bvule64(~bvadd64(4bv64, ~#bb_errno_location~0.offset), #length[~#bb_errno_location~0.base]) && ~bvule64(~#bb_errno_location~0.offset, ~bvadd64(4bv64, ~#bb_errno_location~0.offset))) && ~bvule64(0bv64, ~#bb_errno_location~0.offset)); {6589#false} is VALID [2022-02-21 02:49:52,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {6589#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {6589#false} is VALID [2022-02-21 02:49:52,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {6722#(bvslt |ULTIMATE.start_main_~i~3#1| (_ bv10 32))} assume !~bvslt32(main_~i~3#1, 10bv32); {6589#false} is VALID [2022-02-21 02:49:52,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {6726#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6722#(bvslt |ULTIMATE.start_main_~i~3#1| (_ bv10 32))} is VALID [2022-02-21 02:49:52,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {6726#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6726#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {6726#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6726#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {6726#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6726#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {6739#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6726#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {6739#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6739#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {6739#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6739#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {6739#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6739#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {6752#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6739#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {6752#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6752#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {6752#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6752#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {6752#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6752#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {6765#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6752#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {6765#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} havoc main_#t~nondet118#1; {6765#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:52,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {6765#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6765#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:52,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {6765#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6765#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:52,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {6778#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6765#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:52,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {6778#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6778#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {6778#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6778#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {6778#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6778#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {6791#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6778#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {6791#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6791#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {6791#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6791#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {6791#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6791#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {6804#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6791#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {6804#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6804#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {6804#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6804#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {6804#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6804#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {6817#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {6804#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {6817#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6817#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {6817#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {6817#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,382 INFO L290 TraceCheckUtils]: 4: Hoare triple {6817#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6817#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {6588#true} main_~i~3#1 := 0bv32; {6817#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:52,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {6588#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {6588#true} is VALID [2022-02-21 02:49:52,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {6588#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {6588#true} is VALID [2022-02-21 02:49:52,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {6588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {6588#true} is VALID [2022-02-21 02:49:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 02:49:52,384 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:52,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398122017] [2022-02-21 02:49:52,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398122017] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 02:49:52,384 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 02:49:52,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-02-21 02:49:52,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395822845] [2022-02-21 02:49:52,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 02:49:52,385 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-21 02:49:52,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:52,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:52,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:52,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-21 02:49:52,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:52,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 02:49:52,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-02-21 02:49:52,487 INFO L87 Difference]: Start difference. First operand 261 states and 294 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:59,122 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2022-02-21 02:49:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 02:49:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-21 02:49:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 304 transitions. [2022-02-21 02:49:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 304 transitions. [2022-02-21 02:49:59,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 304 transitions. [2022-02-21 02:49:59,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:59,466 INFO L225 Difference]: With dead ends: 269 [2022-02-21 02:49:59,466 INFO L226 Difference]: Without dead ends: 269 [2022-02-21 02:49:59,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-02-21 02:49:59,467 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 33 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:59,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 2666 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 02:49:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-02-21 02:49:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-02-21 02:49:59,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:59,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 269 states, 179 states have (on average 1.664804469273743) internal successors, (298), 265 states have internal predecessors, (298), 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-21 02:49:59,471 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 269 states, 179 states have (on average 1.664804469273743) internal successors, (298), 265 states have internal predecessors, (298), 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-21 02:49:59,475 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 269 states, 179 states have (on average 1.664804469273743) internal successors, (298), 265 states have internal predecessors, (298), 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-21 02:49:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:59,479 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2022-02-21 02:49:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 302 transitions. [2022-02-21 02:49:59,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:59,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:59,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 179 states have (on average 1.664804469273743) internal successors, (298), 265 states have internal predecessors, (298), 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 269 states. [2022-02-21 02:49:59,480 INFO L87 Difference]: Start difference. First operand has 269 states, 179 states have (on average 1.664804469273743) internal successors, (298), 265 states have internal predecessors, (298), 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 269 states. [2022-02-21 02:49:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:59,485 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2022-02-21 02:49:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 302 transitions. [2022-02-21 02:49:59,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:59,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:59,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:59,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 179 states have (on average 1.664804469273743) internal successors, (298), 265 states have internal predecessors, (298), 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-21 02:49:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 302 transitions. [2022-02-21 02:49:59,490 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 302 transitions. Word has length 39 [2022-02-21 02:49:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:59,490 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 302 transitions. [2022-02-21 02:49:59,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 302 transitions. [2022-02-21 02:49:59,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-21 02:49:59,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:59,493 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:59,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-21 02:49:59,697 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-21 02:49:59,697 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:49:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash 233252627, now seen corresponding path program 2 times [2022-02-21 02:49:59,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:59,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090393782] [2022-02-21 02:49:59,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 02:49:59,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:59,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:59,701 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-21 02:49:59,702 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-21 02:49:59,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 02:49:59,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 02:49:59,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 02:49:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:59,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:59,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 02:49:59,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 02:50:00,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {7914#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {7919#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {7919#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv1 1) (select |#valid| (_ bv10 64))) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_~i~3#1 := 0bv32; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} havoc main_#t~nondet118#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} havoc main_#t~nondet118#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} havoc main_#t~nondet118#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} havoc main_#t~nondet118#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} havoc main_#t~nondet118#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} havoc main_#t~nondet118#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} havoc main_#t~nondet118#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} havoc main_#t~nondet118#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} havoc main_#t~nondet118#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !!~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} havoc main_#t~nondet118#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !~bvslt32(main_~i~3#1, 10bv32); {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} is VALID [2022-02-21 02:50:00,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {7923#(and (= (_ bv10 64) |~#bb_errno_location~0.base|) (= (_ bv0 64) |~#bb_errno_location~0.offset|) (= (select |#length| (_ bv10 64)) (_ bv4 64)))} assume !((~bvule64(~bvadd64(4bv64, ~#bb_errno_location~0.offset), #length[~#bb_errno_location~0.base]) && ~bvule64(~#bb_errno_location~0.offset, ~bvadd64(4bv64, ~#bb_errno_location~0.offset))) && ~bvule64(0bv64, ~#bb_errno_location~0.offset)); {7915#false} is VALID [2022-02-21 02:50:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:00,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:00,582 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:00,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090393782] [2022-02-21 02:50:00,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090393782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:00,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:00,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:50:00,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121570120] [2022-02-21 02:50:00,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:00,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-21 02:50:00,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:00,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:50:00,621 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-21 02:50:00,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 02:50:00,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:00,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 02:50:00,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:50:00,622 INFO L87 Difference]: Start difference. First operand 269 states and 302 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:50:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:01,991 INFO L93 Difference]: Finished difference Result 284 states and 318 transitions. [2022-02-21 02:50:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 02:50:01,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-21 02:50:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:50:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-02-21 02:50:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:50:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-02-21 02:50:02,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 282 transitions. [2022-02-21 02:50:02,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:02,708 INFO L225 Difference]: With dead ends: 284 [2022-02-21 02:50:02,708 INFO L226 Difference]: Without dead ends: 284 [2022-02-21 02:50:02,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:50:02,709 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 275 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:02,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 158 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 02:50:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-02-21 02:50:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-02-21 02:50:02,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:02,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 268 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 264 states have internal predecessors, (297), 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-21 02:50:02,720 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 268 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 264 states have internal predecessors, (297), 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-21 02:50:02,721 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 268 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 264 states have internal predecessors, (297), 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-21 02:50:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:02,725 INFO L93 Difference]: Finished difference Result 284 states and 318 transitions. [2022-02-21 02:50:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 318 transitions. [2022-02-21 02:50:02,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:02,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:02,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 264 states have internal predecessors, (297), 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 284 states. [2022-02-21 02:50:02,728 INFO L87 Difference]: Start difference. First operand has 268 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 264 states have internal predecessors, (297), 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 284 states. [2022-02-21 02:50:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:02,733 INFO L93 Difference]: Finished difference Result 284 states and 318 transitions. [2022-02-21 02:50:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 318 transitions. [2022-02-21 02:50:02,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:02,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:02,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:02,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 264 states have internal predecessors, (297), 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-21 02:50:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 301 transitions. [2022-02-21 02:50:02,739 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 301 transitions. Word has length 47 [2022-02-21 02:50:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:02,739 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 301 transitions. [2022-02-21 02:50:02,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:50:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 301 transitions. [2022-02-21 02:50:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-21 02:50:02,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:02,740 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:02,771 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-21 02:50:02,950 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-21 02:50:02,950 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:50:02,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1065773764, now seen corresponding path program 1 times [2022-02-21 02:50:02,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:02,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442435066] [2022-02-21 02:50:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:02,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:02,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:02,953 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-21 02:50:02,954 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-21 02:50:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:03,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 02:50:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:03,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:03,382 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-21 02:50:03,383 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 1 case distinctions, treesize of input 9 treesize of output 14 [2022-02-21 02:50:03,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {9178#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {9178#true} is VALID [2022-02-21 02:50:03,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {9178#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {9178#true} is VALID [2022-02-21 02:50:03,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {9178#true} is VALID [2022-02-21 02:50:03,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {9178#true} main_~i~3#1 := 0bv32; {9178#true} is VALID [2022-02-21 02:50:03,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {9178#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {9178#true} is VALID [2022-02-21 02:50:03,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {9178#true} havoc main_#t~nondet118#1; {9178#true} is VALID [2022-02-21 02:50:03,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {9178#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {9178#true} is VALID [2022-02-21 02:50:03,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {9178#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {9178#true} is VALID [2022-02-21 02:50:03,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {9178#true} havoc main_#t~nondet118#1; {9178#true} is VALID [2022-02-21 02:50:03,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {9178#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {9178#true} is VALID [2022-02-21 02:50:03,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {9178#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {9178#true} is VALID [2022-02-21 02:50:03,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {9178#true} havoc main_#t~nondet118#1; {9178#true} is VALID [2022-02-21 02:50:03,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {9178#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {9178#true} is VALID [2022-02-21 02:50:03,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {9178#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {9178#true} is VALID [2022-02-21 02:50:03,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {9178#true} havoc main_#t~nondet118#1; {9178#true} is VALID [2022-02-21 02:50:03,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {9178#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {9178#true} is VALID [2022-02-21 02:50:03,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {9178#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {9178#true} is VALID [2022-02-21 02:50:03,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {9178#true} havoc main_#t~nondet118#1; {9178#true} is VALID [2022-02-21 02:50:03,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {9178#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {9178#true} is VALID [2022-02-21 02:50:03,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {9178#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {9178#true} is VALID [2022-02-21 02:50:03,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {9178#true} havoc main_#t~nondet118#1; {9178#true} is VALID [2022-02-21 02:50:03,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {9178#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {9178#true} is VALID [2022-02-21 02:50:03,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {9178#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {9178#true} is VALID [2022-02-21 02:50:03,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {9178#true} havoc main_#t~nondet118#1; {9178#true} is VALID [2022-02-21 02:50:03,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {9178#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {9178#true} is VALID [2022-02-21 02:50:03,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {9178#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {9178#true} is VALID [2022-02-21 02:50:03,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {9178#true} havoc main_#t~nondet118#1; {9178#true} is VALID [2022-02-21 02:50:03,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {9178#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {9178#true} is VALID [2022-02-21 02:50:03,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {9178#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {9178#true} is VALID [2022-02-21 02:50:03,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {9178#true} havoc main_#t~nondet118#1; {9178#true} is VALID [2022-02-21 02:50:03,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {9178#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {9178#true} is VALID [2022-02-21 02:50:03,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {9178#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {9178#true} is VALID [2022-02-21 02:50:03,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {9178#true} havoc main_#t~nondet118#1; {9178#true} is VALID [2022-02-21 02:50:03,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {9178#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {9178#true} is VALID [2022-02-21 02:50:03,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {9178#true} assume !~bvslt32(main_~i~3#1, 10bv32); {9178#true} is VALID [2022-02-21 02:50:03,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {9178#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {9178#true} is VALID [2022-02-21 02:50:03,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {9178#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet119#1, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64); srcloc: L1599 {9178#true} is VALID [2022-02-21 02:50:03,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {9178#true} havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {9178#true} is VALID [2022-02-21 02:50:03,434 INFO L272 TraceCheckUtils]: 48: Hoare triple {9178#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {9178#true} is VALID [2022-02-21 02:50:03,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {9178#true} ~cond := #in~cond; {9178#true} is VALID [2022-02-21 02:50:03,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {9178#true} assume !(0bv32 == ~cond); {9178#true} is VALID [2022-02-21 02:50:03,434 INFO L290 TraceCheckUtils]: 51: Hoare triple {9178#true} assume true; {9178#true} is VALID [2022-02-21 02:50:03,434 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9178#true} {9178#true} #476#return; {9178#true} is VALID [2022-02-21 02:50:03,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {9178#true} call main_#t~malloc121#1.base, main_#t~malloc121#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc121#1.base, main_#t~malloc121#1.offset;havoc main_#t~malloc121#1.base, main_#t~malloc121#1.offset;call main_#t~malloc122#1.base, main_#t~malloc122#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc122#1.base, main_#t~malloc122#1.offset;havoc main_#t~malloc122#1.base, main_#t~malloc122#1.offset; {9342#(= (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|))) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-21 02:50:03,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {9342#(= (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|))) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[main_~argv~0#1.base]); {9179#false} is VALID [2022-02-21 02:50:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:03,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:03,440 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:03,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442435066] [2022-02-21 02:50:03,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442435066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:03,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:03,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:50:03,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976062545] [2022-02-21 02:50:03,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:03,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 55 [2022-02-21 02:50:03,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:03,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-21 02:50:03,471 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-21 02:50:03,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:50:03,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:03,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:50:03,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:50:03,472 INFO L87 Difference]: Start difference. First operand 268 states and 301 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-21 02:50:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:04,568 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2022-02-21 02:50:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:50:04,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 55 [2022-02-21 02:50:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-21 02:50:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2022-02-21 02:50:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-21 02:50:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2022-02-21 02:50:04,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 281 transitions. [2022-02-21 02:50:04,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:04,923 INFO L225 Difference]: With dead ends: 279 [2022-02-21 02:50:04,923 INFO L226 Difference]: Without dead ends: 279 [2022-02-21 02:50:04,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:50:04,924 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 222 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:04,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 211 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 02:50:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-02-21 02:50:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2022-02-21 02:50:04,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:04,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 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-21 02:50:04,930 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 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-21 02:50:04,930 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 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-21 02:50:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:04,935 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2022-02-21 02:50:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 313 transitions. [2022-02-21 02:50:04,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:04,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:04,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 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 279 states. [2022-02-21 02:50:04,936 INFO L87 Difference]: Start difference. First operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 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 279 states. [2022-02-21 02:50:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:04,940 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2022-02-21 02:50:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 313 transitions. [2022-02-21 02:50:04,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:04,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:04,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:04,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 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-21 02:50:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 296 transitions. [2022-02-21 02:50:04,944 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 296 transitions. Word has length 55 [2022-02-21 02:50:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:04,944 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 296 transitions. [2022-02-21 02:50:04,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-21 02:50:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2022-02-21 02:50:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-21 02:50:04,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:04,946 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:04,962 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-21 02:50:05,159 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-21 02:50:05,159 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:50:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:05,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1065773765, now seen corresponding path program 1 times [2022-02-21 02:50:05,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:05,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815902082] [2022-02-21 02:50:05,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:05,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:05,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:05,163 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-21 02:50:05,164 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-21 02:50:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:05,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 02:50:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:05,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:05,693 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-02-21 02:50:05,694 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 1 case distinctions, treesize of input 19 treesize of output 21 [2022-02-21 02:50:05,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {10445#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {10445#true} is VALID [2022-02-21 02:50:05,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {10445#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {10445#true} is VALID [2022-02-21 02:50:05,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {10445#true} is VALID [2022-02-21 02:50:05,861 INFO L290 TraceCheckUtils]: 3: Hoare triple {10445#true} main_~i~3#1 := 0bv32; {10445#true} is VALID [2022-02-21 02:50:05,861 INFO L290 TraceCheckUtils]: 4: Hoare triple {10445#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {10445#true} is VALID [2022-02-21 02:50:05,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {10445#true} havoc main_#t~nondet118#1; {10445#true} is VALID [2022-02-21 02:50:05,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {10445#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {10445#true} is VALID [2022-02-21 02:50:05,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {10445#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {10445#true} is VALID [2022-02-21 02:50:05,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {10445#true} havoc main_#t~nondet118#1; {10445#true} is VALID [2022-02-21 02:50:05,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {10445#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {10445#true} is VALID [2022-02-21 02:50:05,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {10445#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {10445#true} is VALID [2022-02-21 02:50:05,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {10445#true} havoc main_#t~nondet118#1; {10445#true} is VALID [2022-02-21 02:50:05,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {10445#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {10445#true} is VALID [2022-02-21 02:50:05,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {10445#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {10445#true} is VALID [2022-02-21 02:50:05,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {10445#true} havoc main_#t~nondet118#1; {10445#true} is VALID [2022-02-21 02:50:05,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {10445#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {10445#true} is VALID [2022-02-21 02:50:05,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {10445#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {10445#true} is VALID [2022-02-21 02:50:05,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {10445#true} havoc main_#t~nondet118#1; {10445#true} is VALID [2022-02-21 02:50:05,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {10445#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {10445#true} is VALID [2022-02-21 02:50:05,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {10445#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {10445#true} is VALID [2022-02-21 02:50:05,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {10445#true} havoc main_#t~nondet118#1; {10445#true} is VALID [2022-02-21 02:50:05,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {10445#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {10445#true} is VALID [2022-02-21 02:50:05,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {10445#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {10445#true} is VALID [2022-02-21 02:50:05,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {10445#true} havoc main_#t~nondet118#1; {10445#true} is VALID [2022-02-21 02:50:05,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {10445#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {10445#true} is VALID [2022-02-21 02:50:05,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {10445#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {10445#true} is VALID [2022-02-21 02:50:05,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {10445#true} havoc main_#t~nondet118#1; {10445#true} is VALID [2022-02-21 02:50:05,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {10445#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {10445#true} is VALID [2022-02-21 02:50:05,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {10445#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {10445#true} is VALID [2022-02-21 02:50:05,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {10445#true} havoc main_#t~nondet118#1; {10445#true} is VALID [2022-02-21 02:50:05,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {10445#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {10445#true} is VALID [2022-02-21 02:50:05,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {10445#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {10445#true} is VALID [2022-02-21 02:50:05,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {10445#true} havoc main_#t~nondet118#1; {10445#true} is VALID [2022-02-21 02:50:05,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {10445#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {10445#true} is VALID [2022-02-21 02:50:05,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {10445#true} assume !~bvslt32(main_~i~3#1, 10bv32); {10445#true} is VALID [2022-02-21 02:50:05,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {10445#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {10445#true} is VALID [2022-02-21 02:50:05,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {10445#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet119#1, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64); srcloc: L1599 {10445#true} is VALID [2022-02-21 02:50:05,867 INFO L290 TraceCheckUtils]: 47: Hoare triple {10445#true} havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {10445#true} is VALID [2022-02-21 02:50:05,867 INFO L272 TraceCheckUtils]: 48: Hoare triple {10445#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {10445#true} is VALID [2022-02-21 02:50:05,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {10445#true} ~cond := #in~cond; {10597#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:50:05,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {10597#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {10601#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:05,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {10601#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {10601#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:05,869 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10601#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {10445#true} #476#return; {10608#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:05,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {10608#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} call main_#t~malloc121#1.base, main_#t~malloc121#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc121#1.base, main_#t~malloc121#1.offset;havoc main_#t~malloc121#1.base, main_#t~malloc121#1.offset;call main_#t~malloc122#1.base, main_#t~malloc122#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc122#1.base, main_#t~malloc122#1.offset;havoc main_#t~malloc122#1.base, main_#t~malloc122#1.offset; {10612#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))} is VALID [2022-02-21 02:50:05,878 INFO L290 TraceCheckUtils]: 54: Hoare triple {10612#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1)))), #length[main_~argv~0#1.base]) && ~bvule64(~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), ~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1)))))) && ~bvule64(0bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))))); {10446#false} is VALID [2022-02-21 02:50:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:05,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:05,878 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:05,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815902082] [2022-02-21 02:50:05,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815902082] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:05,879 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:05,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 02:50:05,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805268029] [2022-02-21 02:50:05,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:05,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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 55 [2022-02-21 02:50:05,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:05,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-21 02:50:05,947 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-21 02:50:05,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 02:50:05,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:05,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 02:50:05,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 02:50:05,948 INFO L87 Difference]: Start difference. First operand 263 states and 296 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-21 02:50:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:11,530 INFO L93 Difference]: Finished difference Result 443 states and 507 transitions. [2022-02-21 02:50:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 02:50:11,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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 55 [2022-02-21 02:50:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-21 02:50:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions. [2022-02-21 02:50:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-21 02:50:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions. [2022-02-21 02:50:11,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 472 transitions. [2022-02-21 02:50:12,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:12,216 INFO L225 Difference]: With dead ends: 443 [2022-02-21 02:50:12,216 INFO L226 Difference]: Without dead ends: 443 [2022-02-21 02:50:12,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 02:50:12,217 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 450 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:12,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 788 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-21 02:50:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-02-21 02:50:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 367. [2022-02-21 02:50:12,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:12,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 367 states, 283 states have (on average 1.7279151943462898) internal successors, (489), 362 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 02:50:12,226 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 367 states, 283 states have (on average 1.7279151943462898) internal successors, (489), 362 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 02:50:12,226 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 367 states, 283 states have (on average 1.7279151943462898) internal successors, (489), 362 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 02:50:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:12,233 INFO L93 Difference]: Finished difference Result 443 states and 507 transitions. [2022-02-21 02:50:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 507 transitions. [2022-02-21 02:50:12,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:12,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:12,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 283 states have (on average 1.7279151943462898) internal successors, (489), 362 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 443 states. [2022-02-21 02:50:12,235 INFO L87 Difference]: Start difference. First operand has 367 states, 283 states have (on average 1.7279151943462898) internal successors, (489), 362 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 443 states. [2022-02-21 02:50:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:12,242 INFO L93 Difference]: Finished difference Result 443 states and 507 transitions. [2022-02-21 02:50:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 507 transitions. [2022-02-21 02:50:12,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:12,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:12,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:12,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 283 states have (on average 1.7279151943462898) internal successors, (489), 362 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 02:50:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 495 transitions. [2022-02-21 02:50:12,249 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 495 transitions. Word has length 55 [2022-02-21 02:50:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:12,250 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 495 transitions. [2022-02-21 02:50:12,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-21 02:50:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 495 transitions. [2022-02-21 02:50:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-21 02:50:12,251 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:12,251 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:12,280 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-21 02:50:12,464 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-21 02:50:12,464 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:50:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2067963466, now seen corresponding path program 1 times [2022-02-21 02:50:12,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:12,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002695583] [2022-02-21 02:50:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:12,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:12,467 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-21 02:50:12,468 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-21 02:50:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:12,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 02:50:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:12,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:13,100 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-02-21 02:50:13,100 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 1 case distinctions, treesize of input 19 treesize of output 21 [2022-02-21 02:50:13,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 02:50:13,464 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-21 02:50:13,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2022-02-21 02:50:13,481 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 02:50:13,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 02:50:13,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {12313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {12313#true} is VALID [2022-02-21 02:50:13,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {12313#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {12313#true} is VALID [2022-02-21 02:50:13,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {12313#true} is VALID [2022-02-21 02:50:13,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {12313#true} main_~i~3#1 := 0bv32; {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {12313#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {12313#true} havoc main_#t~nondet118#1; {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {12313#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {12313#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {12313#true} havoc main_#t~nondet118#1; {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {12313#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {12313#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {12313#true} havoc main_#t~nondet118#1; {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {12313#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {12313#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {12313#true} havoc main_#t~nondet118#1; {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {12313#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {12313#true} is VALID [2022-02-21 02:50:13,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {12313#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {12313#true} havoc main_#t~nondet118#1; {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {12313#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {12313#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {12313#true} havoc main_#t~nondet118#1; {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {12313#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {12313#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {12313#true} havoc main_#t~nondet118#1; {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {12313#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {12313#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {12313#true} is VALID [2022-02-21 02:50:13,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {12313#true} havoc main_#t~nondet118#1; {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {12313#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {12313#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {12313#true} havoc main_#t~nondet118#1; {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {12313#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {12313#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {12313#true} havoc main_#t~nondet118#1; {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {12313#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {12313#true} assume !~bvslt32(main_~i~3#1, 10bv32); {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {12313#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {12313#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet119#1, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64); srcloc: L1599 {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L290 TraceCheckUtils]: 47: Hoare triple {12313#true} havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {12313#true} is VALID [2022-02-21 02:50:13,672 INFO L272 TraceCheckUtils]: 48: Hoare triple {12313#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {12313#true} is VALID [2022-02-21 02:50:13,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {12313#true} ~cond := #in~cond; {12465#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:50:13,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {12465#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {12469#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:13,674 INFO L290 TraceCheckUtils]: 51: Hoare triple {12469#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {12469#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:13,674 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12469#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {12313#true} #476#return; {12476#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:13,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {12476#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} call main_#t~malloc121#1.base, main_#t~malloc121#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc121#1.base, main_#t~malloc121#1.offset;havoc main_#t~malloc121#1.base, main_#t~malloc121#1.offset;call main_#t~malloc122#1.base, main_#t~malloc122#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc122#1.base, main_#t~malloc122#1.offset;havoc main_#t~malloc122#1.base, main_#t~malloc122#1.offset; {12480#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~mem_track~0#1.base| (_ BitVec 64)) (|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))))} is VALID [2022-02-21 02:50:13,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {12480#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~mem_track~0#1.base| (_ BitVec 64)) (|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))))} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1605 {12484#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~mem_track~0#1.base| (_ BitVec 64)) (|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))) (= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)))} is VALID [2022-02-21 02:50:13,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {12484#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~mem_track~0#1.base| (_ BitVec 64)) (|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))) (= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)))} main_~i~4#1 := 0bv32; {12488#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~mem_track~0#1.base| (_ BitVec 64)) (|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))) (= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)))} is VALID [2022-02-21 02:50:13,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {12488#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~mem_track~0#1.base| (_ BitVec 64)) (|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))) (= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)))} assume !!~bvslt32(main_~i~4#1, main_~argc~0#1);call main_#t~malloc124#1.base, main_#t~malloc124#1.offset := #Ultimate.allocOnHeap(11bv64); {12492#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))))} is VALID [2022-02-21 02:50:13,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {12492#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))))} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1)))), #length[main_~argv~0#1.base]) && ~bvule64(~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))), ~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1)))))) && ~bvule64(0bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))))); {12314#false} is VALID [2022-02-21 02:50:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:13,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:13,764 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:13,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002695583] [2022-02-21 02:50:13,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002695583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:13,764 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:13,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 02:50:13,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738868112] [2022-02-21 02:50:13,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 58 [2022-02-21 02:50:13,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:13,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-21 02:50:13,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:13,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 02:50:13,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:13,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 02:50:13,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-21 02:50:13,881 INFO L87 Difference]: Start difference. First operand 367 states and 495 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-21 02:50:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:17,386 INFO L93 Difference]: Finished difference Result 368 states and 496 transitions. [2022-02-21 02:50:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 02:50:17,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 58 [2022-02-21 02:50:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-21 02:50:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 262 transitions. [2022-02-21 02:50:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-21 02:50:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 262 transitions. [2022-02-21 02:50:17,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 262 transitions. [2022-02-21 02:50:17,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:17,785 INFO L225 Difference]: With dead ends: 368 [2022-02-21 02:50:17,786 INFO L226 Difference]: Without dead ends: 368 [2022-02-21 02:50:17,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-21 02:50:17,786 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 5 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:17,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1155 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 92 Unchecked, 0.0s Time] [2022-02-21 02:50:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-02-21 02:50:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-02-21 02:50:17,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:17,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 368 states, 284 states have (on average 1.7253521126760563) internal successors, (490), 363 states have internal predecessors, (490), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 02:50:17,792 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 368 states, 284 states have (on average 1.7253521126760563) internal successors, (490), 363 states have internal predecessors, (490), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 02:50:17,793 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 368 states, 284 states have (on average 1.7253521126760563) internal successors, (490), 363 states have internal predecessors, (490), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 02:50:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:17,804 INFO L93 Difference]: Finished difference Result 368 states and 496 transitions. [2022-02-21 02:50:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 496 transitions. [2022-02-21 02:50:17,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:17,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:17,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 284 states have (on average 1.7253521126760563) internal successors, (490), 363 states have internal predecessors, (490), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 368 states. [2022-02-21 02:50:17,806 INFO L87 Difference]: Start difference. First operand has 368 states, 284 states have (on average 1.7253521126760563) internal successors, (490), 363 states have internal predecessors, (490), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 368 states. [2022-02-21 02:50:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:17,811 INFO L93 Difference]: Finished difference Result 368 states and 496 transitions. [2022-02-21 02:50:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 496 transitions. [2022-02-21 02:50:17,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:17,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:17,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:17,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 284 states have (on average 1.7253521126760563) internal successors, (490), 363 states have internal predecessors, (490), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 02:50:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 496 transitions. [2022-02-21 02:50:17,818 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 496 transitions. Word has length 58 [2022-02-21 02:50:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:17,819 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 496 transitions. [2022-02-21 02:50:17,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-21 02:50:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 496 transitions. [2022-02-21 02:50:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-21 02:50:17,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:17,820 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:17,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-21 02:50:18,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 02:50:18,050 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:50:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash -317642580, now seen corresponding path program 1 times [2022-02-21 02:50:18,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:18,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234975786] [2022-02-21 02:50:18,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:18,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:18,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:18,068 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 02:50:18,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-21 02:50:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:18,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:50:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:18,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:18,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {13971#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {13971#true} is VALID [2022-02-21 02:50:18,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {13971#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {13971#true} is VALID [2022-02-21 02:50:18,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {13971#true} is VALID [2022-02-21 02:50:18,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {13971#true} main_~i~3#1 := 0bv32; {13971#true} is VALID [2022-02-21 02:50:18,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {13971#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {13971#true} is VALID [2022-02-21 02:50:18,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {13971#true} havoc main_#t~nondet118#1; {13971#true} is VALID [2022-02-21 02:50:18,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {13971#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {13971#true} is VALID [2022-02-21 02:50:18,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {13971#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {13971#true} is VALID [2022-02-21 02:50:18,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {13971#true} havoc main_#t~nondet118#1; {13971#true} is VALID [2022-02-21 02:50:18,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {13971#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {13971#true} is VALID [2022-02-21 02:50:18,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {13971#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {13971#true} is VALID [2022-02-21 02:50:18,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {13971#true} havoc main_#t~nondet118#1; {13971#true} is VALID [2022-02-21 02:50:18,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {13971#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {13971#true} is VALID [2022-02-21 02:50:18,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {13971#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {13971#true} is VALID [2022-02-21 02:50:18,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {13971#true} havoc main_#t~nondet118#1; {13971#true} is VALID [2022-02-21 02:50:18,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {13971#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {13971#true} is VALID [2022-02-21 02:50:18,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {13971#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {13971#true} is VALID [2022-02-21 02:50:18,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {13971#true} havoc main_#t~nondet118#1; {13971#true} is VALID [2022-02-21 02:50:18,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {13971#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {13971#true} is VALID [2022-02-21 02:50:18,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {13971#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {13971#true} is VALID [2022-02-21 02:50:18,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {13971#true} havoc main_#t~nondet118#1; {13971#true} is VALID [2022-02-21 02:50:18,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {13971#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {13971#true} is VALID [2022-02-21 02:50:18,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {13971#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {13971#true} is VALID [2022-02-21 02:50:18,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {13971#true} havoc main_#t~nondet118#1; {13971#true} is VALID [2022-02-21 02:50:18,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {13971#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {13971#true} is VALID [2022-02-21 02:50:18,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {13971#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {13971#true} is VALID [2022-02-21 02:50:18,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {13971#true} havoc main_#t~nondet118#1; {13971#true} is VALID [2022-02-21 02:50:18,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {13971#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {13971#true} is VALID [2022-02-21 02:50:18,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {13971#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {13971#true} is VALID [2022-02-21 02:50:18,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {13971#true} havoc main_#t~nondet118#1; {13971#true} is VALID [2022-02-21 02:50:18,547 INFO L290 TraceCheckUtils]: 39: Hoare triple {13971#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {13971#true} is VALID [2022-02-21 02:50:18,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {13971#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {13971#true} is VALID [2022-02-21 02:50:18,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {13971#true} havoc main_#t~nondet118#1; {13971#true} is VALID [2022-02-21 02:50:18,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {13971#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {13971#true} is VALID [2022-02-21 02:50:18,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {13971#true} assume !~bvslt32(main_~i~3#1, 10bv32); {13971#true} is VALID [2022-02-21 02:50:18,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {13971#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {13971#true} is VALID [2022-02-21 02:50:18,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {13971#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet119#1, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64); srcloc: L1599 {13971#true} is VALID [2022-02-21 02:50:18,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {13971#true} havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {13971#true} is VALID [2022-02-21 02:50:18,548 INFO L272 TraceCheckUtils]: 48: Hoare triple {13971#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {13971#true} is VALID [2022-02-21 02:50:18,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {13971#true} ~cond := #in~cond; {14123#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:50:18,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {14123#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {14127#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:18,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {14127#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {14127#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:18,554 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14127#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {13971#true} #476#return; {14134#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:18,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {14134#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} call main_#t~malloc121#1.base, main_#t~malloc121#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc121#1.base, main_#t~malloc121#1.offset;havoc main_#t~malloc121#1.base, main_#t~malloc121#1.offset;call main_#t~malloc122#1.base, main_#t~malloc122#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc122#1.base, main_#t~malloc122#1.offset;havoc main_#t~malloc122#1.base, main_#t~malloc122#1.offset; {14134#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:18,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {14134#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1605 {14134#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:18,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {14134#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} main_~i~4#1 := 0bv32; {14144#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:18,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {14144#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} assume !~bvslt32(main_~i~4#1, main_~argc~0#1); {13972#false} is VALID [2022-02-21 02:50:18,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {13972#false} assume { :begin_inline___main } true;__main_#in~argc#1, __main_#in~argv#1.base, __main_#in~argv#1.offset := main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset;havoc __main_#res#1;havoc __main_#t~mem41#1.base, __main_#t~mem41#1.offset, __main_#t~nondet42#1, __main_#t~ite43#1, __main_#t~mem44#1.base, __main_#t~mem44#1.offset, __main_#t~mem45#1, __main_#t~mem46#1, __main_#t~mem47#1, __main_#t~mem48#1, __main_#t~mem49#1, __main_#t~mem50#1, __main_~__s2~0#1.base, __main_~__s2~0#1.offset, __main_~__result~0#1, __main_#t~mem51#1.base, __main_#t~mem51#1.offset, __main_#t~nondet52#1, __main_~basename_main$$1$$1$$__s1_len~0#1, __main_~__s2_len~0#1, __main_#t~mem53#1.base, __main_#t~mem53#1.offset, __main_#t~ret54#1.base, __main_#t~ret54#1.offset, __main_#t~nondet55#1, __main_#t~mem56#1.base, __main_#t~mem56#1.offset, __main_#t~mem57#1.base, __main_#t~mem57#1.offset, __main_#t~nondet58#1, __main_#t~mem59#1.base, __main_#t~mem59#1.offset, __main_#t~nondet60#1, __main_~__s1_len~0#1, __main_~basename_main$$1$$4$$1$$__s2_len~0#1, __main_~return_value___builtin_strcmp$7~0#1, __main_#t~ret61#1, __main_~argc#1, __main_~argv#1.base, __main_~argv#1.offset, __main_~m~0#1, __main_~n~0#1, __main_~s~0#1.base, __main_~s~0#1.offset, __main_~tmp_statement_expression$1~0#1, __main_~tmp_if_expr$2~0#1, __main_~tmp_if_expr$5~0#1, __main_~tmp_statement_expression$3~0#1, __main_~return_value___builtin_strcmp$4~0#1, __main_~tmp_statement_expression$6~0#1, __main_~tmp_post$8~0#1, __main_~return_value_full_write$9~0#1;__main_~argc#1 := __main_#in~argc#1;__main_~argv#1.base, __main_~argv#1.offset := __main_#in~argv#1.base, __main_#in~argv#1.offset;havoc __main_~m~0#1;havoc __main_~n~0#1;havoc __main_~s~0#1.base, __main_~s~0#1.offset;havoc __main_~tmp_statement_expression$1~0#1;havoc __main_~tmp_if_expr$2~0#1;havoc __main_~tmp_if_expr$5~0#1;havoc __main_~tmp_statement_expression$3~0#1;havoc __main_~return_value___builtin_strcmp$4~0#1; {13972#false} is VALID [2022-02-21 02:50:18,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {13972#false} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(8bv64, __main_~argv#1.offset)), #length[__main_~argv#1.base]) && ~bvule64(~bvadd64(8bv64, __main_~argv#1.offset), ~bvadd64(8bv64, ~bvadd64(8bv64, __main_~argv#1.offset)))) && ~bvule64(0bv64, ~bvadd64(8bv64, __main_~argv#1.offset))); {13972#false} is VALID [2022-02-21 02:50:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:18,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:18,558 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:18,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234975786] [2022-02-21 02:50:18,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234975786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:18,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:18,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 02:50:18,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691329262] [2022-02-21 02:50:18,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:18,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 59 [2022-02-21 02:50:18,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:18,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-21 02:50:18,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:18,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 02:50:18,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 02:50:18,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 02:50:18,613 INFO L87 Difference]: Start difference. First operand 368 states and 496 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-21 02:50:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:21,021 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2022-02-21 02:50:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 02:50:21,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 59 [2022-02-21 02:50:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-21 02:50:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 284 transitions. [2022-02-21 02:50:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-21 02:50:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 284 transitions. [2022-02-21 02:50:21,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 284 transitions. [2022-02-21 02:50:21,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:21,392 INFO L225 Difference]: With dead ends: 286 [2022-02-21 02:50:21,392 INFO L226 Difference]: Without dead ends: 286 [2022-02-21 02:50:21,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 02:50:21,392 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 287 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:21,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 940 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 02:50:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-02-21 02:50:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 264. [2022-02-21 02:50:21,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:21,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand has 264 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 260 states have internal predecessors, (293), 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-21 02:50:21,397 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand has 264 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 260 states have internal predecessors, (293), 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-21 02:50:21,397 INFO L87 Difference]: Start difference. First operand 286 states. Second operand has 264 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 260 states have internal predecessors, (293), 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-21 02:50:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:21,401 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2022-02-21 02:50:21,401 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 320 transitions. [2022-02-21 02:50:21,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:21,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:21,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 260 states have internal predecessors, (293), 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 286 states. [2022-02-21 02:50:21,402 INFO L87 Difference]: Start difference. First operand has 264 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 260 states have internal predecessors, (293), 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 286 states. [2022-02-21 02:50:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:21,406 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2022-02-21 02:50:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 320 transitions. [2022-02-21 02:50:21,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:21,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:21,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:21,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 260 states have internal predecessors, (293), 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-21 02:50:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 297 transitions. [2022-02-21 02:50:21,412 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 297 transitions. Word has length 59 [2022-02-21 02:50:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:21,412 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 297 transitions. [2022-02-21 02:50:21,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-21 02:50:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 297 transitions. [2022-02-21 02:50:21,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-21 02:50:21,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:21,413 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:21,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-21 02:50:21,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 02:50:21,626 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:50:21,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1256967413, now seen corresponding path program 1 times [2022-02-21 02:50:21,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:21,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938422319] [2022-02-21 02:50:21,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:21,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:21,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:21,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 02:50:21,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-21 02:50:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:21,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 02:50:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:21,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {15277#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {15277#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {15277#true} main_~i~3#1 := 0bv32; {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {15277#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {15277#true} havoc main_#t~nondet118#1; {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {15277#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {15277#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {15277#true} havoc main_#t~nondet118#1; {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {15277#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {15277#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {15277#true} is VALID [2022-02-21 02:50:22,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {15277#true} havoc main_#t~nondet118#1; {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {15277#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {15277#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {15277#true} havoc main_#t~nondet118#1; {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {15277#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {15277#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {15277#true} havoc main_#t~nondet118#1; {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {15277#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {15277#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {15277#true} havoc main_#t~nondet118#1; {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {15277#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {15277#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {15277#true} havoc main_#t~nondet118#1; {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {15277#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {15277#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {15277#true} is VALID [2022-02-21 02:50:22,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {15277#true} havoc main_#t~nondet118#1; {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {15277#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {15277#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {15277#true} havoc main_#t~nondet118#1; {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {15277#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {15277#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {15277#true} havoc main_#t~nondet118#1; {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {15277#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {15277#true} assume !~bvslt32(main_~i~3#1, 10bv32); {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {15277#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {15277#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet119#1, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64); srcloc: L1599 {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {15277#true} havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L272 TraceCheckUtils]: 48: Hoare triple {15277#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {15277#true} ~cond := #in~cond; {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {15277#true} assume !(0bv32 == ~cond); {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {15277#true} assume true; {15277#true} is VALID [2022-02-21 02:50:22,053 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15277#true} {15277#true} #476#return; {15277#true} is VALID [2022-02-21 02:50:22,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {15277#true} call main_#t~malloc121#1.base, main_#t~malloc121#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc121#1.base, main_#t~malloc121#1.offset;havoc main_#t~malloc121#1.base, main_#t~malloc121#1.offset;call main_#t~malloc122#1.base, main_#t~malloc122#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc122#1.base, main_#t~malloc122#1.offset;havoc main_#t~malloc122#1.base, main_#t~malloc122#1.offset; {15441#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} is VALID [2022-02-21 02:50:22,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {15441#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1605 {15441#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} is VALID [2022-02-21 02:50:22,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {15441#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} main_~i~4#1 := 0bv32; {15448#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|))} is VALID [2022-02-21 02:50:22,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {15448#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|))} assume !!~bvslt32(main_~i~4#1, main_~argc~0#1);call main_#t~malloc124#1.base, main_#t~malloc124#1.offset := #Ultimate.allocOnHeap(11bv64); {15448#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|))} is VALID [2022-02-21 02:50:22,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {15448#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|))} SUMMARY for call write~$Pointer$(main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))), 8bv64); srcloc: L1608 {15455#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (bvule (bvadd (_ bv8 64) (bvmul (_ bv8 64) ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|)) |ULTIMATE.start_main_~argv~0#1.offset|) (select |#length| |ULTIMATE.start_main_~argv~0#1.base|)))} is VALID [2022-02-21 02:50:22,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {15455#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (bvule (bvadd (_ bv8 64) (bvmul (_ bv8 64) ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|)) |ULTIMATE.start_main_~argv~0#1.offset|) (select |#length| |ULTIMATE.start_main_~argv~0#1.base|)))} havoc main_#t~malloc124#1.base, main_#t~malloc124#1.offset; {15455#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (bvule (bvadd (_ bv8 64) (bvmul (_ bv8 64) ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|)) |ULTIMATE.start_main_~argv~0#1.offset|) (select |#length| |ULTIMATE.start_main_~argv~0#1.base|)))} is VALID [2022-02-21 02:50:22,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {15455#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (bvule (bvadd (_ bv8 64) (bvmul (_ bv8 64) ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|)) |ULTIMATE.start_main_~argv~0#1.offset|) (select |#length| |ULTIMATE.start_main_~argv~0#1.base|)))} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1)))), #length[main_~argv~0#1.base]) && ~bvule64(~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))), ~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1)))))) && ~bvule64(0bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))))); {15278#false} is VALID [2022-02-21 02:50:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:22,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:22,057 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:22,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938422319] [2022-02-21 02:50:22,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938422319] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:22,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:22,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 02:50:22,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580443921] [2022-02-21 02:50:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:22,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 60 [2022-02-21 02:50:22,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:22,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-21 02:50:22,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:22,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 02:50:22,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:22,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 02:50:22,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-21 02:50:22,099 INFO L87 Difference]: Start difference. First operand 264 states and 297 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-21 02:50:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:24,640 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2022-02-21 02:50:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 02:50:24,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 60 [2022-02-21 02:50:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-21 02:50:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 283 transitions. [2022-02-21 02:50:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-21 02:50:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 283 transitions. [2022-02-21 02:50:24,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 283 transitions. [2022-02-21 02:50:25,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:25,004 INFO L225 Difference]: With dead ends: 282 [2022-02-21 02:50:25,004 INFO L226 Difference]: Without dead ends: 282 [2022-02-21 02:50:25,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-21 02:50:25,005 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 277 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:25,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 631 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-21 02:50:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-02-21 02:50:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2022-02-21 02:50:25,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:25,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 275 states, 193 states have (on average 1.61139896373057) internal successors, (311), 271 states have internal predecessors, (311), 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-21 02:50:25,009 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 275 states, 193 states have (on average 1.61139896373057) internal successors, (311), 271 states have internal predecessors, (311), 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-21 02:50:25,009 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 275 states, 193 states have (on average 1.61139896373057) internal successors, (311), 271 states have internal predecessors, (311), 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-21 02:50:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:25,012 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2022-02-21 02:50:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 316 transitions. [2022-02-21 02:50:25,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:25,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:25,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 275 states, 193 states have (on average 1.61139896373057) internal successors, (311), 271 states have internal predecessors, (311), 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 282 states. [2022-02-21 02:50:25,013 INFO L87 Difference]: Start difference. First operand has 275 states, 193 states have (on average 1.61139896373057) internal successors, (311), 271 states have internal predecessors, (311), 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 282 states. [2022-02-21 02:50:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:25,016 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2022-02-21 02:50:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 316 transitions. [2022-02-21 02:50:25,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:25,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:25,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:25,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 193 states have (on average 1.61139896373057) internal successors, (311), 271 states have internal predecessors, (311), 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-21 02:50:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 315 transitions. [2022-02-21 02:50:25,021 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 315 transitions. Word has length 60 [2022-02-21 02:50:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:25,021 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 315 transitions. [2022-02-21 02:50:25,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-21 02:50:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 315 transitions. [2022-02-21 02:50:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 02:50:25,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:25,022 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:25,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-02-21 02:50:25,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 02:50:25,235 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:50:25,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash -311284142, now seen corresponding path program 1 times [2022-02-21 02:50:25,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:25,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931198392] [2022-02-21 02:50:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:25,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:25,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:25,238 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 02:50:25,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-21 02:50:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:25,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 02:50:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:25,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:25,832 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-21 02:50:25,833 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-21 02:50:25,863 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-21 02:50:25,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2022-02-21 02:50:25,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {16582#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {16582#true} is VALID [2022-02-21 02:50:25,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {16582#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {16582#true} is VALID [2022-02-21 02:50:25,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {16582#true} is VALID [2022-02-21 02:50:25,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {16582#true} main_~i~3#1 := 0bv32; {16582#true} is VALID [2022-02-21 02:50:25,899 INFO L290 TraceCheckUtils]: 4: Hoare triple {16582#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {16582#true} havoc main_#t~nondet118#1; {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {16582#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {16582#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {16582#true} havoc main_#t~nondet118#1; {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {16582#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {16582#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {16582#true} havoc main_#t~nondet118#1; {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {16582#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {16582#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {16582#true} havoc main_#t~nondet118#1; {16582#true} is VALID [2022-02-21 02:50:25,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {16582#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {16582#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {16582#true} havoc main_#t~nondet118#1; {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {16582#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {16582#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {16582#true} havoc main_#t~nondet118#1; {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {16582#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {16582#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {16582#true} havoc main_#t~nondet118#1; {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {16582#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {16582#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {16582#true} havoc main_#t~nondet118#1; {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {16582#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {16582#true} is VALID [2022-02-21 02:50:25,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {16582#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {16582#true} havoc main_#t~nondet118#1; {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {16582#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {16582#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {16582#true} havoc main_#t~nondet118#1; {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {16582#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {16582#true} assume !~bvslt32(main_~i~3#1, 10bv32); {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {16582#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 46: Hoare triple {16582#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet119#1, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64); srcloc: L1599 {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 47: Hoare triple {16582#true} havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L272 TraceCheckUtils]: 48: Hoare triple {16582#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {16582#true} assume !(0bv32 == ~cond); {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-02-21 02:50:25,902 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16582#true} {16582#true} #476#return; {16582#true} is VALID [2022-02-21 02:50:25,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {16582#true} call main_#t~malloc121#1.base, main_#t~malloc121#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc121#1.base, main_#t~malloc121#1.offset;havoc main_#t~malloc121#1.base, main_#t~malloc121#1.offset;call main_#t~malloc122#1.base, main_#t~malloc122#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc122#1.base, main_#t~malloc122#1.offset;havoc main_#t~malloc122#1.base, main_#t~malloc122#1.offset; {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:25,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1605 {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:25,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} main_~i~4#1 := 0bv32; {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:25,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} assume !!~bvslt32(main_~i~4#1, main_~argc~0#1);call main_#t~malloc124#1.base, main_#t~malloc124#1.offset := #Ultimate.allocOnHeap(11bv64); {16756#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc124#1.base|) (_ bv1 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|))))} is VALID [2022-02-21 02:50:25,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {16756#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc124#1.base|) (_ bv1 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|))))} SUMMARY for call write~$Pointer$(main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))), 8bv64); srcloc: L1608 {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:25,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} havoc main_#t~malloc124#1.base, main_#t~malloc124#1.offset; {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:25,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} SUMMARY for call main_#t~mem125#1.base, main_#t~mem125#1.offset := read~$Pointer$(main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))), 8bv64); srcloc: L1609 {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:25,909 INFO L290 TraceCheckUtils]: 60: Hoare triple {16746#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} assume !(1bv1 == #valid[main_~mem_track~0#1.base]); {16583#false} is VALID [2022-02-21 02:50:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:25,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:25,909 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:25,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931198392] [2022-02-21 02:50:25,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931198392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:25,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:25,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 02:50:25,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323997212] [2022-02-21 02:50:25,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:25,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 61 [2022-02-21 02:50:25,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:25,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-21 02:50:25,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:25,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 02:50:25,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:25,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 02:50:25,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:50:25,954 INFO L87 Difference]: Start difference. First operand 275 states and 315 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-21 02:50:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:27,668 INFO L93 Difference]: Finished difference Result 282 states and 322 transitions. [2022-02-21 02:50:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 02:50:27,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 61 [2022-02-21 02:50:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-21 02:50:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-02-21 02:50:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-21 02:50:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-02-21 02:50:27,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 268 transitions. [2022-02-21 02:50:27,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:27,991 INFO L225 Difference]: With dead ends: 282 [2022-02-21 02:50:27,991 INFO L226 Difference]: Without dead ends: 282 [2022-02-21 02:50:27,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:50:27,992 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 215 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:27,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 353 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 02:50:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-02-21 02:50:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2022-02-21 02:50:27,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:27,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 279 states, 198 states have (on average 1.606060606060606) internal successors, (318), 275 states have internal predecessors, (318), 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-21 02:50:27,995 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 279 states, 198 states have (on average 1.606060606060606) internal successors, (318), 275 states have internal predecessors, (318), 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-21 02:50:27,995 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 279 states, 198 states have (on average 1.606060606060606) internal successors, (318), 275 states have internal predecessors, (318), 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-21 02:50:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:27,999 INFO L93 Difference]: Finished difference Result 282 states and 322 transitions. [2022-02-21 02:50:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 322 transitions. [2022-02-21 02:50:27,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:27,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:28,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 198 states have (on average 1.606060606060606) internal successors, (318), 275 states have internal predecessors, (318), 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 282 states. [2022-02-21 02:50:28,000 INFO L87 Difference]: Start difference. First operand has 279 states, 198 states have (on average 1.606060606060606) internal successors, (318), 275 states have internal predecessors, (318), 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 282 states. [2022-02-21 02:50:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:28,003 INFO L93 Difference]: Finished difference Result 282 states and 322 transitions. [2022-02-21 02:50:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 322 transitions. [2022-02-21 02:50:28,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:28,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:28,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:28,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.606060606060606) internal successors, (318), 275 states have internal predecessors, (318), 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-21 02:50:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2022-02-21 02:50:28,008 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 61 [2022-02-21 02:50:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:28,008 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2022-02-21 02:50:28,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-21 02:50:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2022-02-21 02:50:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 02:50:28,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:28,009 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:28,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-21 02:50:28,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 02:50:28,224 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2022-02-21 02:50:28,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:28,224 INFO L85 PathProgramCache]: Analyzing trace with hash -311284141, now seen corresponding path program 1 times [2022-02-21 02:50:28,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:28,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470186274] [2022-02-21 02:50:28,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:28,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:28,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:28,226 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 02:50:28,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-21 02:50:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:28,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 02:50:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:28,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:29,003 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-21 02:50:29,003 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-21 02:50:29,025 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-21 02:50:29,026 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-21 02:50:29,246 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 02:50:29,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 02:50:29,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-02-21 02:50:29,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {17893#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~#bb_errno_location~0.base, ~#bb_errno_location~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(4bv64, 10bv64);call write~init~intINTTYPE4(0bv32, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64);~bb_errno~0.base, ~bb_errno~0.offset := ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(382bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {17893#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset, main_#t~nondet118#1, main_#t~pre117#1, main_~i~3#1, main_#t~nondet119#1, main_#t~nondet120#1, main_#t~malloc121#1.base, main_#t~malloc121#1.offset, main_#t~malloc122#1.base, main_#t~malloc122#1.offset, main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~nondet129#1, main_#t~pre127#1, main_~j~0#1, main_#t~pre123#1, main_~i~4#1, main_#t~ret130#1, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~pre131#1, main_~i~5#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc116#1.base, main_#t~malloc116#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc116#1.base, main_#t~malloc116#1.offset;havoc main_#t~malloc116#1.base, main_#t~malloc116#1.offset; {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {17893#true} main_~i~3#1 := 0bv32; {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {17893#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {17893#true} havoc main_#t~nondet118#1; {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {17893#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {17893#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {17893#true} havoc main_#t~nondet118#1; {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {17893#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {17893#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {17893#true} havoc main_#t~nondet118#1; {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {17893#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {17893#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {17893#true} havoc main_#t~nondet118#1; {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {17893#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {17893#true} is VALID [2022-02-21 02:50:29,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {17893#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {17893#true} havoc main_#t~nondet118#1; {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {17893#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {17893#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {17893#true} havoc main_#t~nondet118#1; {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {17893#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {17893#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {17893#true} havoc main_#t~nondet118#1; {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {17893#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {17893#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {17893#true} havoc main_#t~nondet118#1; {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {17893#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {17893#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {17893#true} havoc main_#t~nondet118#1; {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {17893#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {17893#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet118#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~3#1)), 1bv64); srcloc: L1597 {17893#true} is VALID [2022-02-21 02:50:29,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {17893#true} havoc main_#t~nondet118#1; {17893#true} is VALID [2022-02-21 02:50:29,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {17893#true} main_#t~pre117#1 := ~bvadd32(1bv32, main_~i~3#1);main_~i~3#1 := ~bvadd32(1bv32, main_~i~3#1);havoc main_#t~pre117#1; {17893#true} is VALID [2022-02-21 02:50:29,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {17893#true} assume !~bvslt32(main_~i~3#1, 10bv32); {17893#true} is VALID [2022-02-21 02:50:29,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {17893#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset; {17893#true} is VALID [2022-02-21 02:50:29,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {17893#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet119#1, ~#bb_errno_location~0.base, ~#bb_errno_location~0.offset, 4bv64); srcloc: L1599 {17893#true} is VALID [2022-02-21 02:50:29,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {17893#true} havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {17893#true} is VALID [2022-02-21 02:50:29,468 INFO L272 TraceCheckUtils]: 48: Hoare triple {17893#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {17893#true} is VALID [2022-02-21 02:50:29,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {17893#true} ~cond := #in~cond; {18045#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:50:29,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {18045#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {18049#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:29,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {18049#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {18049#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:29,469 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18049#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {17893#true} #476#return; {18056#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:29,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {18056#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} call main_#t~malloc121#1.base, main_#t~malloc121#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc121#1.base, main_#t~malloc121#1.offset;havoc main_#t~malloc121#1.base, main_#t~malloc121#1.offset;call main_#t~malloc122#1.base, main_#t~malloc122#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc122#1.base, main_#t~malloc122#1.offset;havoc main_#t~malloc122#1.base, main_#t~malloc122#1.offset; {18060#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:29,477 INFO L290 TraceCheckUtils]: 54: Hoare triple {18060#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1605 {18060#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:29,479 INFO L290 TraceCheckUtils]: 55: Hoare triple {18060#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} main_~i~4#1 := 0bv32; {18067#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:29,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {18067#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} assume !!~bvslt32(main_~i~4#1, main_~argc~0#1);call main_#t~malloc124#1.base, main_#t~malloc124#1.offset := #Ultimate.allocOnHeap(11bv64); {18071#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (not (= |ULTIMATE.start_main_~mem_track~0#1.base| |ULTIMATE.start_main_#t~malloc124#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:29,486 INFO L290 TraceCheckUtils]: 57: Hoare triple {18071#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (not (= |ULTIMATE.start_main_~mem_track~0#1.base| |ULTIMATE.start_main_#t~malloc124#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} SUMMARY for call write~$Pointer$(main_#t~malloc124#1.base, main_#t~malloc124#1.offset, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))), 8bv64); srcloc: L1608 {18075#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:29,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {18075#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} havoc main_#t~malloc124#1.base, main_#t~malloc124#1.offset; {18075#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:29,491 INFO L290 TraceCheckUtils]: 59: Hoare triple {18075#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} SUMMARY for call main_#t~mem125#1.base, main_#t~mem125#1.offset := read~$Pointer$(main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))), 8bv64); srcloc: L1609 {18075#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:29,492 INFO L290 TraceCheckUtils]: 60: Hoare triple {18075#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(main_~mem_track~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1)))), #length[main_~mem_track~0#1.base]) && ~bvule64(~bvadd64(main_~mem_track~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))), ~bvadd64(8bv64, ~bvadd64(main_~mem_track~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1)))))) && ~bvule64(0bv64, ~bvadd64(main_~mem_track~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~4#1))))); {17894#false} is VALID [2022-02-21 02:50:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:29,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:29,493 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:29,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470186274] [2022-02-21 02:50:29,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470186274] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:29,493 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:29,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 02:50:29,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442895724] [2022-02-21 02:50:29,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:29,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 61 [2022-02-21 02:50:29,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:29,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-21 02:50:29,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:29,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 02:50:29,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 02:50:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-21 02:50:29,557 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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)