./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6b0415ceba0811795bdd9d25bfbda379c533d6bc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:37:03,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:37:03,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:37:03,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:37:03,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:37:03,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:37:03,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:37:03,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:37:03,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:37:03,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:37:03,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:37:03,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:37:03,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:37:03,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:37:03,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:37:03,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:37:03,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:37:03,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:37:03,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:37:03,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:37:03,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:37:03,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:37:03,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:37:03,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:37:03,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:37:03,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:37:03,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:37:03,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:37:03,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:37:03,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:37:03,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:37:03,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:37:03,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:37:03,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:37:03,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:37:03,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:37:03,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:37:03,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:37:03,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:37:03,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:37:03,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:37:03,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:37:03,721 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:37:03,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:37:03,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:37:03,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:37:03,728 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:37:03,728 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:37:03,728 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:37:03,728 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:37:03,729 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:37:03,729 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:37:03,729 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:37:03,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:37:03,730 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:37:03,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:37:03,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:37:03,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:37:03,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:37:03,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:37:03,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:37:03,732 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:37:03,732 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:37:03,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:37:03,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:37:03,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:37:03,735 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:37:03,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:37:03,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:37:03,736 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:37:03,736 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:37:03,737 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:37:03,737 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 6b0415ceba0811795bdd9d25bfbda379c533d6bc [2020-07-29 01:37:04,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:37:04,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:37:04,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:37:04,034 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:37:04,036 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:37:04,037 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i [2020-07-29 01:37:04,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e5fbf949/dd33ea0721744f37a779ea31afe90bf8/FLAG9cba9ac8b [2020-07-29 01:37:04,577 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:37:04,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i [2020-07-29 01:37:04,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e5fbf949/dd33ea0721744f37a779ea31afe90bf8/FLAG9cba9ac8b [2020-07-29 01:37:04,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e5fbf949/dd33ea0721744f37a779ea31afe90bf8 [2020-07-29 01:37:04,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:37:04,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:37:04,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:04,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:37:04,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:37:04,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:04" (1/1) ... [2020-07-29 01:37:04,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0a3ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:04, skipping insertion in model container [2020-07-29 01:37:04,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:04" (1/1) ... [2020-07-29 01:37:04,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:37:04,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:37:05,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:05,454 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:37:05,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:05,558 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:37:05,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05 WrapperNode [2020-07-29 01:37:05,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:05,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:05,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:37:05,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:37:05,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (1/1) ... [2020-07-29 01:37:05,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (1/1) ... [2020-07-29 01:37:05,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:05,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:37:05,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:37:05,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:37:05,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (1/1) ... [2020-07-29 01:37:05,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (1/1) ... [2020-07-29 01:37:05,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (1/1) ... [2020-07-29 01:37:05,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (1/1) ... [2020-07-29 01:37:05,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (1/1) ... [2020-07-29 01:37:05,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (1/1) ... [2020-07-29 01:37:05,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (1/1) ... [2020-07-29 01:37:05,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:37:05,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:37:05,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:37:05,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:37:05,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:37:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:37:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:37:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:37:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:37:05,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:37:06,063 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:37:06,063 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:37:06,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:06 BoogieIcfgContainer [2020-07-29 01:37:06,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:37:06,067 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:37:06,067 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:37:06,071 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:37:06,072 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:06,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:37:04" (1/3) ... [2020-07-29 01:37:06,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e1249a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:06, skipping insertion in model container [2020-07-29 01:37:06,073 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:06,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:05" (2/3) ... [2020-07-29 01:37:06,074 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e1249a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:06, skipping insertion in model container [2020-07-29 01:37:06,074 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:06,074 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:06" (3/3) ... [2020-07-29 01:37:06,076 INFO L371 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca-2.i [2020-07-29 01:37:06,118 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:37:06,119 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:37:06,119 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:37:06,119 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:37:06,119 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:37:06,120 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:37:06,120 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:37:06,120 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:37:06,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:37:06,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:37:06,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:06,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:06,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:37:06,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:06,159 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:37:06,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:37:06,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:37:06,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:06,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:06,163 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:37:06,163 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:06,169 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L564true assume !(main_~array_size~0 < 1); 10#L564-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 15#L552-3true [2020-07-29 01:37:06,170 INFO L796 eck$LassoCheckResult]: Loop: 15#L552-3true assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 9#L555-3true assume !true; 12#L552-2true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 15#L552-3true [2020-07-29 01:37:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:06,174 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 01:37:06,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:06,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019161475] [2020-07-29 01:37:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:06,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:06,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:06,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:06,324 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2020-07-29 01:37:06,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:06,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030496068] [2020-07-29 01:37:06,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:06,374 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {19#true} is VALID [2020-07-29 01:37:06,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} assume !true; {20#false} is VALID [2020-07-29 01:37:06,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {20#false} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {20#false} is VALID [2020-07-29 01:37:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:06,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030496068] [2020-07-29 01:37:06,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:06,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:37:06,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427863623] [2020-07-29 01:37:06,386 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:37:06,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:06,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:37:06,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:37:06,399 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-07-29 01:37:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:06,427 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-29 01:37:06,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:37:06,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:37:06,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:06,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-07-29 01:37:06,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:37:06,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2020-07-29 01:37:06,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:37:06,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:37:06,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2020-07-29 01:37:06,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:06,448 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:37:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2020-07-29 01:37:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-29 01:37:06,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:06,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 10 transitions. Second operand 8 states. [2020-07-29 01:37:06,474 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 10 transitions. Second operand 8 states. [2020-07-29 01:37:06,476 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 8 states. [2020-07-29 01:37:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:06,478 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-29 01:37:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:37:06,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:06,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:06,479 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states and 10 transitions. [2020-07-29 01:37:06,479 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states and 10 transitions. [2020-07-29 01:37:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:06,481 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-29 01:37:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:37:06,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:06,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:06,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:06,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:37:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-29 01:37:06,485 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:37:06,485 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:37:06,485 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:37:06,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:37:06,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:37:06,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:06,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:06,487 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:37:06,487 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:37:06,488 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L564 assume !(main_~array_size~0 < 1); 36#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 40#L552-3 [2020-07-29 01:37:06,488 INFO L796 eck$LassoCheckResult]: Loop: 40#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 38#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 39#L555-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 41#L552-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 40#L552-3 [2020-07-29 01:37:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:06,489 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-07-29 01:37:06,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:06,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722842536] [2020-07-29 01:37:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:06,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:06,514 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:06,518 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:06,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:06,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2020-07-29 01:37:06,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:06,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083147565] [2020-07-29 01:37:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:06,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:06,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:06,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:06,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:06,551 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2020-07-29 01:37:06,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:06,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101131733] [2020-07-29 01:37:06,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:06,572 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:06,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:06,595 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:06,897 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-07-29 01:37:06,999 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:06,999 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:07,000 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:07,000 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:07,000 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:07,000 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:07,000 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:07,001 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:07,001 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration2_Lasso [2020-07-29 01:37:07,001 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:07,001 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:07,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:07,877 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:07,882 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:07,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:07,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:07,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:07,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:07,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:07,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:07,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:07,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:07,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:07,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:07,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:07,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:07,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:07,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:07,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:07,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:07,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:07,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:07,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:07,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:07,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:07,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:07,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:07,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:07,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:07,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:08,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:08,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:08,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:08,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:08,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:08,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:08,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:08,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:08,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:08,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:08,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:08,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:08,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:08,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:08,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:08,112 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:08,148 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 01:37:08,148 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:08,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:37:08,219 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:37:08,219 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:08,220 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2020-07-29 01:37:08,265 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:37:08,270 INFO L393 LassoCheck]: Loop: "assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset;" "call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);" "assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;" "sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2;" [2020-07-29 01:37:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:08,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:08,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:08,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:08,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {67#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {67#unseeded} is VALID [2020-07-29 01:37:08,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {67#unseeded} is VALID [2020-07-29 01:37:08,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {67#unseeded} assume !(main_~array_size~0 < 1); {67#unseeded} is VALID [2020-07-29 01:37:08,395 INFO L280 TraceCheckUtils]: 3: Hoare triple {67#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {67#unseeded} is VALID [2020-07-29 01:37:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:08,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:08,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:08,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#(>= oldRank0 (+ ULTIMATE.start_sumOfThirdBytes_~array_size (* (- 1) ULTIMATE.start_sumOfThirdBytes_~i~0)))} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {99#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} is VALID [2020-07-29 01:37:08,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {99#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} is VALID [2020-07-29 01:37:08,430 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; {99#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} is VALID [2020-07-29 01:37:08,431 INFO L280 TraceCheckUtils]: 3: Hoare triple {99#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {85#(or (and (> oldRank0 (+ ULTIMATE.start_sumOfThirdBytes_~array_size (* (- 1) ULTIMATE.start_sumOfThirdBytes_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:37:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:08,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:37:08,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:08,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:08,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,447 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:37:08,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:37:08,500 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2020-07-29 01:37:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:08,501 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:08,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 3 [2020-07-29 01:37:08,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:08,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:08,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:37:08,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:08,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:08,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:08,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:37:08,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:08,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:08,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:08,509 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 3 [2020-07-29 01:37:08,510 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:37:08,510 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:37:08,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:08,512 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:08,512 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2020-07-29 01:37:08,512 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:08,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:08,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:08,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:08,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:08,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:08,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:08,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:08,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:08,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:08,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:37:08,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:37:08,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:37:08,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:37:08,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:37:08,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:37:08,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:08,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:08,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:08,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:08,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:08,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:08,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:08,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:08,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:08,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:08,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:08,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:08,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:37:08,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:37:08,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:37:08,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:08,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:08,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:08,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:08,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:08,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:08,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:08,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:08,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:08,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,526 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:37:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 01:37:08,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:08,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:37:08,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:37:08,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:08,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2020-07-29 01:37:08,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:08,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2020-07-29 01:37:08,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:37:08,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:37:08,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2020-07-29 01:37:08,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:08,533 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:37:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2020-07-29 01:37:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-29 01:37:08,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:08,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand 11 states. [2020-07-29 01:37:08,535 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand 11 states. [2020-07-29 01:37:08,535 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 11 states. [2020-07-29 01:37:08,535 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:08,538 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:37:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:37:08,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:08,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:08,539 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states and 16 transitions. [2020-07-29 01:37:08,539 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states and 16 transitions. [2020-07-29 01:37:08,540 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:08,542 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:37:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:37:08,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:08,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:08,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:08,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:37:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2020-07-29 01:37:08,544 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-29 01:37:08,544 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-29 01:37:08,544 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:37:08,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2020-07-29 01:37:08,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:08,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:08,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:08,545 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:08,545 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:08,546 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 128#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 129#L564 assume !(main_~array_size~0 < 1); 130#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 136#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 132#L555-3 [2020-07-29 01:37:08,546 INFO L796 eck$LassoCheckResult]: Loop: 132#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 133#L555-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 132#L555-3 [2020-07-29 01:37:08,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:08,546 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-07-29 01:37:08,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:08,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212618484] [2020-07-29 01:37:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:08,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:08,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:08,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2020-07-29 01:37:08,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:08,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319205174] [2020-07-29 01:37:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:08,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:08,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:08,624 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:08,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:08,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2020-07-29 01:37:08,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:08,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609738630] [2020-07-29 01:37:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:08,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:08,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:08,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:08,879 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-07-29 01:37:08,961 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:08,961 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:08,962 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:08,962 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:08,962 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:08,962 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:08,962 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:08,962 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:08,962 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration3_Lasso [2020-07-29 01:37:08,963 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:08,963 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:08,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,307 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-07-29 01:37:09,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,921 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:09,924 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:09,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:09,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:09,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:09,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:09,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:09,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:09,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:09,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:09,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:09,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:09,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:09,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:09,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:09,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:09,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:10,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:10,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:10,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:10,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:10,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:10,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:10,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:10,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:10,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:10,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:10,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:10,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:10,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:10,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:10,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:10,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:10,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:10,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:10,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:10,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:10,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:10,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:10,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:10,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:10,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:10,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:10,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:10,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:10,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:10,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:10,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:10,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:10,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:10,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:10,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:10,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:10,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:10,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:10,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:10,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:10,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:10,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:10,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:10,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:10,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:10,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:10,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:10,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:10,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:10,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:10,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:10,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:10,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:10,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:10,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:10,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:10,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:10,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:10,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:10,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:10,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:10,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:10,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:10,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:10,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:10,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:10,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:10,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:10,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:10,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:10,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:10,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:10,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:10,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:10,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:10,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:10,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:10,508 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:37:10,508 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:10,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:37:10,516 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:37:10,517 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:10,517 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2020-07-29 01:37:10,561 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:37:10,564 INFO L393 LassoCheck]: Loop: "call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);" "assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6;" [2020-07-29 01:37:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:37:10,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:10,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {206#unseeded} is VALID [2020-07-29 01:37:10,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {206#unseeded} is VALID [2020-07-29 01:37:10,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#unseeded} assume !(main_~array_size~0 < 1); {206#unseeded} is VALID [2020-07-29 01:37:10,605 INFO L280 TraceCheckUtils]: 3: Hoare triple {206#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {206#unseeded} is VALID [2020-07-29 01:37:10,606 INFO L280 TraceCheckUtils]: 4: Hoare triple {206#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {206#unseeded} is VALID [2020-07-29 01:37:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:37:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:10,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {209#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {251#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} is VALID [2020-07-29 01:37:10,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {251#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; {234#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))) unseeded)} is VALID [2020-07-29 01:37:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:10,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:37:10,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:10,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:10,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,647 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:37:10,647 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:37:10,699 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 22 states and 29 transitions. Complement of second has 7 states. [2020-07-29 01:37:10,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:10,700 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:10,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. cyclomatic complexity: 6 [2020-07-29 01:37:10,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:10,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:10,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:37:10,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:10,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:10,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:10,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2020-07-29 01:37:10,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:10,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:10,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:10,704 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 15 transitions. cyclomatic complexity: 6 [2020-07-29 01:37:10,705 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:10,705 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:37:10,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:10,706 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:10,706 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 29 transitions. cyclomatic complexity: 11 [2020-07-29 01:37:10,707 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:10,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:10,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:10,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:10,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:10,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:10,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:10,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:10,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:10,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:10,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:37:10,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:37:10,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:37:10,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:37:10,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:37:10,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:37:10,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:10,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:10,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:10,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:10,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:10,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:10,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:10,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:10,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:10,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:10,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:10,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:10,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:10,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:10,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:10,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:10,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:10,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:10,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,718 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:37:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-07-29 01:37:10,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:10,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:10,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:37:10,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. cyclomatic complexity: 11 [2020-07-29 01:37:10,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:10,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2020-07-29 01:37:10,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:37:10,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:37:10,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-07-29 01:37:10,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:10,724 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 01:37:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-07-29 01:37:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2020-07-29 01:37:10,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:10,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand 14 states. [2020-07-29 01:37:10,726 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand 14 states. [2020-07-29 01:37:10,726 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 14 states. [2020-07-29 01:37:10,726 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:10,728 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 01:37:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 01:37:10,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:10,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:10,729 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 16 states and 21 transitions. [2020-07-29 01:37:10,729 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 16 states and 21 transitions. [2020-07-29 01:37:10,729 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:10,731 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 01:37:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 01:37:10,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:10,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:10,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:10,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:37:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-07-29 01:37:10,733 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 01:37:10,733 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 01:37:10,734 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:37:10,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-07-29 01:37:10,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:10,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:10,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:10,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:10,735 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:10,735 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 289#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 287#L564 assume !(main_~array_size~0 < 1); 288#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 295#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 298#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 299#L555-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 296#L552-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 297#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 291#L555-3 [2020-07-29 01:37:10,736 INFO L796 eck$LassoCheckResult]: Loop: 291#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 292#L555-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 291#L555-3 [2020-07-29 01:37:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:10,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2020-07-29 01:37:10,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:10,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361179490] [2020-07-29 01:37:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:10,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:10,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:10,768 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2020-07-29 01:37:10,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:10,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169348814] [2020-07-29 01:37:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:10,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:10,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:10,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2020-07-29 01:37:10,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:10,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669833882] [2020-07-29 01:37:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:10,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:10,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:10,867 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:11,147 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2020-07-29 01:37:11,254 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:11,255 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:11,255 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:11,255 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:11,255 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:11,255 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:11,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:11,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:11,256 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration4_Lasso [2020-07-29 01:37:11,256 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:11,256 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:11,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,468 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2020-07-29 01:37:11,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:11,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,128 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:12,128 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:12,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:12,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:12,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:12,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:12,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:12,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:12,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:12,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:12,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:12,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:12,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:12,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:12,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:12,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:12,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:12,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:12,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:12,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:12,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:12,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:12,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:12,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:12,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:12,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:12,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:12,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:12,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:12,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:12,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:12,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:12,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:12,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:12,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:12,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:12,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:12,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:12,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:12,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:12,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:12,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:12,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:12,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:12,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:12,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:12,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:12,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:12,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:12,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:12,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:12,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:12,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:12,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:12,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:12,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:12,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:12,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:12,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:12,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:12,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:12,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:12,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:12,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:12,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:12,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:12,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:12,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:12,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:12,403 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:12,405 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:37:12,405 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,407 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:37:12,407 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:37:12,407 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:12,407 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2020-07-29 01:37:12,444 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2020-07-29 01:37:12,447 INFO L393 LassoCheck]: Loop: "call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);" "assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6;" [2020-07-29 01:37:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:37:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:12,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {382#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {382#unseeded} is VALID [2020-07-29 01:37:12,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {382#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {382#unseeded} is VALID [2020-07-29 01:37:12,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {382#unseeded} assume !(main_~array_size~0 < 1); {382#unseeded} is VALID [2020-07-29 01:37:12,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {382#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {382#unseeded} is VALID [2020-07-29 01:37:12,496 INFO L280 TraceCheckUtils]: 4: Hoare triple {382#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {382#unseeded} is VALID [2020-07-29 01:37:12,496 INFO L280 TraceCheckUtils]: 5: Hoare triple {382#unseeded} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {382#unseeded} is VALID [2020-07-29 01:37:12,497 INFO L280 TraceCheckUtils]: 6: Hoare triple {382#unseeded} assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; {382#unseeded} is VALID [2020-07-29 01:37:12,498 INFO L280 TraceCheckUtils]: 7: Hoare triple {382#unseeded} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {382#unseeded} is VALID [2020-07-29 01:37:12,498 INFO L280 TraceCheckUtils]: 8: Hoare triple {382#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {382#unseeded} is VALID [2020-07-29 01:37:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:37:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:12,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {385#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {449#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} is VALID [2020-07-29 01:37:12,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; {420#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))) unseeded)} is VALID [2020-07-29 01:37:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:12,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:37:12,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,539 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:37:12,539 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:37:12,581 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2020-07-29 01:37:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:12,582 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:12,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:37:12,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:12,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:12,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:37:12,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:12,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:12,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:12,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-07-29 01:37:12,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:12,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:12,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:12,586 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:37:12,586 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:12,586 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:37:12,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:12,588 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:12,588 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:12,588 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:12,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:37:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:37:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:37:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:37:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:37:12,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:37:12,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,614 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:37:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-07-29 01:37:12,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,615 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:12,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {382#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {382#unseeded} is VALID [2020-07-29 01:37:12,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {382#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {382#unseeded} is VALID [2020-07-29 01:37:12,664 INFO L280 TraceCheckUtils]: 2: Hoare triple {382#unseeded} assume !(main_~array_size~0 < 1); {382#unseeded} is VALID [2020-07-29 01:37:12,665 INFO L280 TraceCheckUtils]: 3: Hoare triple {382#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {382#unseeded} is VALID [2020-07-29 01:37:12,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {382#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {382#unseeded} is VALID [2020-07-29 01:37:12,666 INFO L280 TraceCheckUtils]: 5: Hoare triple {382#unseeded} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {382#unseeded} is VALID [2020-07-29 01:37:12,667 INFO L280 TraceCheckUtils]: 6: Hoare triple {382#unseeded} assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; {382#unseeded} is VALID [2020-07-29 01:37:12,667 INFO L280 TraceCheckUtils]: 7: Hoare triple {382#unseeded} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {382#unseeded} is VALID [2020-07-29 01:37:12,668 INFO L280 TraceCheckUtils]: 8: Hoare triple {382#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {382#unseeded} is VALID [2020-07-29 01:37:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:37:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:12,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {385#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {511#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} is VALID [2020-07-29 01:37:12,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; {420#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))) unseeded)} is VALID [2020-07-29 01:37:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:12,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:37:12,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:12,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:37:12,711 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:37:12,751 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2020-07-29 01:37:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:12,751 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:12,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:37:12,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:12,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:12,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:37:12,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:12,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:12,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:12,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-07-29 01:37:12,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:12,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:12,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:12,754 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:37:12,754 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:12,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:37:12,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:12,756 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:12,756 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:12,756 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:12,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:37:12,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:37:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:37:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:37:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:37:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:37:12,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:12,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:12,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:12,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,765 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:37:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-07-29 01:37:12,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,766 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:12,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {382#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {382#unseeded} is VALID [2020-07-29 01:37:12,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {382#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {382#unseeded} is VALID [2020-07-29 01:37:12,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {382#unseeded} assume !(main_~array_size~0 < 1); {382#unseeded} is VALID [2020-07-29 01:37:12,807 INFO L280 TraceCheckUtils]: 3: Hoare triple {382#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {382#unseeded} is VALID [2020-07-29 01:37:12,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {382#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {382#unseeded} is VALID [2020-07-29 01:37:12,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {382#unseeded} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {382#unseeded} is VALID [2020-07-29 01:37:12,808 INFO L280 TraceCheckUtils]: 6: Hoare triple {382#unseeded} assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; {382#unseeded} is VALID [2020-07-29 01:37:12,809 INFO L280 TraceCheckUtils]: 7: Hoare triple {382#unseeded} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {382#unseeded} is VALID [2020-07-29 01:37:12,809 INFO L280 TraceCheckUtils]: 8: Hoare triple {382#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {382#unseeded} is VALID [2020-07-29 01:37:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:37:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:12,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:12,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {385#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {573#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} is VALID [2020-07-29 01:37:12,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {573#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; {420#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))) unseeded)} is VALID [2020-07-29 01:37:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:12,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:37:12,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:12,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,862 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:37:12,862 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:37:12,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2020-07-29 01:37:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:12,906 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:12,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:37:12,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:12,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:12,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:37:12,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:12,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:12,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:12,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2020-07-29 01:37:12,912 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:12,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:12,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:37:12,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:12,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:37:12,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:12,914 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:12,914 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 27 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:12,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:12,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:12,915 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:37:12,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:12,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:12,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:12,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:37:12,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:37:12,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:37:12,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:12,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:12,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:12,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:37:12,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:12,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,921 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:37:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:37:12,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:37:12,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:37:12,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:37:12,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:12,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:12,924 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:12,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2020-07-29 01:37:12,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:37:12,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:37:12,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:37:12,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:12,925 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:37:12,925 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:37:12,925 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:37:12,925 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:37:12,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:37:12,926 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:12,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:12,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:37:12 BoogieIcfgContainer [2020-07-29 01:37:12,932 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:37:12,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:37:12,932 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:37:12,932 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:37:12,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:06" (3/4) ... [2020-07-29 01:37:12,935 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:37:12,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:37:12,937 INFO L168 Benchmark]: Toolchain (without parser) took 8027.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 956.2 MB in the beginning and 951.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 307.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:12,937 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:12,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:12,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:12,939 INFO L168 Benchmark]: Boogie Preprocessor took 27.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:12,940 INFO L168 Benchmark]: RCFGBuilder took 430.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:12,940 INFO L168 Benchmark]: BuchiAutomizer took 6864.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 951.3 MB in the end (delta: 152.5 MB). Peak memory consumption was 302.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:12,941 INFO L168 Benchmark]: Witness Printer took 3.24 ms. Allocated memory is still 1.3 GB. Free memory is still 951.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:12,944 INFO L336 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 646.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 430.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6864.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 951.3 MB in the end (delta: 152.5 MB). Peak memory consumption was 302.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.24 ms. Allocated memory is still 1.3 GB. Free memory is still 951.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 59 SDtfs, 49 SDslu, 10 SDs, 0 SdLazy, 33 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax113 hnf98 lsp79 ukn82 mio100 lsp56 div100 bol100 ite100 ukn100 eq193 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...