./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-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 30ab881e1a71a9d76a9921c34ce47cc9425d2331 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:18:30,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:18:30,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:18:30,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:18:30,870 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:18:30,871 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:18:30,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:18:30,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:18:30,878 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:18:30,880 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:18:30,881 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:18:30,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:18:30,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:18:30,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:18:30,885 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:18:30,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:18:30,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:18:30,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:18:30,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:18:30,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:18:30,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:18:30,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:18:30,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:18:30,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:18:30,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:18:30,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:18:30,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:18:30,907 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:18:30,907 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:18:30,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:18:30,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:18:30,910 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:18:30,911 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:18:30,911 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:18:30,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:18:30,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:18:30,915 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:18:30,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:18:30,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:18:30,961 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:18:30,963 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:18:30,963 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:18:30,964 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:18:30,964 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:18:30,965 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:18:30,965 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:18:30,965 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:18:30,965 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:18:30,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:18:30,966 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:18:30,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:18:30,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:18:30,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:18:30,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:18:30,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:18:30,967 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:18:30,967 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:18:30,968 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:18:30,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:18:30,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:18:30,968 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:18:30,968 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:18:30,968 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:18:30,971 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:18:30,972 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:18:30,973 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:18:30,973 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 -> 30ab881e1a71a9d76a9921c34ce47cc9425d2331 [2018-11-28 23:18:31,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:18:31,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:18:31,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:18:31,045 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:18:31,045 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:18:31,047 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-28 23:18:31,124 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70012055a/f00539984e704773a043fb4c9162860f/FLAGc891c4a8e [2018-11-28 23:18:31,737 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:18:31,739 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-28 23:18:31,759 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70012055a/f00539984e704773a043fb4c9162860f/FLAGc891c4a8e [2018-11-28 23:18:32,020 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70012055a/f00539984e704773a043fb4c9162860f [2018-11-28 23:18:32,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:18:32,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:18:32,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:32,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:18:32,037 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:18:32,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b925899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32, skipping insertion in model container [2018-11-28 23:18:32,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:18:32,125 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:32,525 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:32,541 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:32,600 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:32,666 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:32,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32 WrapperNode [2018-11-28 23:18:32,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:32,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:32,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:32,668 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:32,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:32,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:32,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:32,800 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:32,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (1/1) ... [2018-11-28 23:18:32,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:32,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:32,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:32,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:32,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (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 [2018-11-28 23:18:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:32,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:33,428 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:33,428 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:18:33,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:33 BoogieIcfgContainer [2018-11-28 23:18:33,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:33,429 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:33,429 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:33,434 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:33,435 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:33,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:32" (1/3) ... [2018-11-28 23:18:33,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dda57ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:33, skipping insertion in model container [2018-11-28 23:18:33,437 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:33,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:32" (2/3) ... [2018-11-28 23:18:33,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dda57ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:33, skipping insertion in model container [2018-11-28 23:18:33,437 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:33,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:33" (3/3) ... [2018-11-28 23:18:33,440 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-28 23:18:33,505 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:33,506 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:33,506 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:33,506 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:33,506 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:33,507 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:33,507 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:33,507 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:33,507 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:33,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 23:18:33,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:33,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:33,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:33,558 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:18:33,559 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:33,559 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:33,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 23:18:33,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:33,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:33,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:33,561 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:18:33,561 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:33,571 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 11#L551-2true [2018-11-28 23:18:33,572 INFO L796 eck$LassoCheckResult]: Loop: 11#L551-2true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 12#L550-1true assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 6#L550-3true assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 7#L551true assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 11#L551-2true [2018-11-28 23:18:33,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:33,580 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:18:33,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:33,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:33,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:33,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:33,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:33,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2018-11-28 23:18:33,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:33,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:33,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:33,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:33,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:33,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:33,771 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2018-11-28 23:18:33,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:33,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:33,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:33,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:33,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:34,279 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-28 23:18:34,487 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 23:18:34,666 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 23:18:34,821 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:18:34,850 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:34,851 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:34,851 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:34,852 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:34,852 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:34,852 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:34,852 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:34,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:34,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:18:34,853 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:34,853 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:34,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:34,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:34,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:34,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:34,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:34,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:34,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:34,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:34,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:34,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:34,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:35,408 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-11-28 23:18:35,750 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-11-28 23:18:35,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:35,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:35,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:36,439 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:36,444 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:36,447 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 [2018-11-28 23:18:36,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:36,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:36,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:36,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,456 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 [2018-11-28 23:18:36,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:36,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:36,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:36,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,460 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 [2018-11-28 23:18:36,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:36,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:36,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:36,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,464 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 [2018-11-28 23:18:36,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:36,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:36,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,473 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 [2018-11-28 23:18:36,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:36,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:36,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,482 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 [2018-11-28 23:18:36,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:36,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:36,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:36,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,486 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 [2018-11-28 23:18:36,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:36,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:36,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,498 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 [2018-11-28 23:18:36,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:36,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:36,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:36,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,502 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 [2018-11-28 23:18:36,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:36,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,503 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:36,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:18:36,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:36,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,509 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 [2018-11-28 23:18:36,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:36,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:36,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:36,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,514 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 [2018-11-28 23:18:36,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:36,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:36,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,566 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 [2018-11-28 23:18:36,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,567 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:36,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,575 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:36,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:36,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,599 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 [2018-11-28 23:18:36,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:36,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:36,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:36,639 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 [2018-11-28 23:18:36,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:36,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:36,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:36,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:36,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:36,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:36,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:36,652 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:36,659 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:36,664 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:36,667 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:36,670 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:18:36,670 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:36,673 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-28 23:18:36,748 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:18:36,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:36,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:36,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:36,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:36,950 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:18:36,951 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-11-28 23:18:37,073 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 40 states and 48 transitions. Complement of second has 10 states. [2018-11-28 23:18:37,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-28 23:18:37,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:18:37,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:37,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:18:37,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:37,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 23:18:37,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:37,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2018-11-28 23:18:37,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:37,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 16 states and 22 transitions. [2018-11-28 23:18:37,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:18:37,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:18:37,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-28 23:18:37,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:37,092 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:18:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-28 23:18:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-28 23:18:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:18:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-11-28 23:18:37,121 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-28 23:18:37,121 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-28 23:18:37,121 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:37,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-11-28 23:18:37,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:37,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:37,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:37,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:37,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:37,124 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 145#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 153#L550-1 assume !main_#t~short6; 146#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 147#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 151#L551-2 [2018-11-28 23:18:37,124 INFO L796 eck$LassoCheckResult]: Loop: 151#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 155#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 157#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 156#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 151#L551-2 [2018-11-28 23:18:37,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2018-11-28 23:18:37,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:37,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:37,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:37,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:18:37,191 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:18:37,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 2 times [2018-11-28 23:18:37,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:37,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:37,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:37,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,552 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-28 23:18:37,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:18:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:18:37,621 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:18:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:37,649 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-11-28 23:18:37,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:18:37,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-11-28 23:18:37,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:37,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 17 transitions. [2018-11-28 23:18:37,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:18:37,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:18:37,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-28 23:18:37,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:37,655 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 23:18:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-28 23:18:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 23:18:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:18:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-28 23:18:37,657 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 23:18:37,657 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 23:18:37,657 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:37,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-28 23:18:37,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:37,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:37,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:37,659 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:37,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:37,659 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 182#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 191#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 184#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 185#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 188#L551-2 [2018-11-28 23:18:37,659 INFO L796 eck$LassoCheckResult]: Loop: 188#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 190#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 194#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 193#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 188#L551-2 [2018-11-28 23:18:37,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2018-11-28 23:18:37,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:37,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:37,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:37,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 3 times [2018-11-28 23:18:37,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:37,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:37,728 INFO L82 PathProgramCache]: Analyzing trace with hash -980235887, now seen corresponding path program 1 times [2018-11-28 23:18:37,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:37,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:37,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,902 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-28 23:18:38,145 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2018-11-28 23:18:38,223 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:38,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:38,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:38,224 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:38,224 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:38,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:38,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:38,225 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:38,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:18:38,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:38,225 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:38,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,688 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-11-28 23:18:38,974 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-11-28 23:18:38,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:38,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:39,374 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:39,375 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:39,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 [2018-11-28 23:18:39,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:39,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:39,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:39,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,381 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 [2018-11-28 23:18:39,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:39,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:39,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:39,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,387 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 [2018-11-28 23:18:39,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:39,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,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 [2018-11-28 23:18:39,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:39,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:39,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:39,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,400 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 [2018-11-28 23:18:39,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:39,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:39,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:39,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,406 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 [2018-11-28 23:18:39,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:39,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:39,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:39,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,412 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 [2018-11-28 23:18:39,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:39,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,418 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 [2018-11-28 23:18:39,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:39,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,421 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:39,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,423 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:18:39,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:39,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,426 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 [2018-11-28 23:18:39,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:39,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,434 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 [2018-11-28 23:18:39,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:39,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,443 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 [2018-11-28 23:18:39,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,444 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:39,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,447 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:39,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,454 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 [2018-11-28 23:18:39,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:39,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,465 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 [2018-11-28 23:18:39,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,465 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:39,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,469 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:39,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,476 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 [2018-11-28 23:18:39,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:39,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,498 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 [2018-11-28 23:18:39,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:39,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,520 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 [2018-11-28 23:18:39,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:39,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:39,536 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 [2018-11-28 23:18:39,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:39,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:39,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:39,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:39,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:39,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:39,554 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:39,563 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:39,565 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:39,566 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:39,567 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:39,569 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:39,569 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-11-28 23:18:39,699 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:18:39,701 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:39,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:39,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:39,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:39,885 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:18:39,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 23:18:39,914 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2018-11-28 23:18:39,915 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 [2018-11-28 23:18:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:18:39,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:18:39,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:39,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:18:39,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:39,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 23:18:39,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:39,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-28 23:18:39,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:39,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2018-11-28 23:18:39,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:18:39,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:18:39,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-28 23:18:39,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:39,920 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:18:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-28 23:18:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-28 23:18:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:18:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-28 23:18:39,923 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:18:39,923 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:18:39,923 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:18:39,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-28 23:18:39,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:39,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:39,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:39,925 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2018-11-28 23:18:39,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:39,925 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 317#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 333#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 332#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 330#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 329#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 327#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 318#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 319#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 323#L551-2 [2018-11-28 23:18:39,925 INFO L796 eck$LassoCheckResult]: Loop: 323#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 325#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 328#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 331#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 323#L551-2 [2018-11-28 23:18:39,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash -980235885, now seen corresponding path program 2 times [2018-11-28 23:18:39,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:39,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:39,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:39,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:39,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:39,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:39,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 4 times [2018-11-28 23:18:39,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:39,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:39,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:39,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:39,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:39,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:39,996 INFO L82 PathProgramCache]: Analyzing trace with hash -987685255, now seen corresponding path program 2 times [2018-11-28 23:18:39,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:39,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:39,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:39,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:39,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:40,446 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-28 23:18:40,865 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2018-11-28 23:18:40,987 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 23:18:40,989 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:40,989 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:40,989 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:40,989 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:40,990 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:40,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:40,990 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:40,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:40,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:18:40,990 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:40,990 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:40,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,513 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-11-28 23:18:41,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,962 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:41,963 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:41,963 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 [2018-11-28 23:18:41,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:41,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:41,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:41,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,969 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 [2018-11-28 23:18:41,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:41,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:41,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,977 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 [2018-11-28 23:18:41,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:41,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:41,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,983 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 [2018-11-28 23:18:41,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:41,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:41,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:41,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,989 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 [2018-11-28 23:18:41,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:41,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,992 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:41,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,992 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:18:41,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:41,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,996 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 [2018-11-28 23:18:41,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:41,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:42,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:42,004 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 [2018-11-28 23:18:42,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:42,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:42,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:42,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:42,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:42,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:42,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:42,013 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 [2018-11-28 23:18:42,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:42,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:42,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:42,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:42,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:42,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:42,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:42,023 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 [2018-11-28 23:18:42,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:42,024 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:42,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:42,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:42,028 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:42,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:42,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:42,033 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 [2018-11-28 23:18:42,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:42,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:42,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:42,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:42,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:42,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:42,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:42,043 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 [2018-11-28 23:18:42,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:42,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:42,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:42,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:42,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:42,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:42,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:42,050 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 [2018-11-28 23:18:42,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:42,050 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:42,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:42,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:42,054 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:42,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:42,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:42,060 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 [2018-11-28 23:18:42,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:42,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:42,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:42,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:42,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:42,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:42,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:42,068 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 [2018-11-28 23:18:42,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:42,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:42,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:42,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:42,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:42,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:42,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:42,083 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 [2018-11-28 23:18:42,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:42,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:42,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:42,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:42,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:42,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:42,092 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:42,096 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:42,097 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:42,098 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:42,098 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:42,100 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:42,100 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-28 23:18:42,372 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:18:42,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:42,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:42,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:42,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:43,110 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-28 23:18:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:43,155 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:18:43,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 23:18:43,235 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2018-11-28 23:18:43,237 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 [2018-11-28 23:18:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:18:43,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:18:43,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:43,238 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:18:43,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:43,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:43,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:43,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:18:43,363 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 23:18:43,393 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2018-11-28 23:18:43,395 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 [2018-11-28 23:18:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:18:43,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:18:43,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:43,396 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:18:43,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:43,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:43,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:43,491 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 3 loop predicates [2018-11-28 23:18:43,491 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 23:18:43,533 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2018-11-28 23:18:43,535 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 [2018-11-28 23:18:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:18:43,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:18:43,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:43,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 23:18:43,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:43,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-28 23:18:43,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:43,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2018-11-28 23:18:43,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:18:43,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 32 transitions. [2018-11-28 23:18:43,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:18:43,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:18:43,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-28 23:18:43,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:43,546 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-28 23:18:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-28 23:18:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 10. [2018-11-28 23:18:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:18:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-28 23:18:43,550 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:18:43,550 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:18:43,550 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:18:43,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-28 23:18:43,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:18:43,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:43,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:43,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:18:43,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:43,551 INFO L794 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 641#L551-2 [2018-11-28 23:18:43,552 INFO L796 eck$LassoCheckResult]: Loop: 641#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 649#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 643#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 644#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 641#L551-2 [2018-11-28 23:18:43,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:43,555 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 23:18:43,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:43,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:43,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:43,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:43,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:43,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:43,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1142249, now seen corresponding path program 1 times [2018-11-28 23:18:43,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:43,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:43,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:43,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:43,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:43,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:43,581 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 3 times [2018-11-28 23:18:43,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:43,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:43,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:43,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:43,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:43,721 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-11-28 23:18:43,886 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:43,886 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:43,886 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:43,886 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:43,886 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:43,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:43,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:43,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:43,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:18:43,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:43,887 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:43,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:43,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:44,079 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-11-28 23:18:44,699 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:44,699 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:44,700 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 [2018-11-28 23:18:44,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:44,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:44,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:44,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,702 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 [2018-11-28 23:18:44,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:44,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,710 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 [2018-11-28 23:18:44,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:44,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,713 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 [2018-11-28 23:18:44,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:44,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:44,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:44,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,715 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 [2018-11-28 23:18:44,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:44,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,718 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 [2018-11-28 23:18:44,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:44,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:44,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:44,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,720 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 [2018-11-28 23:18:44,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:44,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:44,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:44,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,722 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 [2018-11-28 23:18:44,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:44,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:44,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:44,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,724 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 [2018-11-28 23:18:44,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:44,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:44,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:44,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,726 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 [2018-11-28 23:18:44,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:44,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:44,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:44,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,727 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 [2018-11-28 23:18:44,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:44,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,731 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 [2018-11-28 23:18:44,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:44,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,734 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 [2018-11-28 23:18:44,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:44,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,737 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 [2018-11-28 23:18:44,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,737 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:44,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,738 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:44,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,742 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 [2018-11-28 23:18:44,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:44,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,752 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 [2018-11-28 23:18:44,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:44,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:44,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:44,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,755 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 [2018-11-28 23:18:44,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,755 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:44,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,756 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:44,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,760 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 [2018-11-28 23:18:44,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:44,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,765 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 [2018-11-28 23:18:44,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:44,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:44,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:44,768 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 [2018-11-28 23:18:44,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:44,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:44,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:44,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:44,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:44,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:44,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:44,770 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:44,771 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:44,771 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:44,771 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:44,772 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:18:44,772 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:44,772 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-11-28 23:18:45,051 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:18:45,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:45,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:45,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:45,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:45,178 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:18:45,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-28 23:18:45,258 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 26 states and 33 transitions. Complement of second has 8 states. [2018-11-28 23:18:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:18:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-28 23:18:45,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:18:45,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:45,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:18:45,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:45,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 23:18:45,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:45,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-28 23:18:45,262 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:45,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-28 23:18:45,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:45,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:45,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:45,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:45,263 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:45,263 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:45,263 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:45,263 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:18:45,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:45,263 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:45,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:45,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:45 BoogieIcfgContainer [2018-11-28 23:18:45,271 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:45,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:45,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:45,271 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:45,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:33" (3/4) ... [2018-11-28 23:18:45,276 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:45,276 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:45,277 INFO L168 Benchmark]: Toolchain (without parser) took 13250.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:45,278 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-11-28 23:18:45,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 637.82 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 925.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:45,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:45,280 INFO L168 Benchmark]: Boogie Preprocessor took 34.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:45,281 INFO L168 Benchmark]: RCFGBuilder took 594.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:45,282 INFO L168 Benchmark]: BuchiAutomizer took 11841.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -59.0 MB). Peak memory consumption was 127.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:45,283 INFO L168 Benchmark]: Witness Printer took 5.02 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:45,288 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.16 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 637.82 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 925.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 132.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 594.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11841.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -59.0 MB). Peak memory consumption was 127.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.02 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 50 SDtfs, 47 SDslu, 18 SDs, 0 SdLazy, 74 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax109 hnf100 lsp86 ukn61 mio100 lsp40 div100 bol100 ite100 ukn100 eq184 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 2 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...