./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-1.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-1.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 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 02:49:12,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 02:49:12,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 02:49:12,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 02:49:12,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 02:49:12,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 02:49:12,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 02:49:12,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 02:49:12,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 02:49:12,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 02:49:12,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 02:49:12,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 02:49:12,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 02:49:12,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 02:49:12,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 02:49:12,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 02:49:12,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 02:49:12,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 02:49:12,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 02:49:12,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 02:49:12,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 02:49:12,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 02:49:12,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 02:49:12,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 02:49:12,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 02:49:12,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 02:49:12,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 02:49:12,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 02:49:12,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 02:49:12,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 02:49:12,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 02:49:12,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 02:49:12,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 02:49:12,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 02:49:12,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 02:49:12,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 02:49:12,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 02:49:12,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 02:49:12,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 02:49:12,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 02:49:12,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 02:49:12,490 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:12,518 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 02:49:12,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 02:49:12,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 02:49:12,519 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 02:49:12,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 02:49:12,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 02:49:12,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 02:49:12,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 02:49:12,521 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 02:49:12,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 02:49:12,522 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 02:49:12,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 02:49:12,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 02:49:12,522 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 02:49:12,523 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 02:49:12,523 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 02:49:12,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 02:49:12,523 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 02:49:12,523 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 02:49:12,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 02:49:12,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 02:49:12,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 02:49:12,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 02:49:12,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 02:49:12,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 02:49:12,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 02:49:12,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 02:49:12,525 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 -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2022-02-21 02:49:12,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 02:49:12,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 02:49:12,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 02:49:12,803 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 02:49:12,804 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 02:49:12,805 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-02-21 02:49:12,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60c5014f/b5c71544d9ec4a3e97b079ef30b3b84e/FLAG562e2cf44 [2022-02-21 02:49:13,404 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 02:49:13,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-02-21 02:49:13,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60c5014f/b5c71544d9ec4a3e97b079ef30b3b84e/FLAG562e2cf44 [2022-02-21 02:49:13,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60c5014f/b5c71544d9ec4a3e97b079ef30b3b84e [2022-02-21 02:49:13,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 02:49:13,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 02:49:13,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:13,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 02:49:13,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 02:49:13,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:13" (1/1) ... [2022-02-21 02:49:13,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d4caa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:13, skipping insertion in model container [2022-02-21 02:49:13,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:13" (1/1) ... [2022-02-21 02:49:13,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 02:49:13,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 02:49:14,209 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-1.i[58057,58070] [2022-02-21 02:49:14,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:14,291 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:14,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@27a884db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:14, skipping insertion in model container [2022-02-21 02:49:14,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:14,292 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-21 02:49:14,295 INFO L158 Benchmark]: Toolchain (without parser) took 633.83ms. Allocated memory is still 86.0MB. Free memory was 61.8MB in the beginning and 48.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 02:49:14,296 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 86.0MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 02:49:14,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.55ms. Allocated memory is still 86.0MB. Free memory was 61.5MB in the beginning and 48.7MB in the end (delta: 12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 02:49:14,298 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.37ms. Allocated memory is still 86.0MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.55ms. Allocated memory is still 86.0MB. Free memory was 61.5MB in the beginning and 48.7MB in the end (delta: 12.9MB). 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-1.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 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 02:49:16,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 02:49:16,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 02:49:16,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 02:49:16,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 02:49:16,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 02:49:16,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 02:49:16,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 02:49:16,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 02:49:16,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 02:49:16,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 02:49:16,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 02:49:16,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 02:49:16,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 02:49:16,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 02:49:16,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 02:49:16,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 02:49:16,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 02:49:16,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 02:49:16,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 02:49:16,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 02:49:16,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 02:49:16,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 02:49:16,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 02:49:16,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 02:49:16,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 02:49:16,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 02:49:16,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 02:49:16,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 02:49:16,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 02:49:16,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 02:49:16,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 02:49:16,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 02:49:16,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 02:49:16,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 02:49:16,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 02:49:16,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 02:49:16,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 02:49:16,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 02:49:16,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 02:49:16,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 02:49:16,133 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:16,167 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 02:49:16,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 02:49:16,168 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 02:49:16,169 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 02:49:16,169 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 02:49:16,169 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 02:49:16,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 02:49:16,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 02:49:16,171 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 02:49:16,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 02:49:16,172 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 02:49:16,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 02:49:16,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 02:49:16,173 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 02:49:16,173 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 02:49:16,173 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 02:49:16,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 02:49:16,173 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 02:49:16,173 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-21 02:49:16,174 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-21 02:49:16,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 02:49:16,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 02:49:16,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 02:49:16,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 02:49:16,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 02:49:16,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 02:49:16,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 02:49:16,175 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-21 02:49:16,175 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-21 02:49:16,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-21 02:49:16,176 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 -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2022-02-21 02:49:16,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 02:49:16,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 02:49:16,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 02:49:16,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 02:49:16,518 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 02:49:16,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-02-21 02:49:16,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5a4f4d0/e4efb68885f34d148ff01ce18b71f98f/FLAG9e1fb236a [2022-02-21 02:49:17,091 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 02:49:17,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-02-21 02:49:17,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5a4f4d0/e4efb68885f34d148ff01ce18b71f98f/FLAG9e1fb236a [2022-02-21 02:49:17,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5a4f4d0/e4efb68885f34d148ff01ce18b71f98f [2022-02-21 02:49:17,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 02:49:17,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 02:49:17,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:17,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 02:49:17,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 02:49:17,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:17" (1/1) ... [2022-02-21 02:49:17,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@323cbabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:17, skipping insertion in model container [2022-02-21 02:49:17,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:17" (1/1) ... [2022-02-21 02:49:17,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 02:49:17,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 02:49:17,956 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-1.i[58057,58070] [2022-02-21 02:49:18,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:18,055 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-21 02:49:18,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 02:49:18,135 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-1.i[58057,58070] [2022-02-21 02:49:18,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:18,204 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 02:49:18,264 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-1.i[58057,58070] [2022-02-21 02:49:18,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:18,407 INFO L208 MainTranslator]: Completed translation [2022-02-21 02:49:18,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:18 WrapperNode [2022-02-21 02:49:18,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:18,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 02:49:18,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 02:49:18,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 02:49:18,416 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:18" (1/1) ... [2022-02-21 02:49:18,449 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:18" (1/1) ... [2022-02-21 02:49:18,492 INFO L137 Inliner]: procedures = 352, calls = 112, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 383 [2022-02-21 02:49:18,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 02:49:18,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 02:49:18,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 02:49:18,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 02:49:18,501 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:18" (1/1) ... [2022-02-21 02:49:18,502 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:18" (1/1) ... [2022-02-21 02:49:18,512 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:18" (1/1) ... [2022-02-21 02:49:18,522 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:18" (1/1) ... [2022-02-21 02:49:18,549 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:18" (1/1) ... [2022-02-21 02:49:18,575 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:18" (1/1) ... [2022-02-21 02:49:18,580 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:18" (1/1) ... [2022-02-21 02:49:18,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 02:49:18,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 02:49:18,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 02:49:18,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 02:49:18,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:18" (1/1) ... [2022-02-21 02:49:18,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 02:49:18,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 02:49:18,627 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:18,651 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:18,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-21 02:49:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-21 02:49:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-21 02:49:18,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-21 02:49:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 02:49:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-21 02:49:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 02:49:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-21 02:49:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 02:49:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2022-02-21 02:49:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 02:49:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 02:49:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 02:49:18,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 02:49:18,986 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 02:49:18,987 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 02:49:20,085 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 02:49:20,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 02:49:20,110 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-21 02:49:20,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 02:49:20 BoogieIcfgContainer [2022-02-21 02:49:20,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 02:49:20,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 02:49:20,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 02:49:20,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 02:49:20,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 02:49:17" (1/3) ... [2022-02-21 02:49:20,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 02:49:20, skipping insertion in model container [2022-02-21 02:49:20,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:18" (2/3) ... [2022-02-21 02:49:20,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 02:49:20, skipping insertion in model container [2022-02-21 02:49:20,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 02:49:20" (3/3) ... [2022-02-21 02:49:20,119 INFO L111 eAbstractionObserver]: Analyzing ICFG basename-1.i [2022-02-21 02:49:20,124 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 02:49:20,125 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-02-21 02:49:20,171 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 02:49:20,177 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:20,178 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-02-21 02:49:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 147 states have (on average 1.9319727891156462) internal successors, (284), 239 states have internal predecessors, (284), 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:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 02:49:20,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:20,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 02:49:20,213 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:49:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:20,219 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-21 02:49:20,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:20,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783167353] [2022-02-21 02:49:20,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:20,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:20,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:20,239 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:20,251 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:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:20,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 02:49:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:20,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:20,583 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:20,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {246#true} is VALID [2022-02-21 02:49:20,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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; {254#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:49:20,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~a~0#1.base]); {247#false} is VALID [2022-02-21 02:49:20,598 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:20,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:20,599 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:20,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783167353] [2022-02-21 02:49:20,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783167353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:20,600 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:20,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:49:20,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087402320] [2022-02-21 02:49:20,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:20,606 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:20,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:20,609 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:20,618 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:20,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:49:20,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:20,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:49:20,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:20,643 INFO L87 Difference]: Start difference. First operand has 243 states, 147 states have (on average 1.9319727891156462) internal successors, (284), 239 states have internal predecessors, (284), 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:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:21,923 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2022-02-21 02:49:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:49:21,924 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:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:21,925 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:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2022-02-21 02:49:21,936 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:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2022-02-21 02:49:21,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 299 transitions. [2022-02-21 02:49:22,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:22,356 INFO L225 Difference]: With dead ends: 251 [2022-02-21 02:49:22,356 INFO L226 Difference]: Without dead ends: 249 [2022-02-21 02:49:22,358 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:22,361 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 239 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:22,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 207 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 02:49:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-02-21 02:49:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2022-02-21 02:49:22,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:22,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 233 states, 142 states have (on average 1.8450704225352113) internal successors, (262), 229 states have internal predecessors, (262), 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:22,400 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 233 states, 142 states have (on average 1.8450704225352113) internal successors, (262), 229 states have internal predecessors, (262), 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:22,401 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 233 states, 142 states have (on average 1.8450704225352113) internal successors, (262), 229 states have internal predecessors, (262), 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:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:22,414 INFO L93 Difference]: Finished difference Result 249 states and 283 transitions. [2022-02-21 02:49:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 283 transitions. [2022-02-21 02:49:22,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:22,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:22,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 142 states have (on average 1.8450704225352113) internal successors, (262), 229 states have internal predecessors, (262), 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 249 states. [2022-02-21 02:49:22,417 INFO L87 Difference]: Start difference. First operand has 233 states, 142 states have (on average 1.8450704225352113) internal successors, (262), 229 states have internal predecessors, (262), 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 249 states. [2022-02-21 02:49:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:22,429 INFO L93 Difference]: Finished difference Result 249 states and 283 transitions. [2022-02-21 02:49:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 283 transitions. [2022-02-21 02:49:22,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:22,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:22,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:22,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 142 states have (on average 1.8450704225352113) internal successors, (262), 229 states have internal predecessors, (262), 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:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 266 transitions. [2022-02-21 02:49:22,444 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 266 transitions. Word has length 3 [2022-02-21 02:49:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:22,446 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 266 transitions. [2022-02-21 02:49:22,448 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:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 266 transitions. [2022-02-21 02:49:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 02:49:22,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:22,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 02:49:22,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-21 02:49:22,665 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:22,666 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:49:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:22,667 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 02:49:22,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:22,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067090255] [2022-02-21 02:49:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:22,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:22,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:22,669 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:22,671 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:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:22,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 02:49:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:22,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:22,822 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:22,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {1239#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {1239#true} is VALID [2022-02-21 02:49:22,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {1239#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; {1247#(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:22,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {1247#(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))); {1240#false} is VALID [2022-02-21 02:49:22,835 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:22,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:22,835 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:22,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067090255] [2022-02-21 02:49:22,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067090255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:22,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:22,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:49:22,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143794508] [2022-02-21 02:49:22,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:22,837 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:22,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:22,838 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:22,847 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:22,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:49:22,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:22,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:49:22,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:22,848 INFO L87 Difference]: Start difference. First operand 233 states and 266 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:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:24,527 INFO L93 Difference]: Finished difference Result 232 states and 265 transitions. [2022-02-21 02:49:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:49:24,527 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,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:24,527 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:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2022-02-21 02:49:24,541 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:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2022-02-21 02:49:24,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 266 transitions. [2022-02-21 02:49:24,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:24,864 INFO L225 Difference]: With dead ends: 232 [2022-02-21 02:49:24,864 INFO L226 Difference]: Without dead ends: 232 [2022-02-21 02:49:24,865 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:24,866 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 9 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:24,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 432 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 02:49:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-02-21 02:49:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-02-21 02:49:24,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:24,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 232 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 228 states have internal predecessors, (261), 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:24,876 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 232 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 228 states have internal predecessors, (261), 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:24,877 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 232 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 228 states have internal predecessors, (261), 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:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:24,889 INFO L93 Difference]: Finished difference Result 232 states and 265 transitions. [2022-02-21 02:49:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 265 transitions. [2022-02-21 02:49:24,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:24,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:24,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 228 states have internal predecessors, (261), 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 232 states. [2022-02-21 02:49:24,891 INFO L87 Difference]: Start difference. First operand has 232 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 228 states have internal predecessors, (261), 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 232 states. [2022-02-21 02:49:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:24,903 INFO L93 Difference]: Finished difference Result 232 states and 265 transitions. [2022-02-21 02:49:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 265 transitions. [2022-02-21 02:49:24,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:24,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:24,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:24,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 228 states have internal predecessors, (261), 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:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 265 transitions. [2022-02-21 02:49:24,914 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 265 transitions. Word has length 3 [2022-02-21 02:49:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:24,915 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 265 transitions. [2022-02-21 02:49:24,915 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:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 265 transitions. [2022-02-21 02:49:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 02:49:24,916 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:24,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 02:49:24,930 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:25,129 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:25,130 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:49:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-02-21 02:49:25,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:25,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28616603] [2022-02-21 02:49:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:25,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:25,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:25,133 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:25,135 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:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:25,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:49:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:25,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:25,281 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:25,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {2178#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {2178#true} is VALID [2022-02-21 02:49:25,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {2178#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; {2186#(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:25,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {2186#(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 {2186#(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:25,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {2186#(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; {2193#(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:25,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {2193#(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); {2193#(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:25,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {2193#(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)))); {2179#false} is VALID [2022-02-21 02:49:25,358 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:25,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:25,358 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:25,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28616603] [2022-02-21 02:49:25,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28616603] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:25,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:25,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 02:49:25,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125715897] [2022-02-21 02:49:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:25,359 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:25,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:25,359 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:25,374 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:25,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 02:49:25,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:25,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 02:49:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:49:25,375 INFO L87 Difference]: Start difference. First operand 232 states and 265 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:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:27,937 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-02-21 02:49:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 02:49:27,937 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:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:27,938 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:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-02-21 02:49:27,942 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:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-02-21 02:49:27,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 271 transitions. [2022-02-21 02:49:28,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:28,256 INFO L225 Difference]: With dead ends: 236 [2022-02-21 02:49:28,256 INFO L226 Difference]: Without dead ends: 236 [2022-02-21 02:49:28,256 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:28,258 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 11 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:28,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 603 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-21 02:49:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-02-21 02:49:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2022-02-21 02:49:28,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:28,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 234 states, 144 states have (on average 1.8263888888888888) 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,267 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 234 states, 144 states have (on average 1.8263888888888888) 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,267 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 234 states, 144 states have (on average 1.8263888888888888) 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,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:28,274 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-02-21 02:49:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 269 transitions. [2022-02-21 02:49:28,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:28,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:28,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 144 states have (on average 1.8263888888888888) 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 236 states. [2022-02-21 02:49:28,276 INFO L87 Difference]: Start difference. First operand has 234 states, 144 states have (on average 1.8263888888888888) 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 236 states. [2022-02-21 02:49:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:28,283 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-02-21 02:49:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 269 transitions. [2022-02-21 02:49:28,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:28,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:28,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:28,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 144 states have (on average 1.8263888888888888) 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,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2022-02-21 02:49:28,291 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 6 [2022-02-21 02:49:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:28,291 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2022-02-21 02:49:28,291 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:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2022-02-21 02:49:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 02:49:28,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:28,292 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:28,307 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:28,503 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:28,504 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:49:28,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:28,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2022-02-21 02:49:28,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:28,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68794201] [2022-02-21 02:49:28,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:28,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:28,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:28,507 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:28,509 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:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:28,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 02:49:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:28,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:28,665 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,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {3141#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {3141#true} is VALID [2022-02-21 02:49:28,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {3141#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; {3149#(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,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {3149#(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 {3149#(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,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {3149#(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; {3156#(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,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {3156#(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); {3156#(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,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {3156#(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 {3156#(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,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {3156#(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; {3156#(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,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {3156#(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; {3169#(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:28,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {3169#(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); {3169#(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:28,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {3169#(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)))); {3142#false} is VALID [2022-02-21 02:49:28,860 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:28,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 02:49:29,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {3176#(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)))); {3142#false} is VALID [2022-02-21 02:49:29,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {3176#(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); {3176#(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:29,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {3183#(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; {3176#(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:29,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {3183#(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; {3183#(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:29,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {3183#(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 {3183#(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:29,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {3183#(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); {3183#(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:29,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {3196#(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; {3183#(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:29,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {3196#(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 {3196#(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:29,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {3141#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; {3196#(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:29,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {3141#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {3141#true} is VALID [2022-02-21 02:49:29,768 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:29,768 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:29,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68794201] [2022-02-21 02:49:29,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68794201] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 02:49:29,769 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 02:49:29,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-21 02:49:29,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007345081] [2022-02-21 02:49:29,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 02:49:29,769 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:29,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:29,770 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:29,821 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:29,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 02:49:29,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:29,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 02:49:29,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 02:49:29,822 INFO L87 Difference]: Start difference. First operand 234 states and 267 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,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:44,263 INFO L93 Difference]: Finished difference Result 240 states and 273 transitions. [2022-02-21 02:49:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 02:49:44,263 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,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:44,263 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:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 277 transitions. [2022-02-21 02:49:44,267 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:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 277 transitions. [2022-02-21 02:49:44,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 277 transitions. [2022-02-21 02:49:44,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:44,585 INFO L225 Difference]: With dead ends: 240 [2022-02-21 02:49:44,585 INFO L226 Difference]: Without dead ends: 240 [2022-02-21 02:49:44,586 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:44,588 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 19 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:44,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1120 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-02-21 02:49:44,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-02-21 02:49:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-02-21 02:49:44,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:44,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 240 states, 151 states have (on average 1.781456953642384) internal successors, (269), 236 states have internal predecessors, (269), 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:44,600 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 240 states, 151 states have (on average 1.781456953642384) internal successors, (269), 236 states have internal predecessors, (269), 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:44,600 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 240 states, 151 states have (on average 1.781456953642384) internal successors, (269), 236 states have internal predecessors, (269), 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:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:44,606 INFO L93 Difference]: Finished difference Result 240 states and 273 transitions. [2022-02-21 02:49:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2022-02-21 02:49:44,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:44,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:44,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 151 states have (on average 1.781456953642384) internal successors, (269), 236 states have internal predecessors, (269), 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 240 states. [2022-02-21 02:49:44,608 INFO L87 Difference]: Start difference. First operand has 240 states, 151 states have (on average 1.781456953642384) internal successors, (269), 236 states have internal predecessors, (269), 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 240 states. [2022-02-21 02:49:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:44,615 INFO L93 Difference]: Finished difference Result 240 states and 273 transitions. [2022-02-21 02:49:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2022-02-21 02:49:44,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:44,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:44,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:44,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 151 states have (on average 1.781456953642384) internal successors, (269), 236 states have internal predecessors, (269), 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:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 273 transitions. [2022-02-21 02:49:44,623 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 273 transitions. Word has length 10 [2022-02-21 02:49:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:44,623 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 273 transitions. [2022-02-21 02:49:44,623 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:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2022-02-21 02:49:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 02:49:44,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:44,629 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:44,643 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:44,842 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:44,843 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:49:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -955562967, now seen corresponding path program 1 times [2022-02-21 02:49:44,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:44,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209271302] [2022-02-21 02:49:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:44,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:44,845 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:44,846 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:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:44,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:49:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:45,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:45,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {4169#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {4169#true} is VALID [2022-02-21 02:49:45,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {4169#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; {4169#true} is VALID [2022-02-21 02:49:45,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {4169#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {4169#true} is VALID [2022-02-21 02:49:45,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {4169#true} main_~i~3#1 := 0bv32; {4183#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:45,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {4183#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4183#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:45,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {4183#(= |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 {4183#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:45,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {4183#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} havoc main_#t~nondet118#1; {4183#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:45,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {4183#(= |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; {4196#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:45,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {4196#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4196#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:45,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {4196#(= (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 {4196#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:45,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {4196#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} havoc main_#t~nondet118#1; {4196#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:45,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {4196#(= (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; {4209#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:45,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {4209#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4209#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:45,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {4209#(= |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 {4209#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:45,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {4209#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} havoc main_#t~nondet118#1; {4209#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:45,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {4209#(= |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; {4222#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv2 32))} is VALID [2022-02-21 02:49:45,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {4222#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv2 32))} assume !~bvslt32(main_~i~3#1, 10bv32); {4170#false} is VALID [2022-02-21 02:49:45,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {4170#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet119#1;havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {4170#false} is VALID [2022-02-21 02:49:45,136 INFO L272 TraceCheckUtils]: 18: Hoare triple {4170#false} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {4170#false} is VALID [2022-02-21 02:49:45,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {4170#false} ~cond := #in~cond; {4170#false} is VALID [2022-02-21 02:49:45,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {4170#false} assume !(0bv32 == ~cond); {4170#false} is VALID [2022-02-21 02:49:45,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {4170#false} assume true; {4170#false} is VALID [2022-02-21 02:49:45,137 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4170#false} {4170#false} #476#return; {4170#false} is VALID [2022-02-21 02:49:45,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {4170#false} 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; {4170#false} is VALID [2022-02-21 02:49:45,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {4170#false} assume !(1bv1 == #valid[main_~argv~0#1.base]); {4170#false} is VALID [2022-02-21 02:49:45,138 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,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 02:49:45,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {4170#false} assume !(1bv1 == #valid[main_~argv~0#1.base]); {4170#false} is VALID [2022-02-21 02:49:45,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {4170#false} 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; {4170#false} is VALID [2022-02-21 02:49:45,258 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4169#true} {4170#false} #476#return; {4170#false} is VALID [2022-02-21 02:49:45,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {4169#true} assume true; {4169#true} is VALID [2022-02-21 02:49:45,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {4169#true} assume !(0bv32 == ~cond); {4169#true} is VALID [2022-02-21 02:49:45,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {4169#true} ~cond := #in~cond; {4169#true} is VALID [2022-02-21 02:49:45,258 INFO L272 TraceCheckUtils]: 18: Hoare triple {4170#false} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {4169#true} is VALID [2022-02-21 02:49:45,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {4170#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet119#1;havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {4170#false} is VALID [2022-02-21 02:49:45,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {4274#(bvslt |ULTIMATE.start_main_~i~3#1| (_ bv10 32))} assume !~bvslt32(main_~i~3#1, 10bv32); {4170#false} is VALID [2022-02-21 02:49:45,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {4278#(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; {4274#(bvslt |ULTIMATE.start_main_~i~3#1| (_ bv10 32))} is VALID [2022-02-21 02:49:45,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {4278#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {4278#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {4278#(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 {4278#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {4278#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4278#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {4291#(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; {4278#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {4291#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {4291#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {4291#(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 {4291#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {4291#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4291#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {4304#(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; {4291#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {4304#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {4304#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {4304#(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 {4304#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {4304#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {4304#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {4169#true} main_~i~3#1 := 0bv32; {4304#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:45,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {4169#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {4169#true} is VALID [2022-02-21 02:49:45,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {4169#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; {4169#true} is VALID [2022-02-21 02:49:45,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {4169#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {4169#true} is VALID [2022-02-21 02:49:45,271 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,271 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:45,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209271302] [2022-02-21 02:49:45,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209271302] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 02:49:45,271 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 02:49:45,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-21 02:49:45,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139847379] [2022-02-21 02:49:45,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 02:49:45,272 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-21 02:49:45,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:45,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:45,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:45,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 02:49:45,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:45,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 02:49:45,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-21 02:49:45,323 INFO L87 Difference]: Start difference. First operand 240 states and 273 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:48,508 INFO L93 Difference]: Finished difference Result 260 states and 293 transitions. [2022-02-21 02:49:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 02:49:48,509 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-21 02:49:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 298 transitions. [2022-02-21 02:49:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 298 transitions. [2022-02-21 02:49:48,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 298 transitions. [2022-02-21 02:49:48,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:48,842 INFO L225 Difference]: With dead ends: 260 [2022-02-21 02:49:48,842 INFO L226 Difference]: Without dead ends: 260 [2022-02-21 02:49:48,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 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:48,845 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 27 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:48,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1564 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 02:49:48,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-02-21 02:49:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2022-02-21 02:49:48,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:48,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 260 states, 171 states have (on average 1.6900584795321638) internal successors, (289), 256 states have internal predecessors, (289), 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:48,862 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 260 states, 171 states have (on average 1.6900584795321638) internal successors, (289), 256 states have internal predecessors, (289), 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:48,862 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 260 states, 171 states have (on average 1.6900584795321638) internal successors, (289), 256 states have internal predecessors, (289), 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:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:48,868 INFO L93 Difference]: Finished difference Result 260 states and 293 transitions. [2022-02-21 02:49:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 293 transitions. [2022-02-21 02:49:48,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:48,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:48,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 171 states have (on average 1.6900584795321638) internal successors, (289), 256 states have internal predecessors, (289), 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 260 states. [2022-02-21 02:49:48,871 INFO L87 Difference]: Start difference. First operand has 260 states, 171 states have (on average 1.6900584795321638) internal successors, (289), 256 states have internal predecessors, (289), 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 260 states. [2022-02-21 02:49:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:48,876 INFO L93 Difference]: Finished difference Result 260 states and 293 transitions. [2022-02-21 02:49:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 293 transitions. [2022-02-21 02:49:48,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:48,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:48,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:48,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 171 states have (on average 1.6900584795321638) internal successors, (289), 256 states have internal predecessors, (289), 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:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 293 transitions. [2022-02-21 02:49:48,883 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 293 transitions. Word has length 25 [2022-02-21 02:49:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:48,883 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 293 transitions. [2022-02-21 02:49:48,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 293 transitions. [2022-02-21 02:49:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 02:49:48,884 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:48,884 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:48,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-21 02:49:49,097 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,098 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:49:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash -167681350, now seen corresponding path program 2 times [2022-02-21 02:49:49,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:49,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726470624] [2022-02-21 02:49:49,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 02:49:49,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:49,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:49,101 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,103 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,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 02:49:49,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 02:49:49,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:49:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:49,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:49,428 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-21 02:49:49,430 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:49:49,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {5371#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {5371#true} is VALID [2022-02-21 02:49:49,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {5371#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; {5371#true} is VALID [2022-02-21 02:49:49,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {5371#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {5371#true} is VALID [2022-02-21 02:49:49,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {5371#true} main_~i~3#1 := 0bv32; {5371#true} is VALID [2022-02-21 02:49:49,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {5371#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {5371#true} is VALID [2022-02-21 02:49:49,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {5371#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 {5371#true} is VALID [2022-02-21 02:49:49,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {5371#true} havoc main_#t~nondet118#1; {5371#true} is VALID [2022-02-21 02:49:49,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {5371#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; {5371#true} is VALID [2022-02-21 02:49:49,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {5371#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {5371#true} is VALID [2022-02-21 02:49:49,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {5371#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 {5371#true} is VALID [2022-02-21 02:49:49,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {5371#true} havoc main_#t~nondet118#1; {5371#true} is VALID [2022-02-21 02:49:49,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {5371#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; {5371#true} is VALID [2022-02-21 02:49:49,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {5371#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {5371#true} is VALID [2022-02-21 02:49:49,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {5371#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 {5371#true} is VALID [2022-02-21 02:49:49,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {5371#true} havoc main_#t~nondet118#1; {5371#true} is VALID [2022-02-21 02:49:49,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {5371#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; {5371#true} is VALID [2022-02-21 02:49:49,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {5371#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {5371#true} is VALID [2022-02-21 02:49:49,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {5371#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 {5371#true} is VALID [2022-02-21 02:49:49,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {5371#true} havoc main_#t~nondet118#1; {5371#true} is VALID [2022-02-21 02:49:49,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {5371#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; {5371#true} is VALID [2022-02-21 02:49:49,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {5371#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {5371#true} is VALID [2022-02-21 02:49:49,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {5371#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 {5371#true} is VALID [2022-02-21 02:49:49,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {5371#true} havoc main_#t~nondet118#1; {5371#true} is VALID [2022-02-21 02:49:49,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {5371#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; {5371#true} is VALID [2022-02-21 02:49:49,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {5371#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {5371#true} is VALID [2022-02-21 02:49:49,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {5371#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 {5371#true} is VALID [2022-02-21 02:49:49,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {5371#true} havoc main_#t~nondet118#1; {5371#true} is VALID [2022-02-21 02:49:49,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {5371#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; {5371#true} is VALID [2022-02-21 02:49:49,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {5371#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {5371#true} is VALID [2022-02-21 02:49:49,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {5371#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 {5371#true} is VALID [2022-02-21 02:49:49,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {5371#true} havoc main_#t~nondet118#1; {5371#true} is VALID [2022-02-21 02:49:49,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {5371#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; {5371#true} is VALID [2022-02-21 02:49:49,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {5371#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {5371#true} is VALID [2022-02-21 02:49:49,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {5371#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 {5371#true} is VALID [2022-02-21 02:49:49,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {5371#true} havoc main_#t~nondet118#1; {5371#true} is VALID [2022-02-21 02:49:49,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {5371#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; {5371#true} is VALID [2022-02-21 02:49:49,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {5371#true} assume !~bvslt32(main_~i~3#1, 10bv32); {5371#true} is VALID [2022-02-21 02:49:49,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {5371#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet119#1;havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {5371#true} is VALID [2022-02-21 02:49:49,477 INFO L272 TraceCheckUtils]: 38: Hoare triple {5371#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {5371#true} is VALID [2022-02-21 02:49:49,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {5371#true} ~cond := #in~cond; {5371#true} is VALID [2022-02-21 02:49:49,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {5371#true} assume !(0bv32 == ~cond); {5371#true} is VALID [2022-02-21 02:49:49,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {5371#true} assume true; {5371#true} is VALID [2022-02-21 02:49:49,477 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5371#true} {5371#true} #476#return; {5371#true} is VALID [2022-02-21 02:49:49,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {5371#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; {5505#(= (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|))) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-21 02:49:49,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {5505#(= (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|))) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[main_~argv~0#1.base]); {5372#false} is VALID [2022-02-21 02:49:49,486 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,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:49,487 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:49,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726470624] [2022-02-21 02:49:49,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726470624] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:49,489 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:49,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:49:49,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097756370] [2022-02-21 02:49:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:49,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 45 [2022-02-21 02:49:49,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:49,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:49:49,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:49,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:49:49,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:49,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:49:49,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:49,518 INFO L87 Difference]: Start difference. First operand 260 states and 293 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:49:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:50,530 INFO L93 Difference]: Finished difference Result 271 states and 305 transitions. [2022-02-21 02:49:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:49:50,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 45 [2022-02-21 02:49:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:49:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2022-02-21 02:49:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:49:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2022-02-21 02:49:50,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 281 transitions. [2022-02-21 02:49:50,863 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:49:50,868 INFO L225 Difference]: With dead ends: 271 [2022-02-21 02:49:50,868 INFO L226 Difference]: Without dead ends: 271 [2022-02-21 02:49:50,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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:50,870 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 224 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:50,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 210 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 02:49:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-02-21 02:49:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2022-02-21 02:49:50,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:50,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 255 states, 171 states have (on average 1.6608187134502923) internal successors, (284), 251 states have internal predecessors, (284), 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:50,877 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 255 states, 171 states have (on average 1.6608187134502923) internal successors, (284), 251 states have internal predecessors, (284), 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:50,878 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 255 states, 171 states have (on average 1.6608187134502923) internal successors, (284), 251 states have internal predecessors, (284), 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:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:50,883 INFO L93 Difference]: Finished difference Result 271 states and 305 transitions. [2022-02-21 02:49:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2022-02-21 02:49:50,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:50,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:50,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 171 states have (on average 1.6608187134502923) internal successors, (284), 251 states have internal predecessors, (284), 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 271 states. [2022-02-21 02:49:50,885 INFO L87 Difference]: Start difference. First operand has 255 states, 171 states have (on average 1.6608187134502923) internal successors, (284), 251 states have internal predecessors, (284), 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 271 states. [2022-02-21 02:49:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:50,891 INFO L93 Difference]: Finished difference Result 271 states and 305 transitions. [2022-02-21 02:49:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2022-02-21 02:49:50,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:50,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:50,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:50,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 171 states have (on average 1.6608187134502923) internal successors, (284), 251 states have internal predecessors, (284), 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:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2022-02-21 02:49:50,899 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 45 [2022-02-21 02:49:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:50,902 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2022-02-21 02:49:50,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:49:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2022-02-21 02:49:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 02:49:50,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:50,905 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:50,923 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,118 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,118 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:49:51,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:51,118 INFO L85 PathProgramCache]: Analyzing trace with hash -167681349, now seen corresponding path program 1 times [2022-02-21 02:49:51,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:51,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398413395] [2022-02-21 02:49:51,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:51,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:51,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:51,120 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,121 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,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:51,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 02:49:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:51,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:51,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {6576#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {6576#true} is VALID [2022-02-21 02:49:51,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {6576#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; {6576#true} is VALID [2022-02-21 02:49:51,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {6576#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {6576#true} is VALID [2022-02-21 02:49:51,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {6576#true} main_~i~3#1 := 0bv32; {6590#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:51,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {6590#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6590#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:51,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {6590#(= |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 {6590#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:51,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {6590#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} havoc main_#t~nondet118#1; {6590#(= |ULTIMATE.start_main_~i~3#1| (_ bv0 32))} is VALID [2022-02-21 02:49:51,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {6590#(= |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; {6603#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:51,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {6603#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6603#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:51,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {6603#(= (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 {6603#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:51,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {6603#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} havoc main_#t~nondet118#1; {6603#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|) (_ bv0 32))} is VALID [2022-02-21 02:49:51,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {6603#(= (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; {6616#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:51,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {6616#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6616#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:51,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {6616#(= |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 {6616#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:51,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {6616#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} havoc main_#t~nondet118#1; {6616#(= |ULTIMATE.start_main_~i~3#1| (_ bv2 32))} is VALID [2022-02-21 02:49:51,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {6616#(= |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; {6629#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} is VALID [2022-02-21 02:49:51,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {6629#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6629#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} is VALID [2022-02-21 02:49:51,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {6629#(= |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 {6629#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} is VALID [2022-02-21 02:49:51,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {6629#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} havoc main_#t~nondet118#1; {6629#(= |ULTIMATE.start_main_~i~3#1| (_ bv3 32))} is VALID [2022-02-21 02:49:51,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {6629#(= |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; {6642#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} is VALID [2022-02-21 02:49:51,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {6642#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} assume !!~bvslt32(main_~i~3#1, 10bv32); {6642#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} is VALID [2022-02-21 02:49:51,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {6642#(= (_ 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 {6642#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} is VALID [2022-02-21 02:49:51,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {6642#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} havoc main_#t~nondet118#1; {6642#(= (_ bv4 32) |ULTIMATE.start_main_~i~3#1|)} is VALID [2022-02-21 02:49:51,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {6642#(= (_ 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; {6655#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} is VALID [2022-02-21 02:49:51,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {6655#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6655#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} is VALID [2022-02-21 02:49:51,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {6655#(= (_ 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 {6655#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} is VALID [2022-02-21 02:49:51,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {6655#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} havoc main_#t~nondet118#1; {6655#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~3#1|))} is VALID [2022-02-21 02:49:51,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {6655#(= (_ 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; {6668#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} is VALID [2022-02-21 02:49:51,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {6668#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6668#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} is VALID [2022-02-21 02:49:51,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {6668#(= |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 {6668#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} is VALID [2022-02-21 02:49:51,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {6668#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} havoc main_#t~nondet118#1; {6668#(= |ULTIMATE.start_main_~i~3#1| (_ bv6 32))} is VALID [2022-02-21 02:49:51,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {6668#(= |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; {6681#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} is VALID [2022-02-21 02:49:51,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {6681#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6681#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} is VALID [2022-02-21 02:49:51,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {6681#(= |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 {6681#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} is VALID [2022-02-21 02:49:51,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {6681#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} havoc main_#t~nondet118#1; {6681#(= |ULTIMATE.start_main_~i~3#1| (_ bv7 32))} is VALID [2022-02-21 02:49:51,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {6681#(= |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; {6694#(= |ULTIMATE.start_main_~i~3#1| (_ bv8 32))} is VALID [2022-02-21 02:49:51,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {6694#(= |ULTIMATE.start_main_~i~3#1| (_ bv8 32))} assume !~bvslt32(main_~i~3#1, 10bv32); {6577#false} is VALID [2022-02-21 02:49:51,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {6577#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet119#1;havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {6577#false} is VALID [2022-02-21 02:49:51,518 INFO L272 TraceCheckUtils]: 38: Hoare triple {6577#false} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {6577#false} is VALID [2022-02-21 02:49:51,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {6577#false} ~cond := #in~cond; {6577#false} is VALID [2022-02-21 02:49:51,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {6577#false} assume !(0bv32 == ~cond); {6577#false} is VALID [2022-02-21 02:49:51,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {6577#false} assume true; {6577#false} is VALID [2022-02-21 02:49:51,518 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6577#false} {6577#false} #476#return; {6577#false} is VALID [2022-02-21 02:49:51,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {6577#false} 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; {6577#false} is VALID [2022-02-21 02:49:51,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {6577#false} 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))))); {6577#false} is VALID [2022-02-21 02:49:51,519 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:51,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 02:49:51,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {6577#false} 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))))); {6577#false} is VALID [2022-02-21 02:49:51,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {6577#false} 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; {6577#false} is VALID [2022-02-21 02:49:51,791 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6576#true} {6577#false} #476#return; {6577#false} is VALID [2022-02-21 02:49:51,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {6576#true} assume true; {6576#true} is VALID [2022-02-21 02:49:51,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {6576#true} assume !(0bv32 == ~cond); {6576#true} is VALID [2022-02-21 02:49:51,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {6576#true} ~cond := #in~cond; {6576#true} is VALID [2022-02-21 02:49:51,791 INFO L272 TraceCheckUtils]: 38: Hoare triple {6577#false} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {6576#true} is VALID [2022-02-21 02:49:51,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {6577#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet119#1;havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {6577#false} is VALID [2022-02-21 02:49:51,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {6746#(bvslt |ULTIMATE.start_main_~i~3#1| (_ bv10 32))} assume !~bvslt32(main_~i~3#1, 10bv32); {6577#false} is VALID [2022-02-21 02:49:51,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {6750#(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; {6746#(bvslt |ULTIMATE.start_main_~i~3#1| (_ bv10 32))} is VALID [2022-02-21 02:49:51,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {6750#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6750#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {6750#(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 {6750#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {6750#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6750#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {6763#(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; {6750#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {6763#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6763#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {6763#(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 {6763#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {6763#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6763#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {6776#(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; {6763#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {6776#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6776#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {6776#(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 {6776#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {6776#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6776#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {6789#(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; {6776#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {6789#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} havoc main_#t~nondet118#1; {6789#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:51,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {6789#(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 {6789#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:51,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {6789#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6789#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:51,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {6802#(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; {6789#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~3#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:51,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {6802#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6802#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {6802#(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 {6802#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {6802#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6802#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {6815#(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; {6802#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {6815#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6815#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {6815#(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 {6815#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {6815#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6815#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {6828#(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; {6815#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {6828#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6828#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {6828#(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 {6828#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {6828#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6828#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {6841#(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; {6828#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {6841#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} havoc main_#t~nondet118#1; {6841#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {6841#(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 {6841#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,836 INFO L290 TraceCheckUtils]: 4: Hoare triple {6841#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~3#1, 10bv32); {6841#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {6576#true} main_~i~3#1 := 0bv32; {6841#(bvslt (bvadd |ULTIMATE.start_main_~i~3#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {6576#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {6576#true} is VALID [2022-02-21 02:49:51,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {6576#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; {6576#true} is VALID [2022-02-21 02:49:51,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {6576#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {6576#true} is VALID [2022-02-21 02:49:51,837 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:51,838 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:51,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398413395] [2022-02-21 02:49:51,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398413395] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 02:49:51,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 02:49:51,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-02-21 02:49:51,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143591955] [2022-02-21 02:49:51,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 02:49:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-02-21 02:49:51,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:51,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:51,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:51,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-21 02:49:51,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:51,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 02:49:51,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-02-21 02:49:51,971 INFO L87 Difference]: Start difference. First operand 255 states and 288 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:58,798 INFO L93 Difference]: Finished difference Result 263 states and 296 transitions. [2022-02-21 02:49:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 02:49:58,798 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-02-21 02:49:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 298 transitions. [2022-02-21 02:49:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 298 transitions. [2022-02-21 02:49:58,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 298 transitions. [2022-02-21 02:49:59,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:59,123 INFO L225 Difference]: With dead ends: 263 [2022-02-21 02:49:59,123 INFO L226 Difference]: Without dead ends: 263 [2022-02-21 02:49:59,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 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,124 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 30 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3110 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:59,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 3110 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-21 02:49:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-02-21 02:49:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-02-21 02:49:59,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:59,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 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:49:59,130 INFO L74 IsIncluded]: Start isIncluded. First operand 263 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:49:59,130 INFO L87 Difference]: Start difference. First operand 263 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:49:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:59,135 INFO L93 Difference]: Finished difference Result 263 states and 296 transitions. [2022-02-21 02:49:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2022-02-21 02:49:59,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:59,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:59,137 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 263 states. [2022-02-21 02:49:59,137 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 263 states. [2022-02-21 02:49:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:59,142 INFO L93 Difference]: Finished difference Result 263 states and 296 transitions. [2022-02-21 02:49:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2022-02-21 02:49:59,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:59,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:59,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:59,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:59,144 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:49:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 296 transitions. [2022-02-21 02:49:59,149 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 296 transitions. Word has length 45 [2022-02-21 02:49:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:59,149 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 296 transitions. [2022-02-21 02:49:59,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2022-02-21 02:49:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-21 02:49:59,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:59,150 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:59,167 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,365 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,365 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:49:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1953485173, now seen corresponding path program 2 times [2022-02-21 02:49:59,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:59,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950126586] [2022-02-21 02:49:59,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 02:49:59,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:59,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:59,368 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,369 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,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 02:49:59,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 02:49:59,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 02:49:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:59,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:59,735 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-02-21 02:49:59,735 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:49:59,837 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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {7914#true} is VALID [2022-02-21 02:49:59,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {7914#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {7914#true} is VALID [2022-02-21 02:49:59,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {7914#true} main_~i~3#1 := 0bv32; {7914#true} is VALID [2022-02-21 02:49:59,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {7914#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {7914#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 {7914#true} is VALID [2022-02-21 02:49:59,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {7914#true} havoc main_#t~nondet118#1; {7914#true} is VALID [2022-02-21 02:49:59,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {7914#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {7914#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 {7914#true} is VALID [2022-02-21 02:49:59,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {7914#true} havoc main_#t~nondet118#1; {7914#true} is VALID [2022-02-21 02:49:59,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {7914#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {7914#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 {7914#true} is VALID [2022-02-21 02:49:59,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {7914#true} havoc main_#t~nondet118#1; {7914#true} is VALID [2022-02-21 02:49:59,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {7914#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {7914#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 {7914#true} is VALID [2022-02-21 02:49:59,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {7914#true} havoc main_#t~nondet118#1; {7914#true} is VALID [2022-02-21 02:49:59,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {7914#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {7914#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 {7914#true} is VALID [2022-02-21 02:49:59,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {7914#true} havoc main_#t~nondet118#1; {7914#true} is VALID [2022-02-21 02:49:59,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {7914#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {7914#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 {7914#true} is VALID [2022-02-21 02:49:59,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {7914#true} havoc main_#t~nondet118#1; {7914#true} is VALID [2022-02-21 02:49:59,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {7914#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {7914#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 {7914#true} is VALID [2022-02-21 02:49:59,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {7914#true} havoc main_#t~nondet118#1; {7914#true} is VALID [2022-02-21 02:49:59,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {7914#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {7914#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 {7914#true} is VALID [2022-02-21 02:49:59,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {7914#true} havoc main_#t~nondet118#1; {7914#true} is VALID [2022-02-21 02:49:59,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {7914#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {7914#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 {7914#true} is VALID [2022-02-21 02:49:59,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {7914#true} havoc main_#t~nondet118#1; {7914#true} is VALID [2022-02-21 02:49:59,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,842 INFO L290 TraceCheckUtils]: 40: Hoare triple {7914#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {7914#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 {7914#true} is VALID [2022-02-21 02:49:59,843 INFO L290 TraceCheckUtils]: 42: Hoare triple {7914#true} havoc main_#t~nondet118#1; {7914#true} is VALID [2022-02-21 02:49:59,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {7914#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; {7914#true} is VALID [2022-02-21 02:49:59,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {7914#true} assume !~bvslt32(main_~i~3#1, 10bv32); {7914#true} is VALID [2022-02-21 02:49:59,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {7914#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet119#1;havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {7914#true} is VALID [2022-02-21 02:49:59,843 INFO L272 TraceCheckUtils]: 46: Hoare triple {7914#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {7914#true} is VALID [2022-02-21 02:49:59,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {7914#true} ~cond := #in~cond; {8060#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:49:59,845 INFO L290 TraceCheckUtils]: 48: Hoare triple {8060#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {8064#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:49:59,845 INFO L290 TraceCheckUtils]: 49: Hoare triple {8064#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {8064#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:49:59,847 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8064#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {7914#true} #476#return; {8071#(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:49:59,850 INFO L290 TraceCheckUtils]: 51: Hoare triple {8071#(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; {8075#(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:49:59,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {8075#(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))))); {7915#false} is VALID [2022-02-21 02:49:59,866 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:49:59,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:59,867 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:59,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950126586] [2022-02-21 02:49:59,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950126586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:59,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:59,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 02:49:59,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742530162] [2022-02-21 02:49:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:59,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 53 [2022-02-21 02:49:59,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:59,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:49:59,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:59,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 02:49:59,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:59,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 02:49:59,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 02:49:59,905 INFO L87 Difference]: Start difference. First operand 263 states and 296 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:04,733 INFO L93 Difference]: Finished difference Result 445 states and 509 transitions. [2022-02-21 02:50:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 02:50:04,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 53 [2022-02-21 02:50:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 474 transitions. [2022-02-21 02:50:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 474 transitions. [2022-02-21 02:50:04,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 474 transitions. [2022-02-21 02:50:05,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:05,553 INFO L225 Difference]: With dead ends: 445 [2022-02-21 02:50:05,554 INFO L226 Difference]: Without dead ends: 445 [2022-02-21 02:50:05,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 02:50:05,555 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 667 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:05,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 722 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-21 02:50:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-02-21 02:50:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 369. [2022-02-21 02:50:05,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:05,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 445 states. Second operand has 369 states, 285 states have (on average 1.7228070175438597) internal successors, (491), 364 states have internal predecessors, (491), 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:05,571 INFO L74 IsIncluded]: Start isIncluded. First operand 445 states. Second operand has 369 states, 285 states have (on average 1.7228070175438597) internal successors, (491), 364 states have internal predecessors, (491), 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:05,571 INFO L87 Difference]: Start difference. First operand 445 states. Second operand has 369 states, 285 states have (on average 1.7228070175438597) internal successors, (491), 364 states have internal predecessors, (491), 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:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:05,583 INFO L93 Difference]: Finished difference Result 445 states and 509 transitions. [2022-02-21 02:50:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 509 transitions. [2022-02-21 02:50:05,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:05,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:05,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 369 states, 285 states have (on average 1.7228070175438597) internal successors, (491), 364 states have internal predecessors, (491), 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 445 states. [2022-02-21 02:50:05,586 INFO L87 Difference]: Start difference. First operand has 369 states, 285 states have (on average 1.7228070175438597) internal successors, (491), 364 states have internal predecessors, (491), 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 445 states. [2022-02-21 02:50:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:05,598 INFO L93 Difference]: Finished difference Result 445 states and 509 transitions. [2022-02-21 02:50:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 509 transitions. [2022-02-21 02:50:05,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:05,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:05,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:05,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 285 states have (on average 1.7228070175438597) internal successors, (491), 364 states have internal predecessors, (491), 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:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 497 transitions. [2022-02-21 02:50:05,608 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 497 transitions. Word has length 53 [2022-02-21 02:50:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:05,608 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 497 transitions. [2022-02-21 02:50:05,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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,608 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 497 transitions. [2022-02-21 02:50:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 02:50:05,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:05,609 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] [2022-02-21 02:50:05,625 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:05,824 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:05,825 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:50:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash -530101490, now seen corresponding path program 1 times [2022-02-21 02:50:05,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:05,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700027475] [2022-02-21 02:50:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:05,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:05,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:05,829 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:05,831 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:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:06,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 02:50:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:06,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:06,403 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-02-21 02:50:06,403 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:06,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 02:50:06,763 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-21 02:50:06,763 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:06,779 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 02:50:06,779 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:06,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {9784#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {9784#true} is VALID [2022-02-21 02:50:06,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {9784#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {9784#true} is VALID [2022-02-21 02:50:06,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {9784#true} main_~i~3#1 := 0bv32; {9784#true} is VALID [2022-02-21 02:50:06,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {9784#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {9784#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 {9784#true} is VALID [2022-02-21 02:50:06,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {9784#true} havoc main_#t~nondet118#1; {9784#true} is VALID [2022-02-21 02:50:06,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {9784#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {9784#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 {9784#true} is VALID [2022-02-21 02:50:06,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {9784#true} havoc main_#t~nondet118#1; {9784#true} is VALID [2022-02-21 02:50:06,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {9784#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {9784#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 {9784#true} is VALID [2022-02-21 02:50:06,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {9784#true} havoc main_#t~nondet118#1; {9784#true} is VALID [2022-02-21 02:50:06,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {9784#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {9784#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 {9784#true} is VALID [2022-02-21 02:50:06,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {9784#true} havoc main_#t~nondet118#1; {9784#true} is VALID [2022-02-21 02:50:06,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {9784#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {9784#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 {9784#true} is VALID [2022-02-21 02:50:06,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {9784#true} havoc main_#t~nondet118#1; {9784#true} is VALID [2022-02-21 02:50:06,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {9784#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {9784#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 {9784#true} is VALID [2022-02-21 02:50:06,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {9784#true} havoc main_#t~nondet118#1; {9784#true} is VALID [2022-02-21 02:50:06,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {9784#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {9784#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 {9784#true} is VALID [2022-02-21 02:50:06,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {9784#true} havoc main_#t~nondet118#1; {9784#true} is VALID [2022-02-21 02:50:06,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {9784#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {9784#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 {9784#true} is VALID [2022-02-21 02:50:06,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {9784#true} havoc main_#t~nondet118#1; {9784#true} is VALID [2022-02-21 02:50:06,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {9784#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {9784#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 {9784#true} is VALID [2022-02-21 02:50:06,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {9784#true} havoc main_#t~nondet118#1; {9784#true} is VALID [2022-02-21 02:50:06,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {9784#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {9784#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 {9784#true} is VALID [2022-02-21 02:50:06,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {9784#true} havoc main_#t~nondet118#1; {9784#true} is VALID [2022-02-21 02:50:06,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {9784#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; {9784#true} is VALID [2022-02-21 02:50:06,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {9784#true} assume !~bvslt32(main_~i~3#1, 10bv32); {9784#true} is VALID [2022-02-21 02:50:06,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {9784#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet119#1;havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {9784#true} is VALID [2022-02-21 02:50:06,909 INFO L272 TraceCheckUtils]: 46: Hoare triple {9784#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {9784#true} is VALID [2022-02-21 02:50:06,911 INFO L290 TraceCheckUtils]: 47: Hoare triple {9784#true} ~cond := #in~cond; {9930#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:50:06,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {9930#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {9934#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:06,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {9934#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {9934#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:06,912 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9934#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {9784#true} #476#return; {9941#(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:07,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {9941#(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; {9945#(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:07,037 INFO L290 TraceCheckUtils]: 52: Hoare triple {9945#(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 {9949#(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:07,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {9949#(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; {9953#(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:07,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {9953#(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); {9957#(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:07,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {9957#(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))))); {9785#false} is VALID [2022-02-21 02:50:07,062 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:07,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:07,062 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:07,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700027475] [2022-02-21 02:50:07,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700027475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:07,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:07,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 02:50:07,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837397113] [2022-02-21 02:50:07,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:07,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 56 [2022-02-21 02:50:07,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:07,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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:07,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:07,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 02:50:07,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:07,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 02:50:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-21 02:50:07,180 INFO L87 Difference]: Start difference. First operand 369 states and 497 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:11,637 INFO L93 Difference]: Finished difference Result 370 states and 498 transitions. [2022-02-21 02:50:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 02:50:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 56 [2022-02-21 02:50:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 262 transitions. [2022-02-21 02:50:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 262 transitions. [2022-02-21 02:50:11,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 262 transitions. [2022-02-21 02:50:12,007 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:12,014 INFO L225 Difference]: With dead ends: 370 [2022-02-21 02:50:12,014 INFO L226 Difference]: Without dead ends: 370 [2022-02-21 02:50:12,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-21 02:50:12,017 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:12,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1448 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 219 Unchecked, 0.0s Time] [2022-02-21 02:50:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-02-21 02:50:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2022-02-21 02:50:12,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:12,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 370 states. Second operand has 370 states, 286 states have (on average 1.7202797202797202) internal successors, (492), 365 states have internal predecessors, (492), 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,026 INFO L74 IsIncluded]: Start isIncluded. First operand 370 states. Second operand has 370 states, 286 states have (on average 1.7202797202797202) internal successors, (492), 365 states have internal predecessors, (492), 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,026 INFO L87 Difference]: Start difference. First operand 370 states. Second operand has 370 states, 286 states have (on average 1.7202797202797202) internal successors, (492), 365 states have internal predecessors, (492), 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,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:12,034 INFO L93 Difference]: Finished difference Result 370 states and 498 transitions. [2022-02-21 02:50:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 498 transitions. [2022-02-21 02:50:12,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:12,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:12,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 370 states, 286 states have (on average 1.7202797202797202) internal successors, (492), 365 states have internal predecessors, (492), 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 370 states. [2022-02-21 02:50:12,036 INFO L87 Difference]: Start difference. First operand has 370 states, 286 states have (on average 1.7202797202797202) internal successors, (492), 365 states have internal predecessors, (492), 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 370 states. [2022-02-21 02:50:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:12,045 INFO L93 Difference]: Finished difference Result 370 states and 498 transitions. [2022-02-21 02:50:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 498 transitions. [2022-02-21 02:50:12,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:12,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:12,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:12,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 286 states have (on average 1.7202797202797202) internal successors, (492), 365 states have internal predecessors, (492), 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,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 498 transitions. [2022-02-21 02:50:12,054 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 498 transitions. Word has length 56 [2022-02-21 02:50:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:12,055 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 498 transitions. [2022-02-21 02:50:12,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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,055 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 498 transitions. [2022-02-21 02:50:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 02:50:12,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:12,057 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] [2022-02-21 02:50:12,076 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:12,272 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:12,273 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:50:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:12,273 INFO L85 PathProgramCache]: Analyzing trace with hash 746722395, now seen corresponding path program 1 times [2022-02-21 02:50:12,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:12,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852030308] [2022-02-21 02:50:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:12,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:12,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:12,275 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:12,276 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:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:12,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 02:50:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:12,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:12,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {11444#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {11444#true} is VALID [2022-02-21 02:50:12,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {11444#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {11444#true} is VALID [2022-02-21 02:50:12,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {11444#true} main_~i~3#1 := 0bv32; {11444#true} is VALID [2022-02-21 02:50:12,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {11444#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {11444#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 {11444#true} is VALID [2022-02-21 02:50:12,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {11444#true} havoc main_#t~nondet118#1; {11444#true} is VALID [2022-02-21 02:50:12,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {11444#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {11444#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 {11444#true} is VALID [2022-02-21 02:50:12,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {11444#true} havoc main_#t~nondet118#1; {11444#true} is VALID [2022-02-21 02:50:12,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {11444#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {11444#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 {11444#true} is VALID [2022-02-21 02:50:12,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {11444#true} havoc main_#t~nondet118#1; {11444#true} is VALID [2022-02-21 02:50:12,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {11444#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {11444#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 {11444#true} is VALID [2022-02-21 02:50:12,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {11444#true} havoc main_#t~nondet118#1; {11444#true} is VALID [2022-02-21 02:50:12,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {11444#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {11444#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 {11444#true} is VALID [2022-02-21 02:50:12,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {11444#true} havoc main_#t~nondet118#1; {11444#true} is VALID [2022-02-21 02:50:12,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {11444#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {11444#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 {11444#true} is VALID [2022-02-21 02:50:12,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {11444#true} havoc main_#t~nondet118#1; {11444#true} is VALID [2022-02-21 02:50:12,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {11444#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {11444#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 {11444#true} is VALID [2022-02-21 02:50:12,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {11444#true} havoc main_#t~nondet118#1; {11444#true} is VALID [2022-02-21 02:50:12,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {11444#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {11444#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 {11444#true} is VALID [2022-02-21 02:50:12,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {11444#true} havoc main_#t~nondet118#1; {11444#true} is VALID [2022-02-21 02:50:12,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {11444#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {11444#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 {11444#true} is VALID [2022-02-21 02:50:12,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {11444#true} havoc main_#t~nondet118#1; {11444#true} is VALID [2022-02-21 02:50:12,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {11444#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {11444#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 {11444#true} is VALID [2022-02-21 02:50:12,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {11444#true} havoc main_#t~nondet118#1; {11444#true} is VALID [2022-02-21 02:50:12,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {11444#true} assume !~bvslt32(main_~i~3#1, 10bv32); {11444#true} is VALID [2022-02-21 02:50:12,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {11444#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet119#1;havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {11444#true} is VALID [2022-02-21 02:50:12,633 INFO L272 TraceCheckUtils]: 46: Hoare triple {11444#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {11444#true} is VALID [2022-02-21 02:50:12,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {11444#true} ~cond := #in~cond; {11444#true} is VALID [2022-02-21 02:50:12,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {11444#true} assume !(0bv32 == ~cond); {11444#true} is VALID [2022-02-21 02:50:12,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {11444#true} assume true; {11444#true} is VALID [2022-02-21 02:50:12,634 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11444#true} {11444#true} #476#return; {11444#true} is VALID [2022-02-21 02:50:12,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {11444#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; {11444#true} is VALID [2022-02-21 02:50:12,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {11444#true} 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 {11605#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:50:12,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {11605#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} main_~i~4#1 := 0bv32; {11605#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:50:12,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {11605#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} assume !~bvslt32(main_~i~4#1, main_~argc~0#1); {11605#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:50:12,644 INFO L290 TraceCheckUtils]: 55: Hoare triple {11605#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} 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; {11615#(= (select |#valid| |ULTIMATE.start___main_~argv#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:50:12,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {11615#(= (select |#valid| |ULTIMATE.start___main_~argv#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[__main_~argv#1.base]); {11445#false} is VALID [2022-02-21 02:50:12,645 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:12,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:12,645 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:12,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852030308] [2022-02-21 02:50:12,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852030308] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:12,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:12,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 02:50:12,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191149382] [2022-02-21 02:50:12,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:12,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 57 [2022-02-21 02:50:12,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:12,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:12,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 02:50:12,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:12,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 02:50:12,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:50:12,672 INFO L87 Difference]: Start difference. First operand 370 states and 498 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:13,960 INFO L93 Difference]: Finished difference Result 387 states and 518 transitions. [2022-02-21 02:50:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 02:50:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 57 [2022-02-21 02:50:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2022-02-21 02:50:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2022-02-21 02:50:13,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 275 transitions. [2022-02-21 02:50:14,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:14,377 INFO L225 Difference]: With dead ends: 387 [2022-02-21 02:50:14,377 INFO L226 Difference]: Without dead ends: 387 [2022-02-21 02:50:14,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 02:50:14,377 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 394 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:14,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 244 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-21 02:50:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-02-21 02:50:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 363. [2022-02-21 02:50:14,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:14,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 363 states, 286 states have (on average 1.6713286713286712) internal successors, (478), 358 states have internal predecessors, (478), 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:14,386 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 363 states, 286 states have (on average 1.6713286713286712) internal successors, (478), 358 states have internal predecessors, (478), 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:14,386 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 363 states, 286 states have (on average 1.6713286713286712) internal successors, (478), 358 states have internal predecessors, (478), 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:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:14,401 INFO L93 Difference]: Finished difference Result 387 states and 518 transitions. [2022-02-21 02:50:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 518 transitions. [2022-02-21 02:50:14,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:14,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:14,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 363 states, 286 states have (on average 1.6713286713286712) internal successors, (478), 358 states have internal predecessors, (478), 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 387 states. [2022-02-21 02:50:14,403 INFO L87 Difference]: Start difference. First operand has 363 states, 286 states have (on average 1.6713286713286712) internal successors, (478), 358 states have internal predecessors, (478), 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 387 states. [2022-02-21 02:50:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:14,414 INFO L93 Difference]: Finished difference Result 387 states and 518 transitions. [2022-02-21 02:50:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 518 transitions. [2022-02-21 02:50:14,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:14,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:14,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:14,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 286 states have (on average 1.6713286713286712) internal successors, (478), 358 states have internal predecessors, (478), 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:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 484 transitions. [2022-02-21 02:50:14,425 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 484 transitions. Word has length 57 [2022-02-21 02:50:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:14,425 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 484 transitions. [2022-02-21 02:50:14,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 484 transitions. [2022-02-21 02:50:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 02:50:14,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:14,426 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] [2022-02-21 02:50:14,446 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:14,641 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:14,641 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:50:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash 746722396, now seen corresponding path program 1 times [2022-02-21 02:50:14,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:14,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579384836] [2022-02-21 02:50:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:14,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:14,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:14,643 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:14,644 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:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:14,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:50:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:14,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:15,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {13144#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {13144#true} is VALID [2022-02-21 02:50:15,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {13144#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {13144#true} is VALID [2022-02-21 02:50:15,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {13144#true} main_~i~3#1 := 0bv32; {13144#true} is VALID [2022-02-21 02:50:15,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {13144#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {13144#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 {13144#true} is VALID [2022-02-21 02:50:15,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {13144#true} havoc main_#t~nondet118#1; {13144#true} is VALID [2022-02-21 02:50:15,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {13144#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {13144#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 {13144#true} is VALID [2022-02-21 02:50:15,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {13144#true} havoc main_#t~nondet118#1; {13144#true} is VALID [2022-02-21 02:50:15,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {13144#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {13144#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 {13144#true} is VALID [2022-02-21 02:50:15,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {13144#true} havoc main_#t~nondet118#1; {13144#true} is VALID [2022-02-21 02:50:15,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {13144#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {13144#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 {13144#true} is VALID [2022-02-21 02:50:15,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {13144#true} havoc main_#t~nondet118#1; {13144#true} is VALID [2022-02-21 02:50:15,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {13144#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {13144#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 {13144#true} is VALID [2022-02-21 02:50:15,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {13144#true} havoc main_#t~nondet118#1; {13144#true} is VALID [2022-02-21 02:50:15,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {13144#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {13144#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 {13144#true} is VALID [2022-02-21 02:50:15,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {13144#true} havoc main_#t~nondet118#1; {13144#true} is VALID [2022-02-21 02:50:15,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {13144#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {13144#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 {13144#true} is VALID [2022-02-21 02:50:15,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {13144#true} havoc main_#t~nondet118#1; {13144#true} is VALID [2022-02-21 02:50:15,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {13144#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {13144#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 {13144#true} is VALID [2022-02-21 02:50:15,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {13144#true} havoc main_#t~nondet118#1; {13144#true} is VALID [2022-02-21 02:50:15,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {13144#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {13144#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 {13144#true} is VALID [2022-02-21 02:50:15,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {13144#true} havoc main_#t~nondet118#1; {13144#true} is VALID [2022-02-21 02:50:15,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {13144#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {13144#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 {13144#true} is VALID [2022-02-21 02:50:15,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {13144#true} havoc main_#t~nondet118#1; {13144#true} is VALID [2022-02-21 02:50:15,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {13144#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; {13144#true} is VALID [2022-02-21 02:50:15,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {13144#true} assume !~bvslt32(main_~i~3#1, 10bv32); {13144#true} is VALID [2022-02-21 02:50:15,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {13144#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet119#1;havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {13144#true} is VALID [2022-02-21 02:50:15,112 INFO L272 TraceCheckUtils]: 46: Hoare triple {13144#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {13144#true} is VALID [2022-02-21 02:50:15,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {13144#true} ~cond := #in~cond; {13290#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:50:15,113 INFO L290 TraceCheckUtils]: 48: Hoare triple {13290#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {13294#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:15,113 INFO L290 TraceCheckUtils]: 49: Hoare triple {13294#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {13294#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:15,114 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13294#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {13144#true} #476#return; {13301#(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:15,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {13301#(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; {13301#(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:15,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {13301#(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 {13301#(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:15,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {13301#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} main_~i~4#1 := 0bv32; {13311#(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:15,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {13311#(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); {13145#false} is VALID [2022-02-21 02:50:15,117 INFO L290 TraceCheckUtils]: 55: Hoare triple {13145#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; {13145#false} is VALID [2022-02-21 02:50:15,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {13145#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))); {13145#false} is VALID [2022-02-21 02:50:15,118 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:15,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:15,118 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:15,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579384836] [2022-02-21 02:50:15,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579384836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:15,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:15,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 02:50:15,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150204506] [2022-02-21 02:50:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:15,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 57 [2022-02-21 02:50:15,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:15,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:15,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:15,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 02:50:15,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:15,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 02:50:15,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 02:50:15,168 INFO L87 Difference]: Start difference. First operand 363 states and 484 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:17,233 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2022-02-21 02:50:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 02:50:17,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 57 [2022-02-21 02:50:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 277 transitions. [2022-02-21 02:50:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 277 transitions. [2022-02-21 02:50:17,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 277 transitions. [2022-02-21 02:50:17,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:17,694 INFO L225 Difference]: With dead ends: 279 [2022-02-21 02:50:17,694 INFO L226 Difference]: Without dead ends: 279 [2022-02-21 02:50:17,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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:17,696 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 282 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 912 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:17,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 912 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:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-02-21 02:50:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2022-02-21 02:50:17,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:17,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 257 states, 181 states have (on average 1.580110497237569) internal successors, (286), 253 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:50:17,701 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 257 states, 181 states have (on average 1.580110497237569) internal successors, (286), 253 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:50:17,701 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 257 states, 181 states have (on average 1.580110497237569) internal successors, (286), 253 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:50:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:17,720 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2022-02-21 02:50:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 313 transitions. [2022-02-21 02:50:17,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:17,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:17,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 181 states have (on average 1.580110497237569) internal successors, (286), 253 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 279 states. [2022-02-21 02:50:17,722 INFO L87 Difference]: Start difference. First operand has 257 states, 181 states have (on average 1.580110497237569) internal successors, (286), 253 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 279 states. [2022-02-21 02:50:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:17,729 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2022-02-21 02:50:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 313 transitions. [2022-02-21 02:50:17,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:17,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:17,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:17,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 181 states have (on average 1.580110497237569) internal successors, (286), 253 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:50:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 290 transitions. [2022-02-21 02:50:17,735 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 290 transitions. Word has length 57 [2022-02-21 02:50:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:17,735 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 290 transitions. [2022-02-21 02:50:17,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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,736 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 290 transitions. [2022-02-21 02:50:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-21 02:50:17,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:17,736 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:17,758 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:17,957 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:17,958 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-21 02:50:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1673575759, now seen corresponding path program 1 times [2022-02-21 02:50:17,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:17,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776679724] [2022-02-21 02:50:17,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:17,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:17,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:17,960 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:17,961 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,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:18,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 02:50:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:18,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:18,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {14416#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 := 0bv32;~bb_errno~0.base, ~bb_errno~0.offset := 0bv64, 0bv64;~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 10bv64, 0bv64;call #Ultimate.allocInit(382bv64, 10bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {14416#true} is VALID [2022-02-21 02:50:18,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {14416#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1595 {14416#true} is VALID [2022-02-21 02:50:18,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {14416#true} main_~i~3#1 := 0bv32; {14416#true} is VALID [2022-02-21 02:50:18,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {14416#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {14416#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 {14416#true} is VALID [2022-02-21 02:50:18,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {14416#true} havoc main_#t~nondet118#1; {14416#true} is VALID [2022-02-21 02:50:18,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {14416#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {14416#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 {14416#true} is VALID [2022-02-21 02:50:18,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {14416#true} havoc main_#t~nondet118#1; {14416#true} is VALID [2022-02-21 02:50:18,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {14416#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {14416#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 {14416#true} is VALID [2022-02-21 02:50:18,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {14416#true} havoc main_#t~nondet118#1; {14416#true} is VALID [2022-02-21 02:50:18,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {14416#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {14416#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 {14416#true} is VALID [2022-02-21 02:50:18,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {14416#true} havoc main_#t~nondet118#1; {14416#true} is VALID [2022-02-21 02:50:18,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {14416#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {14416#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 {14416#true} is VALID [2022-02-21 02:50:18,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {14416#true} havoc main_#t~nondet118#1; {14416#true} is VALID [2022-02-21 02:50:18,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {14416#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {14416#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 {14416#true} is VALID [2022-02-21 02:50:18,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {14416#true} havoc main_#t~nondet118#1; {14416#true} is VALID [2022-02-21 02:50:18,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {14416#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {14416#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 {14416#true} is VALID [2022-02-21 02:50:18,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {14416#true} havoc main_#t~nondet118#1; {14416#true} is VALID [2022-02-21 02:50:18,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {14416#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {14416#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 {14416#true} is VALID [2022-02-21 02:50:18,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {14416#true} havoc main_#t~nondet118#1; {14416#true} is VALID [2022-02-21 02:50:18,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {14416#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {14416#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 {14416#true} is VALID [2022-02-21 02:50:18,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {14416#true} havoc main_#t~nondet118#1; {14416#true} is VALID [2022-02-21 02:50:18,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {14416#true} assume !!~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {14416#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 {14416#true} is VALID [2022-02-21 02:50:18,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {14416#true} havoc main_#t~nondet118#1; {14416#true} is VALID [2022-02-21 02:50:18,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {14416#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; {14416#true} is VALID [2022-02-21 02:50:18,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {14416#true} assume !~bvslt32(main_~i~3#1, 10bv32); {14416#true} is VALID [2022-02-21 02:50:18,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {14416#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet119#1;havoc main_#t~nondet119#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet120#1;havoc main_#t~nondet120#1; {14416#true} is VALID [2022-02-21 02:50:18,400 INFO L272 TraceCheckUtils]: 46: Hoare triple {14416#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {14416#true} is VALID [2022-02-21 02:50:18,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {14416#true} ~cond := #in~cond; {14416#true} is VALID [2022-02-21 02:50:18,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {14416#true} assume !(0bv32 == ~cond); {14416#true} is VALID [2022-02-21 02:50:18,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {14416#true} assume true; {14416#true} is VALID [2022-02-21 02:50:18,400 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14416#true} {14416#true} #476#return; {14416#true} is VALID [2022-02-21 02:50:18,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {14416#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; {14574#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} is VALID [2022-02-21 02:50:18,402 INFO L290 TraceCheckUtils]: 52: Hoare triple {14574#(= (_ 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 {14574#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} is VALID [2022-02-21 02:50:18,402 INFO L290 TraceCheckUtils]: 53: Hoare triple {14574#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} main_~i~4#1 := 0bv32; {14581#(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:18,403 INFO L290 TraceCheckUtils]: 54: Hoare triple {14581#(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); {14581#(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:18,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {14581#(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 {14588#(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:18,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {14588#(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; {14588#(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:18,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {14588#(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))))); {14417#false} is VALID [2022-02-21 02:50:18,405 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,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:18,406 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:18,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776679724] [2022-02-21 02:50:18,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776679724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:18,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:18,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 02:50:18,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812883477] [2022-02-21 02:50:18,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:18,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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:18,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:18,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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:18,443 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:18,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 02:50:18,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 02:50:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-21 02:50:18,444 INFO L87 Difference]: Start difference. First operand 257 states and 290 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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)