./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.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 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:44:05,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:44:05,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:44:05,780 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:44:05,780 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:44:05,781 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:44:05,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:44:05,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:44:05,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:44:05,788 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:44:05,789 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:44:05,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:44:05,790 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:44:05,791 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:44:05,793 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:44:05,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:44:05,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:44:05,797 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:44:05,799 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:44:05,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:44:05,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:44:05,803 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:44:05,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:44:05,807 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:44:05,807 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:44:05,808 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:44:05,809 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:44:05,811 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:44:05,812 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:44:05,813 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:44:05,813 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:44:05,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:44:05,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:44:05,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:44:05,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:44:05,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:44:05,817 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:44:05,846 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:44:05,846 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:44:05,848 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:44:05,848 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:44:05,848 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:44:05,849 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:44:05,849 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:44:05,849 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:44:05,849 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:44:05,849 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:44:05,850 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:44:05,851 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:44:05,851 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:44:05,852 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:44:05,852 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:44:05,852 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:44:05,852 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:44:05,852 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:44:05,852 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:44:05,854 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:44:05,854 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:44:05,854 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:44:05,854 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:44:05,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:44:05,855 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:44:05,855 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:44:05,855 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:44:05,855 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:44:05,856 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:44:05,856 INFO L133 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 -> 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b [2019-01-14 02:44:05,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:44:05,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:44:05,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:44:05,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:44:05,920 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:44:05,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.i [2019-01-14 02:44:05,980 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb0e6f6d/94c966c677b844af934c75f1841827a1/FLAG1b51b0a09 [2019-01-14 02:44:06,457 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:44:06,458 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.i [2019-01-14 02:44:06,468 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb0e6f6d/94c966c677b844af934c75f1841827a1/FLAG1b51b0a09 [2019-01-14 02:44:06,787 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb0e6f6d/94c966c677b844af934c75f1841827a1 [2019-01-14 02:44:06,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:44:06,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:44:06,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:44:06,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:44:06,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:44:06,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:44:06" (1/1) ... [2019-01-14 02:44:06,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113037e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:06, skipping insertion in model container [2019-01-14 02:44:06,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:44:06" (1/1) ... [2019-01-14 02:44:06,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:44:06,854 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:44:07,279 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:44:07,297 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:44:07,378 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:44:07,531 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:44:07,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07 WrapperNode [2019-01-14 02:44:07,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:44:07,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:44:07,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:44:07,533 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:44:07,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (1/1) ... [2019-01-14 02:44:07,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (1/1) ... [2019-01-14 02:44:07,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:44:07,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:44:07,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:44:07,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:44:07,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (1/1) ... [2019-01-14 02:44:07,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (1/1) ... [2019-01-14 02:44:07,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (1/1) ... [2019-01-14 02:44:07,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (1/1) ... [2019-01-14 02:44:07,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (1/1) ... [2019-01-14 02:44:07,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (1/1) ... [2019-01-14 02:44:07,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (1/1) ... [2019-01-14 02:44:07,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:44:07,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:44:07,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:44:07,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:44:07,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (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 [2019-01-14 02:44:07,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:44:07,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:44:07,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:44:07,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:44:07,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:44:07,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:44:08,052 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:44:08,052 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:44:08,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:44:08 BoogieIcfgContainer [2019-01-14 02:44:08,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:44:08,054 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:44:08,055 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:44:08,059 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:44:08,060 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:44:08,061 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:44:06" (1/3) ... [2019-01-14 02:44:08,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35d446c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:44:08, skipping insertion in model container [2019-01-14 02:44:08,062 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:44:08,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:07" (2/3) ... [2019-01-14 02:44:08,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35d446c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:44:08, skipping insertion in model container [2019-01-14 02:44:08,064 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:44:08,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:44:08" (3/3) ... [2019-01-14 02:44:08,069 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_alloca_true-termination.c.i [2019-01-14 02:44:08,127 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:44:08,128 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:44:08,128 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:44:08,128 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:44:08,129 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:44:08,129 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:44:08,129 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:44:08,129 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:44:08,129 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:44:08,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:44:08,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:44:08,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:08,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:08,177 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:44:08,177 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:44:08,177 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:44:08,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:44:08,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:44:08,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:08,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:08,181 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:44:08,182 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:44:08,191 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 15#L369true assume !(main_~length~0 < 1); 20#L369-2true call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 12#L371true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 16#L372-3true [2019-01-14 02:44:08,192 INFO L796 eck$LassoCheckResult]: Loop: 16#L372-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 7#L374true assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0; 10#L374-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 13#L372-2true main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 16#L372-3true [2019-01-14 02:44:08,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:08,199 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-14 02:44:08,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:08,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:08,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:08,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:08,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:08,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:08,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-01-14 02:44:08,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:08,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:08,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:08,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-01-14 02:44:08,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:08,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:08,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:08,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:08,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:08,939 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-14 02:44:09,029 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:44:09,030 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:44:09,030 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:44:09,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:44:09,031 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:44:09,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:44:09,031 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:44:09,031 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:44:09,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:44:09,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:44:09,032 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:44:09,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:09,556 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-14 02:44:10,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:44:10,388 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:44:10,391 INFO L122 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 [2019-01-14 02:44:10,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:10,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:10,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:10,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,403 INFO L122 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 [2019-01-14 02:44:10,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:10,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:10,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:10,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,409 INFO L122 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 [2019-01-14 02:44:10,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:10,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:10,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:10,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,415 INFO L122 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 [2019-01-14 02:44:10,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:10,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:10,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:10,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,420 INFO L122 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 [2019-01-14 02:44:10,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:10,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:10,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,433 INFO L122 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 [2019-01-14 02:44:10,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:10,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:10,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:10,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,439 INFO L122 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 [2019-01-14 02:44:10,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:10,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:10,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:10,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,444 INFO L122 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 [2019-01-14 02:44:10,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:10,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:10,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:10,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,449 INFO L122 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 [2019-01-14 02:44:10,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:10,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:10,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:10,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,455 INFO L122 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 [2019-01-14 02:44:10,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:10,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:10,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:10,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,461 INFO L122 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 [2019-01-14 02:44:10,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:10,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:10,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:10,472 INFO L122 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 [2019-01-14 02:44:10,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:10,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:10,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:10,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:10,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:10,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:10,549 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:44:10,594 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:44:10,595 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:44:10,597 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:44:10,600 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:44:10,600 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:44:10,601 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-14 02:44:10,643 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:44:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:10,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:10,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:10,745 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 [2019-01-14 02:44:10,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-01-14 02:44:10,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2019-01-14 02:44:10,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:44:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:44:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-01-14 02:44:10,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:44:10,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:10,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:44:10,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:10,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 02:44:10,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:10,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-01-14 02:44:10,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:44:10,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-01-14 02:44:10,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:44:10,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:44:10,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-01-14 02:44:10,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:44:10,843 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-14 02:44:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-01-14 02:44:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-14 02:44:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:44:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-14 02:44:10,866 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-14 02:44:10,866 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-14 02:44:10,866 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:44:10,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-01-14 02:44:10,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:44:10,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:10,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:10,868 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:44:10,868 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:44:10,868 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 135#L369 assume !(main_~length~0 < 1); 140#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 137#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L372-3 assume !(main_~i~0 < main_~length~0); 141#L372-4 main_~j~0 := 0; 130#L379-3 [2019-01-14 02:44:10,869 INFO L796 eck$LassoCheckResult]: Loop: 130#L379-3 assume !!(main_~j~0 < main_~length~0); 127#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 128#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 129#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 130#L379-3 [2019-01-14 02:44:10,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:10,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-01-14 02:44:10,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:10,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:10,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:10,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:10,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:10,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:44:10,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:44:10,954 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:44:10,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:10,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-01-14 02:44:10,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:10,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:10,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:10,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:10,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:44:11,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:44:11,067 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-14 02:44:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:44:11,166 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-14 02:44:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:44:11,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-14 02:44:11,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:44:11,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-01-14 02:44:11,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:44:11,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:44:11,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-01-14 02:44:11,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:44:11,171 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-14 02:44:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-01-14 02:44:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-01-14 02:44:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:44:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-01-14 02:44:11,174 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 02:44:11,174 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 02:44:11,174 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:44:11,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-01-14 02:44:11,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:44:11,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:11,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:11,176 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:44:11,176 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:44:11,177 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 175#L369 assume !(main_~length~0 < 1); 180#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 177#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 178#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 171#L374 assume !(main_~val~0 > main_~limit~0); 172#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 173#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 179#L372-3 assume !(main_~i~0 < main_~length~0); 181#L372-4 main_~j~0 := 0; 170#L379-3 [2019-01-14 02:44:11,177 INFO L796 eck$LassoCheckResult]: Loop: 170#L379-3 assume !!(main_~j~0 < main_~length~0); 167#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 168#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 169#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 170#L379-3 [2019-01-14 02:44:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:11,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-01-14 02:44:11,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:11,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:11,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:11,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:11,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-01-14 02:44:11,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:11,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:11,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:11,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:11,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:11,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-01-14 02:44:11,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:11,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:11,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:11,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:44:11,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:11,713 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-01-14 02:44:11,806 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:44:11,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:44:11,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:44:11,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:44:11,807 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:44:11,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:44:11,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:44:11,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:44:11,808 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:44:11,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:44:11,809 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:44:11,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:11,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:11,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:11,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:11,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:11,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:11,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:11,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:11,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:12,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:12,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:12,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:12,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:12,348 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:44:12,348 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:44:12,349 INFO L122 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 [2019-01-14 02:44:12,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:12,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:12,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:12,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,352 INFO L122 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 [2019-01-14 02:44:12,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:12,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:12,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:12,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,354 INFO L122 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 [2019-01-14 02:44:12,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:12,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:12,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:12,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,356 INFO L122 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 [2019-01-14 02:44:12,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:12,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:12,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:12,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,359 INFO L122 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 [2019-01-14 02:44:12,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:12,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:12,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:12,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,362 INFO L122 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 [2019-01-14 02:44:12,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:12,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:12,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,368 INFO L122 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 [2019-01-14 02:44:12,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:12,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:12,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:12,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,370 INFO L122 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 [2019-01-14 02:44:12,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:12,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:12,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,375 INFO L122 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 [2019-01-14 02:44:12,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:12,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:12,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,384 INFO L122 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 [2019-01-14 02:44:12,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:12,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:12,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,395 INFO L122 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 [2019-01-14 02:44:12,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:12,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:12,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:12,401 INFO L122 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 [2019-01-14 02:44:12,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:12,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:12,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:12,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:12,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:12,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:12,431 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:44:12,459 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:44:12,462 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:44:12,462 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:44:12,463 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:44:12,464 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:44:12,464 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 - 1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-14 02:44:12,551 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:44:12,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:44:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:12,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:12,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:12,709 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 [2019-01-14 02:44:12,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 02:44:12,797 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2019-01-14 02:44:12,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:44:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:44:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-14 02:44:12,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:44:12,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:12,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-14 02:44:12,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:12,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2019-01-14 02:44:12,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:12,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-01-14 02:44:12,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:12,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2019-01-14 02:44:12,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:44:12,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:44:12,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-01-14 02:44:12,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:44:12,804 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 02:44:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-01-14 02:44:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-01-14 02:44:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:44:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-01-14 02:44:12,806 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 02:44:12,807 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 02:44:12,807 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:44:12,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-01-14 02:44:12,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:12,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:12,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:12,808 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:44:12,809 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:44:12,809 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 293#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 294#L369 assume !(main_~length~0 < 1); 300#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 295#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 296#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 290#L374 assume !(main_~val~0 > main_~limit~0); 291#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 292#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 298#L372-3 assume !(main_~i~0 < main_~length~0); 299#L372-4 main_~j~0 := 0; 289#L379-3 assume !!(main_~j~0 < main_~length~0); 283#L380-3 [2019-01-14 02:44:12,809 INFO L796 eck$LassoCheckResult]: Loop: 283#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 284#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem212;havoc main_#t~post213; 283#L380-3 [2019-01-14 02:44:12,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:12,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2019-01-14 02:44:12,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:12,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:12,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:12,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-01-14 02:44:12,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:12,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:12,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:12,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:12,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2019-01-14 02:44:12,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:12,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:12,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:13,161 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-01-14 02:44:13,214 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:44:13,214 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:44:13,214 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:44:13,214 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:44:13,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:44:13,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:44:13,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:44:13,215 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:44:13,215 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:44:13,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:44:13,215 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:44:13,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,395 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-01-14 02:44:13,621 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-01-14 02:44:13,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:13,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:14,044 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:44:14,044 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:44:14,044 INFO L122 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 [2019-01-14 02:44:14,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:14,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:14,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:14,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:14,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:14,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:14,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:14,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:14,047 INFO L122 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 [2019-01-14 02:44:14,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:14,048 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:44:14,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:14,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:14,050 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:44:14,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:14,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:14,057 INFO L122 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 [2019-01-14 02:44:14,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:14,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:14,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:14,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:14,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:14,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:14,074 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:44:14,084 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:44:14,084 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-14 02:44:14,084 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:44:14,086 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:44:14,086 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:44:14,086 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-01-14 02:44:14,165 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:44:14,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:44:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:14,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:14,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:14,541 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 [2019-01-14 02:44:14,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:44:14,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 27 states and 35 transitions. Complement of second has 7 states. [2019-01-14 02:44:14,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:44:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:44:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-14 02:44:14,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 02:44:14,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:14,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-14 02:44:14,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:14,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-14 02:44:14,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:14,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-01-14 02:44:14,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:14,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2019-01-14 02:44:14,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:44:14,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:44:14,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-01-14 02:44:14,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:44:14,592 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-01-14 02:44:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-01-14 02:44:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-14 02:44:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:44:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-01-14 02:44:14,595 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-14 02:44:14,595 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-14 02:44:14,595 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:44:14,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-01-14 02:44:14,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:14,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:14,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:14,599 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:44:14,599 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:44:14,599 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 420#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 421#L369 assume !(main_~length~0 < 1); 427#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 424#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 425#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 418#L374 assume !(main_~val~0 > main_~limit~0); 419#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 422#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 426#L372-3 assume !(main_~i~0 < main_~length~0); 428#L372-4 main_~j~0 := 0; 416#L379-3 assume !!(main_~j~0 < main_~length~0); 417#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 430#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 414#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 415#L379-3 assume !!(main_~j~0 < main_~length~0); 410#L380-3 [2019-01-14 02:44:14,599 INFO L796 eck$LassoCheckResult]: Loop: 410#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 411#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem212;havoc main_#t~post213; 410#L380-3 [2019-01-14 02:44:14,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-01-14 02:44:14,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:14,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:14,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:14,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:14,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:44:14,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:44:14,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:44:14,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:44:14,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:44:14,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:14,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:44:14,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-01-14 02:44:14,961 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:44:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:14,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-01-14 02:44:14,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:14,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:14,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:44:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:15,141 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:44:15,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 02:44:15,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-14 02:44:15,197 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2019-01-14 02:44:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:44:15,546 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-01-14 02:44:15,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 02:44:15,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2019-01-14 02:44:15,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:15,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2019-01-14 02:44:15,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:44:15,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:44:15,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-01-14 02:44:15,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:44:15,551 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-14 02:44:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-01-14 02:44:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-01-14 02:44:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 02:44:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-01-14 02:44:15,554 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-14 02:44:15,554 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-14 02:44:15,554 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:44:15,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-01-14 02:44:15,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:44:15,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:15,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:15,558 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:44:15,559 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:44:15,559 INFO L794 eck$LassoCheckResult]: Stem: 566#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 564#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 565#L369 assume !(main_~length~0 < 1); 572#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 567#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 568#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 571#L374 assume !(main_~val~0 > main_~limit~0); 576#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 569#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 570#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 561#L374 assume !(main_~val~0 > main_~limit~0); 562#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 563#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 575#L372-3 assume !(main_~i~0 < main_~length~0); 574#L372-4 main_~j~0 := 0; 559#L379-3 assume !!(main_~j~0 < main_~length~0); 560#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 577#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 557#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 558#L379-3 assume !!(main_~j~0 < main_~length~0); 553#L380-3 [2019-01-14 02:44:15,559 INFO L796 eck$LassoCheckResult]: Loop: 553#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 554#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem212;havoc main_#t~post213; 553#L380-3 [2019-01-14 02:44:15,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:15,559 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2019-01-14 02:44:15,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:15,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:15,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:15,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:44:15,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-01-14 02:44:15,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:15,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:15,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:44:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2019-01-14 02:44:15,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:15,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:15,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:15,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:44:15,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:16,052 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-01-14 02:44:16,138 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:44:16,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:44:16,139 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:44:16,139 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:44:16,139 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:44:16,139 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:44:16,139 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:44:16,139 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:44:16,140 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration6_Lasso [2019-01-14 02:44:16,140 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:44:16,140 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:44:16,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:16,612 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:44:16,612 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:44:16,613 INFO L122 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 [2019-01-14 02:44:16,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:16,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:16,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:16,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:16,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:16,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:16,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:16,620 INFO L122 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 [2019-01-14 02:44:16,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:16,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:16,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:16,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:16,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:16,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:16,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:16,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:16,622 INFO L122 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 [2019-01-14 02:44:16,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:16,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:16,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:16,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:16,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:16,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:16,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:16,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:16,624 INFO L122 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 [2019-01-14 02:44:16,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:16,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:16,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:16,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:16,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:16,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:16,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:16,650 INFO L122 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 [2019-01-14 02:44:16,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:16,651 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:44:16,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:16,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:16,654 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:44:16,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:16,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:16,660 INFO L122 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 [2019-01-14 02:44:16,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:16,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:16,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:16,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:16,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:16,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:16,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:16,670 INFO L122 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 [2019-01-14 02:44:16,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:16,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:16,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:16,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:16,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:16,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:16,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:16,677 INFO L122 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 [2019-01-14 02:44:16,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:16,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:16,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:16,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:16,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:16,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:16,690 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:44:16,696 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:44:16,696 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:44:16,697 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:44:16,699 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:44:16,699 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:44:16,699 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] [2019-01-14 02:44:16,740 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:44:16,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:44:16,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:16,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:16,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:16,829 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 [2019-01-14 02:44:16,829 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 02:44:16,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-01-14 02:44:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:44:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:44:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 02:44:16,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-14 02:44:16,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:16,884 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:44:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:16,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:16,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:16,939 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 [2019-01-14 02:44:16,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 02:44:16,959 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-01-14 02:44:16,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:44:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:44:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 02:44:16,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-14 02:44:16,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:16,963 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:44:17,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:17,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:17,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:17,049 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 [2019-01-14 02:44:17,049 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 02:44:17,070 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2019-01-14 02:44:17,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:44:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:44:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-14 02:44:17,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-14 02:44:17,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:17,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2019-01-14 02:44:17,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:17,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2019-01-14 02:44:17,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:17,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2019-01-14 02:44:17,076 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:44:17,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-01-14 02:44:17,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:44:17,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:44:17,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:44:17,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:44:17,078 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:44:17,078 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:44:17,078 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:44:17,078 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:44:17,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:44:17,079 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:44:17,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:44:17,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:44:17 BoogieIcfgContainer [2019-01-14 02:44:17,085 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:44:17,085 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:44:17,085 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:44:17,086 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:44:17,086 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:44:08" (3/4) ... [2019-01-14 02:44:17,090 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:44:17,090 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:44:17,091 INFO L168 Benchmark]: Toolchain (without parser) took 10300.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 951.4 MB in the beginning and 819.2 MB in the end (delta: 132.1 MB). Peak memory consumption was 337.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:17,092 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:44:17,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:17,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.70 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:17,094 INFO L168 Benchmark]: Boogie Preprocessor took 25.14 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. [2019-01-14 02:44:17,095 INFO L168 Benchmark]: RCFGBuilder took 453.07 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:17,096 INFO L168 Benchmark]: BuchiAutomizer took 9030.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 819.2 MB in the end (delta: 272.7 MB). Peak memory consumption was 348.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:17,097 INFO L168 Benchmark]: Witness Printer took 4.79 ms. Allocated memory is still 1.2 GB. Free memory is still 819.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:44:17,102 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 739.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.70 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.14 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 453.07 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9030.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 819.2 MB in the end (delta: 272.7 MB). Peak memory consumption was 348.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.79 ms. Allocated memory is still 1.2 GB. Free memory is still 819.2 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 #length - 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[arr] + -1 * arr + -4 * j and consists of 4 locations. One deterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. One nondeterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 7.2s. Construction of modules took 0.4s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 222 SDslu, 71 SDs, 0 SdLazy, 168 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital128 mio100 ax100 hnf98 lsp94 ukn80 mio100 lsp54 div100 bol100 ite100 ukn100 eq165 hnf89 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...